Computing the Girth of a Planar Graph in Linear Time. - Hsien-Chih Chang; Hsueh-I Lu (SIAM J. Comput., 2013)

Detecting Weakly Simple Polygons. - Hsien-Chih Chang; Jeff Erickson 001; Chao Xu 002 (SODA, 2015)

Electrical Reduction, Homotopy Moves, and Defect. - Hsien-Chih Chang; Jeff Erickson 001 (CoRR, 2015)

A faster algorithm to recognize even-hole-free graphs. - Hsien-Chih Chang; Hsueh-I Lu (J. Comb. Theory B, 2015)

Largest Eigenvalue and Invertibility of Symmetric Matrix Signings. - Charles Carlson 002; Karthekeyan Chandrasekaran; Hsien-Chih Chang; Alexandra Kolla (CoRR, 2016)

From Proximity to Utility: A Voronoi Partition of Pareto Optima. - Hsien-Chih Chang; Sariel Har-Peled; Benjamin Raichel (Discret. Comput. Geom., 2016)

Lower Bounds for Planar Electrical Reduction. - Hsien-Chih Chang; Jeff Erickson 001 (CoRR, 2017)

Untangling Planar Curves. - Hsien-Chih Chang; Jeff Erickson 001 (Discret. Comput. Geom., 2017)

Near-Optimal Distance Emulator for Planar Graphs. - Hsien-Chih Chang; Pawel Gawrychowski; Shay Mozes; Oren Weimann (ESA, 2018)

Tightening Curves on Surfaces via Local Moves. - Hsien-Chih Chang; Jeff Erickson 001; David Letscher; Arnaud de Mesmay; Saul Schleimer; Eric Sedgwick; Dylan Thurston; Stephan Tillmann (SODA, 2018)

Tightening curves and graphs on surfaces - Hsien-Chih Chang (2018)

Efficient Algorithms for Geometric Partial Matching. - Pankaj K. Agarwal; Hsien-Chih Chang; Allen Xiao (SoCG, 2019)

Lower Bounds for Electrical Reduction on Surfaces. - Hsien-Chih Chang; Marcos Cossarini; Jeff Erickson 001 (SoCG, 2019)

Planar Emulators for Monge Matrices. - Hsien-Chih Chang; Tim Ophelders (CCCG, 2020)

Clustering Under Perturbation Stability in Near-Linear Time. - Pankaj K. Agarwal; Hsien-Chih Chang; Kamesh Munagala; Erin Taylor 002; Emo Welzl (FSTTCS, 2020)

Spectral aspects of symmetric matrix signings. - Charles Carlson 002; Karthekeyan Chandrasekaran; Hsien-Chih Chang; Naonori Kakimura; Alexandra Kolla (Discret. Optim., 2020)

Untangling Planar Graphs and Curves by Staying Positive. - Santiago Aranguri; Hsien-Chih Chang; Dylan Fridman (SODA, 2022)

Deterministic, near-linear ε-approximation algorithm for geometric bipartite matching. - Pankaj K. Agarwal; Hsien-Chih Chang; Sharath Raghvendra; Allen Xiao (STOC, 2022)

Almost-linear ε-emulators for planar graphs. - Hsien-Chih Chang; Robert Krauthgamer; Zihan Tan (STOC, 2022)

Deterministic, Near-Linear ε-Approximation Algorithm for Geometric Bipartite Matching. - Pankaj K. Agarwal; Hsien-Chih Chang; Sharath Raghvendra; Allen Xiao (CoRR, 2022)

Near-Linear ε-Emulators for Planar Graphs. - Hsien-Chih Chang; Robert Krauthgamer; Zihan Tan (CoRR, 2022)

Dynamic Geometric Set Cover and Hitting Set. - Pankaj K. Agarwal; Hsien-Chih Chang; Subhash Suri; Allen Xiao; Jie Xue 003 (ACM Trans. Algorithms, 2022)

Tightening Curves on Surfaces Monotonically with Applications. - Hsien-Chih Chang; Arnaud de Mesmay (ACM Trans. Algorithms, 2022)

Covering Planar Metrics (and Beyond): O(1) Trees Suffice. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (FOCS, 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 (WADS, 2023)

Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (CoRR, 2023)

Computing Diameter+2 in Truly-Subquadratic Time for Unit-Disk Graphs. - Hsien-Chih Chang; Jie Gao 001; Hung Le 001 (SoCG, 2024)

Optimal Euclidean Tree Covers. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (SoCG, 2024)

Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Lazar Milenkovic; Shay Solomon; Cuong Than (SODA, 2024)

Embedding Planar Graphs into Graphs of Treewidth O(log3 n). - Hsien-Chih Chang; Vincent Cohen-Addad; Jonathan Conroy; Hung Le 001; Marcin Pilipczuk; Michal Pilipczuk (CoRR, 2024)

Hard Diagrams of the Unknot. - Benjamin A. Burton; Hsien-Chih Chang; Maarten Löffler; Clément Maria; Arnaud de Mesmay; Saul Schleimer; Eric Sedgwick; Jonathan Spreer (Exp. Math., 2024)

Embedding Planar Graphs into Graphs of Treewidth O (log3 n ). - Hsien-Chih Chang; Vincent Cohen-Addad; Jonathan Conroy; Hung Le 001; Marcin Pilipczuk; Michal Pilipczuk (SODA, 2025)

Light Tree Covers, Routing, and Path-Reporting Oracles via Spanning Tree Covers in Doubling Graphs. - Hsien-Chih Chang; Jonathan Conroy; Hung Le 001; Shay Solomon; Cuong Than (STOC, 2025)

Unintuitive Facts About Distances on Planar Graphs (Invited Talk). - Hsien-Chih Chang (WADS, 2025)