default search action
Chenglin Fan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c33]Chenglin Fan
, Jung Gyu Hur
Robust Anomaly Detection for Offshore Wind Turbines: A Comparative Analysis of AESE Algorithm and Existing Techniques in SCADA Systems. ICMLSC 2024: 111-115 - [c32]Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee
A PTAS for ℓ0-Low Rank Approximation: Solving Dense CSPs over Reals. SODA 2024: 935-961 - [i14]Rishi Chandra, Michael Dinitz, Chenglin Fan, Zongrui Zou:
Differentially Private Multiway and k-Cut. CoRR abs/2407.06911 (2024) - 2023
- [j10]Kevin Buchin
Fréchet Distance for Uncertain Curves. ACM Trans. Algorithms 19(3): 29:1-29:47 (2023) - [c31]Huang Fang, Xiaoyun Li, Chenglin Fan, Ping Li:
Improved Convergence of Differential Private SGD with Gradient Clipping. ICLR 2023 - [c30]Chenglin Fan, Ping Li, Xiaoyun Li:
LSDS++ : Dual Sampling for Accelerated k-means++. ICML 2023: 9640-9649 - [c29]Chenglin Fan, Ping Li, Xiaoyun Li:
k-Median Clustering via Metric Embedding: Towards Better Initialization with Differential Privacy. NeurIPS 2023 - [i13]Chenglin Fan, Ping Li, Hanyu Peng:
Faster Algorithms for Generalized Mean Densest Subgraph Problem. CoRR abs/2310.11377 (2023) - [i12]Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee
A PTAS for 𝓁0-Low Rank Approximation: Solving Dense CSPs over Reals. CoRR abs/2311.00892 (2023) - 2022
- [j9]Chenglin Fan, Benjamin Raichel
Metric Violation Distance: Hardness and Approximation. Algorithmica 84(5): 1441-1465 (2022) - [c28]Vincent Cohen-Addad, Yunus Esencayi, Chenglin Fan, Marco Gaboardi
On Facility Location Problem in the Local Differential Privacy Model. AISTATS 2022: 3914-3929 - [c27]Vincent Cohen-Addad, Chenglin Fan, Euiwoong Lee
Fitting Metrics and Ultrametrics with Minimum Disagreements. FOCS 2022: 301-311 - [c26]Chenglin Fan, Ping Li:
Distances Release with Differential Privacy in Tree and Grid Graph. ISIT 2022: 2190-2195 - [c25]Chenglin Fan, Ping Li:
Metric Nearness with Minimum Distortion: Optimal and Approximation. ITW 2022: 434-439 - [c24]Vincent Cohen-Addad, Chenglin Fan, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski:
Near-Optimal Correlation Clustering with Privacy. NeurIPS 2022 - [c23]Chenglin Fan, Ping Li, Xiaoyun Li:
Private Graph All-Pairwise-Shortest-Path Distance Release with Improved Error Rate. NeurIPS 2022 - [i11]Vincent Cohen-Addad, Chenglin Fan, Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Nikos Parotsidis, Jakub Tarnawski:
Near-Optimal Correlation Clustering with Privacy. CoRR abs/2203.01440 (2022) - [i10]Chenglin Fan, Ping Li:
Distances Release with Differential Privacy in Tree and Grid Graph. CoRR abs/2204.12488 (2022) - [i9]Chenglin Fan, Ping Li, Xiaoyun Li:
Breaking the Linear Error Barrier in Differentially Private Graph Distance Release. CoRR abs/2204.14247 (2022) - [i8]Chenglin Fan, Ping Li, Xiaoyun Li:
k-Median Clustering via Metric Embedding: Towards Better Initialization with Differential Privacy. CoRR abs/2206.12895 (2022) - [i7]Vincent Cohen-Addad, Chenglin Fan, Euiwoong Lee
Fitting Metrics and Ultrametrics with Minimum Disagreements. CoRR abs/2208.13920 (2022) - 2021
- [j8]Chenglin Fan, Benjamin Raichel
Computing the Fréchet Gap Distance. Discret. Comput. Geom. 65(4): 1244-1274 (2021) - [j7]Jinfei Liu
Skyline Diagram: Efficient Space Partitioning for Skyline Queries. IEEE Trans. Knowl. Data Eng. 33(1): 271-286 (2021) - 2020
- [c22]Chenglin Fan, Benjamin Raichel:
Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams. ESA 2020: 45:1-45:18 - [c21]Chenglin Fan, Ping Li:
Classification Acceleration via Merging Decision Trees. FODS 2020: 13-22 - [c20]Kevin Buchin
Fréchet Distance for Uncertain Curves. ICALP 2020: 20:1-20:20 - [c19]Chenglin Fan, Anna C. Gilbert, Benjamin Raichel, Rishi Sonthalia, Gregory Van Buskirk:
Generalized Metric Repair on Graphs. SWAT 2020: 25:1-25:22 - [i6]Chenglin Fan, Benjamin Raichel:
Linear Expected Complexity for Directional and Multiplicative Voronoi Diagrams. CoRR abs/2004.09385 (2020) - [i5]Kevin Buchin, Chenglin Fan, Maarten Löffler, Aleksandr Popov
Fréchet Distance for Uncertain Curves. CoRR abs/2004.11862 (2020)
2010 – 2019
- 2019
- [i4]Chenglin Fan, Anna C. Gilbert, Benjamin Raichel, Rishi Sonthalia, Gregory Van Buskirk:
Generalized Metric Repair on Graphs. CoRR abs/1908.08411 (2019) - 2018
- [j6]Ye Liu
Cross-layer cooperative multichannel medium access for internet of things. Peer-to-Peer Netw. Appl. 11(3): 504-517 (2018) - [c18]Chenglin Fan, Benjamin Raichel, Gregory Van Buskirk:
Metric Violation Distance: Hardness and Approximation. SODA 2018: 196-209 - [i3]Chenglin Fan, Benjamin Raichel, Gregory Van Buskirk:
Metric Violation Distance: Revisited and Extended. CoRR abs/1807.08078 (2018) - [i2]Jinfei Liu, Juncheng Yang, Li Xiong, Jian Pei, Jun Luo, Yuzhang Guo, Shuaicheng Ma, Chenglin Fan:
Skyline Diagram: Efficient Space Partitioning for Skyline Queries. CoRR abs/1812.01663 (2018) - 2017
- [c17]Chenglin Fan, Benjamin Raichel:
Computing the Fréchet Gap Distance. SoCG 2017: 42:1-42:16 - 2016
- [c16]Haitao Jiang, Chenglin Fan, Boting Yang, Farong Zhong, Daming Zhu, Binhai Zhu:
Genomic Scaffold Filling Revisited. CPM 2016: 15:1-15:13 - [c15]Chenglin Fan, Omrit Filtser
On the General Chain Pair Simplification Problem. MFCS 2016: 37:1-37:14 - 2015
- [j5]Chao Li, Chenglin Fan, Jun Luo, Farong Zhong, Binhai Zhu:
Expected computations on color spanning sets. J. Comb. Optim. 29(3): 589-604 (2015) - [c14]Chenglin Fan, Omrit Filtser
On the Chain Pair Simplification Problem. WADS 2015: 351-362 - [c13]Chenglin Fan, Qing Yang, Binhai Zhu:
Computing an Optimal Path with the Minimum Number of Distinct Sensors. WASA 2015: 104-113 - [i1]Chenglin Fan, Binhai Zhu:
Complexity and Algorithms for the Discrete Fréchet Distance Upper Bound with Imprecise Input. CoRR abs/1509.02576 (2015) - 2014
- [j4]Chenglin Fan, Jun Luo, Wencheng Wang, Farong Zhong, Binhai Zhu:
On Some Proximity Problems of Colored Sets. J. Comput. Sci. Technol. 29(5): 879-886 (2014) - [j3]Chenglin Fan, Jun Luo, Wencheng Wang, Binhai Zhu:
Voronoi diagram with visual restriction. Theor. Comput. Sci. 532: 31-39 (2014) - 2013
- [j2]Wenqi Ju, Chenglin Fan, Jun Luo, Binhai Zhu, Ovidiu Daescu:
On some geometric problems of color-spanning sets. J. Comb. Optim. 26(2): 266-283 (2013) - [c12]Chenglin Fan, Jun Luo, Farong Zhong, Binhai Zhu:
Expected Computations on Color Spanning Sets. FAW-AAIM 2013: 130-141 - [c11]Chenglin Fan, Jun Luo, Farong Zhong:
On Some Proximity Problems of Colored Sets. COCOA 2013: 202-213 - [c10]Chenglin Fan, Jun Luo, Binhai Zhu:
Tight Approximation Bounds for Connectivity with a Color-Spanning Set. ISAAC 2013: 590-600 - 2012
- [c9]Chenglin Fan, Jun Luo, Wencheng Wang, Binhai Zhu:
Voronoi Diagram with Visual Restriction. FAW-AAIM 2012: 36-46 - [c8]Wenqi Ju, Chenglin Fan, Shuguang Liu, Jinfei Liu:
New models and efficient algorithms for hazard detection. Geoinformatics 2012: 1-7 - 2011
- [j1]Chenglin Fan, Jun Luo, Binhai Zhu:
Continuous-Time Moving Network Voronoi Diagram. Trans. Comput. Sci. 14: 129-150 (2011) - [c7]Chenglin Fan, Wenqi Ju, Jun Luo, Binhai Zhu:
On Some Geometric Problems of Color-Spanning Sets. FAW-AAIM 2011: 113-124 - [c6]Chenglin Fan, Jun Luo, Jinfei Liu, Yinfeng Xu:
Half-Plane Voronoi Diagram. ISVD 2011: 127-133 - [c5]Jinfei Liu, Jun Luo, Chenglin Fan:
Effective Privacy Preserved Clustering Based on Voronoi Diagram. ISVD 2011: 206-213 - [c4]Atlas F. Cook, Chenglin Fan, Jun Luo:
Hide-and-Seek: Algorithms for Polygon Walk Problems. TAMC 2011: 495-504 - 2010
- [c3]Chenglin Fan, Jun Luo:
Point Location in the Continuous-Time Moving Network. AAIM 2010: 131-140 - [c2]Chenglin Fan, Jun Luo, Binhai Zhu:
Fréchet-Distance on Road Networks. CGGA 2010: 61-72 - [c1]Chenglin Fan, Jianbiao He, Jun Luo, Binhai Zhu:
Moving Network Voronoi Diagram. ISVD 2010: 142-150
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: