Hsien-Chih Chang

According to our database, Hsien-Chih Chang authored at least 29 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Optimal Euclidean Tree Covers.

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

CoRR, 2024

Computing Diameter+2 in Truly Subquadratic Time for Unit-Disk Graphs.

Hsien-Chih Chang, Jie Gao, Hung Le

CoRR, 2024

Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More.

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions.

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

CoRR, 2023

From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy.

Hsien-Chih Chang, Brittany Terese Fasy, Bradley McCoy, David L. Millman, Carola Wenk

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Covering Planar Metrics (and Beyond): O(1) Trees Suffice.

Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Tightening Curves on Surfaces Monotonically with Applications.

Hsien-Chih Chang, Arnaud de Mesmay

ACM Trans. Algorithms, 2022

Dynamic Geometric Set Cover and Hitting Set.

Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue

ACM Trans. Algorithms, 2022

Near-Linear ε-Emulators for Planar Graphs.

Hsien-Chih Chang, Robert Krauthgamer, Zihan Tan

CoRR, 2022

Deterministic, Near-Linear ε-Approximation Algorithm for Geometric Bipartite Matching.

Pankaj K. Agarwal, Hsien-Chih Chang, Sharath Raghvendra, Allen Xiao

CoRR, 2022

Almost-linear <i>ε</i>-emulators for planar graphs.

Hsien-Chih Chang, Robert Krauthgamer, Zihan Tan

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Deterministic, near-linear <i>ε</i>-approximation algorithm for geometric bipartite matching.

Pankaj K. Agarwal, Hsien-Chih Chang, Sharath Raghvendra, Allen Xiao

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Untangling Planar Graphs and Curves by Staying Positive.

Santiago Aranguri, Hsien-Chih Chang, Dylan Fridman

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2020

Spectral aspects of symmetric matrix signings.

Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla

Discret. Optim., 2020

Clustering Under Perturbation Stability in Near-Linear Time.

Pankaj K. Agarwal, Hsien-Chih Chang, Kamesh Munagala, Erin Taylor, Emo Welzl

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Planar Emulators for Monge Matrices.

Hsien-Chih Chang, Tim Ophelders

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Lower Bounds for Electrical Reduction on Surfaces.

Hsien-Chih Chang, Marcos Cossarini, Jeff Erickson

Proceedings of the 35th International Symposium on Computational Geometry, 2019

Efficient Algorithms for Geometric Partial Matching.

Pankaj K. Agarwal, Hsien-Chih Chang, Allen Xiao

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Tightening curves and graphs on surfaces

Hsien-Chih Chang

PhD thesis, 2018

Tightening Curves on Surfaces via Local Moves.

Hsien-Chih Chang, Jeff Erickson, David Letscher, Arnaud de Mesmay, Saul Schleimer, Eric Sedgwick, Dylan Thurston, Stephan Tillmann

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Near-Optimal Distance Emulator for Planar Graphs.

Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Untangling Planar Curves.

Hsien-Chih Chang, Jeff Erickson

Discret. Comput. Geom., 2017

Lower Bounds for Planar Electrical Reduction.

Hsien-Chih Chang, Jeff Erickson

CoRR, 2017

2016

From Proximity to Utility: A Voronoi Partition of Pareto Optima.

Hsien-Chih Chang, Sariel Har-Peled, Benjamin Raichel

Discret. Comput. Geom., 2016

Largest Eigenvalue and Invertibility of Symmetric Matrix Signings.

Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Alexandra Kolla

CoRR, 2016

2015

A faster algorithm to recognize even-hole-free graphs.

Hsien-Chih Chang, Hsueh-I Lu

J. Comb. Theory, Ser. B, 2015

Electrical Reduction, Homotopy Moves, and Defect.

Hsien-Chih Chang, Jeff Erickson

CoRR, 2015

Detecting Weakly Simple Polygons.

Hsien-Chih Chang, Jeff Erickson, Chao Xu

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2013

Computing the Girth of a Planar Graph in Linear Time.

Hsien-Chih Chang, Hsueh-I Lu

SIAM J. Comput., 2013