| Publication | Date of Publication | Type |
|---|
| Sorting under partial (interval order) information | 2024-11-22 | Paper |
| Removing popular faces in curve arrangements | 2024-11-12 | Paper |
| Shortest paths in portalgons | 2024-10-16 | Paper |
| Removing popular faces in curve arrangements | 2024-10-14 | Paper |
| Hard Diagrams of the Unknot | 2024-10-02 | Paper |
| Minimum link fencing | 2024-09-11 | Paper |
| Segment visibility counting queries in polygons | 2024-09-11 | Paper |
| Preprocessing imprecise points for the Pareto front | 2024-07-19 | Paper |
| Nearest-neighbor decompositions of drawings | 2024-05-27 | Paper |
| Adjacency graphs of polyhedral surfaces | 2024-05-21 | Paper |
| Pushing blocks by sweeping lines | 2024-05-16 | Paper |
| On cyclic solutions to the min-max latency multi-robot patrolling problem | 2024-05-14 | Paper |
| Morphing planar graph drawings through 3D | 2023-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6179342 | 2023-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059188 | 2023-11-02 | Paper |
| Morphing planar graph drawings through 3D | 2023-08-14 | Paper |
| Minimum color spanning circle in imprecise setup | 2023-03-30 | Paper |
| Rectangular spiral galaxies are still hard | 2023-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5057207 | 2022-12-15 | Paper |
| How to fit a tree in a box | 2022-09-28 | Paper |
| Minimum color spanning circle of imprecise points | 2022-08-25 | Paper |
| Convex partial transversals of planar regions | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091157 | 2022-07-21 | Paper |
| Preprocessing Ambiguous Imprecise Points | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088998 | 2022-07-18 | Paper |
| Unit disk representations of embedded trees, outerplanar and multi-legged graphs | 2022-07-01 | Paper |
| Embedding ray intersection graphs and global curve simplification | 2022-07-01 | Paper |
| Global Curve Simplification | 2022-05-11 | Paper |
| Mapping multiple regions to the grid with bounded Hausdorff distance | 2022-03-25 | Paper |
| Finding a Battleship of Uncertain Shape | 2022-02-17 | Paper |
| Labeling nonograms: boundary labeling for curve arrangements | 2021-09-17 | Paper |
| Largest and smallest area triangles on imprecise points | 2021-09-16 | Paper |
| Hard Diagrams of the Unknot | 2021-04-28 | Paper |
| Folding polyominoes with holes into a cube | 2021-01-07 | Paper |
| Geometric multicut: shortest fences for separating groups of objects in the plane | 2020-10-23 | Paper |
| Dynamic smooth compressed quadtrees | 2020-08-18 | Paper |
| On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance | 2020-08-18 | Paper |
| Maximum-area triangle in a convex polygon, revisited | 2020-08-04 | Paper |
| On optimal polyline simplification using the Hausdorff and Fréchet distance | 2020-08-04 | Paper |
| Multi-colored spanning graphs | 2020-08-03 | Paper |
| A fully polynomial time approximation scheme for the smallest diameter of imprecise points | 2020-03-12 | Paper |
| Most vital segment barriers | 2020-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207877 | 2020-01-13 | Paper |
| Approximating (k, ℓ)-center clustering for curves | 2019-10-15 | Paper |
| Theoretical analysis of beaconless geocast protocols in 1D | 2019-09-18 | Paper |
| Region-based Approximation Algorithms for Visibility between Imprecise Locations | 2019-09-12 | Paper |
| Region-based approximation of probability distributions (for visibility between imprecise points among obstacles) | 2019-05-21 | Paper |
| Segmentation of Trajectories on Non-Monotone Criteria | 2019-05-15 | Paper |
| Planar and Poly-arc Lombardi Drawings | 2019-02-27 | Paper |
| Lombardi Drawings of Knots and Links | 2019-02-20 | Paper |
| How to fit a tree in a box | 2019-02-15 | Paper |
| On the complexity of barrier resilience for fat regions and bounded ply | 2018-10-31 | Paper |
| Segmentation of Trajectories on Nonmonotone Criteria | 2018-10-30 | Paper |
| On the complexity of barrier resilience for fat regions | 2018-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580143 | 2018-08-13 | Paper |
| A Refined Definition for Groups of Moving Entities and Its Computation | 2018-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5745397 | 2018-06-05 | Paper |
| A Refined Definition for Groups of Moving Entities and its Computation | 2018-04-19 | Paper |
| Homotopy measures for representative trajectories | 2018-03-02 | Paper |
| Colored spanning graphs for set visualization | 2018-02-19 | Paper |
| On the complexity of minimum-link path problems | 2018-01-30 | Paper |
| Grouping time-varying data for interactive exploration | 2018-01-30 | Paper |
| Trajectory Grouping Structure under Geodesic Distance | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365153 | 2017-09-29 | Paper |
| Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals | 2017-08-22 | Paper |
| Recognizing a DOG is Hard but not when it is Thin and Unit | 2017-07-17 | Paper |
| Listing All Maximal Cliques in Large Sparse Real-World Graphs | 2017-06-16 | Paper |
| Packing plane spanning trees and paths in complete geometric graphs | 2017-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2978407 | 2017-04-24 | Paper |
| Strict Confluent Drawing | 2017-03-30 | Paper |
| Adjacency-preserving spatial treemaps | 2017-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2968073 | 2017-03-09 | Paper |
| Flow computations on imprecise terrains | 2017-03-09 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:2968106 Unions of Onions: Preprocessing Imprecise Points for Fast Onion
Decomposition] | 2017-03-09 | Paper |
| The Flip Diameter of Rectangulations and Convex Subdivisions | 2017-03-03 | Paper |
| Multi-colored spanning graphs | 2017-02-21 | Paper |
| Linear-Size Universal Point Sets for One-Bend Drawings | 2017-02-10 | Paper |
| Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees | 2017-02-10 | Paper |
| Minimizing Co-location Potential of Moving Entities | 2016-10-28 | Paper |
| Counting carambolas | 2016-06-09 | Paper |
| Mixed Map Labeling | 2015-09-21 | Paper |
| TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS | 2015-07-01 | Paper |
| Optimizing airspace closure with respect to politicians' egos | 2015-05-26 | Paper |
| Competitive query strategies for minimising the ply of the potential locations of moving points | 2015-02-17 | Paper |
| Computing similarity between piecewise-linear functions | 2014-04-03 | Paper |
| The Flip Diameter of Rectangulations and Convex Subdivisions | 2014-03-31 | Paper |
| Bounds on the complexity of halfspace intersections when the bounded faces have small dimension | 2014-03-24 | Paper |
| Computing Correlation between Piecewise-Linear Functions | 2014-02-04 | Paper |
| Terrain Visibility with Multiple Viewpoints | 2014-01-14 | Paper |
| Colored Spanning Graphs for Set Visualization | 2013-12-20 | Paper |
| Strict Confluent Drawing | 2013-12-20 | Paper |
| Category-based routing in social networks: membership dimension and the small-world phenomenon | 2013-12-11 | Paper |
| Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer Decomposition | 2013-08-12 | Paper |
| Dynamic Planar Point Location with Sub-logarithmic Local Updates | 2013-08-12 | Paper |
| Bounds on the complexity of halfspace intersections when the bounded faces have small dimension | 2013-08-05 | Paper |
| Median trajectories | 2013-06-25 | Paper |
| Optimal 3D Angular Resolution for Low-Degree Graphs | 2013-04-09 | Paper |
| How Many Potatoes Are in a Mesh? | 2013-03-21 | Paper |
| Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area | 2012-12-04 | Paper |
| Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent | 2012-11-29 | Paper |
| Removing local extrema from imprecise terrains | 2012-05-18 | Paper |
| Planar and Poly-arc Lombardi Drawings | 2012-03-09 | Paper |
| Preprocessing imprecise points for Delaunay triangulation: simplified and extended | 2011-11-07 | Paper |
| DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES | 2011-08-23 | Paper |
| Tracking Moving Objects with Few Handovers | 2011-08-12 | Paper |
| Geometric Computations on Indecisive Points | 2011-08-12 | Paper |
| Adjacency-Preserving Spatial Treemaps | 2011-08-12 | Paper |
| Flow Computations on Imprecise Terrains | 2011-08-12 | Paper |
| The directed Hausdorff distance between imprecise point sets | 2011-07-27 | Paper |
| EXISTENCE AND COMPUTATION OF TOURS THROUGH IMPRECISE POINTS | 2011-06-17 | Paper |
| Peeling meshed potatoes | 2011-05-10 | Paper |
| Preprocessing Imprecise Points and Splitting Triangulations | 2011-04-04 | Paper |
| Finding the Most Relevant Fragments in Networks | 2011-02-16 | Paper |
| Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area | 2011-02-11 | Paper |
| Optimal 3D Angular Resolution for Low-Degree Graphs | 2011-02-11 | Paper |
| Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) | 2011-01-31 | Paper |
| Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time | 2010-12-09 | Paper |
| SMOOTHING IMPRECISE 1.5D TERRAINS | 2010-09-30 | Paper |
| Median Trajectories | 2010-09-06 | Paper |
| Polychromatic 4-coloring of guillotine subdivisions | 2010-08-20 | Paper |
| Optimization for first order Delaunay triangulations | 2010-03-16 | Paper |
| Largest bounding box, smallest diameter, and related problems on imprecise points | 2010-03-16 | Paper |
| Largest and smallest convex hulls for imprecise points | 2010-02-23 | Paper |
| The Directed Hausdorff Distance between Imprecise Point Sets | 2009-12-17 | Paper |
| Planar bichromatic minimum spanning trees | 2009-12-10 | Paper |
| Delaunay triangulation of imprecise points in linear time after preprocessing | 2009-11-16 | Paper |
| Shape Fitting on Point Sets with Probability Distributions | 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 |
| Connected Rectilinear Graphs on Point Sets | 2009-03-03 | Paper |
| Approximating largest convex hulls for imprecise points | 2009-02-23 | Paper |
| Optimization for First Order Delaunay Triangulations | 2009-02-17 | Paper |
| Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points | 2009-02-17 | Paper |
| Smoothing Imprecise 1.5D Terrains | 2009-02-12 | Paper |
| Delaunay triangulations of imprecise pointsin linear time after preprocessing | 2009-02-12 | Paper |
| Preprocessing Imprecise Points and Splitting Triangulations | 2009-01-29 | Paper |
| Detecting Commuting Patterns by Clustering Subtrajectories | 2009-01-29 | Paper |
| Approximating Largest Convex Hulls for Imprecise Points | 2008-02-20 | Paper |
| Largest and Smallest Tours and Convex Hulls for Imprecise Points | 2007-09-07 | Paper |
| Generating realistic terrains with higher-order Delaunay triangulations | 2007-03-12 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
