| Publication | Date of Publication | Type |
|---|
| Sorting under partial (interval order) information | 2024-11-22 | Paper |
| Preprocessing imprecise points for the Pareto front | 2024-07-19 | Paper |
| Compacting squares: input-sensitive in-place reconfiguration of sliding squares | 2024-05-27 | Paper |
| A subquadratic \(n^\varepsilon\)-approximation for the continuous Fréchet distance | 2024-05-14 | Paper |
| Density approximation for moving groups | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6060035 | 2023-11-02 | Paper |
| Obstructing Classification via Projection | 2023-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6104073 | 2023-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5881544 | 2023-03-10 | Paper |
| Preprocessing Ambiguous Imprecise Points | 2022-07-18 | Paper |
| Crossing Numbers of Beyond-Planar Graphs Revisited | 2022-06-28 | Paper |
| Diverse partitions of colored points | 2022-03-25 | Paper |
| 10 reasons to get interested in graph drawing | 2022-02-16 | Paper |
| Agglomerative clustering of growing squares | 2022-02-01 | Paper |
| Non-crossing geometric steiner arborescences | 2020-11-25 | Paper |
| Optimal morphs of planar orthogonal drawings. II | 2020-10-26 | Paper |
| Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary | 2020-05-27 | Paper |
| A framework for algorithm stability and its application to kinetic Euclidean MSTs | 2020-02-12 | Paper |
| Agglomerative clustering of growing squares | 2020-02-12 | Paper |
| Computing representative networks for braided rivers | 2020-01-13 | Paper |
| SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension | 2019-10-15 | Paper |
| Non-crossing Paths with Geographic Constraints | 2019-08-01 | Paper |
| Non-crossing Paths with Geographic Constraints | 2019-02-20 | Paper |
| Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons | 2018-11-23 | Paper |
| Locally correct Fréchet matchings | 2018-11-16 | Paper |
| Computing the similarity between moving curves | 2018-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580125 | 2018-08-13 | Paper |
| Computing the Fréchet Distance between Real-Valued Surfaces | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643895 | 2018-05-29 | Paper |
| Computing the Fréchet distance with shortcuts is NP-hard | 2018-04-23 | Paper |
| Colored spanning graphs for set visualization | 2018-02-19 | Paper |
| Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges | 2018-02-12 | Paper |
| An improved lower bound on the minimum number of triangulations | 2018-01-30 | Paper |
| Grouping time-varying data for interactive exploration | 2018-01-30 | Paper |
| Shooting permanent rays among disjoint polygons in the plane | 2017-10-20 | Paper |
| Area-universal rectangular layouts | 2017-10-20 | Paper |
| Trajectory Grouping Structure under Geodesic Distance | 2017-10-10 | Paper |
| Geometric k Shortest Paths | 2017-10-05 | Paper |
| Kinetic collision detection for simple polygons | 2017-09-29 | Paper |
| Packing plane spanning trees and paths in complete geometric graphs | 2017-06-13 | Paper |
| Complexity Measures for Mosaic Drawings | 2017-05-05 | Paper |
| Trajectory grouping structure | 2017-03-30 | Paper |
| Strict Confluent Drawing | 2017-03-30 | Paper |
| Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model | 2017-03-09 | Paper |
| Towards Characterizing Graphs with a Sliceable Rectangular Dual | 2017-02-10 | Paper |
| Distance-sensitive planar point location | 2016-05-17 | Paper |
| Computing the similarity between moving curves | 2015-11-19 | Paper |
| Improved Grid Map Layout by Point Set Matching | 2015-11-03 | Paper |
| Algorithms for Necklace Maps | 2015-10-09 | Paper |
| Angle-restricted Steiner arborescences for flow map layout | 2015-07-10 | Paper |
| Kinetic 2-centers in the black-box model | 2015-02-17 | Paper |
| Column Planarity and Partial Simultaneous Geometric Embedding | 2015-01-07 | Paper |
| On the number of regular edge labelings | 2014-11-10 | Paper |
| Treemaps with bounded aspect ratio | 2014-05-19 | Paper |
| Kinetic convex hulls and delaunay triangulations in the black-box model | 2014-03-24 | Paper |
| Flip graphs of bounded degree triangulations | 2014-02-14 | Paper |
| Triangulating and guarding realistic polygons | 2014-01-22 | Paper |
| Colored Spanning Graphs for Set Visualization | 2013-12-20 | Paper |
| Strict Confluent Drawing | 2013-12-20 | Paper |
| On planar supports for hypergraphs | 2013-11-28 | Paper |
| Flip graphs of bounded-degree triangulations | 2013-10-10 | Paper |
| Distance-Sensitive Planar Point Location | 2013-08-12 | Paper |
| Trajectory Grouping Structure | 2013-08-12 | Paper |
| Shooting Permanent Rays among Disjoint Polygons in the Plane | 2012-11-29 | Paper |
| Locally correct Fréchet matchings | 2012-09-25 | Paper |
| Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes | 2012-09-25 | Paper |
| Area-universal and constrained rectangular layouts | 2012-09-12 | Paper |
| Empty pseudo-triangles in point sets | 2012-03-19 | Paper |
| Treemaps with Bounded Aspect Ratio | 2011-12-16 | Paper |
| Angle-Restricted Steiner Arborescences for Flow Map Layout | 2011-12-16 | Paper |
| Geometric Simultaneous Embeddings of a Graph and a Matching | 2011-04-19 | Paper |
| Finding the Most Relevant Fragments in Networks | 2011-02-16 | Paper |
| Optimizing Regular Edge Labelings | 2011-02-11 | Paper |
| Algorithmic aspects of proportional symbol maps | 2010-09-27 | Paper |
| Kinetic kd-Trees and Longest-Side kd-Trees | 2010-09-06 | Paper |
| OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS | 2010-05-28 | Paper |
| On Planar Supports for Hypergraphs | 2010-04-27 | Paper |
| Geometric Simultaneous Embeddings of a Graph and a Matching | 2010-04-27 | Paper |
| Homotopic Rectilinear Routing with Few Links and Thick Edges | 2010-04-27 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Matched Drawings of Planar Graphs | 2010-02-04 | Paper |
| Connect the Dot: Computing Feed-Links with Minimum Dilation | 2009-10-20 | Paper |
| Polychromatic colorings of plane graphs | 2009-08-27 | Paper |
| On minimum weight pseudo-triangulations | 2009-07-27 | Paper |
| Edges and switches, tunnels and bridges | 2009-06-30 | Paper |
| Kinetic collision detection for convex fat objects | 2009-05-06 | Paper |
| On rectilinear duals for vertex-weighted plane graphs | 2009-04-09 | Paper |
| Subdivision Drawings of Hypergraphs | 2009-03-03 | Paper |
| Edges and Switches, Tunnels and Bridges | 2009-02-17 | Paper |
| Polychromatic colorings of plane graphs | 2009-02-12 | Paper |
| Kinetic KD-trees and longest-side KD-trees | 2009-02-12 | Paper |
| Efficient algorithms for maximum regression depth | 2008-08-19 | Paper |
| Matched Drawings of Planar Graphs | 2008-03-25 | Paper |
| Kinetic Collision Detection for Convex Fat Objects | 2008-03-11 | Paper |
| Algorithmic Aspects of Proportional Symbol Maps | 2008-03-11 | Paper |
| On the number of pseudo-triangulations of certain point sets | 2008-03-06 | Paper |
| Decompositions, partitions, and coverings with convex polygons and pseudo-triangles | 2007-12-10 | Paper |
| Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles | 2007-09-05 | Paper |
| On rectangular cartograms | 2007-06-04 | Paper |
| Area-preserving approximations of polygonal paths | 2007-02-14 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations | 2005-04-15 | Paper |
| KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS | 2004-09-29 | Paper |
| Convexity minimizes pseudo-triangulations | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471281 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425945 | 2003-09-14 | Paper |
| Tight degree bounds for pseudo-triangulations of points | 2003-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547811 | 2002-08-21 | Paper |
