| Publication | Date of Publication | Type |
|---|
| An improved bound for plane covering paths | 2026-08-31 | Paper |
| Tight bounds on the number of closest pairs in vertical slabs | 2026-08-11 | Paper |
| Polychromatic coloring of tuples in hypergraphs | 2026-08-11 | Paper |
| Computing oriented spanners and their dilation | 2026-08-11 | Paper |
| On the spanning and routing ratios of the Yao-four graph | 2026-06-08 | Paper |
Noncrossing longest paths and cycles
Graphs and Combinatorics | 2026-01-29 | Paper |
On separating path and tree systems in graphs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-01-13 | Paper |
Metric and geometric spanners that are resilient to degree-bounded edge faults
Journal of Computational Geometry | 2025-12-04 | Paper |
| Geometric covering via extraction theorem | 2025-11-04 | Paper |
| Noncrossing longest paths and cycles | 2025-10-07 | Paper |
Euclidean maximum matchings in the plane -- local to global
Algorithmica | 2025-01-24 | Paper |
| On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees | 2024-07-05 | Paper |
On the spanning and routing ratio of the directed theta-four graph
Discrete & Computational Geometry | 2024-04-02 | Paper |
scientific article; zbMATH DE number 7788617 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| scientific article; zbMATH DE number 7788635 (Why is no real title available?) | 2024-01-15 | Paper |
| On Separating Path and Tree Systems in Graphs | 2023-12-21 | Paper |
Improved routing on the Delaunay triangulation
Discrete & Computational Geometry | 2023-10-12 | Paper |
An instance-based algorithm for deciding the bias of a coin
Discrete Mathematics, Algorithms and Applications | 2023-07-14 | Paper |
Shortest beer path queries in outerplanar graphs
Algorithmica | 2023-06-05 | Paper |
The Minimum Moving Spanning Tree Problem
Journal of Graph Algorithms and Applications | 2023-03-30 | Paper |
scientific article; zbMATH DE number 7662164 (Why is no real title available?)
(available as arXiv preprint) | 2023-03-10 | Paper |
Static and dynamic algorithms for k-point clustering problems
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Further results on generalized intersection searching problems: Counting, reporting, and dynamization
Lecture Notes in Computer Science | 2023-01-18 | Paper |
On intersection searching problems involving curved objects
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
On some geometric optimization problems in layered manufacturing
Lecture Notes in Computer Science | 2022-08-19 | Paper |
Computing maximum independent set on outerstring graphs and their relatives
Computational Geometry | 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 |
Closest-pair queries and minimum-weight queries are equivalent for squares
Computational Geometry | 2021-12-15 | Paper |
Approximating maximum diameter-bounded subgraph in unit disk graphs
Discrete & Computational Geometry | 2021-11-18 | Paper |
Window queries for intersecting objects, maximal points and approximations using coresets
Discrete Applied Mathematics | 2021-10-21 | Paper |
Tight bounds on the clique chromatic number
The Electronic Journal of Combinatorics | 2021-09-28 | Paper |
| Improved routing on the Delaunay triangulation | 2021-08-04 | Paper |
On the minimum consistent subset problem
Algorithmica | 2021-06-30 | Paper |
The Most Likely Object to be Seen Through a Window
International Journal of Computational Geometry & Applications | 2021-02-11 | Paper |
A simple randomized O(N N)-time closest-pair algorithm in doubling metrics
(available as arXiv preprint) | 2021-01-12 | Paper |
An improved construction for spanners of disks
Computational Geometry | 2021-01-07 | Paper |
Faster algorithms for some optimization problems on collinear points
(available as arXiv preprint) | 2020-11-12 | Paper |
Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
Computational Geometry | 2020-10-23 | Paper |
Querying relational event graphs using colored range searching data structures
Discrete Applied Mathematics | 2020-09-17 | Paper |
| Flip distance to some plane configurations | 2020-08-25 | Paper |
| Approximating maximum diameter-bounded subgraph in unit disk graphs | 2020-08-18 | Paper |
| Faster algorithms for some optimization problems on collinear points | 2020-08-18 | Paper |
Tight Bounds on the Clique Chromatic Number
(available as arXiv preprint) | 2020-06-19 | Paper |
Optimal art gallery localization is NP-hard
Computational Geometry | 2020-03-23 | Paper |
Plane and planarity thresholds for random geometric graphs
Discrete Mathematics, Algorithms and Applications | 2020-02-18 | Paper |
Orthogonal range reporting and rectangle stabbing for fat rectangles
(available as arXiv preprint) | 2020-01-16 | Paper |
On the minimum consistent subset problem
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Computing maximum independent set on outerstring graphs and their relatives
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs
Information Processing Letters | 2019-11-21 | Paper |
Flip distance to some plane configurations
Computational Geometry | 2019-10-25 | Paper |
Flip distance to some plane configurations
Computational Geometry | 2019-10-25 | Paper |
Closest-pair queries in fat rectangles
Computational Geometry | 2019-10-25 | Paper |
On the spanning and routing ratio of Theta-Four
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
The discrete Voronoi game in a simple polygon
Theoretical Computer Science | 2019-10-07 | Paper |
Partial enclosure range searching
International Journal of Computational Geometry & Applications | 2019-09-09 | Paper |
Fast algorithms for diameter-optimally augmenting paths and trees
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
Maximum plane trees in multipartite geometric graphs
Algorithmica | 2019-04-25 | Paper |
Spanning trees in multipartite geometric graphs
Algorithmica | 2019-01-11 | Paper |
Data structures for halfplane proximity queries and incremental Voronoi diagrams
Algorithmica | 2019-01-11 | Paper |
Approximate distance oracles for geometric spanners
ACM Transactions on Algorithms | 2018-11-05 | Paper |
An optimal algorithm for plane matchings in multipartite geometric graphs
Computational Geometry | 2018-11-01 | Paper |
Plane bichromatic trees of low degree
Discrete & Computational Geometry | 2018-07-13 | Paper |
| Window queries for problems on intersecting objects and maximal points | 2018-06-05 | Paper |
| scientific article; zbMATH DE number 6876123 (Why is no real title available?) | 2018-05-29 | Paper |
| Towards plane spanners of degree 3 | 2018-04-19 | Paper |
Improved spanning ratio for low degree plane spanners
Algorithmica | 2018-04-11 | Paper |
Geometric path problems with violations
Algorithmica | 2018-04-06 | Paper |
Strong matching of points with geometric shapes
Computational Geometry | 2018-02-19 | Paper |
Discrete Voronoi games and -nets, in two and three dimensions
Computational Geometry | 2018-01-19 | Paper |
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
Computational Geometry | 2018-01-19 | Paper |
Planar spanners and approximate shortest path queries among obstacles in the plane
Algorithms — ESA '96 | 2017-12-05 | Paper |
| scientific article; zbMATH DE number 6792401 (Why is no real title available?) | 2017-10-17 | Paper |
scientific article; zbMATH DE number 6792403 (Why is no real title available?)
(available as arXiv preprint) | 2017-10-17 | Paper |
| Minimizing the continuous diameter when augmenting a tree with a shortcut | 2017-09-22 | Paper |
Maximum plane trees in multipartite geometric graphs
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Faster algorithms for the minimum red-blue-purple spanning graph problem
Journal of Graph Algorithms and Applications | 2017-05-16 | Paper |
Querying Relational Event Graphs Using Colored Range Searching Data Structures
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
Essential Constraints of Edge-Constrained Proximity Graphs
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere
(available as arXiv preprint) | 2017-03-30 | Paper |
| A plane 1.88-spanner for points in convex position | 2017-03-30 | Paper |
Towards plane spanners of degree 3
(available as arXiv preprint) | 2017-03-30 | Paper |
| On the stretch factor of convex Delaunay graphs | 2017-03-09 | Paper |
| Approximating the average stretch factor of geometric graphs | 2017-03-09 | Paper |
| An optimal algorithm for computing angle-constrained spanners | 2017-03-09 | Paper |
Network farthest-point diagrams
(available as arXiv preprint) | 2017-03-09 | Paper |
Computing a largest empty anchored cylinder, and related problems
Lecture Notes in Computer Science | 2017-01-19 | Paper |
Probing convex polygons with a wedge
Computational Geometry | 2016-11-14 | Paper |
Essential constraints of edge-constrained proximity graphs
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Plane bichromatic trees of low degree
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Efficient algorithms for counting and reporting pairwise intersections between convex polygons
Information Processing Letters | 2016-06-16 | Paper |
A lower bound for approximating the geometric minimum weight matching
Information Processing Letters | 2016-06-16 | Paper |
A technique for adding range restrictions to generalized searching problems
Information Processing Letters | 2016-06-09 | Paper |
Improved spanning ratio for low degree plane spanners
Lecture Notes in Computer Science | 2016-05-03 | Paper |
Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon
Topics in Theoretical Computer Science | 2016-04-01 | Paper |
Higher-order triangular-distance Delaunay graphs: graph-theoretical properties
Computational Geometry | 2016-01-15 | Paper |
Approximating the bottleneck plane perfect matching of a point set
Computational Geometry | 2016-01-15 | Paper |
Packing plane perfect matchings into a point set
(available as arXiv preprint) | 2015-12-03 | Paper |
| Packing plane perfect matchings into a point set | 2015-12-03 | Paper |
An optimal algorithm for plane matchings in multipartite geometric graphs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Fast algorithms for diameter-optimally augmenting paths
Automata, Languages, and Programming | 2015-10-27 | Paper |
