| Publication | Date of Publication | Type |
|---|
| Chasing puppies: mobile beacon routing on closed curves | 2026-04-27 | Paper |
| Smoothing the gap between NP and ER | 2025-08-12 | Paper |
| The tragedy of being almost but not quite Planar (invited talk) | 2024-09-11 | Paper |
How to morph graphs on the torus
(available as arXiv preprint) | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7760169 (Why is no real title available?) | 2023-11-02 | Paper |
Minimum Cuts in Surface Graphs
SIAM Journal on Computing | 2023-04-04 | Paper |
Planar and Toroidal Morphs Made Easier
Journal of Graph Algorithms and Applications | 2023-03-30 | Paper |
| Reconstructing Graphs from Connected Triples | 2023-03-12 | Paper |
scientific article; zbMATH DE number 7633284 (Why is no real title available?)
(available as arXiv preprint) | 2022-12-15 | Paper |
scientific article; zbMATH DE number 7577570 (Why is no real title available?)
(available as arXiv preprint) | 2022-08-30 | Paper |
| scientific article; zbMATH DE number 7577570 (Why is no real title available?) | 2022-08-30 | Paper |
Lower bounds for electrical reduction on surfaces
(available as arXiv preprint) | 2022-07-18 | Paper |
| scientific article; zbMATH DE number 7559234 (Why is no real title available?) | 2022-07-18 | Paper |
Planar and toroidal morphs made easier
(available as arXiv preprint) | 2022-07-01 | Paper |
A toroidal Maxwell-Cremona-Delaunay correspondence
(available as arXiv preprint) | 2022-05-18 | Paper |
Smoothing the Gap Between NP and ER
SIAM Journal on Computing | 2022-04-20 | Paper |
Planar and Toroidal Morphs Made Easier
(available as arXiv preprint) | 2021-06-26 | Paper |
Topologically trivial closed walks in directed surface graphs
Discrete & Computational Geometry | 2021-01-29 | Paper |
Topologically trivial closed walks in directed surface graphs
Discrete & Computational Geometry | 2021-01-29 | Paper |
Fusible numbers and Peano Arithmetic
(available as arXiv preprint) | 2020-03-31 | Paper |
Smoothing the gap between NP and ER
(available as arXiv preprint) | 2019-12-04 | Paper |
Holiest minimum-cost paths and flows in surface graphs
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Transforming curves on surfaces redux
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Global minimum cuts in surface embedded graphs | 2019-05-10 | Paper |
Vertex-unfoldings of simplicial manifolds
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Optimally cutting a surface into a disk
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
A near-optimal approximation algorithm for asymmetric TSP on embedded graphs
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | 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 |
Recognizing weakly simple polygons
(available as arXiv preprint) | 2018-01-30 | Paper |
Untangling planar curves
Discrete & Computational Geometry | 2018-01-11 | Paper |
Recognizing weakly simple polygons
Discrete & Computational Geometry | 2018-01-11 | Paper |
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Detecting weakly simple polygons
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Shortest non-crossing walks in the plane | 2017-09-29 | Paper |
| scientific article; zbMATH DE number 6783459 (Why is no real title available?) | 2017-09-29 | Paper |
| scientific article; zbMATH DE number 6783474 (Why is no real title available?) | 2017-09-29 | Paper |
Spacetime meshing with adaptive refinement and coarsening
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Nice point sets can have nasty Delaunay triangulations
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Local polyhedra and geometric graphs
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
On the least median square problem
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Separating point sets in polygonal environments
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Necklaces, convolutions, and \(X+Y\)
Algorithmica | 2017-03-27 | Paper |
| Electrical Reduction, Homotopy Moves, and Defect | 2015-10-02 | Paper |
Efficiently hex-meshing things with topology
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Finding one tight cycle
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Efficiently hex-meshing things with topology
Discrete & Computational Geometry | 2014-11-14 | Paper |
| Greedy optimal homotopy and homology generators | 2014-10-13 | Paper |
| Lower bounds for external algebraic decision trees | 2014-10-13 | Paper |
Tracing compressed curves in triangulated surfaces
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
| scientific article; zbMATH DE number 6297748 (Why is no real title available?) | 2014-05-22 | Paper |
Shortest non-trivial cycles in directed surface graphs
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Multiple-source shortest paths in embedded graphs
SIAM Journal on Computing | 2013-11-14 | Paper |
Tracing compressed curves in triangulated surfaces
Discrete & Computational Geometry | 2013-08-05 | Paper |
Homology Flows, Cohomology Cuts
SIAM Journal on Computing | 2013-03-19 | Paper |
| Combinatorial optimization of cycles and bases | 2012-09-14 | Paper |
Tightening nonsimple paths and cycles on surfaces
SIAM Journal on Computing | 2011-04-04 | Paper |
An h-adaptive spacetime-discontinuous Galerkin method for linear elastodynamics
European Journal of Computational Mechanics | 2011-03-31 | Paper |
Computing the shortest essential cycle
Discrete & Computational Geometry | 2010-11-08 | Paper |
Tightening non-simple paths and cycles on surfaces
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764895 (Why is no real title available?) | 2010-08-06 | Paper |
| Empty-ellipse graphs | 2010-08-06 | Paper |
| Centerpoint theorems for wedges | 2010-07-27 | Paper |
Vietoris-Rips complexes of planar point sets
Discrete & Computational Geometry | 2010-06-21 | Paper |
Output-sensitive algorithms for computing nearest-neighbour decision boundaries.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
Computational Geometry | 2009-11-16 | Paper |
Walking your dog in the woods in polynomial time
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Testing contractibility in planar rips complexes
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
| Minimum-cost coverage of point sets by disks | 2009-02-10 | Paper |
| scientific article; zbMATH DE number 5506234 (Why is no real title available?) | 2009-02-10 | Paper |
Realizing partitions respecting full and partial order information
Journal of Discrete Algorithms | 2008-11-18 | Paper |
Splitting (complicated) surfaces is hard
Computational Geometry | 2008-07-29 | Paper |
Necklaces, Convolutions, and X + Y
Lecture Notes in Computer Science | 2008-03-11 | Paper |
On the least median square problem
Discrete & Computational Geometry | 2006-12-06 | Paper |
SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
International Journal of Computational Geometry & Applications | 2005-09-29 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Output-sensitive algorithms for computing nearest-neighbour decision boundaries
Discrete & Computational Geometry | 2005-08-02 | Paper |
Local polyhedra and geometric graphs
Computational Geometry | 2005-05-04 | Paper |
Dense point sets have sparse Delaunay triangulations or ``\dots but not too nasty''
Discrete & Computational Geometry | 2005-02-23 | Paper |
| scientific article; zbMATH DE number 2119653 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2068107 (Why is no real title available?) | 2004-05-27 | Paper |
scientific article; zbMATH DE number 2068110 (Why is no real title available?)
(available as arXiv preprint) | 2004-05-27 | Paper |
Kinetic collision detection between two simple polygons.
Computational Geometry | 2004-03-29 | Paper |
Optimally cutting a surface into a disk
Discrete & Computational Geometry | 2004-03-11 | Paper |
Preprocessing chains for fast dihedral rotations is hard or even impossible.
Computational Geometry | 2003-10-14 | Paper |
| scientific article; zbMATH DE number 1979514 (Why is no real title available?) | 2003-09-14 | Paper |
Nice point sets can have nasty Delaunay triangulations
Discrete & Computational Geometry | 2003-08-21 | Paper |
Indexing moving points
Journal of Computer and System Sciences | 2003-06-25 | Paper |
Flipturning Polygons
Discrete & Computational Geometry | 2003-03-17 | Paper |
Reconfiguring convex polygons
Computational Geometry | 2002-01-14 | Paper |
Efficient searching with linear constraints
Journal of Computer and System Sciences | 2001-04-02 | Paper |
Space-Time Tradeoffs for Emptiness Queries
SIAM Journal on Computing | 2000-10-18 | Paper |
Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
Discrete & Computational Geometry | 2000-10-17 | Paper |
| scientific article; zbMATH DE number 1445393 (Why is no real title available?) | 2000-05-10 | Paper |
| scientific article; zbMATH DE number 1305422 (Why is no real title available?) | 2000-02-16 | Paper |
New Lower Bounds for Convex Hull Problems in Odd Dimensions
SIAM Journal on Computing | 1999-10-28 | Paper |
scientific article; zbMATH DE number 1351079 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 1999-10-20 | Paper |
| scientific article; zbMATH DE number 1305397 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1303547 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1241835 (Why is no real title available?) | 1999-01-18 | Paper |
| scientific article; zbMATH DE number 988837 (Why is no real title available?) | 1997-10-15 | Paper |
| scientific article; zbMATH DE number 988836 (Why is no real title available?) | 1997-03-09 | Paper |
New lower bounds for Hopcroft's problem
Discrete & Computational Geometry | 1997-03-03 | Paper |
| scientific article; zbMATH DE number 910895 (Why is no real title available?) | 1996-07-28 | Paper |
Iterated nearest neighbors and finding minimal polytopes
Discrete & Computational Geometry | 1995-03-01 | Paper |
| scientific article; zbMATH DE number 437530 (Why is no real title available?) | 1994-11-29 | Paper |
