Hsien-Chih Chang

Orcid: 0000-0001-6714-7988

Affiliations:
  • Dartmouth College, Hanover, NH, USA
  • University of Illinois Urbana-Champaign, USA (PhD 2018)


According to our database1, Hsien-Chih Chang authored at least 37 papers between 2011 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
O(1)-Distortion Planar Emulators for String Graphs.
CoRR, October, 2025

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimension.
CoRR, October, 2025

Distance Approximating Minors for Planar and Minor-Free Graphs.
CoRR, September, 2025

Unintuitive Facts About Distances on Planar Graphs (Invited Talk).
Proceedings of the 19th International Symposium on Algorithms and Data Structures, 2025

Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Embedding Planar Graphs into Graphs of Treewidth <i>O</i> (log<sup>3</sup> <i>n</i> ).
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024
Hard Diagrams of the Unknot.
Exp. Math., July, 2024

Embedding Planar Graphs into Graphs of Treewidth O(log<sup>3</sup> n).
CoRR, 2024

Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Optimal Euclidean Tree Covers.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

Computing Diameter+2 in Truly-Subquadratic Time for Unit-Disk Graphs.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

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

From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Covering Planar Metrics (and Beyond): O(1) Trees Suffice.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Near-Linear ε-Emulators for Planar Graphs.
CoRR, 2022

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

Almost-linear <i>ε</i>-emulators for planar graphs.
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.
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.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2020
Tightening Curves on Surfaces Monotonically with Applications.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Clustering Under Perturbation Stability in Near-Linear Time.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Dynamic Geometric Set Cover and Hitting Set.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

Planar Emulators for Monge Matrices.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019
Spectral Aspects of Symmetric Matrix Signings.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Lower Bounds for Electrical Reduction on Surfaces.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

Efficient Algorithms for Geometric Partial Matching.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Tightening curves and graphs on surfaces
PhD thesis, 2018

Tightening Curves on Surfaces via Local Moves.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Near-Optimal Distance Emulator for Planar Graphs.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Lower Bounds for Planar Electrical Reduction.
CoRR, 2017

2016
Largest Eigenvalue and Invertibility of Symmetric Matrix Signings.
CoRR, 2016

Untangling Planar Curves.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Electrical Reduction, Homotopy Moves, and Defect.
CoRR, 2015

Detecting Weakly Simple Polygons.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

From Proximity to Utility: A Voronoi Partition of Pareto Optima.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2012
A faster algorithm to recognize even-hole-free graphs.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Computing the Girth of a Planar Graph in Linear Time.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011


  Loading...