| Publication | Date of Publication | Type |
|---|
| Realizable piecewise linear paths of persistence diagrams with Reeb graphs | 2024-09-10 | Paper |
| On complexity of computing bottleneck and lexicographic optimal cycles in a homology class | 2024-05-14 | Paper |
| A cautionary tale: burning the medial axis is unstable (media exposition) | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147422 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059174 | 2023-11-02 | Paper |
| Algorithms for contractibility of compressed curves on 3-manifold boundaries | 2023-08-17 | Paper |
| Metric and Path-Connectedness Properties of the Frechet Distance for Paths and Graphs | 2023-08-01 | Paper |
| Research networks for women | 2023-05-09 | Paper |
| Minimum Cuts in Surface Graphs | 2023-04-04 | Paper |
| Distances between immersed graphs: metric properties | 2023-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5881551 | 2023-03-10 | Paper |
| Constructing monotone homotopies and sweepouts | 2022-02-01 | Paper |
| Homotopy height, grid-major height and graph-drawing height | 2020-10-26 | Paper |
| Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary | 2020-05-27 | Paper |
| Exploring 2D Shape Complexity | 2019-09-18 | Paper |
| Medial Fragments for Segmentation of Articulating Objects in Images | 2019-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5224476 | 2019-07-23 | Paper |
| Persistent homology over directed acyclic graphs | 2019-01-25 | Paper |
| Density of local maxima of the distance function to a set of points in the plane | 2019-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607960 | 2018-03-15 | Paper |
| Homotopy measures for representative trajectories | 2018-03-02 | Paper |
| Connecting a set of circles with minimum sum of radii | 2018-02-19 | Paper |
| Minimum cycle and homology bases of surface-embedded graphs | 2018-01-30 | Paper |
| Minimum cuts and shortest homologous cycles | 2017-10-20 | Paper |
| Connectivity graphs of uncertainty regions | 2017-10-09 | Paper |
| Constructing monotone homotopies and sweepouts | 2017-04-20 | Paper |
| Minimum cycle and homology bases of surface-embedded graphs | 2017-03-30 | Paper |
| Integrating and Sampling Cuts in Bounded Treewidth Graphs | 2016-11-16 | Paper |
| The zipper foldings of the diamond | 2016-10-13 | Paper |
| Skeleton-Based Recognition of Shapes in Images via Longest Path Matching | 2016-04-14 | Paper |
| The zipper foldings of the diamond | 2015-06-15 | Paper |
| Measuring similarity between curves on 2-manifolds via homotopy area | 2015-02-17 | Paper |
| Counting and sampling minimum cuts in genus g graphs | 2015-02-17 | Paper |
| Homology flows, cohomology cuts | 2015-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934586 | 2014-12-18 | Paper |
| Counting and sampling minimum cuts in genus \(g\) graphs | 2014-11-14 | Paper |
| Covering nearly surface-embedded graphs with a fixed number of balls | 2014-09-12 | Paper |
| Multiple-source shortest paths in embedded graphs | 2013-11-14 | Paper |
| Flows in One-Crossing-Minor-Free Graphs | 2013-04-09 | Paper |
| Homology Flows, Cohomology Cuts | 2013-03-19 | Paper |
| Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area | 2012-12-04 | Paper |
| Connecting a set of circles with minimum sum of radii | 2011-08-12 | Paper |
| Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area | 2011-02-11 | Paper |
| Flows in One-Crossing-Minor-Free Graphs | 2010-12-09 | Paper |
| Connectivity graphs of uncertainty regions | 2010-12-09 | Paper |
| Extremal Problems for Roman Domination | 2010-08-27 | Paper |
| Vietoris-Rips complexes of planar point sets | 2010-06-21 | 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 |
| Splitting (complicated) surfaces is hard | 2008-07-29 | Paper |
| Pebbling and optimal pebbling in graphs | 2008-03-20 | Paper |
