| Publication | Date of Publication | Type |
|---|
| Euclidean maximum matchings in the plane -- local to global | 2025-01-24 | Paper |
| Distance-preserving graph compression techniques | 2024-10-08 | Paper |
| Half-guarding weakly-visible polygons and terrains | 2024-09-12 | Paper |
| Online class cover problem | 2024-09-10 | Paper |
| Maximum bipartite subgraphs of geometric intersection graphs | 2024-06-10 | Paper |
| A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes | 2024-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147551 | 2024-01-15 | Paper |
| On Separating Path and Tree Systems in Graphs | 2023-12-21 | Paper |
| Constant delay lattice train schedules | 2023-12-11 | Paper |
| Bounded-Angle Minimum Spanning Trees | 2023-11-02 | Paper |
| Rectilinear Voronoi games with a simple rectilinear obstacle in plane | 2023-08-17 | Paper |
| A linear-time algorithm for semitotal domination in strongly chordal graphs | 2023-08-02 | Paper |
| Minimum consistent subset of simple graph classes | 2023-08-02 | Paper |
| Voronoi games using geodesics | 2023-05-08 | Paper |
| The Minimum Moving Spanning Tree Problem | 2023-03-30 | Paper |
| Optimal strategies in single round Voronoi game on convex polygons with constraints | 2023-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5881545 | 2023-03-10 | Paper |
| An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces | 2022-12-09 | Paper |
| Parallel algorithms for all minimum link paths and link center problems | 2022-12-09 | Paper |
| Acrophobic guard watchtower problem | 2022-11-16 | Paper |
| An \(\varOmega (n^3)\) lower bound on the number of cell crossings for weighted shortest paths in 3-dimensional polyhedral structures | 2022-10-13 | Paper |
| Shortest paths among transient obstacles | 2022-07-18 | Paper |
| An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures | 2022-06-13 | Paper |
| Minimum consistent subset problem for trees | 2022-05-20 | Paper |
| Computing maximum independent set on outerstring graphs and their relatives | 2022-04-08 | Paper |
| The minimum moving spanning tree problem | 2022-03-25 | Paper |
| Euclidean maximum matchings in the plane -- local to global | 2022-03-25 | Paper |
| Minimum consistent subset of simple graph classes | 2022-03-24 | Paper |
| Bounded-angle minimum spanning trees | 2022-02-01 | Paper |
| Linear-size planar Manhattan network for convex point sets | 2021-12-15 | Paper |
| Approximating maximum diameter-bounded subgraph in unit disk graphs | 2021-11-18 | Paper |
| Window queries for intersecting objects, maximal points and approximations using coresets | 2021-10-21 | Paper |
| Voronoi game on polygons | 2021-08-11 | Paper |
| Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames | 2021-08-04 | Paper |
| On the minimum consistent subset problem | 2021-06-30 | Paper |
| Color-spanning localized query | 2021-03-09 | Paper |
| The Most Likely Object to be Seen Through a Window | 2021-02-11 | Paper |
| A Simple Randomized $O(n \log n)$--Time Closest-Pair Algorithm in Doubling Metrics | 2021-01-12 | Paper |
| Faster algorithms for some optimization problems on collinear points | 2020-11-12 | Paper |
| Minimizing the continuous diameter when augmenting a geometric tree with a shortcut | 2020-10-23 | Paper |
| Querying relational event graphs using colored range searching data structures | 2020-09-17 | Paper |
| Flip Distance to some Plane Configurations. | 2020-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5115775 | 2020-08-18 | Paper |
| Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs | 2020-08-18 | Paper |
| Maximum bipartite subgraph of geometric intersection graphs | 2020-07-22 | Paper |
| Packing boundary-anchored rectangles and squares | 2020-03-23 | Paper |
| Plane and planarity thresholds for random geometric graphs | 2020-02-18 | Paper |
| On the minimum consistent subset problem | 2020-01-16 | Paper |
| Computing maximum independent set on outerstring graphs and their relatives | 2020-01-16 | Paper |
| Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs | 2019-11-21 | Paper |
| Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames | 2019-10-25 | Paper |
| Flip distance to some plane configurations | 2019-10-25 | Paper |
| Approximability of covering cells with line segments | 2019-10-11 | Paper |
| Rectilinear shortest paths among transient obstacles | 2019-10-11 | Paper |
| Localized query: color spanning variations | 2019-10-10 | Paper |
| The discrete Voronoi game in a simple polygon | 2019-10-07 | Paper |
| Partial Enclosure Range Searching | 2019-09-09 | Paper |
| Maximum Bipartite Subgraph of Geometric Intersection Graphs | 2019-09-09 | Paper |
| Approximability of covering cells with line segments | 2019-08-13 | Paper |
| Weighted minimum backward Fréchet distance | 2019-08-13 | Paper |
| Two-center of the Convex Hull of a Point Set: Dynamic Model, and Restricted Streaming Model | 2019-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633875 | 2019-05-06 | Paper |
| Maximum plane trees in multipartite geometric graphs | 2019-04-25 | Paper |
| Time Windowed Data Structures for Graphs | 2019-03-18 | Paper |
| Spanning trees in multipartite geometric graphs | 2019-01-11 | Paper |
| Optimal shooting: Characterizations and applications | 2019-01-10 | Paper |
| An optimal algorithm for plane matchings in multipartite geometric graphs | 2018-11-01 | Paper |
| Approximating the integral Fréchet distance | 2018-10-31 | Paper |
| Path refinement in weighted regions | 2018-10-18 | Paper |
| Plane bichromatic trees of low degree | 2018-07-13 | Paper |
| Window queries for problems on intersecting objects and maximal points | 2018-06-05 | Paper |
| Towards Plane Spanners of Degree 3 | 2018-04-19 | Paper |
| Geometric path problems with violations | 2018-04-06 | Paper |
| Strong matching of points with geometric shapes | 2018-02-19 | Paper |
| Discrete Voronoi games and \(\epsilon\)-nets, in two and three dimensions | 2018-01-19 | Paper |
| Analysis of farthest point sampling for approximating geodesics in a graph | 2018-01-19 | Paper |
| Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon | 2018-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369529 | 2017-10-17 | Paper |
| Approximating the Integral Fréchet Distance | 2017-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369527 | 2017-10-17 | Paper |
| Maximum plane trees in multipartite geometric graphs | 2017-09-22 | Paper |
| Rectilinear path problems in restricted memory setup | 2017-06-19 | Paper |
| Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem | 2017-05-16 | Paper |
| I/O-efficient path traversal in succinct planar graphs | 2017-04-12 | Paper |
| Querying Relational Event Graphs Using Colored Range Searching Data Structures | 2017-04-07 | Paper |
| A plane 1.88-spanner for points in convex position | 2017-03-30 | Paper |
| Towards plane spanners of degree 3 | 2017-03-30 | Paper |
| On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere | 2017-03-30 | Paper |
| Switching to directional antennas with constant increase in radius and hop distance | 2017-03-27 | Paper |
| Network farthest-point diagrams | 2017-03-09 | Paper |
| Plane bichromatic trees of low degree | 2016-09-29 | Paper |
| Counting Subgraphs in Relational Event Graphs | 2016-05-03 | Paper |
| Minimizing Walking Length in Map Matching | 2016-04-01 | Paper |
| Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon | 2016-04-01 | Paper |
| Higher-order triangular-distance Delaunay graphs: graph-theoretical properties | 2016-01-15 | Paper |
| Approximating the bottleneck plane perfect matching of a point set | 2016-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3455035 | 2015-12-03 | Paper |
| An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs | 2015-10-30 | Paper |
| On the hardness of full Steiner tree problems | 2015-08-24 | Paper |
| Matchings in higher-order Gabriel graphs | 2015-07-24 | Paper |
| On full Steiner trees in unit disk graphs | 2015-06-17 | Paper |
| A Facility Coloring Problem in 1-D | 2015-05-20 | Paper |
| Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties | 2015-02-19 | Paper |
| Rectilinear Path Problems in Restricted Memory Setup | 2015-02-19 | Paper |
| Optimal Data Structures for Farthest-Point Queries in Cactus Networks | 2015-01-27 | Paper |
| Fixed-orientation equilateral triangle matching of point sets | 2014-10-06 | Paper |
| Approximation algorithms for geometric shortest path problems | 2014-09-26 | Paper |
| Succinct geometric indexes supporting point location queries | 2014-09-09 | Paper |
| Improved algorithms for partial curve matching | 2014-07-03 | Paper |
| A note on the unsolvability of the weighted region shortest path problem | 2014-06-27 | Paper |
| Similarity of polygonal curves in the presence of outliers | 2014-04-09 | Paper |
| An optimal algorithm for the Euclidean bottleneck full Steiner tree problem | 2014-01-22 | Paper |
| \(\alpha\)-visibility | 2014-01-22 | Paper |
| On the Construction of Generalized Voronoi Inverse of a Rectangular Tessellation | 2013-12-17 | Paper |
| An approximation algorithm for computing shortest paths in weighted 3-d domains | 2013-08-05 | Paper |
| The Discrete Voronoi Game in a Simple Polygon | 2013-06-11 | Paper |
| Fixed-Orientation Equilateral Triangle Matching of Point Sets | 2013-04-12 | Paper |
| Low-interference networks in metric spaces of bounded doubling dimension | 2013-04-04 | Paper |
| Localized geometric query problems | 2013-01-25 | Paper |
| An in-place min-max priority search tree | 2013-01-25 | Paper |
| α-Visibility | 2012-08-14 | Paper |
| Succinct and I/O efficient data structures for traversal in trees | 2012-04-26 | Paper |
| A survey of geodesic paths on 3D surfaces | 2011-12-28 | Paper |
| Improved Algorithms for Partial Curve Matching | 2011-09-16 | Paper |
| Switching to Directional Antennas with Constant Increase in Radius and Hop Distance | 2011-08-12 | Paper |
| On the number of shortest descending paths on the surface of a convex terrain | 2011-07-29 | Paper |
| Fréchet distance with speed limits | 2011-01-31 | Paper |
| Algorithms for approximate shortest path queries on weighted polyhedral surfaces | 2010-11-08 | Paper |
| Computing the greedy spanner in near-quadratic time | 2010-09-27 | Paper |
| Improved Methods For Generating Quasi-gray Codes | 2010-06-22 | Paper |
| On the false-positive rate of Bloom filters | 2010-06-09 | Paper |
| Approximation algorithms for shortest descending paths in terrains | 2010-05-25 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Sigma-local graphs | 2010-02-26 | Paper |
| I/O and Space-Efficient Path Traversal in Planar Graphs | 2009-12-17 | Paper |
| Spanners of Complete k-Partite Geometric Graphs | 2009-11-06 | Paper |
| Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing | 2009-10-20 | Paper |
| I/O-efficient algorithms for graphs of bounded treewidth | 2009-08-27 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Algorithms for optimal outlier removal | 2009-06-24 | Paper |
| I/O-Efficient Planar Separators | 2009-06-22 | Paper |
| A linear-space algorithm for distance preserving graph embedding | 2009-03-09 | Paper |
| Algorithms for Computing Diffuse Reflection Paths in Polygons | 2009-02-24 | Paper |
| Shortest Gently Descending Paths | 2009-02-24 | Paper |
| Succinct and I/O Efficient Data Structures for Traversal in Trees | 2009-01-29 | Paper |
| Determining approximate shortest paths on weighted polyhedral surfaces | 2008-12-21 | Paper |
| Geometric spanners with small chromatic number | 2008-11-19 | Paper |
| Computing the Greedy Spanner in Near-Quadratic Time | 2008-07-15 | Paper |
| Shortest Path Queries in Polygonal Domains | 2008-07-10 | Paper |
| Partitioning planar graphs with costs and weights | 2008-06-20 | Paper |
| I/O-efficient algorithms for computing planar geometric spanners | 2008-06-18 | Paper |
| An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane | 2008-05-27 | Paper |
| Spanners of Complete k-Partite Geometric Graphs | 2008-04-15 | Paper |
| Geometric Spanners with Small Chromatic Number | 2008-02-20 | Paper |
| Approximate Shortest Path Queries on Weighted Polyhedral Surfaces | 2007-09-05 | Paper |
| Space-efficient geometric divide-and-conquer algorithms | 2007-06-04 | Paper |
| I/O-efficient well-separated pair decomposition and applications | 2006-09-26 | Paper |
| A dynamic dictionary for priced information with application | 2006-06-14 | Paper |
| I/O-Optimal Algorithms for Outerplanar Graphs | 2005-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828956 | 2004-11-29 | Paper |
| Approximating geometric bottleneck shortest paths | 2004-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474222 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470498 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428991 | 2003-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418635 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707791 | 2003-06-11 | Paper |
| Translating a regular grid over a point set | 2003-05-19 | Paper |
| Fast approximations for sums of distances, clustering and the Fermat-Weber problem | 2003-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778553 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778563 | 2002-11-18 | Paper |
| Cutting circles into equal area pieces | 2002-09-18 | Paper |
| I/O-efficient algorithms for graphs of bounded treewidth | 2002-03-24 | Paper |
| Blocking in parallel multisearch problems | 2002-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753938 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728847 | 2001-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2728846 | 2001-11-01 | Paper |
| Ray shooting from convex ranges | 2001-09-03 | Paper |
| Approximating shortest paths on weighted polyhedral surfaces | 2001-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511234 | 2001-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525709 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945513 | 2000-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942643 | 2000-03-16 | Paper |
| Planar stage graphs: Characterizations and applications | 1998-07-23 | Paper |
| Efficient computation of implicit representations of sparse graphs | 1998-06-23 | Paper |
| Stage-graph representations | 1998-01-29 | Paper |
| Multilist layering: Complexity and applications | 1997-02-28 | Paper |
| Realizing Degree Sequences in Parallel | 1996-09-12 | Paper |
| -Algorithms for Minimum Link Path and Related Problems | 1996-05-28 | Paper |
| Optimal parallel algorithms for rectilinear link-distance problems | 1995-08-27 | Paper |
| An algorithm for recognizing palm polygons | 1995-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281530 | 1994-03-10 | Paper |
| Characterizing and recognizing weak visibility polygons | 1993-11-01 | Paper |
| An optimal parallel algorithm for computing furthest neighbors in a tree | 1993-04-01 | Paper |
| An optimal algorithm for computing a minimum nested nonconvex polygon | 1990-01-01 | Paper |
