| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147302 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147534 | 2024-01-15 | Paper |
| The centroid of points with approximate weights | 2023-05-08 | Paper |
| The Maximum Exposure Problem. | 2023-02-03 | Paper |
| Applications of a semi-dynamic convex hull algorithm | 2022-12-09 | Paper |
| Fully dynamic 2-edge-connectivity in planar graphs | 2022-12-09 | Paper |
| A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane | 2022-08-25 | Paper |
| On-line scheduling with hard deadlines | 2022-08-19 | Paper |
| Efficient breakout routing in printed circuit boards | 2022-08-19 | Paper |
| The maximum exposure problem | 2022-04-08 | Paper |
| Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009492 | 2021-08-04 | Paper |
| Improved approximation bounds for the minimum constraint removal problem | 2020-10-23 | Paper |
| Computing Shortest Paths in the Plane with Removable Obstacles | 2020-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111738 | 2020-05-27 | Paper |
| K-Dominance in Multidimensional Data: Theory and Applications | 2020-05-27 | Paper |
| Shortest paths in the plane with obstacle violations | 2020-05-21 | Paper |
| K-dominance in multidimensional data: theory and applications | 2020-04-22 | Paper |
| Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames | 2019-10-25 | Paper |
| Stochastic Minimum Spanning Trees and Related Problems | 2019-09-16 | Paper |
| Untangling the Braid: Finding Outliers in a Set of Streams | 2019-09-11 | Paper |
| Finding the k shortest simple paths | 2018-11-05 | Paper |
| Tight bounds for conflict-free chromatic guarding of orthogonal art galleries | 2018-10-31 | Paper |
| An optimal algorithm for detecting weak visibility of a polygon | 2018-09-14 | Paper |
| Efficient Algorithms for k-Regret Minimizing Sets | 2018-08-13 | Paper |
| Metric Embedding, Hyperbolic Space, and Social Networks | 2018-04-23 | Paper |
| Most likely Voronoi diagrams in higher dimensions | 2018-04-19 | Paper |
| Range-max queries on uncertain data | 2018-04-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132872 | 2018-01-30 | Paper |
| Block Crossings in Storyline Visualizations | 2017-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368703 | 2017-10-10 | Paper |
| Convex hulls under uncertainty | 2017-10-10 | Paper |
| Geometric k Shortest Paths | 2017-10-05 | Paper |
| Kinetic connectivity for unit disks | 2017-09-29 | Paper |
| Range counting over multidimensional data streams | 2017-09-29 | Paper |
| Binary space partitions of orthogonal subdivisions | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365046 | 2017-09-29 | Paper |
| On the Most Likely Voronoi Diagram and Nearest Neighbor Searching | 2017-05-19 | Paper |
| Hyperplane separability and convexity of probabilistic point sets | 2017-03-30 | Paper |
| Block Crossings in Storyline Visualizations | 2017-02-21 | Paper |
| Metric embedding, hyperbolic space, and social networks | 2016-11-14 | Paper |
| Observability of lattice graphs | 2016-10-21 | Paper |
| Bundled Crossings in Embedded Graphs | 2016-05-03 | Paper |
| Containment and Evasion in Stochastic Point Data | 2016-05-03 | Paper |
| Pursuit evasion on polyhedral surfaces | 2016-02-19 | Paper |
| On the Most Likely Voronoi Diagramand Nearest Neighbor Searching | 2015-09-11 | Paper |
| On the difficulty of some shortest path problems | 2015-09-02 | Paper |
| Computing Klee's measure of grounded boxes | 2015-05-26 | Paper |
| Matrix searching with the shortest path metric | 2015-05-07 | Paper |
| Capture bounds for visibility-based pursuit evasion | 2015-02-17 | Paper |
| A near-optimal algorithm for shortest paths among curved obstacles in the plane | 2015-02-17 | Paper |
| Capture bounds for visibility-based pursuit evasion | 2014-12-23 | Paper |
| On the complexity of time-dependent shortest paths | 2014-12-02 | Paper |
| Convex hulls under uncertainty | 2014-10-08 | Paper |
| On Klee's measure problem for grounded boxes | 2014-08-07 | Paper |
| Summarizing spatial data streams using ClusterHulls | 2014-04-01 | Paper |
| Conflict-free chromatic art gallery coverage | 2014-03-25 | Paper |
| Erratum to: ``Conflict-free chromatic art gallery coverage | 2014-03-25 | Paper |
| Stochastic minimum spanning trees in euclidean spaces | 2014-03-24 | Paper |
| \(k\)-capture in multiagent pursuit evasion, or the lion and the hyenas | 2014-01-24 | Paper |
| Closest pair and the post office problem for stochastic points | 2014-01-22 | Paper |
| Pursuit Evasion on Polyhedral Surfaces | 2014-01-14 | Paper |
| Euclidean Traveling Salesman Tours through Stochastic Neighborhoods | 2014-01-14 | Paper |
| On the Most Likely Convex Hull of Uncertain Points | 2013-09-17 | Paper |
| Conflict-free Chromatic Art Gallery Coverage | 2012-08-23 | Paper |
| Reconstructing visibility graphs with simple robots | 2012-08-10 | Paper |
| The Union of Probabilistic Boxes: Maintaining the Volume | 2011-09-16 | Paper |
| Closest Pair and the Post Office Problem for Stochastic Points | 2011-08-12 | Paper |
| Multiagent Pursuit Evasion, or Playing Kabaddi | 2011-08-04 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Reconstructing Visibility Graphs with Simple Robots | 2010-02-24 | Paper |
| Bandwidth-constrained allocation in grid computing | 2009-05-13 | Paper |
| Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks | 2009-03-06 | Paper |
| Simple Robots in Polygonal Environments: A Hierarchy | 2009-01-22 | Paper |
| Simplified Planar Coresets for Data Streams | 2008-07-15 | Paper |
| Angle Optimization in Target Tracking | 2008-07-15 | Paper |
| Adaptive sampling for geometric problems over data streams | 2008-03-13 | Paper |
| Towards real-time dynamic spectrum auctions | 2008-03-11 | Paper |
| Selfish load balancing and atomic congestion games | 2007-03-05 | Paper |
| Range counting over multidimensional data streams | 2006-12-06 | Paper |
| Adaptive spatial partitioning for multidimensional data streams | 2006-10-16 | Paper |
| Fast packet classification for two-dimensional conflict-free filters | 2006-10-10 | Paper |
| Side constraints and non-price attributes in markets | 2006-09-28 | Paper |
| BOB: Improved winner determination in combinatorial auctions and generalizations | 2006-02-07 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Binary Space Partitions of Orthogonal Subdivisions | 2005-09-16 | Paper |
| A lower bound for multicast key distribution | 2005-02-09 | Paper |
| Noise-tolerant distribution-free learning of general geometric concepts | 2005-01-25 | Paper |
| Analysis of a bounding box heuristic for object intersection | 2005-01-25 | Paper |
| Routing bandwidth-guaranteed paths with restoration in label-switched networks | 2004-11-23 | Paper |
| Multiway range trees: scalable IP lookup with fast updates | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471280 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427880 | 2003-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4423002 | 2003-08-24 | Paper |
| A constant bound for geometric permutations of disjoint unit balls | 2003-08-21 | Paper |
| Compressing two-dimensional routing tables | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418662 | 2003-08-11 | Paper |
| Geometric permutations of balls with bounded size disparity. | 2003-07-01 | Paper |
| Curvature-Constrained Shortest Paths in a Convex Polygon | 2003-01-05 | Paper |
| Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions | 2002-09-29 | Paper |
| Kinetic connectivity for unit disks | 2002-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768300 | 2002-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768286 | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753959 | 2001-11-11 | Paper |
| Morphing simple polygons | 2001-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2722003 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952659 | 2000-10-23 | Paper |
| Online Scheduling with Hard Deadlines | 2000-08-28 | Paper |
| An Optimal Algorithm for Euclidean Shortest Paths in the Plane | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250173 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252366 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228465 | 1999-05-18 | Paper |
| Label placement by maximum independent set in rectangles | 1999-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252435 | 1999-01-01 | Paper |
| Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\) | 1998-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401013 | 1998-09-30 | Paper |
| Surface Approximation and Geometric Partitions | 1998-09-20 | Paper |
| Matrix Searching with the Shortest-Path Metric | 1998-02-10 | Paper |
| Designing Least-Cost Nonblocking Broadband Networks | 1997-10-20 | Paper |
| Off-Line Maintenance of Planar Configurations | 1997-06-03 | Paper |
| Finding a shortest diagonal of a simple polygon in linear time | 1997-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335190 | 1997-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886077 | 1996-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886071 | 1996-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873762 | 1996-04-22 | Paper |
| Separation and approximation of polyhedral objects | 1996-02-13 | Paper |
| LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON | 1995-12-18 | Paper |
| Data structures for two-edge connectivity in planar graphs | 1995-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4845369 | 1995-09-11 | Paper |
| A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk | 1995-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763413 | 1995-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763415 | 1995-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4327375 | 1995-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140401 | 1994-12-04 | Paper |
| Can visibility graphs be represented compactly? | 1994-11-27 | Paper |
| Maintenance of geometric extrema | 1994-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138936 | 1993-10-20 | Paper |
| Selecting distances in the plane | 1993-06-29 | Paper |
| Computing the intersection-depth to polyhedra | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037411 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028879 | 1993-03-28 | Paper |
| Transitions in geometric minimum spanning trees | 1993-01-16 | Paper |
| Applications of a semi-dynamic convex hull algorithm | 1992-12-14 | Paper |
| Farthest neighbors, maximum spanning trees and related problems in higher dimensions | 1992-09-27 | Paper |
| A Note on Finding a Strict Saddlepoint | 1992-06-27 | Paper |
| Computing external farthest neighbors for a simple polygon | 1992-06-25 | Paper |
| Fast Matching Algorithms for Points on a Polygon | 1992-06-25 | Paper |
| Finding k points with minimum diameter and related problems | 1991-01-01 | Paper |
| Finding tailored partitions | 1991-01-01 | Paper |
| Computing Euclidean maximum spanning trees | 1990-01-01 | Paper |
| Computing the longest diagonal of a simple polygon | 1990-01-01 | Paper |
| Finding minimal convex nested polygons | 1989-01-01 | Paper |
| Computing geodesic furthest neighbors in simple polygons | 1989-01-01 | Paper |
| Computing the link center of a simple polygon | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787487 | 1988-01-01 | Paper |
| A linear time algorithm for minimum link paths inside a simple polygon | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3685218 | 1985-01-01 | Paper |
