Suivre
Hsien-Chih Chang
Titre
Citée par
Citée par
Année
Detecting weakly simple polygons
HC Chang, J Erickson, C Xu
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2015
552015
A faster algorithm to recognize even-hole-free graphs
HC Chang, HI Lu
Journal of Combinatorial Theory, Series B 113, 141-161, 2015
372015
Untangling Planar Curves
HC Chang, J Erickson
Discrete & Computational Geometry 58 (4), 889-920, 2017
292017
Near-optimal distance preserver for planar graphs
HC Chang, P Gawrychowski, S Mozes, O Weimann
Proceedings of the Twenty-Sixth Annual European Symposium on Algorithms, 2018
24*2018
Computing the girth of a planar graph in linear time
HC Chang, HI Lu
SIAM Journal on Computing 42 (3), 1077-1094, 2013
242013
Deterministic, near-linear 𝜀-approximation algorithm for geometric bipartite matching
PK Agarwal, HC Chang, S Raghvendra, A Xiao
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
132022
From proximity to utility: A Voronoi partition of Pareto optima
HC Chang, S Har-Peled, B Raichel
Discrete & Computational Geometry 56 (3), 631-656, 2016
122016
Dynamic geometric set cover and hitting set
P Agarwal, HC Chang, S Suri, A Xiao, J Xue
ACM Transactions on Algorithms (TALG) 18 (4), 1-37, 2022
112022
Tightening curves on surfaces via local moves
HC Chang, J Erickson, D Letscher, A de Mesmay, S Schleimer, ...
SODA 18: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, 2017
112017
Electrical Reduction, Homotopy Moves, and Defect
HC Chang, J Erickson
arXiv preprint arXiv:1510.00571, 2015
112015
Near-Linear ϵ-Emulators for Planar Graphs
HC Chang, R Krauthgamer, Z Tan
arXiv preprint arXiv:2206.10681, 2022
8*2022
Tightening curves on surfaces monotonically with applications
HC Chang, A de Mesmay
ACM Transactions on Algorithms 18 (4), 1-32, 2022
62022
Lower Bounds for Electrical Reduction on Surfaces
HC Chang, M Cossarini, J Erickson
35th International Symposium on Computational Geometry (SoCG 2019), 2019
62019
TIGHTENING CURVES AND GRAPHS ON SURFACES
HC CHANG
University of Illinois at Urbana-Champaign, 2018
62018
Planar Emulators for Monge Matrices
HC Chang, T Ophelders
Proc. 32nd Canadian Conference on Computational Geometry (CCCG), 141-147, 2020
52020
Efficient Algorithms for Geometric Partial Matching
PK Agarwal, HC Chang, A Xiao
arXiv preprint arXiv:1903.09358, 2019
52019
Covering Planar Metrics (and Beyond): O (1) Trees Suffice
HC Chang, J Conroy, H Le, L Milenkovic, S Solomon, C Than
arXiv preprint arXiv:2306.06215, 2023
42023
Shortcut partitions in minor-free graphs: Steiner point removal, distance oracles, tree covers, and more
HC Chang, J Conroy, H Le, L Milenković, S Solomon, C Than
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
32024
Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions
HC Chang, J Conroy, H Le, L Milenkovic, S Solomon, C Than
arXiv preprint arXiv:2306.06235, 2023
32023
Clustering under Perturbation Stability in Near-Linear Time
PK Agarwal, HC Chang, K Munagala, E Taylor, E Welzl
arXiv preprint arXiv:2009.14358, 2020
32020
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20