Hsien-Chih Chang

From MaRDI portal
Person:331375

Available identifiers

zbMath Open chang.hsien-chihMaRDI QIDQ331375

List of research outcomes





PublicationDate of PublicationType
Shortcut partitions in minor-free graphs: Steiner point removal, distance oracles, tree covers, and more2024-11-28Paper
Hard Diagrams of the Unknot2024-10-02Paper
Untangling planar graphs and curves by staying positive2024-07-19Paper
From curves to words and back again: geometric computation of minimum-area homotopy2024-01-16Paper
Deterministic, near-linear 𝜀 -approximation algorithm for geometric bipartite matching2023-12-08Paper
Almost-linear Δ -emulators for planar graphs2023-12-08Paper
Tightening Curves on Surfaces Monotonically with Applications2023-10-31Paper
Spectral aspects of symmetric matrix signings2022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50889312022-07-18Paper
Lower bounds for electrical reduction on surfaces2022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50095732021-08-04Paper
Hard Diagrams of the Unknot2021-04-28Paper
Tightening Curves on Surfaces Monotonically with Applications2021-02-02Paper
Spectral aspects of symmetric matrix signings2020-07-30Paper
https://portal.mardi4nfdi.de/entity/Q57434762019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q46078812018-03-15Paper
Untangling Planar Curves2018-01-30Paper
Untangling planar curves2018-01-11Paper
https://portal.mardi4nfdi.de/entity/Q53687212017-10-10Paper
Detecting Weakly Simple Polygons2017-10-05Paper
Invertibility and Largest Eigenvalue of Symmetric Matrix Signings2016-11-11Paper
From proximity to utility: a Voronoi partition of Pareto optima2016-10-27Paper
Electrical Reduction, Homotopy Moves, and Defect2015-10-02Paper
A faster algorithm to recognize even-hole-free graphs2015-06-10Paper
Computing the girth of a planar graph in linear time2013-09-25Paper
Computing the girth of a planar graph in linear time2011-08-17Paper

Research outcomes over time

This page was built for person: Hsien-Chih Chang