| Publication | Date of Publication | Type |
|---|
| On \(k\)-means for segments and polylines | 2025-01-06 | Paper |
| A note on the 2-colored rectilinear crossing number of random point sets in the unit square | 2024-09-19 | Paper |
| Long plane trees | 2024-05-14 | Paper |
| A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square | 2023-12-04 | Paper |
| Minimum shared‐power edge cut | 2023-11-15 | Paper |
| Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth | 2023-10-31 | Paper |
| Maximum matchings in geometric intersection graphs | 2023-10-12 | Paper |
| Faster distance-based representative skyline and \(k\)-center along Pareto front in the plane | 2023-06-28 | Paper |
| Connectivity with uncertainty regions given as line segments | 2023-03-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874304 | 2023-02-07 | Paper |
| Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088947 | 2022-07-18 | Paper |
| Finding a largest-area triangle in a terrain in near-linear time | 2022-03-25 | Paper |
| Computing Shapley values in the plane | 2022-03-22 | Paper |
| The inverse Kakeya problem | 2022-02-22 | Paper |
| The complexity of mixed-connectivity | 2022-01-24 | Paper |
| Maximizing dominance in the plane and its applications | 2021-11-19 | Paper |
| On the minimum consistent subset problem | 2021-06-30 | Paper |
| The reverse Kakeya problem | 2021-04-20 | Paper |
| The inverse Voronoi problem in graphs. II: Trees | 2021-04-19 | Paper |
| Minimum cuts in geometric intersection graphs | 2021-01-07 | Paper |
| The inverse Voronoi problem in graphs. I: Hardness | 2020-10-12 | Paper |
| The Reverse Kakeya Problem | 2020-08-18 | Paper |
| Hardness of minimum barrier shrinkage and minimum installation path | 2020-08-17 | Paper |
| Maximizing dominance in the plane and its applications | 2020-01-16 | Paper |
| On the minimum consistent subset problem | 2020-01-16 | Paper |
| The Inverse Kakeya Problem | 2019-12-18 | Paper |
| The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex | 2019-10-30 | Paper |
| Covering many points with a small-area box | 2019-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633873 | 2019-05-06 | Paper |
| Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs | 2019-03-28 | Paper |
| Testing Homotopy for paths in the plane | 2018-11-23 | Paper |
| Two optimization problems for unit disks | 2018-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580096 | 2018-08-13 | Paper |
| Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs | 2018-07-16 | Paper |
| Peeling Potatoes Near-Optimally in Near-Linear Time | 2018-04-23 | Paper |
| The parameterized complexity of finding a 2-sphere in a simplicial complex | 2018-04-19 | Paper |
| Minimum Cell Connection in Line Segment Arrangements | 2018-01-31 | Paper |
| Parameterized Complexity of 1-Planarity | 2018-01-12 | Paper |
| Interval selection in the streaming model | 2017-11-06 | Paper |
| Finding All Maximal Subsequences with Hereditary Properties | 2017-10-10 | Paper |
| Peeling Potatoes Near-Optimally in Near-Linear Time | 2017-10-06 | Paper |
| Approximation algorithms for aligning points | 2017-09-29 | Paper |
| Schematization of road networks | 2017-09-29 | Paper |
| Finding shortest non-trivial cycles in directed graphs on surfaces | 2017-03-30 | Paper |
| Refining the hierarchies of classes of geometric intersection graphs | 2017-02-17 | Paper |
| Refining the hierarchies of classes of geometric intersection graphs | 2017-02-13 | Paper |
| Drawing a disconnected graph on the torus (extended abstract) | 2016-10-14 | Paper |
| The complexity of separating points in the plane | 2016-03-29 | Paper |
| Finding largest rectangles in convex polygons | 2016-01-18 | Paper |
| Semi-dynamic Connectivity in the Plane | 2015-10-30 | Paper |
| Interval selection in the streaming model | 2015-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2943937 | 2015-09-07 | Paper |
| Simple PTAS's for families of graphs excluding a minor | 2015-06-30 | Paper |
| Shortest paths in intersection graphs of unit disks | 2015-05-12 | Paper |
| The complexity of separating points in the plane | 2015-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5173165 | 2015-02-09 | Paper |
| Computing the Stretch of an Embedded Graph | 2014-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934586 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934587 | 2014-12-18 | Paper |
| Finding shortest contractible and shortest separating cycles in embedded graphs | 2014-11-18 | Paper |
| Finding one tight cycle | 2014-11-18 | Paper |
| Geometric clustering | 2014-09-09 | Paper |
| Finding shortest non-trivial cycles in directed graphs on surfaces | 2014-04-03 | Paper |
| Adding one edge to planar graphs makes crossing number hard | 2014-04-03 | Paper |
| Output-sensitive algorithm for the edge-width of an embedded graph | 2014-04-03 | Paper |
| Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard | 2014-02-04 | Paper |
| Multiple-source shortest paths in embedded graphs | 2013-11-14 | Paper |
| The clique problem in ray intersection graphs | 2013-11-06 | Paper |
| Parameterized Complexity of 1-Planarity | 2013-08-12 | Paper |
| Hardness of approximation for crossing number | 2013-03-20 | Paper |
| Covering a bichromatic point set with two disjoint monochromatic disks | 2013-01-25 | Paper |
| The Clique Problem in Ray Intersection Graphs | 2012-09-25 | Paper |
| Annotating Simplices with a Homology Basis and Its Applications | 2012-08-14 | Paper |
| The class cover problem with boxes | 2012-05-18 | Paper |
| Algorithms for the edge-width of an embedded graph | 2012-05-18 | Paper |
| Many distances in planar graphs | 2012-04-26 | Paper |
| Finding Cycles with Topological Properties in Embedded Graphs | 2012-03-15 | Paper |
| On the \(b\)-chromatic number of regular graphs | 2011-08-10 | Paper |
| Obnoxious Centers in Graphs | 2011-07-18 | Paper |
| Crossing number and weighted crossing number of near-planar graphs | 2011-06-30 | Paper |
| The Fibonacci dimension of a graph | 2011-06-01 | Paper |
| The complexity of obtaining a distance-balanced graph | 2011-06-01 | 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 |
| Algorithmic aspects of proportional symbol maps | 2010-09-27 | Paper |
| Many distances in planar graphs | 2010-08-16 | Paper |
| Higher-order Voronoi diagrams on triangulated surfaces | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579411 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579489 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575470 | 2010-07-27 | Paper |
| Geometric Simultaneous Embeddings of a Graph and a Matching | 2010-04-27 | Paper |
| On the parameterized complexity of \(d\)-dimensional point set pattern matching | 2010-03-24 | Paper |
| MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION | 2010-02-12 | Paper |
| Facility location problems in the plane based on reverse nearest neighbor queries | 2009-11-17 | Paper |
| Covering many or few points with unit disks | 2009-09-02 | Paper |
| Algorithms for graphs of bounded treewidth via orthogonal range searching | 2009-08-14 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Crossing and Weighted Crossing Number of Near-Planar Graphs | 2009-03-03 | Paper |
| Planar Embeddings of Graphs with Specified Edge Lengths | 2009-01-19 | Paper |
| Planar embeddability of the vertices of a graph using a fixed point set is NP-hard | 2009-01-19 | Paper |
| On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching | 2008-06-03 | Paper |
| Computing a Center-Transversal Line | 2008-04-17 | Paper |
| Algorithmic Aspects of Proportional Symbol Maps | 2008-03-11 | Paper |
| Covering Many or Few Points with Unit Disks | 2008-02-21 | Paper |
| Matching point sets with respect to the earth mover's distance | 2007-12-03 | Paper |
| Approximation algorithms for spreading points | 2007-06-08 | Paper |
| Finding shortest non-separating and non-contractible cycles for topologically embedded graphs | 2007-04-26 | Paper |
| Area-preserving approximations of polygonal paths | 2007-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3418607 | 2007-02-05 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Schematization of networks | 2005-05-12 | Paper |
| Approximation algorithms for aligning points | 2004-09-22 | Paper |
| Testing homotopy for paths in the plane | 2004-03-11 | Paper |
| Secret sharing schemes with detection of cheaters for a general access structure | 2002-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934327 | 2000-01-17 | Paper |
