Point Location in the Continuous-Time Moving Network. - Chenglin Fan; Jun Luo 008 (AAIM, 2010)

Fréchet-Distance on Road Networks. - Chenglin Fan; Jun Luo 008; Binhai Zhu (CGGA, 2010)

Moving Network Voronoi Diagram. - Chenglin Fan; Jianbiao He; Jun Luo 008; Binhai Zhu (ISVD, 2010)

On Some Geometric Problems of Color-Spanning Sets. - Chenglin Fan; Wenqi Ju; Jun Luo 008; Binhai Zhu (FAW-AAIM, 2011)

Half-Plane Voronoi Diagram. - Chenglin Fan; Jun Luo 007; Jinfei Liu; Yinfeng Xu (ISVD, 2011)

Effective Privacy Preserved Clustering Based on Voronoi Diagram. - Jinfei Liu; Jun Luo 007; Chenglin Fan (ISVD, 2011)

Hide-and-Seek: Algorithms for Polygon Walk Problems. - Atlas F. Cook; Chenglin Fan; Jun Luo 008 (TAMC, 2011)

Continuous-Time Moving Network Voronoi Diagram. - Chenglin Fan; Jun Luo 008; Binhai Zhu (Trans. Comput. Sci., 2011)

New models and efficient algorithms for hazard detection. - Wenqi Ju; Chenglin Fan; Shuguang Liu; Jinfei Liu (Geoinformatics, 2012)

Expected Computations on Color Spanning Sets. - Chenglin Fan; Jun Luo 008; Farong Zhong; Binhai Zhu (FAW-AAIM, 2013)

On Some Proximity Problems of Colored Sets. - Chenglin Fan; Jun Luo 008; Farong Zhong (COCOA, 2013)

Tight Approximation Bounds for Connectivity with a Color-Spanning Set. - Chenglin Fan; Jun Luo 008; Binhai Zhu (ISAAC, 2013)

On some geometric problems of color-spanning sets. - Wenqi Ju; Chenglin Fan; Jun Luo 008; Binhai Zhu; Ovidiu Daescu (J. Comb. Optim., 2013)

On Some Proximity Problems of Colored Sets. - Chenglin Fan; Jun Luo 008; Wencheng Wang 001; Farong Zhong; Binhai Zhu (J. Comput. Sci. Technol., 2014)

Voronoi diagram with visual restriction. - Chenglin Fan; Jun Luo 008; Wencheng Wang 001; Binhai Zhu (Theor. Comput. Sci., 2014)

On the Chain Pair Simplification Problem. - Chenglin Fan; Omrit Filtser; Matthew J. Katz; Tim Wylie; Binhai Zhu (WADS, 2015)

Computing an Optimal Path with the Minimum Number of Distinct Sensors. - Chenglin Fan; Qing Yang 003; Binhai Zhu (WASA, 2015)

Complexity and Algorithms for the Discrete Fréchet Distance Upper Bound with Imprecise Input. - Chenglin Fan; Binhai Zhu (CoRR, 2015)

Expected computations on color spanning sets. - Chao Li 022; Chenglin Fan; Jun Luo 008; Farong Zhong; Binhai Zhu (J. Comb. Optim., 2015)

Genomic Scaffold Filling Revisited. - Haitao Jiang; Chenglin Fan; Boting Yang; Farong Zhong; Daming Zhu; Binhai Zhu (CPM, 2016)

On the General Chain Pair Simplification Problem. - Chenglin Fan; Omrit Filtser; Matthew J. Katz; Binhai Zhu (MFCS, 2016)

Metric Violation Distance: Revisited and Extended. - Chenglin Fan; Benjamin Raichel; Gregory Van Buskirk (CoRR, 2018)

Cross-layer cooperative multichannel medium access for internet of things. - Ye Liu 004; Chenglin Fan; Hao Liu 013; Qing Yang 003; Shaoen Wu (Peer-to-Peer Netw. Appl., 2018)

Classification Acceleration via Merging Decision Trees. - Chenglin Fan; Ping Li 001 (FODS, 2020)

Generalized Metric Repair on Graphs. - Chenglin Fan; Anna C. Gilbert; Benjamin Raichel; Rishi Sonthalia; Gregory Van Buskirk (SWAT, 2020)

Computing the Fréchet Gap Distance. - Chenglin Fan; Benjamin Raichel (Discret. Comput. Geom., 2021)

Skyline Diagram: Efficient Space Partitioning for Skyline Queries. - Jinfei Liu; Juncheng Yang; Li Xiong 001; Jian Pei 001; Jun Luo 007; Yuzhang Guo; Shuaicheng Ma; Chenglin Fan (IEEE Trans. Knowl. Data Eng., 2021)

On Facility Location Problem in the Local Differential Privacy Model. - Vincent Cohen-Addad; Yunus Esencayi; Chenglin Fan; Marco Gaboardi; Shi Li 001; Di Wang 015 (AISTATS, 2022)

Distances Release with Differential Privacy in Tree and Grid Graph. - Chenglin Fan; Ping Li 001 (ISIT, 2022)

Metric Nearness with Minimum Distortion: Optimal and Approximation. - Chenglin Fan; Ping Li 001 (ITW, 2022)

Near-Optimal Correlation Clustering with Privacy. - Vincent Cohen-Addad; Chenglin Fan; Silvio Lattanzi; Slobodan Mitrovic; Ashkan Norouzi-Fard; Nikos Parotsidis; Jakub Tarnawski (NeurIPS, 2022)

Private Graph All-Pairwise-Shortest-Path Distance Release with Improved Error Rate. - Chenglin Fan; Ping Li 001; Xiaoyun Li (NeurIPS, 2022)

Metric Violation Distance: Hardness and Approximation. - Chenglin Fan; Benjamin Raichel; Gregory Van Buskirk (Algorithmica, 2022)

Breaking the Linear Error Barrier in Differentially Private Graph Distance Release. - Chenglin Fan; Ping Li 001; Xiaoyun Li (CoRR, 2022)

Improved Convergence of Differential Private SGD with Gradient Clipping. - Huang Fang; Xiaoyun Li; Chenglin Fan; Ping Li 001 (ICLR, 2023)

LSDS++ : Dual Sampling for Accelerated k-means++. - Chenglin Fan; Ping Li 001; Xiaoyun Li (ICML, 2023)

k-Median Clustering via Metric Embedding: Towards Better Initialization with Differential Privacy. - Chenglin Fan; Ping Li 001; Xiaoyun Li (NeurIPS, 2023)

Faster Algorithms for Generalized Mean Densest Subgraph Problem. - Chenglin Fan; Ping Li; Hanyu Peng (CoRR, 2023)

A PTAS for 𝓁0-Low Rank Approximation: Solving Dense CSPs over Reals. - Vincent Cohen-Addad; Chenglin Fan; Suprovat Ghoshal; Euiwoong Lee; Arnaud de Mesmay; Alantha Newman; Tony Chang Wang (CoRR, 2023)

Fréchet Distance for Uncertain Curves. - Kevin Buchin; Chenglin Fan; Maarten Löffler; Aleksandr Popov 001; Benjamin Raichel; Marcel Roeloffzen (ACM Trans. Algorithms, 2023)

Robust Anomaly Detection for Offshore Wind Turbines: A Comparative Analysis of AESE Algorithm and Existing Techniques in SCADA Systems. - Chenglin Fan; Jung Gyu Hur; Chang Gyoon Lim (ICMLSC, 2024)

A PTAS for ℓ0-Low Rank Approximation: Solving Dense CSPs over Reals. - Vincent Cohen-Addad; Chenglin Fan; Suprovat Ghoshal; Euiwoong Lee; Arnaud de Mesmay; Alantha Newman; Tony Chang Wang (SODA, 2024)

Differentially Private Multiway and k-Cut. - Rishi Chandra; Michael Dinitz; Chenglin Fan; Zongrui Zou (CoRR, 2024)

Noise is All You Need: Private Second-Order Convergence of Noisy SGD. - Dmitrii Avdiukhin; Michael Dinitz; Chenglin Fan; Grigory Yaroslavtsev (CoRR, 2024)

Learning Augmented Graph k-Clustering. - Chenglin Fan; Kijun Shin (COLT, 2025)

Fitting Metrics and Ultrametrics with Minimum Disagreements. - Vincent Cohen-Addad; Chenglin Fan; Euiwoong Lee; Arnaud de Mesmay (SIAM J. Comput., 2025)

Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams. - Chenglin Fan; Benjamin Raichel (Discret. Comput. Geom., 2025)

A Generalized Binary Tree Mechanism for Differentially Private Approximation of All-Pair Distances. - Michael Dinitz; Chenglin Fan; Jingcheng Liu 001; Jalaj Upadhyay; Zongrui Zou (CoRR, 2025)

Verifying Differentially Private Median Estimation. - Hyukjun Kwon; Chenglin Fan (CoRR, 2025)

Improved Approximation Algorithms for Chromatic and Pseudometric-Weighted Correlation Clustering. - Dahoon Lee; Chenglin Fan; Euiwoong Lee (CoRR, 2025)

EALG: Evolutionary Adversarial Generation of Language Model-Guided Generators for Combinatorial Optimization. - Ruibo Duan; Yuxin Liu; Xinyao Dong; Chenglin Fan (CoRR, 2025)

A Simple Analysis of Discretization Error in Diffusion Models. - Juhyeok Choi; Chenglin Fan (CoRR, 2025)

Learning Augmented Graph k-Clustering. - Chenglin Fan; Kijun Shin (CoRR, 2025)

Self-Critique-Guided Curiosity Refinement: Enhancing Honesty and Helpfulness in Large Language Models via In-Context Learning. - Duc Hieu Ho; Chenglin Fan (CoRR, 2025)

1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP. - Dahoon Lee; Chenglin Fan; Euiwoong Lee (CoRR, 2025)