| Publication | Date of Publication | Type |
|---|
| Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons | 2021-01-12 | Paper |
| Placing your coins on a shelf | 2020-11-25 | Paper |
| The geometric dilation of three points | 2020-01-31 | Paper |
| Covering many points with a small-area box | 2019-09-10 | Paper |
| Fast algorithms for diameter-optimally augmenting paths and trees | 2019-06-24 | Paper |
| Placing your coins on a shelf | 2019-02-27 | Paper |
| Elastic geometric shape matching for translations under the Manhattan norm | 2018-10-31 | Paper |
| Minimum Cell Connection in Line Segment Arrangements | 2018-01-31 | Paper |
| Shortest path to a segment and quickest visibility queries | 2017-10-10 | Paper |
| The complexity of (un)folding | 2017-09-29 | Paper |
| Testing the congruence of d-dimensional point sets | 2017-09-29 | Paper |
| Top-\(k\) Manhattan spatial skyline queries | 2017-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2970472 | 2017-03-30 | Paper |
| Shortest path to a segment and quickest visibility queries | 2017-03-30 | Paper |
| A fixed-parameter algorithm for the minimum Manhattan network problem | 2017-03-09 | Paper |
| Approximating the average stretch factor of geometric graphs | 2017-03-09 | Paper |
| Finding largest rectangles in convex polygons | 2016-01-18 | Paper |
| Approximating minimum-area rectangular and convex containers for packing convex polygons | 2015-11-19 | Paper |
| Elastic geometric shape matching for point sets under translations | 2015-10-30 | Paper |
| Fast algorithms for diameter-optimally augmenting paths | 2015-10-27 | Paper |
| Fixed-parameter complexity and approximability of norm maximization | 2015-04-16 | Paper |
| Geometric clustering, fixed-parameter tractability and lower bounds with respect to the dimension | 2014-09-09 | Paper |
| Top-\(k\) Manhattan spatial skyline queries | 2014-02-18 | Paper |
| Convex transversals | 2014-01-22 | Paper |
| On the computational complexity of Erdős-Szekeres and related problems in \(\mathbb{R}^{3}\) | 2013-09-17 | Paper |
| Realistic roofs over a rectilinear polygon | 2013-09-03 | Paper |
| Fixed-parameter tractability and lower bounds for stabbing problems | 2013-08-22 | Paper |
| Covering and piercing disks with two centers | 2013-01-25 | Paper |
| Computing the discrete Fréchet distance with imprecise input | 2012-11-23 | Paper |
| Largest inscribed rectangles in convex polygons | 2012-09-13 | Paper |
| Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension | 2012-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113727 | 2012-01-23 | Paper |
| Generating realistic roofs over a rectilinear polygon | 2011-12-16 | Paper |
| Covering and piercing disks with two centers | 2011-12-16 | Paper |
| On graphs and algebraic graphs that do not contain cycles of length 4 | 2011-10-12 | Paper |
| Approximate nearest neighbor search under translation invariant Hausdorff distance | 2011-08-23 | Paper |
| Convex transversals | 2011-08-12 | Paper |
| The directed Hausdorff distance between imprecise point sets | 2011-07-27 | Paper |
| THE ALIGNED K-CENTER PROBLEM | 2011-05-11 | Paper |
| Acyclic orientation of drawings | 2011-02-16 | Paper |
| Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions | 2011-02-02 | Paper |
| Computing the discrete Fréchet distance with imprecise input | 2010-12-09 | Paper |
| Approximating the average stretch factor of geometric graphs | 2010-12-09 | Paper |
| Milling a graph with turn costs: a parameterized complexity perspective | 2010-11-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579411 | 2010-08-06 | Paper |
| The Complexity of Geometric Problems in High Dimension | 2010-06-17 | Paper |
| Computing geometric minimum-dilation graphs is NP-hard | 2010-05-28 | Paper |
| On the parameterized complexity of \(d\)-dimensional point set pattern matching | 2010-03-24 | Paper |
| Covering a simple polygon by monotone directions | 2010-03-11 | Paper |
| Maximizing the area of overlap of two unions of disks under rigid motion | 2010-02-12 | Paper |
| The parameterized complexity of some geometric problems in unbounded dimension | 2010-01-14 | Paper |
| The directed Hausdorff distance between imprecise point sets | 2009-12-17 | Paper |
| Algorithms for graphs of bounded treewidth via orthogonal range searching | 2009-08-14 | Paper |
| On the dilation spectrum of paths, cycles, and trees | 2009-08-14 | Paper |
| A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM | 2009-07-20 | Paper |
| Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions | 2009-07-14 | Paper |
| Bounds on the quality of the PCA bounding boxes | 2009-06-30 | Paper |
| CONSTRUCTING OPTIMAL HIGHWAYS | 2009-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619930 | 2009-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3619929 | 2009-04-14 | Paper |
| Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation | 2009-03-10 | Paper |
| On the Number of Cycles in Planar Graphs | 2009-03-06 | Paper |
| Fixed-Parameter Tractability for Non-Crossing Spanning Trees | 2009-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602870 | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3602884 | 2009-02-12 | Paper |
| Minimum-cost coverage of point sets by disks | 2009-02-10 | Paper |
| Covering a Simple Polygon by Monotone Directions | 2009-01-29 | Paper |
| Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance | 2009-01-29 | Paper |
| Visibility Maps of Segments and Triangles in 3D | 2009-01-27 | Paper |
| Faster fixed-parameter tractable algorithms for matching and packing problems | 2008-12-02 | Paper |
| A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators | 2008-09-04 | Paper |
| On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching | 2008-06-03 | Paper |
| Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D | 2008-04-16 | Paper |
| There are not too many magic configurations | 2008-04-16 | Paper |
| Visibility maps of segments and triangles in 3D | 2008-03-13 | Paper |
| Fréchet Distance for Curves, Revisited | 2008-03-11 | Paper |
| Matching point sets with respect to the earth mover's distance | 2007-12-03 | Paper |
| A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem | 2007-09-10 | Paper |
| Approximation Algorithms for the Minimum Convex Partition Problem | 2007-09-07 | Paper |
| Acyclic Orientation of Drawings | 2007-09-07 | Paper |
| EMBEDDING POINT SETS INTO PLANE GRAPHS OF SMALL DILATION | 2007-07-13 | Paper |
| Configurations with few crossings in topological graphs | 2007-04-18 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| GUARDING ART GALLERIES BY GUARDING WITNESSES | 2006-05-29 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692692 | 2005-09-28 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4657574 | 2005-03-14 | Paper |
| Comparison of distance measures for planar curves | 2004-12-02 | Paper |
| Covering with ellipses | 2004-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828967 | 2004-11-29 | Paper |
| TESTING THE CONGRUENCE OF d-DIMENSIONAL POINT SETS | 2004-09-29 | Paper |
| Testing congruence and symmetry for general 3-dimensional objects. | 2004-01-23 | Paper |
| On counting point-hyperplane incidences | 2003-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762787 | 2002-01-09 | Paper |
