Hsien-Chih Chang

Available identifiers

zbMath Open chang.hsien-chihMaRDI QIDQ331375

List of research outcomes

Publication	Date of Publication	Type
Shortcut partitions in minor-free graphs: Steiner point removal, distance oracles, tree covers, and more	2024-11-28	Paper
Hard Diagrams of the Unknot	2024-10-02	Paper
Untangling planar graphs and curves by staying positive	2024-07-19	Paper
From curves to words and back again: geometric computation of minimum-area homotopy	2024-01-16	Paper
Deterministic, near-linear 𝜀 -approximation algorithm for geometric bipartite matching	2023-12-08	Paper
Almost-linear ε -emulators for planar graphs	2023-12-08	Paper
Tightening Curves on Surfaces Monotonically with Applications	2023-10-31	Paper
Spectral aspects of symmetric matrix signings	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5088931	2022-07-18	Paper
Lower bounds for electrical reduction on surfaces	2022-07-18	Paper
https://portal.mardi4nfdi.de/entity/Q5009573	2021-08-04	Paper
Hard Diagrams of the Unknot	2021-04-28	Paper
Tightening Curves on Surfaces Monotonically with Applications	2021-02-02	Paper
Spectral aspects of symmetric matrix signings	2020-07-30	Paper
https://portal.mardi4nfdi.de/entity/Q5743476	2019-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q4607881	2018-03-15	Paper
Untangling Planar Curves	2018-01-30	Paper
Untangling planar curves	2018-01-11	Paper
https://portal.mardi4nfdi.de/entity/Q5368721	2017-10-10	Paper
Detecting Weakly Simple Polygons	2017-10-05	Paper
Invertibility and Largest Eigenvalue of Symmetric Matrix Signings	2016-11-11	Paper
From proximity to utility: a Voronoi partition of Pareto optima	2016-10-27	Paper
Electrical Reduction, Homotopy Moves, and Defect	2015-10-02	Paper
A faster algorithm to recognize even-hole-free graphs	2015-06-10	Paper
Computing the girth of a planar graph in linear time	2013-09-25	Paper
Computing the girth of a planar graph in linear time	2011-08-17	Paper

Research outcomes over time

This page was built for person: Hsien-Chih Chang