| Publication | Date of Publication | Type |
|---|
| Minimum Scan Cover and Variants: Theory and Experiments | 2024-04-14 | Paper |
| On length-sensitive Fréchet similarity | 2024-01-16 | Paper |
| Morphing planar graph drawings through 3D | 2023-12-16 | Paper |
| On the Hardness of Computing an Average Curve. | 2023-11-02 | Paper |
| Geometric Secluded Paths and Planar Satisfiability | 2023-11-02 | Paper |
| Dots & Polygons (Media Exposition) | 2023-11-02 | Paper |
| Designing art galleries (Media Exposition) | 2023-11-02 | Paper |
| Morphing planar graph drawings through 3D | 2023-08-14 | Paper |
| Dots & Boxes Is PSPACE-Complete | 2023-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6159887 | 2023-06-23 | Paper |
| Sometimes Reliable Spanners of Almost Linear Size. | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088946 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5077657 | 2022-05-18 | Paper |
| Fine-grained Complexity Analysis of Two Classic TSP Variants | 2022-02-08 | Paper |
| A spanner for the day after | 2021-01-29 | Paper |
| Placing your Coins on a Shelf | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115783 | 2020-08-18 | Paper |
| Progressive simplification of polygonal curves | 2020-03-23 | Paper |
| Minimum perimeter-sum partitions in the plane | 2020-01-31 | Paper |
| SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension | 2019-10-15 | Paper |
| Approximating (k, ℓ)-center clustering for curves | 2019-10-15 | Paper |
| Region-based Approximation Algorithms for Visibility between Imprecise Locations | 2019-09-12 | Paper |
| Four Soviets Walk the Dog—with an Application to Alt's Conjecture | 2019-06-20 | Paper |
| Region-based approximation of probability distributions (for visibility between imprecise points among obstacles) | 2019-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633876 | 2019-05-06 | Paper |
| The Number of Convex Polyominoes with Given Height and Width | 2019-03-04 | Paper |
| Placing your Coins on a Shelf | 2019-02-27 | Paper |
| Locally correct Fréchet matchings | 2018-11-16 | Paper |
| Computing the similarity between moving curves | 2018-10-31 | Paper |
| Minimum Perimeter-Sum Partitions in the Plane | 2018-08-13 | Paper |
| Range-clustering queries | 2018-08-13 | Paper |
| Ruler of the plane - Games of geometry | 2018-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580143 | 2018-08-13 | Paper |
| Compact Flow Diagrams for State Sequences | 2018-08-06 | Paper |
| Model-based segmentation and classification of trajectories | 2018-07-25 | Paper |
| Computing the Fréchet Distance between Real-Valued Surfaces | 2018-07-16 | Paper |
| A Framework for Computing the Greedy Spanner | 2018-04-23 | Paper |
| Progressive Geometric Algorithms | 2018-04-23 | Paper |
| Fine-grained complexity analysis of two classic TSP variants | 2017-12-19 | Paper |
| Four Soviets walk the dog: improved bounds for computing the Fréchet distance | 2017-10-10 | Paper |
| Distribution-sensitive construction of the greedy spanner | 2017-05-11 | Paper |
| Progressive Geometric Algorithms | 2017-03-30 | Paper |
| Adjacency-preserving spatial treemaps | 2017-03-30 | Paper |
| Computing the Fréchet distance with a retractable leash | 2016-09-14 | Paper |
| Computing the greedy spanner in linear space | 2015-11-19 | Paper |
| Computing the similarity between moving curves | 2015-11-19 | Paper |
| Angle-restricted Steiner arborescences for flow map layout | 2015-07-10 | Paper |
| DYNAMIC POINT LABELING IS STRONGLY PSPACE-COMPLETE | 2015-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2928592 | 2014-11-10 | Paper |
| Delaunay Triangulations in O(sort(n)) Time and More | 2014-07-25 | Paper |
| Reprint of: Memory-constrained algorithms for simple polygons | 2014-01-22 | Paper |
| Dynamic Point Labeling is Strongly PSPACE-Complete | 2014-01-14 | Paper |
| On Planar Supports for Hypergraphs | 2013-11-28 | Paper |
| Computing the Greedy Spanner in Linear Space | 2013-09-17 | Paper |
| Computing the Fréchet Distance with a Retractable Leash | 2013-09-17 | Paper |
| Vertex Deletion for 3D Delaunay Triangulations | 2013-09-17 | Paper |
| Trajectory Grouping Structure | 2013-08-12 | Paper |
| Memory-constrained algorithms for simple polygons | 2013-07-31 | Paper |
| Median trajectories | 2013-06-25 | Paper |
| Vectors in a box | 2012-10-15 | Paper |
| Locally correct Fréchet matchings | 2012-09-25 | Paper |
| Drawing (complete) binary tanglegrams | 2012-04-26 | Paper |
| Shortest-Paths Preserving Metro Maps | 2012-03-09 | Paper |
| Finding long and similar parts of trajectories | 2011-12-28 | Paper |
| Angle-Restricted Steiner Arborescences for Flow Map Layout | 2011-12-16 | Paper |
| Preprocessing imprecise points for Delaunay triangulation: simplified and extended | 2011-11-07 | Paper |
| DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES | 2011-08-23 | Paper |
| Adjacency-Preserving Spatial Treemaps | 2011-08-12 | Paper |
| Delaunay triangulations in O (sort( n )) time and more | 2011-07-14 | Paper |
| Finding the Most Relevant Fragments in Networks | 2011-02-16 | Paper |
| Acyclic Orientation of Drawings | 2011-02-16 | Paper |
| Optimizing Regular Edge Labelings | 2011-02-11 | Paper |
| A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets | 2010-12-16 | Paper |
| VORONOI DIAGRAM OF POLYGONAL CHAINS UNDER THE DISCRETE FRÉCHET DISTANCE | 2010-09-30 | Paper |
| Fréchet Distance of Surfaces: Some Simple Hard Cases | 2010-09-06 | Paper |
| On the Number of Spanning Trees a Planar Graph Can Have | 2010-09-06 | Paper |
| Median Trajectories | 2010-09-06 | Paper |
| On Planar Supports for Hypergraphs | 2010-04-27 | Paper |
| Constructing Delaunay Triangulations along Space-Filling Curves | 2009-10-29 | Paper |
| Connect the Dot: Computing Feed-Links with Minimum Dilation | 2009-10-20 | Paper |
| Delaunay Triangulation of Imprecise Points Simplified and Extended | 2009-10-20 | Paper |
| Polychromatic colorings of plane graphs | 2009-08-27 | Paper |
| Transforming spanning trees: A lower bound | 2009-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619929 | 2009-04-14 | Paper |
| On the Number of Cycles in Planar Graphs | 2009-03-06 | Paper |
| Drawing (Complete) Binary Tanglegrams | 2009-03-03 | Paper |
| Inflating the cube by shrinking | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602870 | 2009-02-12 | Paper |
| Polychromatic colorings of plane graphs | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601525 | 2009-02-10 | Paper |
| Detecting Commuting Patterns by Clustering Subtrajectories | 2009-01-29 | Paper |
| Computing the Fréchet distance between simple polygons | 2008-07-29 | Paper |
| Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance | 2008-07-10 | Paper |
| Recursive geometry of the flow complex and topology of the flow complex filtration | 2008-04-28 | Paper |
| There are not too many magic configurations | 2008-04-16 | Paper |
| Acyclic Orientation of Drawings | 2007-09-07 | Paper |
