| Publication | Date of Publication | Type |
|---|
| An O(n n) algorithm for single-source shortest paths in disk graphs | 2026-08-31 | Paper |
| Optimal motion planning for two square robots in a rectilinear environment | 2026-08-11 | Paper |
| Rectilinear Steiner trees in narrow strips | 2026-04-27 | Paper |
| A coreset for approximate furthest-neighbor queries in a simple polygon | 2025-11-24 | Paper |
| A clique-based separator for intersection graphs of geodesic disks in \(\mathbb{R}^2\) | 2025-11-24 | Paper |
A clique-based separator for intersection graphs of geodesic disks in \(\mathbb{R}^2\)
Algorithmica | 2025-10-10 | Paper |
| An ETH-tight exact algorithm for Euclidean TSP | 2025-08-12 | Paper |
| Removing depth-order cycles among triangles: an efficient algorithm generating triangular fragments | 2025-08-06 | Paper |
| Finding diverse minimum s-t cuts | 2025-07-24 | Paper |
| Clustering in polygonal domains | 2025-07-24 | Paper |
| Geometric TSP on sets | 2025-07-24 | Paper |
Geometric TSP on sets
Computational Geometry | 2025-07-04 | Paper |
| Computing smallest convex intersecting polygons | 2025-06-19 | Paper |
| TSP in a simple polygon | 2025-06-19 | Paper |
Stable approximation algorithms for dominating set and independent set
SIAM Journal on Discrete Mathematics | 2025-05-07 | Paper |
Computing smallest convex intersecting polygons
Journal of Computational Geometry | 2025-04-23 | Paper |
| 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
Discrete & Computational Geometry | 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
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem
SIAM Journal on Discrete Mathematics | 2024-02-27 | Paper |
Improved bounds for discrete Voronoi games
Lecture Notes in Computer Science | 2024-01-16 | Paper |
| scientific article; zbMATH DE number 7788595 (Why is no real title available?) | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7788646 (Why is no real title available?) | 2024-01-15 | Paper |
| Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision tree model | 2024-01-15 | Paper |
A note on reachability and distance oracles for transmission graphs
(available as arXiv preprint) | 2023-12-16 | Paper |
The online broadcast range-assignment problem
Algorithmica | 2023-12-13 | Paper |
The Online Broadcast Range-Assignment Problem
(available as arXiv preprint) | 2023-11-14 | Paper |
| Preclustering Algorithms for Imprecise Points | 2023-11-02 | Paper |
Euclidean TSP in narrow strips
(available as arXiv preprint) | 2023-11-02 | Paper |
| On β-Plurality Points in Spatial Voting Games. | 2023-11-02 | Paper |
k-Center Clustering with Outliers in the Sliding-Window Model.
(available as arXiv preprint) | 2023-09-20 | Paper |
An ETH-Tight Exact Algorithm for Euclidean TSP
SIAM Journal on Computing | 2023-06-09 | Paper |
Clique-based separators for geometric intersection graphs
Algorithmica | 2023-06-05 | Paper |
Linear size binary space partitions for fat objects
Lecture Notes in Computer Science | 2023-05-08 | Paper |
On one-round discrete voronoi games
(available as arXiv preprint) | 2023-02-03 | Paper |
| Computing the maximum overlap of two convex polygons under translations | 2023-01-25 | Paper |
Models and motion planning
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Translating polygons with applications to hidden surface removal
SWAT 90 | 2022-12-09 | Paper |
Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
SWAT 90 | 2022-12-09 | Paper |
Two- and three- dimensional point location in rectangular subdivisions
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
New results on binary space partitions in the plane (extended abstract)
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
Computational Geometry | 2022-11-16 | Paper |
Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
Treewidth, Kernels, and Algorithms | 2022-10-19 | Paper |
Computing constrained minimum-width annuli of point sets
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Preclustering algorithms for imprecise points
Algorithmica | 2022-06-01 | Paper |
On β-Plurality Points in Spatial Voting Games
ACM Transactions on Algorithms | 2022-02-16 | Paper |
Fine-grained Complexity Analysis of Two Classic TSP Variants
ACM Transactions on Algorithms | 2022-02-08 | Paper |
Removing depth-order cycles among triangles: an algorithm generating triangular fragments
Discrete & Computational Geometry | 2021-02-10 | Paper |
A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs
SIAM Journal on Computing | 2021-01-13 | Paper |
| Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons | 2021-01-12 | Paper |
| Shortcuts for the circle | 2020-11-25 | Paper |
Faster DBScan and HDBscan in low-dimensional Euclidean spaces
(available as arXiv preprint) | 2020-11-25 | Paper |
Fully-dynamic and kinetic conflict-free coloring of intervals with respect to points
(available as arXiv preprint) | 2020-11-25 | Paper |
| Dynamic conflict-free colorings in the plane | 2020-11-25 | Paper |
The dominating set problem in geometric intersection graphs
(available as arXiv preprint) | 2020-05-27 | Paper |
Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces
Algorithmica | 2020-04-01 | Paper |
Minimum perimeter-sum partitions in the plane
Discrete & Computational Geometry | 2020-01-31 | Paper |
Geodesic spanners for points on a polyhedral terrain
SIAM Journal on Computing | 2019-12-19 | Paper |
An efficient algorithm for the 1D total visibility-index problem
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Covering many points with a small-area box
(available as arXiv preprint) | 2019-09-10 | Paper |
Faster \textsc{dbscan} and \textsc{hdbscan} in low-dimensional Euclidean spaces
International Journal of Computational Geometry & Applications | 2019-09-09 | Paper |
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points
International Journal of Computational Geometry & Applications | 2019-09-09 | Paper |
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
The homogeneous broadcast problem in narrow and wide strips. I: Algorithms
Algorithmica | 2019-05-21 | Paper |
The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds
Algorithmica | 2019-05-21 | Paper |
The complexity of dominating set in geometric intersection graphs
Theoretical Computer Science | 2019-04-23 | Paper |
Shortcuts for the circle
Computational Geometry | 2019-03-20 | Paper |
Shortcuts for the circle
Computational Geometry | 2019-03-20 | Paper |
Finding pairwise intersections inside a query range
Algorithmica | 2019-01-11 | Paper |
Dynamic conflict-free colorings in the plane
Computational Geometry | 2018-12-07 | Paper |
Dynamic conflict-free colorings in the plane
Computational Geometry | 2018-12-07 | Paper |
Box-trees for collision checking in industrial installations
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
An efficient algorithm for the 1D total visibility-index problem and its parallelization
ACM Journal of Experimental Algorithmics | 2018-11-20 | Paper |
Faster algorithms for computing plurality points
ACM Transactions on Algorithms | 2018-11-13 | Paper |
The priority R-tree: a practically efficient and worst-case optimal R-tree
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Independent-set reconfiguration thresholds of hereditary graph classes
Discrete Applied Mathematics | 2018-10-26 | Paper |
Independent-set reconfiguration thresholds of hereditary graph classes
Discrete Applied Mathematics | 2018-10-26 | Paper |
Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces
(available as arXiv preprint) | 2018-10-04 | Paper |
Minimum Perimeter-Sum Partitions in the Plane
(available as arXiv preprint) | 2018-08-13 | Paper |
Range-clustering queries
(available as arXiv preprint) | 2018-08-13 | Paper |
Geodesic spanners for points on a polyhedral terrain
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| scientific article; zbMATH DE number 6876121 (Why is no real title available?) | 2018-05-29 | Paper |
Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces
(available as arXiv preprint) | 2018-05-07 | Paper |
Progressive geometric algorithms
Proceedings of the thirtieth annual symposium on Computational geometry | 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
(available as arXiv preprint) | 2017-12-19 | Paper |
Cache-oblivious R-trees
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Kinetic sorting and kinetic convex hulls
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Vertical ray shooting for fat objects
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Kinetic spanners in \(\mathbb{R}^d\)
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Visibility maps of realistic terrains have linear smoothed complexity
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Schematization of road networks
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Box-trees and R-trees with near-optimal query time
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
A segment-tree based kinetic BSP
Proceedings of the seventeenth annual symposium on Computational geometry | 2017-09-29 | Paper |
| Implicit flow routing on terrains with applications to surface networks and drainage structures | 2017-09-29 | Paper |
The homogeneous broadcast problem in narrow and wide strips
(available as arXiv preprint) | 2017-09-22 | Paper |
Guarding monotone art galleries with sliding cameras in linear time
Journal of Discrete Algorithms | 2017-07-13 | Paper |
