| Publication | Date of Publication | Type |
|---|
| Unintuitive facts about distances on planar graphs (invited talk) | 2026-08-11 | Paper |
Optimal Euclidean tree covers
Discrete & Computational Geometry | 2026-07-03 | Paper |
| Clustering under perturbation stability in near-linear time | 2026-03-23 | Paper |
| Computing diameter+2 in truly-subquadratic time for unit-disk graphs | 2025-11-24 | Paper |
| Optimal Euclidean tree covers | 2025-11-24 | Paper |
| Covering planar metrics (and beyond): O(1) trees suffice | 2025-08-15 | Paper |
| Shortcut partitions in minor-free graphs: Steiner point removal, distance oracles, tree covers, and more | 2024-11-28 | Paper |
Hard Diagrams of the Unknot
Experimental Mathematics | 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
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Deterministic, near-linear <i>đ</i> -approximation algorithm for geometric bipartite matching
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Almost-linear <i>Δ</i> -emulators for planar graphs
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Tightening Curves on Surfaces Monotonically with Applications
ACM Transactions on Algorithms | 2023-10-31 | Paper |
| Spectral aspects of symmetric matrix signings | 2022-07-21 | Paper |
Efficient algorithms for geometric partial matching
(available as arXiv preprint) | 2022-07-18 | Paper |
Lower bounds for electrical reduction on surfaces
(available as arXiv preprint) | 2022-07-18 | Paper |
Near-optimal distance emulator for planar graphs
(available as arXiv preprint) | 2021-08-04 | Paper |
| Hard Diagrams of the Unknot | 2021-04-28 | Paper |
Tightening Curves on Surfaces Monotonically with Applications
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Spectral aspects of symmetric matrix signings
Discrete Optimization | 2020-07-30 | Paper |
| A faster algorithm to recognize even-hole-free graphs | 2019-05-10 | Paper |
| scientific article; zbMATH DE number 6850316 (Why is no real title available?) | 2018-03-15 | Paper |
Untangling planar curves
(available as arXiv preprint) | 2018-01-30 | Paper |
Untangling planar curves
Discrete & Computational Geometry | 2018-01-11 | Paper |
| From proximity to utility: a Voronoi partition of Pareto optima | 2017-10-10 | Paper |
Detecting weakly simple polygons
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 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
Discrete & Computational Geometry | 2016-10-27 | Paper |
From proximity to utility: a Voronoi partition of Pareto optima
Discrete & Computational Geometry | 2016-10-27 | Paper |
| Electrical Reduction, Homotopy Moves, and Defect | 2015-10-02 | Paper |
A faster algorithm to recognize even-hole-free graphs
Journal of Combinatorial Theory. Series B | 2015-06-10 | Paper |
Computing the girth of a planar graph in linear time
SIAM Journal on Computing | 2013-09-25 | Paper |
Computing the girth of a planar graph in linear time
Lecture Notes in Computer Science | 2011-08-17 | Paper |
