| 2026 | AAAI | Learning-Augmented Ski Rental with Discrete Distribution: A Bayesian Approach. | Bosun Kang, Hyejun Park, Chenglin Fan |
| 2026 | IPCO | 1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP. | Chenglin Fan, Dahoon Lee, Euiwoong Lee |
| 2026 | SODA | Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More. | Rishi Chandra, Michael Dinitz, Chenglin Fan, Zongrui Zou |
| 2025 | COLT | Learning Augmented Graph k-Clustering. | Chenglin Fan, Kijun Shin |
| 2024 | SODA | A PTAS for | Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang |
| 2023 | ICLR | Improved Convergence of Differential Private SGD with Gradient Clipping. | Huang Fang, Xiaoyun Li, Chenglin Fan, Ping Li |
| 2023 | ICML | LSDS++ : Dual Sampling for Accelerated k-means++. | Chenglin Fan, Ping Li, Xiaoyun Li |
| 2022 | AISTATS | On Facility Location Problem in the Local Differential Privacy Model. | Vincent Cohen-Addad, Yunus Esencayi, Chenglin Fan, Marco Gaboardi, Shi Li, Di Wang |
| 2022 | FOCS | Fitting Metrics and Ultrametrics with Minimum Disagreements. | Vincent Cohen-Addad, Chenglin Fan, Euiwoong Lee, Arnaud de Mesmay |
| 2022 | ISIT | Distances Release with Differential Privacy in Tree and Grid Graph. | Chenglin Fan, Ping Li |
| 2022 | ITW | Metric Nearness with Minimum Distortion: Optimal and Approximation. | Chenglin Fan, Ping Li |
| 2020 | ESA | Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams. | Chenglin Fan, Benjamin Raichel |
| 2020 | ICALP | Frchet Distance for Uncertain Curves. | Kevin Buchin, Chenglin Fan, Maarten Lffler, Aleksandr Popov, Benjamin Raichel, Marcel Roeloffzen |
| 2018 | SODA | Metric Violation Distance: Hardness and Approximation. | Chenglin Fan, Benjamin Raichel, Gregory Van Buskirk |
| 2016 | CPM | Genomic Scaffold Filling Revisited. | Haitao Jiang, Chenglin Fan, Boting Yang, Farong Zhong, Daming Zhu, Binhai Zhu |
| 2016 | MFCS | On the General Chain Pair Simplification Problem. | Chenglin Fan, Omrit Filtser, Matthew J. Katz, Binhai Zhu |
| 2015 | WADS | On the Chain Pair Simplification Problem. | Chenglin Fan, Omrit Filtser, Matthew J. Katz, Tim Wylie, Binhai Zhu |
| 2013 | AAIM | Expected Computations on Color Spanning Sets. | Chenglin Fan, Jun Luo, Farong Zhong, Binhai Zhu |
| 2013 | COCOA | On Some Proximity Problems of Colored Sets. | Chenglin Fan, Jun Luo, Farong Zhong |
| 2013 | ISAAC | Tight Approximation Bounds for Connectivity with a Color-Spanning Set. | Chenglin Fan, Jun Luo, Binhai Zhu |
| 2012 | AAIM | Voronoi Diagram with Visual Restriction. | Chenglin Fan, Jun Luo, Wencheng Wang, Binhai Zhu |
| 2011 | AAIM | On Some Geometric Problems of Color-Spanning Sets. | Chenglin Fan, Wenqi Ju, Jun Luo, Binhai Zhu |
| 2011 | TAMC | Hide-and-Seek: Algorithms for Polygon Walk Problems. | Atlas F. Cook, Chenglin Fan, Jun Luo |
| 2010 | AAIM | Point Location in the Continuous-Time Moving Network. | Chenglin Fan, Jun Luo |