default search action
Hsien-Chih Chang
Person information
- affiliation: Dartmouth College, Hanover, NH, USA
- affiliation (PhD 2018): University of Illinois Urbana-Champaign, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Benjamin A. Burton
, Hsien-Chih Chang, Maarten Löffler, Clément Maria, Arnaud de Mesmay, Saul Schleimer
Hard Diagrams of the Unknot. Exp. Math. 33(3): 482-500 (2024) - [c22]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Optimal Euclidean Tree Covers. SoCG 2024: 37:1-37:15 - [c21]Hsien-Chih Chang, Jie Gao, Hung Le:
Computing Diameter+2 in Truly-Subquadratic Time for Unit-Disk Graphs. SoCG 2024: 38:1-38:14 - [c20]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. SODA 2024: 5300-5331 - [i21]Hsien-Chih Chang, Jie Gao, Hung Le:
Computing Diameter+2 in Truly Subquadratic Time for Unit-Disk Graphs. CoRR abs/2401.12881 (2024) - [i20]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Optimal Euclidean Tree Covers. CoRR abs/2403.17754 (2024) - 2023
- [c19]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Covering Planar Metrics (and Beyond): O(1) Trees Suffice. FOCS 2023: 2231-2261 - [c18]Hsien-Chih Chang
From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy. WADS 2023: 605-619 - [i19]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Covering Planar Metrics (and Beyond): O(1) Trees Suffice. CoRR abs/2306.06215 (2023) - [i18]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Resolving the Steiner Point Removal Problem in Planar Graphs via Shortcut Partitions. CoRR abs/2306.06235 (2023) - [i17]Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than:
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More. CoRR abs/2308.00555 (2023) - [i16]Hsien-Chih Chang, Brittany Terese Fasy, Bradley McCoy, David L. Millman, Carola Wenk
From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy. CoRR abs/2309.02383 (2023) - 2022
- [j7]Hsien-Chih Chang
Tightening Curves on Surfaces Monotonically with Applications. ACM Trans. Algorithms 18(4): 36:1-36:32 (2022) - [j6]Pankaj K. Agarwal
Dynamic Geometric Set Cover and Hitting Set. ACM Trans. Algorithms 18(4): 40:1-40:37 (2022) - [c17]Santiago Aranguri, Hsien-Chih Chang, Dylan Fridman:
Untangling Planar Graphs and Curves by Staying Positive. SODA 2022: 211-225 - [c16]Pankaj K. Agarwal, Hsien-Chih Chang, Sharath Raghvendra, Allen Xiao:
Deterministic, near-linear ε-approximation algorithm for geometric bipartite matching. STOC 2022: 1052-1065 - [c15]Hsien-Chih Chang, Robert Krauthgamer
Almost-linear ε-emulators for planar graphs. STOC 2022: 1311-1324 - [i15]Pankaj K. Agarwal, Hsien-Chih Chang, Sharath Raghvendra, Allen Xiao:
Deterministic, Near-Linear ε-Approximation Algorithm for Geometric Bipartite Matching. CoRR abs/2204.03875 (2022) - [i14]Hsien-Chih Chang, Robert Krauthgamer, Zihan Tan:
Near-Linear ε-Emulators for Planar Graphs. CoRR abs/2206.10681 (2022) - 2020
- [j5]Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla:
Spectral aspects of symmetric matrix signings. Discret. Optim. 37: 100582 (2020) - [c14]Hsien-Chih Chang, Tim Ophelders:
Planar Emulators for Monge Matrices. CCCG 2020: 141-147 - [c13]Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue
Dynamic Geometric Set Cover and Hitting Set. SoCG 2020: 2:1-2:15 - [c12]Pankaj K. Agarwal, Hsien-Chih Chang, Kamesh Munagala, Erin Taylor
Clustering Under Perturbation Stability in Near-Linear Time. FSTTCS 2020: 8:1-8:16 - [c11]Hsien-Chih Chang, Arnaud de Mesmay:
Tightening Curves on Surfaces Monotonically with Applications. SODA 2020: 747-766 - [i13]Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue:
Dynamic geometric set cover and hitting set. CoRR abs/2003.00202 (2020) - [i12]Hsien-Chih Chang, Arnaud de Mesmay:
Tightening Curves on Surfaces Monotonically with Applications. CoRR abs/2003.00649 (2020) - [i11]Pankaj K. Agarwal, Hsien-Chih Chang, Kamesh Munagala, Erin Taylor, Emo Welzl:
Clustering under Perturbation Stability in Near-Linear Time. CoRR abs/2009.14358 (2020)
2010 – 2019
- 2019
- [c10]Pankaj K. Agarwal, Hsien-Chih Chang, Allen Xiao:
Efficient Algorithms for Geometric Partial Matching. SoCG 2019: 6:1-6:14 - [c9]Hsien-Chih Chang, Marcos Cossarini, Jeff Erickson:
Lower Bounds for Electrical Reduction on Surfaces. SoCG 2019: 25:1-25:16 - [c8]Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Naonori Kakimura, Alexandra Kolla:
Spectral Aspects of Symmetric Matrix Signings. MFCS 2019: 81:1-81:13 - [i10]Pankaj K. Agarwal, Hsien-Chih Chang, Allen Xiao:
Efficient Algorithms for Geometric Partial Matching. CoRR abs/1903.09358 (2019) - 2018
- [b1]Hsien-Chih Chang:
Tightening curves and graphs on surfaces. University of Illinois Urbana-Champaign, USA, 2018 - [c7]Hsien-Chih Chang, Pawel Gawrychowski
Near-Optimal Distance Emulator for Planar Graphs. ESA 2018: 16:1-16:17 - [c6]Hsien-Chih Chang, Jeff Erickson, David Letscher, Arnaud de Mesmay, Saul Schleimer, Eric Sedgwick, Dylan Thurston, Stephan Tillmann
Tightening Curves on Surfaces via Local Moves. SODA 2018: 121-135 - [i9]Hsien-Chih Chang, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Near-Optimal Distance Emulator for Planar Graphs. CoRR abs/1807.01478 (2018) - 2017
- [j4]Hsien-Chih Chang, Jeff Erickson
Untangling Planar Curves. Discret. Comput. Geom. 58(4): 889-920 (2017) - [i8]Hsien-Chih Chang, Jeff Erickson:
Untangling Planar Curves. CoRR abs/1702.00146 (2017) - [i7]Hsien-Chih Chang, Jeff Erickson:
Lower Bounds for Planar Electrical Reduction. CoRR abs/1707.04683 (2017) - 2016
- [j3]Hsien-Chih Chang, Sariel Har-Peled
From Proximity to Utility: A Voronoi Partition of Pareto Optima. Discret. Comput. Geom. 56(3): 631-656 (2016) - [c5]Hsien-Chih Chang, Jeff Erickson:
Untangling Planar Curves. SoCG 2016: 29:1-29:16 - [i6]Charles Carlson, Karthekeyan Chandrasekaran, Hsien-Chih Chang, Alexandra Kolla:
Largest Eigenvalue and Invertibility of Symmetric Matrix Signings. CoRR abs/1611.03624 (2016) - 2015
- [j2]Hsien-Chih Chang, Hsueh-I Lu:
A faster algorithm to recognize even-hole-free graphs. J. Comb. Theory B 113: 141-161 (2015) - [c4]Hsien-Chih Chang, Sariel Har-Peled
From Proximity to Utility: A Voronoi Partition of Pareto Optima. SoCG 2015: 689-703 - [c3]Hsien-Chih Chang, Jeff Erickson, Chao Xu
Detecting Weakly Simple Polygons. SODA 2015: 1655-1670 - [i5]Hsien-Chih Chang, Jeff Erickson:
Electrical Reduction, Homotopy Moves, and Defect. CoRR abs/1510.00571 (2015) - 2014
- [i4]Hsien-Chih Chang, Sariel Har-Peled, Benjamin Raichel:
From Proximity to Utility: A Voronoi Partition of Pareto Optima. CoRR abs/1404.3403 (2014) - [i3]Hsien-Chih Chang, Jeff Erickson, Chao Xu:
Detecting Weakly Simple Polygons. CoRR abs/1407.3340 (2014) - 2013
- [j1]Hsien-Chih Chang, Hsueh-I Lu:
Computing the Girth of a Planar Graph in Linear Time. SIAM J. Comput. 42(3): 1077-1094 (2013) - [i2]Hsien-Chih Chang, Hsueh-I Lu:
A Faster Algorithm to Recognize Even-Hole-Free Graphs. CoRR abs/1311.0358 (2013) - 2012
- [c2]Hsien-Chih Chang, Hsueh-I Lu:
A faster algorithm to recognize even-hole-free graphs. SODA 2012: 1286-1297 - 2011
- [c1]Hsien-Chih Chang, Hsueh-I Lu:
Computing the Girth of a Planar Graph in Linear Time. COCOON 2011: 225-236 - [i1]Hsien-Chih Chang, Hsueh-I Lu:
Computing the Girth of a Planar Graph in Linear Time. CoRR abs/1104.4892 (2011)
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-11-14 00:52 CET 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: