| Publication | Date of Publication | Type |
|---|
| Shortest paths in portalgons | 2024-10-16 | Paper |
| Computing largest minimum color-spanning intervals of imprecise points | 2024-05-31 | Paper |
| Shortest coordinated motion for square robots | 2024-01-16 | Paper |
| On approximating shortest paths in weighted triangular tessellations | 2023-06-27 | Paper |
| Continuous mean distance of a weighted graph | 2023-05-26 | Paper |
| Flips in higher order Delaunay triangulations | 2022-10-13 | Paper |
| Farthest color Voronoi diagrams: complexity and algorithms | 2022-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091005 | 2022-07-21 | Paper |
| On approximating shortest paths in weighted triangular tessellations | 2022-07-13 | Paper |
| Affine invariant triangulations | 2022-01-12 | Paper |
| New production matrices for geometric graphs | 2021-11-23 | Paper |
| Hamiltonicity for convex shape Delaunay and Gabriel graphs | 2020-10-23 | Paper |
| Hamiltonicity for convex shape Delaunay and Gabriel graphs | 2020-01-16 | Paper |
| A new lower bound on the maximum number of plane graphs using production matrices | 2019-10-25 | 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 |
| Non-crossing Paths with Geographic Constraints | 2019-08-01 | Paper |
| Computing optimal shortcuts for networks | 2019-07-03 | Paper |
| Matching points with disks with a common intersection | 2019-06-18 | Paper |
| Region-based approximation of probability distributions (for visibility between imprecise points among obstacles) | 2019-05-21 | Paper |
| Stabbing segments with rectilinear objects | 2019-03-29 | Paper |
| Non-crossing Paths with Geographic Constraints | 2019-02-20 | Paper |
| A Note on Flips in Diagonal Rectangulations | 2018-12-10 | Paper |
| On the complexity of barrier resilience for fat regions and bounded ply | 2018-10-31 | Paper |
| On the complexity of barrier resilience for fat regions | 2018-10-17 | Paper |
| New results on production matrices for geometric graphs | 2018-10-11 | Paper |
| Colored spanning graphs for set visualization | 2018-02-19 | Paper |
| Colored ray configurations | 2018-02-19 | Paper |
| Characteristic polynomials of production matrices for geometric graphs | 2018-01-18 | Paper |
| Embedding rivers in polyhedral terrains | 2017-10-20 | Paper |
| Adjacency-preserving spatial treemaps | 2017-03-30 | Paper |
| Flow computations on imprecise terrains | 2017-03-09 | Paper |
| Production matrices for geometric graphs | 2017-02-13 | Paper |
| Space-Time Trade-offs for Stack-Based Algorithms | 2017-01-30 | Paper |
| Stabbing segments with rectilinear objects | 2015-09-29 | Paper |
| Space-time trade-offs for stack-based algorithms | 2015-09-02 | Paper |
| TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS | 2015-07-01 | Paper |
| Geometric biplane graphs. II: Graph augmentation | 2015-05-22 | Paper |
| Geometric biplane graphs. I: Maximal graphs | 2015-05-22 | Paper |
| Bichromatic 2-center of pairs of points | 2015-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5173163 | 2015-02-09 | Paper |
| Balanced partitions of 3-colored geometric sets in the plane | 2014-12-05 | Paper |
| New results on stabbing segments with a polygon | 2014-11-24 | Paper |
| Computing a visibility polygon using few variables | 2014-08-13 | Paper |
| Computing similarity between piecewise-linear functions | 2014-04-03 | 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 |
| Median trajectories | 2013-06-25 | Paper |
| IMPROVING SHORTEST PATHS IN THE DELAUNAY TRIANGULATION | 2013-06-24 | Paper |
| New Results on Stabbing Segments with a Polygon | 2013-06-07 | Paper |
| Bichromatic 2-Center of Pairs of Points | 2012-06-29 | Paper |
| Removing local extrema from imprecise terrains | 2012-05-18 | Paper |
| Drawing (complete) binary tanglegrams | 2012-04-26 | Paper |
| Computing the Visibility Polygon Using Few Variables | 2011-12-16 | Paper |
| Flow Computations on Imprecise Terrains | 2011-08-12 | Paper |
| Adjacency-Preserving Spatial Treemaps | 2011-08-12 | Paper |
| On the number of higher order Delaunay triangulations | 2011-07-14 | Paper |
| Peeling meshed potatoes | 2011-05-10 | Paper |
| Finding the most relevant fragments in networks | 2011-02-16 | Paper |
| SMOOTHING IMPRECISE 1.5D TERRAINS | 2010-09-30 | Paper |
| Median trajectories | 2010-09-06 | Paper |
| Flooding countries and destroying dams | 2010-07-27 | Paper |
| On the Number of Higher Order Delaunay Triangulations | 2010-05-28 | Paper |
| Optimization for first order Delaunay triangulations | 2010-03-16 | Paper |
| Planar bichromatic minimum spanning trees | 2009-12-10 | Paper |
| Connect the Dot: Computing Feed-Links with Minimum Dilation | 2009-10-20 | Paper |
| Optimal higher order Delaunay triangulations of polygons | 2009-06-30 | Paper |
| Towards a definition of higher order constrained Delaunay triangulations | 2009-03-09 | Paper |
| Drawing (Complete) Binary Tanglegrams | 2009-03-03 | Paper |
| Optimization for First Order Delaunay Triangulations | 2009-02-17 | Paper |
| Flooding Countries and Destroying Dams | 2009-02-17 | Paper |
| Smoothing Imprecise 1.5D Terrains | 2009-02-12 | Paper |
| Optimal Higher Order Delaunay Triangulations of Polygons | 2008-04-15 | Paper |
