| Publication | Date of Publication | Type |
|---|
| A superlinear lower bound on the number of 5-holes | 2020-03-20 | Paper |
| Packing plane spanning graphs with short edges in complete geometric graphs | 2019-10-25 | 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 |
| Packing short plane spanning trees in complete geometric graphs | 2018-04-19 | Paper |
| Modem illumination of monotone polygons | 2018-02-19 | Paper |
| Linear transformation distance for bichromatic matchings | 2018-02-19 | Paper |
| An improved lower bound on the minimum number of triangulations | 2018-01-30 | Paper |
| Divide-and-conquer for Voronoi diagrams revisited | 2017-10-20 | Paper |
| Packing plane spanning trees and paths in complete geometric graphs | 2017-06-13 | 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 |
| Geometric achromatic and pseudoachromatic indices | 2016-06-13 | Paper |
| 3-colorability of pseudo-triangulations | 2016-03-14 | 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 |
| Geodesic-preserving polygon simplification | 2015-07-01 | Paper |
| Empty triangles in good drawings of the complete graph | 2015-05-22 | Paper |
| Flips in combinatorial pointed pseudo-triangulations with face degree at most four | 2015-04-22 | Paper |
| Monotone simultaneous embeddings of upward planar digraphs | 2015-03-04 | Paper |
| Cell-paths in mono- and bichromatic line arrangements in the plane | 2015-02-09 | Paper |
| Embedding four-directional paths on convex point sets | 2015-01-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 |
| Lower bounds for the number of small convex \(k\)-holes | 2014-04-09 | Paper |
| Flip graphs of bounded degree triangulations | 2014-02-14 | Paper |
| Geodesic-preserving polygon simplification | 2014-01-14 | Paper |
| Flip graphs of bounded-degree triangulations | 2013-10-10 | Paper |
| Coloring hypergraphs induced by dynamic point sets and bottomless rectangles | 2013-08-12 | Paper |
| On 5-gons and 5-holes | 2013-01-07 | Paper |
| Blocking Delaunay triangulations | 2012-12-04 | 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 |
| Edge-removal and non-crossing configurations in geometric graphs | 2010-07-27 | Paper |
| Empty monochromatic triangles | 2009-08-14 | Paper |
| On minimum weight pseudo-triangulations | 2009-07-27 | Paper |
| Computational and Structural Advantages of Circular Boundary Representation | 2009-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601550 | 2009-02-10 | Paper |
| Pre-triangulations and liftable complexes | 2008-02-18 | Paper |
| On the number of plane geometric graphs | 2007-07-19 | Paper |
| Connecting colored point sets | 2007-03-02 | Paper |
