| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6124762 | 2024-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6204659 | 2024-04-02 | Paper |
| Perfect matchings with crossings | 2024-03-25 | Paper |
| Straight skeletons for general polygonal figures in the plane | 2024-01-29 | Paper |
| Twisted ways to find plane structures in simple drawings of complete graphs | 2024-01-09 | Paper |
| Flipping plane spanning paths | 2023-11-24 | Paper |
| Bichromatic Perfect Matchings with Crossings | 2023-09-01 | Paper |
| Compatible spanning trees in simple drawings of \(K_n\) | 2023-08-16 | Paper |
| Shooting stars in simple drawings of \(K_{m,n}\) | 2023-08-16 | Paper |
| Disjoint compatibility via graph classes | 2023-05-05 | Paper |
| Graphs with large total angular resolution | 2023-01-05 | Paper |
| Drawing graphs as spanners | 2022-12-21 | Paper |
| On Compatible Matchings | 2022-11-14 | Paper |
| Geometric dominating sets -- a minimum version of the no-three-in-line problem | 2022-10-06 | Paper |
| Drawing graphs as spanners | 2022-09-16 | Paper |
| Perfect matchings with crossings | 2022-08-30 | Paper |
| On crossing-families in planar point sets | 2022-06-13 | Paper |
| Geometric Dominating Sets | 2022-03-24 | Paper |
| Edge Partitions of Complete Geometric Graphs (Part 2) | 2021-12-15 | Paper |
| On compatible matchings | 2021-10-04 | Paper |
| Flip distances between graph orientations | 2021-02-01 | Paper |
| Folding polyominoes with holes into a cube | 2021-01-07 | Paper |
| Graphs with large total angular resolution | 2020-10-26 | Paper |
| On the 2-colored crossing number | 2020-10-26 | Paper |
| On the edge-vertex ratio of maximal thrackles | 2020-10-26 | Paper |
| An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants | 2020-09-04 | Paper |
| A superlinear lower bound on the number of 5-holes | 2020-03-20 | Paper |
| Flip distances between graph orientations | 2020-02-24 | Paper |
| Packing plane spanning graphs with short edges in complete geometric graphs | 2019-10-25 | Paper |
| On the edge-vertex ratio of maximal thrackles | 2019-08-23 | Paper |
| On the 2-colored crossing number | 2019-08-18 | Paper |
| Transformed flips in triangulations and matchings | 2019-07-20 | Paper |
| Perfect \(k\)-colored matchings and \((k+2)\)-gonal tilings | 2019-01-11 | Paper |
| Folding Polyominoes into (Poly)Cubes | 2018-11-26 | Paper |
| On the crossing number of complete graphs | 2018-11-23 | Paper |
| Quickest paths, straight skeletons, and the city Voronoi diagram | 2018-11-23 | Paper |
| Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\) | 2018-11-19 | Paper |
| Bishellable drawings of $K_n$ | 2018-11-19 | Paper |
| Holes in 2-convex point sets | 2018-10-31 | Paper |
| A superlinear lower bound on the number of 5-holes | 2018-08-13 | Paper |
| Holes in 2-convex point sets | 2018-06-15 | Paper |
| Linear transformation distance for bichromatic matchings | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636491 | 2018-04-19 | Paper |
| Computing balanced islands in two colored point sets in the plane | 2018-04-05 | Paper |
| Linear transformation distance for bichromatic matchings | 2018-02-19 | Paper |
| Modem illumination of monotone polygons | 2018-02-19 | Paper |
| An improved lower bound on the minimum number of triangulations | 2018-01-30 | Paper |
| An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings | 2017-10-20 | Paper |
| Abstract order type extension and new results on the rectilinear crossing number | 2017-10-20 | Paper |
| Divide-and-conquer for Voronoi diagrams revisited | 2017-10-20 | Paper |
| Enumerating order types for small sets with applications | 2017-09-29 | Paper |
| Spatial embedding of pseudo-triangulations | 2017-09-29 | Paper |
| Packing plane spanning trees and paths in complete geometric graphs | 2017-06-13 | Paper |
| Reconstructing Point Set Order Types from Radial Orderings | 2017-05-19 | Paper |
| Representing Directed Trees as Straight Skeletons | 2017-02-10 | Paper |
| A Note on the Number of General 4-holes in (Perturbed) Grids | 2017-02-01 | Paper |
| New results on MWT subgraphs | 2016-06-16 | Paper |
| Geometric achromatic and pseudoachromatic indices | 2016-06-13 | Paper |
| 3-Colorability of Pseudo-Triangulations | 2016-03-14 | Paper |
| An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings | 2016-01-11 | Paper |
| Embedding Four-directional Paths on Convex Point Sets | 2016-01-07 | Paper |
| On \(k\)-gons and \(k\)-holes in point sets | 2015-12-30 | Paper |
| Flip distance between triangulations of a simple polygon is NP-complete | 2015-12-02 | Paper |
| Reconstructing Point Set Order Typesfrom Radial Orderings | 2015-09-11 | Paper |
| GEODESIC-PRESERVING POLYGON SIMPLIFICATION | 2015-07-01 | Paper |
| Empty triangles in good drawings of the complete graph | 2015-05-22 | Paper |
| Reprint of: Theta-3 is connected | 2015-04-27 | Paper |
| FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR | 2015-04-22 | Paper |
| Disjoint compatibility graph of non-crossing matchings of points in convex position | 2015-03-19 | Paper |
| Monotone Simultaneous Embeddings of Upward Planar Digraphs | 2015-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5173163 | 2015-02-09 | Paper |
| Shellable drawings and the cylindrical crossing number of \(K_n\) | 2015-02-03 | Paper |
| Triangulations with Circular Arcs | 2015-01-27 | Paper |
| Geodesic order types | 2015-01-19 | Paper |
| Embedding Four-Directional Paths on Convex Point Sets | 2015-01-07 | Paper |
| Theta-3 is connected | 2014-08-13 | Paper |
| The 2-page crossing number of K n | 2014-08-07 | Paper |
| Empty monochromatic simplices | 2014-07-04 | Paper |
| On \(k\)-convex point sets | 2014-06-27 | Paper |
| 4-holes in point sets | 2014-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5412472 | 2014-04-25 | Paper |
| Lower bounds for the number of small convex \(k\)-holes | 2014-04-09 | Paper |
| Flip graphs of bounded degree triangulations | 2014-02-14 | Paper |
| Reprint of: Extreme point and halving edge search in abstract order types | 2014-01-22 | Paper |
| Geodesic-Preserving Polygon Simplification | 2014-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2857403 | 2013-11-01 | Paper |
| Flip Graphs of Bounded-Degree Triangulations | 2013-10-10 | Paper |
| Flip distance between triangulations of a simple polygon is NP-complete | 2013-09-17 | Paper |
| The 2-page crossing number of \(K_{n}\) | 2013-08-05 | Paper |
| Extreme point and halving edge search in abstract order types | 2013-07-31 | Paper |
| Compatible Geometric Matchings | 2013-06-28 | Paper |
| Shape spaces via medial axis transforms for segmentation of complex geometry in 3D voxel data | 2013-06-12 | Paper |
| Extremal antipodal polygons and polytopes | 2013-01-28 | Paper |
| On 5-Gons and 5-Holes | 2013-01-07 | Paper |
| Convexifying Monotone Polygons while Maintaining Internal Visibility | 2013-01-07 | Paper |
| Blocking Delaunay triangulations | 2012-12-04 | Paper |
| Geodesic Order Types | 2012-09-25 | Paper |
| Pointed drawings of planar graphs | 2012-09-21 | Paper |
| On \(k\)-convex polygons | 2012-06-13 | Paper |
| Triangulations with Circular Arcs | 2012-03-09 | Paper |
| Exact Medial Axis Computation for Triangulated Solids with Respect to Piecewise Linear Metrics | 2012-01-13 | Paper |
| Exact Medial Axis Computation for Circular Arc Boundaries | 2012-01-13 | Paper |
| COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION | 2011-06-17 | Paper |
| Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons | 2010-12-03 | Paper |
| Divide-and-conquer for Voronoi diagrams revisited | 2010-09-02 | Paper |
| On the number of plane graphs | 2010-08-16 | Paper |
| Einführung in die angewandte Geometrie | 2010-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575470 | 2010-07-27 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Discrete and Computational Geometry | 2010-02-05 | Paper |
| Transforming spanning trees and pseudo-triangulations | 2009-12-18 | Paper |
| New results on lower bounds for the number of \((\leq k)\)-facets | 2009-11-30 | Paper |
| Empty monochromatic triangles | 2009-08-14 | Paper |
| Compatible geometric matchings | 2009-07-27 | Paper |
| On minimum weight pseudo-triangulations | 2009-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3625834 | 2009-05-22 | Paper |
| Computational and Structural Advantages of Circular Boundary Representation | 2009-02-17 | Paper |
| Improved upper bounds on the reflexivity of point sets | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601550 | 2009-02-10 | Paper |
| New results on lower bounds for the number of (⩽ k)-facets | 2008-06-05 | Paper |
| Triangulations without pointed spanning trees | 2008-03-26 | Paper |
| On the number of pseudo-triangulations of certain point sets | 2008-03-06 | Paper |
| Pre-triangulations and liftable complexes | 2008-02-18 | Paper |
| Gray code enumeration of plane straight-line graphs | 2007-12-10 | Paper |
| Decompositions, partitions, and coverings with convex polygons and pseudo-triangles | 2007-12-10 | Paper |
| New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\) | 2007-10-11 | Paper |
| Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles | 2007-09-05 | Paper |
| On the number of plane geometric graphs | 2007-07-19 | Paper |
| A quadratic distance bound on sliding between crossing-free spanning trees | 2007-06-04 | Paper |
| Abstract order type extension and new results on the rectilinear crossing number | 2007-03-12 | Paper |
| Connecting colored point sets | 2007-03-02 | Paper |
| On the crossing number of complete graphs | 2006-03-02 | Paper |
| Games on triangulations | 2005-10-26 | Paper |
| ON FLIPS IN POLYHEDRAL SURFACES | 2005-06-22 | Paper |
| A lower bound on the number of triangulations of planar point sets | 2004-10-01 | Paper |
| Convexity minimizes pseudo-triangulations | 2004-08-06 | Paper |
| Quickest paths, straight skeletons, and the city Voronoi diagram | 2004-03-11 | Paper |
| Pseudotriangulations from Surfaces and a Novel Type of Edge Flip | 2004-01-08 | Paper |
| Towards compatible triangulations. | 2003-08-17 | Paper |
| Long proteins with unique optimal foldings in the H-P model | 2003-05-19 | Paper |
| Flipturning Polygons | 2003-03-17 | Paper |
| Enumerating order types for small point sets with applications | 2003-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551352 | 2002-09-05 | Paper |
| Sequences of spanning trees and a fixed tree theorem | 2002-09-03 | Paper |
| Reconfiguring convex polygons | 2002-01-14 | Paper |
| Constant-level greedy triangulations approximate the MWT well | 2001-11-06 | Paper |
| Generalized self-approaching curves | 2001-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518984 | 2000-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4509205 | 2000-10-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942263 | 2000-05-11 | Paper |
| SKEW VORONOI DIAGRAMS | 2000-05-07 | Paper |
| Matching Shapes with a Reference Point | 1998-03-16 | Paper |
| Triangulations intersect nicely | 1997-02-18 | Paper |
| Classifying Hyperplanes in Hypercubes | 1996-09-12 | Paper |
