| Publication | Date of Publication | Type |
|---|
| Stable approximation algorithms for dominating set and independent set | 2025-01-14 | Paper |
| Stable and dynamic minimum cuts | 2024-07-19 | Paper |
| Stable approximation algorithms for the dynamic broadcast range-assignment problem | 2024-05-27 | Paper |
| Euclidean TSP in narrow strips | 2024-05-21 | Paper |
| On cyclic solutions to the min-max latency multi-robot patrolling problem | 2024-05-14 | Paper |
| Unlabeled multi-robot motion planning with tighter separation bounds | 2024-05-14 | Paper |
| Throughput and packet displacements of dynamic broadcasting algorithms | 2024-04-05 | Paper |
| Dominance in the presence of obstacles | 2024-02-28 | Paper |
| Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem | 2024-02-27 | Paper |
| Improved bounds for discrete Voronoi games | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147519 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147573 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187787 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6179341 | 2023-12-16 | Paper |
| The online broadcast range-assignment problem | 2023-12-13 | Paper |
| The Online Broadcast Range-Assignment Problem | 2023-11-14 | Paper |
| On β-Plurality Points in Spatial Voting Games. | 2023-11-02 | Paper |
| Euclidean TSP in narrow strips | 2023-11-02 | Paper |
| Preclustering Algorithms for Imprecise Points | 2023-11-02 | Paper |
| k-Center Clustering with Outliers in the Sliding-Window Model. | 2023-09-20 | Paper |
| An ETH-Tight Exact Algorithm for Euclidean TSP | 2023-06-09 | Paper |
| Clique-based separators for geometric intersection graphs | 2023-06-05 | Paper |
| Linear size binary space partitions for fat objects | 2023-05-08 | Paper |
| On one-round discrete voronoi games | 2023-02-03 | Paper |
| Computing the maximum overlap of two convex polygons under translations | 2023-01-25 | Paper |
| Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric | 2022-12-09 | Paper |
| Translating polygons with applications to hidden surface removal | 2022-12-09 | Paper |
| New results on binary space partitions in the plane (extended abstract) | 2022-12-09 | Paper |
| Models and motion planning | 2022-12-09 | Paper |
| Two- and three- dimensional point location in rectangular subdivisions | 2022-12-09 | Paper |
| Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model | 2022-11-16 | Paper |
| Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs | 2022-10-19 | Paper |
| Computing constrained minimum-width annuli of point sets | 2022-08-19 | Paper |
| Preclustering algorithms for imprecise points | 2022-06-01 | Paper |
| On β-Plurality Points in Spatial Voting Games | 2022-02-16 | Paper |
| Fine-grained Complexity Analysis of Two Classic TSP Variants | 2022-02-08 | Paper |
| Removing depth-order cycles among triangles: an algorithm generating triangular fragments | 2021-02-10 | Paper |
| A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs | 2021-01-13 | Paper |
| Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons | 2021-01-12 | Paper |
| Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. | 2020-11-25 | Paper |
| Dynamic Conflict-Free Colorings in the Plane | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136224 | 2020-11-25 | Paper |
| Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces | 2020-11-25 | Paper |
| The Dominating Set Problem in Geometric Intersection Graphs | 2020-05-27 | Paper |
| Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces | 2020-04-01 | Paper |
| Minimum perimeter-sum partitions in the plane | 2020-01-31 | Paper |
| Geodesic Spanners for Points on a Polyhedral Terrain | 2019-12-19 | Paper |
| An Efficient Algorithm for the 1D Total Visibility-Index Problem | 2019-09-12 | Paper |
| Covering many points with a small-area box | 2019-09-10 | Paper |
| Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points | 2019-09-09 | Paper |
| Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces | 2019-09-09 | Paper |
| A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs | 2019-08-22 | Paper |
| The homogeneous broadcast problem in narrow and wide strips. I: Algorithms | 2019-05-21 | Paper |
| The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds | 2019-05-21 | Paper |
| The complexity of dominating set in geometric intersection graphs | 2019-04-23 | Paper |
| Shortcuts for the circle | 2019-03-20 | Paper |
| Finding pairwise intersections inside a query range | 2019-01-11 | Paper |
| Dynamic conflict-free colorings in the plane | 2018-12-07 | Paper |
| Box-trees for collision checking in industrial installations | 2018-11-23 | Paper |
| An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization | 2018-11-20 | Paper |
| Faster Algorithms for Computing Plurality Points | 2018-11-13 | Paper |
| The priority R-tree | 2018-11-05 | Paper |
| Independent-set reconfiguration thresholds of hereditary graph classes | 2018-10-26 | Paper |
| Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces | 2018-10-04 | Paper |
| Range-clustering queries | 2018-08-13 | Paper |
| Minimum Perimeter-Sum Partitions in the Plane | 2018-08-13 | Paper |
| Geodesic Spanners for Points on a Polyhedral Terrain | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643895 | 2018-05-29 | Paper |
| Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces | 2018-05-07 | Paper |
| Progressive Geometric Algorithms | 2018-04-23 | Paper |
| Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes. | 2018-04-19 | Paper |
| Faster Algorithms for Computing Plurality Points | 2018-01-30 | Paper |
| Fine-grained complexity analysis of two classic TSP variants | 2017-12-19 | Paper |
| Cache-oblivious R-trees | 2017-10-20 | Paper |
| Kinetic spanners in R d | 2017-10-20 | Paper |
| Kinetic sorting and kinetic convex hulls | 2017-10-20 | Paper |
| Vertical ray shooting for fat objects | 2017-10-20 | Paper |
| Visibility maps of realistic terrains have linear smoothed complexity | 2017-10-20 | Paper |
| A segment-tree based kinetic BSP | 2017-09-29 | Paper |
| Box-trees and R-trees with near-optimal query time | 2017-09-29 | Paper |
| Schematization of road networks | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365043 | 2017-09-29 | Paper |
| The homogeneous broadcast problem in narrow and wide strips | 2017-09-22 | Paper |
| Guarding monotone art galleries with sliding cameras in linear time | 2017-07-13 | Paper |
| Separability of imprecise points | 2017-07-05 | Paper |
| Progressive Geometric Algorithms | 2017-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2970472 | 2017-03-30 | Paper |
| Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model | 2017-03-09 | Paper |
| Fat polygonal partitions with applications to visualization and embeddings | 2017-03-09 | Paper |
| Visibility maps of realistic terrains have linear smoothed complexity | 2017-03-09 | Paper |
| Multi-method dispatching: a geometric approach with applications to string matching problems | 2016-09-29 | Paper |
| Conflict-free colorings for frequency allocation is wireless networks | 2016-09-07 | Paper |
| On lazy randomized incremental construction | 2016-09-01 | Paper |
| Computing a single cell in the overlay of two simple polygons | 2016-05-26 | Paper |
| Distance-sensitive planar point location | 2016-05-17 | Paper |
| Straight-path queries in trajectory data | 2016-02-18 | Paper |
| Separating bichromatic point sets by L-shapes | 2016-01-15 | Paper |
| COMPUTING PUSH PLANS FOR DISK-SHAPED ROBOTS | 2015-12-22 | Paper |
| Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons | 2015-11-19 | Paper |
| Finding Pairwise Intersections Inside a Query Range | 2015-10-30 | Paper |
| Guarding Monotone Art Galleries with Sliding Cameras in Linear Time | 2015-09-11 | Paper |
| Piecewise linear paths among convex obstacles | 2015-05-07 | Paper |
| Straight-Path Queries in Trajectory Data | 2015-02-27 | Paper |
| Kinetic 2-centers in the black-box model | 2015-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934575 | 2014-12-18 | Paper |
| Separability of Imprecise Points | 2014-09-02 | Paper |
| Improved Bounds for the Union of Locally Fat Objects in the Plane | 2014-07-30 | Paper |
| Treemaps with bounded aspect ratio | 2014-05-19 | Paper |
| Better bounds on the union complexity of locally fat objects | 2014-04-03 | Paper |
| Kinetic convex hulls and delaunay triangulations in the black-box model | 2014-03-24 | Paper |
| Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons | 2014-03-24 | Paper |
| Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap | 2013-09-17 | Paper |
| Distance-Sensitive Planar Point Location | 2013-08-12 | Paper |
| OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE | 2013-06-24 | Paper |
| Fast Fréchet queries | 2013-04-29 | Paper |
| Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes | 2012-09-25 | Paper |
| Unions of fat convex polytopes have short skeletons | 2012-08-13 | Paper |
| Approximation algorithms for free-label maximization | 2012-05-18 | Paper |
| The Traveling Salesman Problem under squared Euclidean distances | 2012-01-23 | Paper |
| Treemaps with Bounded Aspect Ratio | 2011-12-16 | Paper |
| Fast Fréchet Queries | 2011-12-16 | Paper |
| Geometric spanners for weighted point sets | 2011-08-16 | Paper |
| On Rectilinear Partitions with Minimum Stabbing Number | 2011-08-12 | Paper |
| Piecewise-Linear Approximations of Uncertain Functions | 2011-08-12 | Paper |
| Kinetic spanners in \(\mathbb R^{d}\) | 2011-06-03 | Paper |
| Go with the Flow: The Direction-Based Fréchet Distance of Polygonal Curves | 2011-05-12 | Paper |
| Out-of-order event processing in kinetic data structures | 2011-05-10 | Paper |
| Kinetic kd-Trees and Longest-Side kd-Trees | 2010-09-06 | Paper |
| Vertical ray shooting and computing depth orders for fat objects | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579436 | 2010-08-06 | Paper |
| Optimal Binary Space Partitions in the Plane | 2010-07-20 | Paper |
| Approximation Algorithms for Free-Label Maximization | 2010-06-22 | Paper |
| Cache-oblivious selection in sorted \(X+Y\) matrices | 2010-06-09 | Paper |
| OPTIMAL BSPs AND RECTILINEAR CARTOGRAMS | 2010-05-28 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Streaming algorithms for line simplification | 2010-04-12 | Paper |
| The complexity of flow on fat terrains and its i/o-efficient computation | 2010-03-16 | Paper |
| Computing the visibility map of fat objects | 2010-03-16 | Paper |
| Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions | 2010-03-11 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION | 2010-02-12 | Paper |
| Decompositions and boundary coverings of non-convex fat polyhedra | 2009-11-16 | Paper |
| A simple and efficient kinetic spanner | 2009-11-16 | Paper |
| Geometric Spanners for Weighted Point Sets | 2009-10-29 | Paper |
| Covering many or few points with unit disks | 2009-09-02 | Paper |
| Cache-oblivious R-trees | 2009-05-13 | Paper |
| Region-fault tolerant geometric spanners | 2009-05-06 | Paper |
| Kinetic collision detection for convex fat objects | 2009-05-06 | Paper |
| On rectilinear duals for vertex-weighted plane graphs | 2009-04-09 | Paper |
| Vertical Ray Shooting and Computing Depth Orders for Fat Objects | 2009-03-16 | Paper |
| I/O-Efficient Flow Modeling on Fat Terrains | 2009-02-17 | Paper |
| Computing the Visibility Map of Fat Objects | 2009-02-17 | Paper |
| Kinetic KD-trees and longest-side KD-trees | 2009-02-12 | Paper |
| A simple and efficient kinetic spanner | 2009-02-12 | Paper |
| Streaming algorithms for line simplification | 2009-02-12 | Paper |
| Efficient \(c\)-oriented range searching with DOP-trees | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601526 | 2009-02-10 | Paper |
| The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains | 2008-11-25 | Paper |
| Decompositions and Boundary Coverings of Non-convex Fat Polyhedra | 2008-11-25 | Paper |
| Improved bounds on the union complexity of fat objects | 2008-09-24 | Paper |
| Ray shooting and intersection searching amidst fat convex polyhedra in 3-space | 2008-07-29 | Paper |
| Sparse geometric graphs with small dilation | 2008-06-18 | Paper |
| I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5452284 | 2008-03-25 | Paper |
| Out-of-Order Event Processing in Kinetic Data Structures | 2008-03-11 | Paper |
| Kinetic Collision Detection for Convex Fat Objects | 2008-03-11 | Paper |
| Covering Many or Few Points with Unit Disks | 2008-02-21 | Paper |
| Kinetic sorting and kinetic convex hulls | 2007-03-15 | Paper |
| An intersection-sensitive algorithm for snap rounding | 2007-02-19 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Approximate range searching using binary space partitions | 2006-04-28 | Paper |
| TSP with neighborhoods of varying size | 2005-11-16 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| Schematization of networks | 2005-05-12 | Paper |
| Optimal spanners for axis-aligned rectangles | 2005-02-09 | Paper |
| Spanning trees crossing few barriers | 2004-02-05 | Paper |
| On simplifying dot maps. | 2004-01-23 | Paper |
| Guarding scenes against invasive hypercubes. | 2003-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411358 | 2003-07-08 | Paper |
| On the flatness of Minkowski sums | 2003-06-24 | Paper |
| On R-trees with low query complexity | 2003-04-28 | Paper |
| Reporting intersecting pairs of convex polytopes in two and three dimensions | 2003-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4792781 | 2003-02-17 | Paper |
| Realistic input models for geometric algorithms | 2002-12-01 | Paper |
| Box-trees and R-trees with near-optimal query time | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778548 | 2002-11-18 | Paper |
| Models and motion planning | 2002-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753933 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761861 | 2001-02-21 | Paper |
| Lower bounds for kinetic planar subdivisions | 2000-12-19 | Paper |
| Linear size binary space partitions for uncluttered scenes | 2000-12-03 | Paper |
| Computing the Angularity Tolerance | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4947407 | 2000-04-18 | Paper |
| Motion planning for multiple robots | 1999-11-25 | Paper |
| The union of moving polygonal pseudodiscs -- combinatorial bounds and applications | 1999-05-17 | Paper |
| Motion planning in environments with low obstacle density | 1999-01-13 | Paper |
| Computing the maximum overlap of two convex polygons under translations | 1998-11-11 | Paper |
| Constructing Levels in Arrangements and Higher Order Voronoi Diagrams | 1998-05-10 | Paper |
| New results on binary space partitions in the plane | 1997-10-28 | Paper |
| Trekking in the alps without freezing or getting tired | 1997-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4344150 | 1997-07-14 | Paper |
| Perfect binary space partitions | 1997-03-18 | Paper |
| Reaching a goal with directional uncertainty | 1997-02-28 | Paper |
| Generalized hidden surface removal | 1996-07-14 | Paper |
| Computing half-plane and strip discrepancy of planar point sets | 1996-07-14 | Paper |
| Point location in zones of \(k\)-flats in arrangements | 1996-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875176 | 1996-04-28 | Paper |
| TRANSLATION QUERIES FOR SETS OF POLYGONS | 1996-04-16 | Paper |
| Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions | 1996-02-26 | Paper |
| Vertical decompositions for triangles in 3-space | 1996-02-13 | Paper |
| CUTTINGS AND APPLICATIONS | 1996-02-01 | Paper |
| On lazy randomized incremental construction | 1995-11-29 | Paper |
| Piecewise linear paths among convex obstacles | 1995-08-01 | Paper |
| Rectilinear decompositions with low stabbing number | 1995-01-09 | Paper |
| Efficient ray shooting and hidden surface removal | 1994-08-10 | Paper |
| Computing and Verifying Depth Orders | 1994-05-10 | Paper |
| Ray shooting, depth orders and hidden surface removal | 1993-12-06 | Paper |
| SHORTEST PATH QUERIES IN RECTILINEAR WORLDS | 1993-04-01 | Paper |
| Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra | 1992-12-16 | Paper |
| Hidden surface removal for \(c\)-oriented polyhedra | 1992-09-27 | Paper |
| A general approach to dominance in the plane | 1992-06-28 | Paper |
| Finding squares and rectangles in sets of points | 1991-01-01 | Paper |
| On rectilinear link distance | 1991-01-01 | Paper |
| Maintaining range trees in secondary memory. Part I: Partitions | 1990-01-01 | Paper |
