| Publication | Date of Publication | Type |
|---|
| The tragedy of being almost but not quite Planar (invited talk) | 2024-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147422 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059989 | 2023-11-02 | Paper |
| Minimum Cuts in Surface Graphs | 2023-04-04 | Paper |
| Planar and Toroidal Morphs Made Easier | 2023-03-30 | Paper |
| Reconstructing Graphs from Connected Triples | 2023-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5057207 | 2022-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5101339 | 2022-08-30 | Paper |
| Lower bounds for electrical reduction on surfaces | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088964 | 2022-07-18 | Paper |
| Planar and toroidal morphs made easier | 2022-07-01 | Paper |
| A Toroidal Maxwell-Cremona-Delaunay Correspondence | 2022-05-18 | Paper |
| Smoothing the Gap Between NP and ER | 2022-04-20 | Paper |
| Planar and Toroidal Morphs Made Easier | 2021-06-26 | Paper |
| Topologically trivial closed walks in directed surface graphs | 2021-01-29 | Paper |
| Fusible numbers and Peano Arithmetic | 2020-03-31 | Paper |
| Smoothing the gap between NP and ER | 2019-12-04 | Paper |
| Holiest minimum-cost paths and flows in surface graphs | 2019-08-22 | Paper |
| Transforming Curves on Surfaces Redux | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743478 | 2019-05-10 | Paper |
| Vertex-unfoldings of simplicial manifolds | 2018-11-23 | Paper |
| Optimally cutting a surface into a disk | 2018-11-23 | Paper |
| A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607881 | 2018-03-15 | Paper |
| Untangling Planar Curves | 2018-01-30 | Paper |
| Recognizing weakly simple polygons | 2018-01-30 | Paper |
| Untangling planar curves | 2018-01-11 | Paper |
| Recognizing weakly simple polygons | 2018-01-11 | Paper |
| Minimum cuts and shortest homologous cycles | 2017-10-20 | Paper |
| Detecting Weakly Simple Polygons | 2017-10-05 | Paper |
| Spacetime meshing with adaptive refinement and coarsening | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365044 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365107 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365122 | 2017-09-29 | Paper |
| Nice point sets can have nasty Delaunay triangulations | 2017-09-29 | Paper |
| Local polyhedra and geometric graphs | 2017-09-29 | Paper |
| On the least median square problem | 2017-09-29 | Paper |
| Separating point sets in polygonal environments | 2017-09-29 | Paper |
| Necklaces, convolutions, and \(X+Y\) | 2017-03-27 | Paper |
| Electrical Reduction, Homotopy Moves, and Defect | 2015-10-02 | Paper |
| Efficiently hex-meshing things with topology | 2015-02-17 | Paper |
| Homology flows, cohomology cuts | 2015-02-04 | Paper |
| Finding one tight cycle | 2014-11-18 | Paper |
| Efficiently hex-meshing things with topology | 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 | 2014-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417668 | 2014-05-22 | Paper |
| Shortest non-trivial cycles in directed surface graphs | 2014-03-24 | Paper |
| Multiple-source shortest paths in embedded graphs | 2013-11-14 | Paper |
| Tracing compressed curves in triangulated surfaces | 2013-08-05 | Paper |
| Homology Flows, Cohomology Cuts | 2013-03-19 | Paper |
| Combinatorial optimization of cycles and bases | 2012-09-14 | Paper |
| Tightening Nonsimple Paths and Cycles on Surfaces | 2011-04-04 | Paper |
| An h-adaptive spacetime-discontinuous Galerkin method for linear elastodynamics | 2011-03-31 | Paper |
| Computing the shortest essential cycle | 2010-11-08 | Paper |
| Tightening non-simple paths and cycles on surfaces | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579489 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579508 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575444 | 2010-07-27 | Paper |
| Vietoris-Rips complexes of planar point sets | 2010-06-21 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time | 2009-11-16 | Paper |
| Walking your dog in the woods in polynomial time | 2009-02-12 | Paper |
| Testing contractibility in planar rips complexes | 2009-02-12 | Paper |
| Minimum-cost coverage of point sets by disks | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601568 | 2009-02-10 | Paper |
| Realizing partitions respecting full and partial order information | 2008-11-18 | Paper |
| Splitting (complicated) surfaces is hard | 2008-07-29 | Paper |
| Necklaces, Convolutions, and X + Y | 2008-03-11 | Paper |
| On the least median square problem | 2006-12-06 | Paper |
| SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS | 2005-09-29 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Output-sensitive algorithms for computing nearest-neighbour decision boundaries | 2005-08-02 | Paper |
| Local polyhedra and geometric graphs | 2005-05-04 | Paper |
| Dense point sets have sparse Delaunay triangulations or ``\dots but not too nasty | 2005-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828924 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4464718 | 2004-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4464722 | 2004-05-27 | Paper |
| Kinetic collision detection between two simple polygons. | 2004-03-29 | Paper |
| Optimally cutting a surface into a disk | 2004-03-11 | Paper |
| Preprocessing chains for fast dihedral rotations is hard or even impossible. | 2003-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427858 | 2003-09-14 | Paper |
| Nice point sets can have nasty Delaunay triangulations | 2003-08-21 | Paper |
| Indexing moving points | 2003-06-25 | Paper |
| Flipturning Polygons | 2003-03-17 | Paper |
| Reconfiguring convex polygons | 2002-01-14 | Paper |
| Efficient searching with linear constraints | 2001-04-02 | Paper |
| Space-Time Tradeoffs for Emptiness Queries | 2000-10-18 | Paper |
| Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952716 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252305 | 2000-02-16 | Paper |
| New Lower Bounds for Convex Hull Problems in Odd Dimensions | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4267801 | 1999-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252278 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250171 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4225298 | 1999-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3123666 | 1997-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3123665 | 1997-03-09 | Paper |
| New lower bounds for Hopcroft's problem | 1997-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886070 | 1996-07-28 | Paper |
| Iterated nearest neighbors and finding minimal polytopes | 1995-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140402 | 1994-11-29 | Paper |
