| Publication | Date of Publication | Type |
|---|
| Vickrey prices and shortest paths: What is an edge worth? | 2026-05-08 | Paper |
Dynamic geometric set cover, revisited
SIAM Journal on Computing | 2025-06-25 | Paper |
| Fault tolerance in Euclidean committee selection | 2025-01-06 | Paper |
| Dynamic geometric set cover, revisited | 2024-07-19 | Paper |
| Point separation and obstacle removal by finding and hitting odd cycles | 2024-05-14 | Paper |
| scientific article; zbMATH DE number 7788605 (Why is no real title available?) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788390 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
The centroid of points with approximate weights
Lecture Notes in Computer Science | 2023-05-08 | Paper |
| The Maximum Exposure Problem. | 2023-02-03 | Paper |
Fully dynamic 2-edge-connectivity in planar graphs
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Applications of a semi-dynamic convex hull algorithm
SWAT 90 | 2022-12-09 | Paper |
A near-optimal algorithm for shortest paths among curved obstacles in the plane
SIAM Journal on Computing | 2022-08-25 | Paper |
On-line scheduling with hard deadlines
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Efficient breakout routing in printed circuit boards (extended abstract)
Lecture Notes in Computer Science | 2022-08-19 | Paper |
The maximum exposure problem
Computational Geometry | 2022-04-08 | Paper |
The maximum exposure problem
Computational Geometry | 2022-04-08 | Paper |
Approximating dominating set on intersection graphs of rectangles and L-frames
(available as arXiv preprint) | 2021-08-04 | Paper |
| Improved approximation bounds for the minimum constraint removal problem | 2021-08-04 | Paper |
Improved approximation bounds for the minimum constraint removal problem
Computational Geometry | 2020-10-23 | Paper |
| Computing shortest paths in the plane with removable obstacles | 2020-08-25 | Paper |
| Shortest paths in the plane with obstacle violations | 2020-05-27 | Paper |
| K-Dominance in Multidimensional Data: Theory and Applications | 2020-05-27 | Paper |
Shortest paths in the plane with obstacle violations
Algorithmica | 2020-05-21 | Paper |
K-dominance in multidimensional data: theory and applications
Computational Geometry | 2020-04-22 | Paper |
Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames
Computational Geometry | 2019-10-25 | Paper |
Stochastic minimum spanning trees and related problems
2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Untangling the braid: finding outliers in a set of streams
2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Finding the <i>k</i> shortest simple paths
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Tight bounds for conflict-free chromatic guarding of orthogonal art galleries
Computational Geometry | 2018-10-31 | Paper |
An optimal algorithm for detecting weak visibility of a polygon
IEEE Transactions on Computers | 2018-09-14 | Paper |
Efficient Algorithms for k-Regret Minimizing Sets
(available as arXiv preprint) | 2018-08-13 | Paper |
Metric embedding, hyperbolic space, and social networks
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
| Most likely Voronoi diagrams in higher dimensions | 2018-04-19 | Paper |
Range-max queries on uncertain data
Journal of Computer and System Sciences | 2018-04-18 | Paper |
| Hyperplane separability and convexity of probabilistic point sets | 2018-01-30 | Paper |
Block crossings in storyline visualizations
Journal of Graph Algorithms and Applications | 2017-10-12 | Paper |
Convex hulls under uncertainty
Algorithmica | 2017-10-10 | Paper |
| Tight bounds for conflict-free chromatic guarding of orthogonal art galleries | 2017-10-10 | Paper |
Geometric <i>k</i> Shortest Paths
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Range counting over multidimensional data streams
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
| On the complexity of time-dependent shortest paths | 2017-09-29 | Paper |
Binary space partitions of orthogonal subdivisions
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Kinetic connectivity for unit disks
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
On the Most Likely Voronoi Diagram and Nearest Neighbor Searching
International Journal of Computational Geometry & Applications | 2017-05-19 | Paper |
| Hyperplane separability and convexity of probabilistic point sets | 2017-03-30 | Paper |
Block Crossings in Storyline Visualizations
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Metric embedding, hyperbolic space, and social networks
Computational Geometry | 2016-11-14 | Paper |
Observability of lattice graphs
Algorithmica | 2016-10-21 | Paper |
Bundled Crossings in Embedded Graphs
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Containment and evasion in stochastic point data
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Pursuit evasion on polyhedral surfaces
Algorithmica | 2016-02-19 | Paper |
On the most likely Voronoi diagram and nearest neighbor searching
Algorithms and Computation | 2015-09-11 | Paper |
On the difficulty of some shortest path problems
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Computing Klee's measure of grounded boxes
Algorithmica | 2015-05-26 | Paper |
Matrix searching with the shortest path metric
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Capture bounds for visibility-based pursuit evasion
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
A near-optimal algorithm for shortest paths among curved obstacles in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Capture bounds for visibility-based pursuit evasion
Computational Geometry | 2014-12-23 | Paper |
On the complexity of time-dependent shortest paths
Algorithmica | 2014-12-02 | Paper |
Convex hulls under uncertainty
Lecture Notes in Computer Science | 2014-10-08 | Paper |
On Klee's measure problem for grounded boxes
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Summarizing spatial data streams using clusterhulls
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Erratum to: ``Conflict-free chromatic art gallery coverage''
Algorithmica | 2014-03-25 | Paper |
Conflict-free chromatic art gallery coverage
Algorithmica | 2014-03-25 | Paper |
Stochastic minimum spanning trees in Euclidean spaces
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
\(k\)-capture in multiagent pursuit evasion, or the lion and the hyenas
Theoretical Computer Science | 2014-01-24 | Paper |
Closest pair and the post office problem for stochastic points
Computational Geometry | 2014-01-22 | Paper |
Euclidean Traveling Salesman Tours through Stochastic Neighborhoods
Algorithms and Computation | 2014-01-14 | Paper |
Pursuit evasion on polyhedral surfaces
Algorithms and Computation | 2014-01-14 | Paper |
On the Most Likely Convex Hull of Uncertain Points
Lecture Notes in Computer Science | 2013-09-17 | Paper |
| Conflict-free chromatic art gallery coverage | 2012-08-23 | Paper |
Reconstructing visibility graphs with simple robots
Theoretical Computer Science | 2012-08-10 | Paper |
The union of probabilistic boxes: Maintaining the volume
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Closest pair and the post office problem for stochastic points
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Multiagent Pursuit Evasion, or Playing Kabaddi
Springer Tracts in Advanced Robotics | 2011-08-04 | Paper |
Bandwidth-constrained allocation in grid computing.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Reconstructing visibility graphs with simple robots
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Bandwidth-constrained allocation in grid computing
Algorithmica | 2009-05-13 | Paper |
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Simple Robots in Polygonal Environments: A Hierarchy
1522.68597 | 2009-01-22 | Paper |
Simplified Planar Coresets for Data Streams
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Angle Optimization in Target Tracking
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Adaptive sampling for geometric problems over data streams
Computational Geometry | 2008-03-13 | Paper |
Towards real-time dynamic spectrum auctions
Computer Networks | 2008-03-11 | Paper |
Selfish load balancing and atomic congestion games
Algorithmica | 2007-03-05 | Paper |
Range counting over multidimensional data streams
Discrete & Computational Geometry | 2006-12-06 | Paper |
Adaptive spatial partitioning for multidimensional data streams
Algorithmica | 2006-10-16 | Paper |
Fast packet classification for two-dimensional conflict-free filters
Computer Networks | 2006-10-10 | Paper |
Side constraints and non-price attributes in markets
Games and Economic Behavior | 2006-09-28 | Paper |
BOB: Improved winner determination in combinatorial auctions and generalizations
Artificial Intelligence | 2006-02-07 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Binary Space Partitions of Orthogonal Subdivisions
SIAM Journal on Computing | 2005-09-16 | Paper |
A lower bound for multicast key distribution
Computer Networks | 2005-02-09 | Paper |
Noise-tolerant distribution-free learning of general geometric concepts
Journal of the ACM | 2005-01-25 | Paper |
Analysis of a bounding box heuristic for object intersection
Journal of the ACM | 2005-01-25 | Paper |
Routing bandwidth-guaranteed paths with restoration in label-switched networks
Computer Networks | 2004-11-23 | Paper |
Multiway range trees: scalable IP lookup with fast updates
Computer Networks | 2004-11-23 | Paper |
| scientific article; zbMATH DE number 2079327 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 1979533 (Why is no real title available?) | 2003-09-14 | Paper |
| scientific article; zbMATH DE number 1969709 (Why is no real title available?) | 2003-08-24 | Paper |
A constant bound for geometric permutations of disjoint unit balls
Discrete & Computational Geometry | 2003-08-21 | Paper |
Compressing two-dimensional routing tables
Algorithmica | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1962826 (Why is no real title available?) | 2003-08-11 | Paper |
Geometric permutations of balls with bounded size disparity.
Computational Geometry | 2003-07-01 | Paper |
Curvature-Constrained Shortest Paths in a Convex Polygon
SIAM Journal on Computing | 2003-01-05 | Paper |
Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
SIAM Journal on Computing | 2002-09-29 | Paper |
Kinetic connectivity for unit disks
Discrete & Computational Geometry | 2002-05-14 | Paper |
| Shape sensitive geometric permutations | 2002-04-22 | Paper |
| Simplified kinetic connectivity for rectangles and hypercubes | 2002-03-24 | Paper |
| scientific article; zbMATH DE number 1670680 (Why is no real title available?) | 2001-11-11 | Paper |
Morphing simple polygons
Discrete & Computational Geometry | 2001-09-10 | Paper |
| scientific article; zbMATH DE number 1617280 (Why is no real title available?) | 2001-07-11 | Paper |
| scientific article; zbMATH DE number 1445342 (Why is no real title available?) | 2000-10-23 | Paper |
Online Scheduling with Hard Deadlines
Journal of Algorithms | 2000-08-28 | Paper |
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1305478 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1303549 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1256730 (Why is no real title available?) | 1999-05-18 | Paper |
Label placement by maximum independent set in rectangles
Computational Geometry | 1999-04-11 | Paper |
| scientific article; zbMATH DE number 1305543 (Why is no real title available?) | 1999-01-01 | Paper |
Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\)
Computational Geometry | 1998-10-01 | Paper |
| scientific article; zbMATH DE number 1182916 (Why is no real title available?) | 1998-09-30 | Paper |
Surface Approximation and Geometric Partitions
SIAM Journal on Computing | 1998-09-20 | Paper |
Matrix Searching with the Shortest-Path Metric
SIAM Journal on Computing | 1998-02-10 | Paper |
Designing Least-Cost Nonblocking Broadband Networks
Journal of Algorithms | 1997-10-20 | Paper |
Off-Line Maintenance of Planar Configurations
Journal of Algorithms | 1997-06-03 | Paper |
Finding a shortest diagonal of a simple polygon in linear time
Computational Geometry | 1997-05-06 | Paper |
| scientific article; zbMATH DE number 1003231 (Why is no real title available?) | 1997-04-23 | Paper |
| scientific article; zbMATH DE number 910902 (Why is no real title available?) | 1996-11-04 | Paper |
| scientific article; zbMATH DE number 910896 (Why is no real title available?) | 1996-07-28 | Paper |
| scientific article; zbMATH DE number 867650 (Why is no real title available?) | 1996-04-22 | Paper |
Separation and approximation of polyhedral objects
Computational Geometry | 1996-02-13 | Paper |
LOGARITHMIC-TIME LINK PATH QUERIES IN A SIMPLE POLYGON
International Journal of Computational Geometry & Applications | 1995-12-18 | Paper |
Data structures for two-edge connectivity in planar graphs
Theoretical Computer Science | 1995-10-09 | Paper |
| scientific article; zbMATH DE number 795220 (Why is no real title available?) | 1995-09-11 | Paper |
A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
Journal of Algorithms | 1995-07-03 | Paper |
| scientific article; zbMATH DE number 742976 (Why is no real title available?) | 1995-04-11 | Paper |
| scientific article; zbMATH DE number 742973 (Why is no real title available?) | 1995-04-11 | Paper |
| scientific article; zbMATH DE number 741010 (Why is no real title available?) | 1995-04-05 | Paper |
| scientific article; zbMATH DE number 437529 (Why is no real title available?) | 1994-12-04 | Paper |
Can visibility graphs be represented compactly?
Discrete & Computational Geometry | 1994-11-27 | Paper |
Maintenance of geometric extrema
Journal of the ACM | 1994-11-13 | Paper |
| scientific article; zbMATH DE number 432803 (Why is no real title available?) | 1993-10-20 | Paper |
Selecting distances in the plane
Algorithmica | 1993-06-29 | Paper |
Computing the intersection-depth to polyhedra
Algorithmica | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 177542 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 140463 (Why is no real title available?) | 1993-03-28 | Paper |
Transitions in geometric minimum spanning trees
Discrete & Computational Geometry | 1993-01-16 | Paper |
Applications of a semi-dynamic convex hull algorithm
BIT | 1992-12-14 | Paper |
Farthest neighbors, maximum spanning trees and related problems in higher dimensions
Computational Geometry | 1992-09-27 | Paper |
A Note on Finding a Strict Saddlepoint
The American Mathematical Monthly | 1992-06-27 | Paper |
Computing external farthest neighbors for a simple polygon
Discrete Applied Mathematics | 1992-06-25 | Paper |
Fast Matching Algorithms for Points on a Polygon
SIAM Journal on Computing | 1992-06-25 | Paper |
Finding tailored partitions
Journal of Algorithms | 1991-01-01 | Paper |
Finding k points with minimum diameter and related problems
Journal of Algorithms | 1991-01-01 | Paper |
Computing Euclidean maximum spanning trees
Algorithmica | 1990-01-01 | Paper |
Computing the longest diagonal of a simple polygon
Information Processing Letters | 1990-01-01 | Paper |
Computing geodesic furthest neighbors in simple polygons
Journal of Computer and System Sciences | 1989-01-01 | Paper |
Finding minimal convex nested polygons
Information and Computation | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4050998 (Why is no real title available?) | 1988-01-01 | Paper |
Computing the link center of a simple polygon
Discrete & Computational Geometry | 1988-01-01 | Paper |
A linear time algorithm for minimum link paths inside a simple polygon
Computer Vision, Graphics, and Image Processing | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3907791 (Why is no real title available?) | 1985-01-01 | Paper |
