| Publication | Date of Publication | Type |
|---|
| Kinetic geodesic Voronoi diagrams in a simple polygon | 2026-03-18 | Paper |
| A simple dynamization of trapezoidal point location in planar subdivisions | 2026-03-18 | Paper |
The mutual visibility problem for fat robots with lights
CGT. Computing in Geometry and Topology | 2026-03-09 | Paper |
Oriented spanners
Algorithmica | 2025-12-30 | Paper |
Shortest paths of mutually visible robots
International Journal of Computational Geometry & Applications | 2025-11-12 | Paper |
The tight spanning ratio of the rectangle Delaunay triangulation
Algorithmica | 2025-08-29 | Paper |
| Computing a subtrajectory cluster from c-packed trajectories | 2025-07-24 | Paper |
Pattern formation for fat robots with memory
Computational Geometry | 2025-07-04 | Paper |
Pattern formation for fat robots with lights
Computational Geometry | 2025-03-10 | Paper |
| Oriented spanners | 2025-01-06 | Paper |
| The tight spanning ratio of the rectangle Delaunay triangulation | 2025-01-06 | Paper |
Generalized sweeping line spanners
Theoretical Computer Science | 2024-02-20 | Paper |
The mutual visibility problem for fat robots
Lecture Notes in Computer Science | 2024-01-16 | Paper |
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
SIAM Journal on Discrete Mathematics | 2023-10-26 | Paper |
Generalized sweeping line spanners
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Covering a set of line segments with a few squares
Lecture Notes in Computer Science | 2023-03-22 | Paper |
Local Routing in Sparse and Lightweight Geometric Graphs
(available as arXiv preprint) | 2023-02-03 | Paper |
Graphs with large total angular resolution
Theoretical Computer Science | 2023-01-05 | Paper |
Local routing in a tree metric 1-spanner
Journal of Combinatorial Optimization | 2022-10-18 | Paper |
| Rectilinear link diameter and radius in a rectilinear polygonal domain | 2022-07-21 | Paper |
Covering a set of line segments with a few squares
Theoretical Computer Science | 2022-06-13 | Paper |
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
(available as arXiv preprint) | 2022-05-11 | Paper |
Local routing in sparse and lightweight geometric graphs
Algorithmica | 2022-05-03 | Paper |
Translation invariant Fréchet distance queries
Algorithmica | 2021-11-19 | Paper |
Snipperclips: cutting tools into desired polygons using themselves
Computational Geometry | 2021-09-17 | Paper |
Local routing in a tree metric 1-spanner
(available as arXiv preprint) | 2021-04-21 | Paper |
Bounded-degree spanners in the presence of polygonal obstacles
(available as arXiv preprint) | 2021-04-21 | Paper |
Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers
Algorithmica | 2021-04-19 | Paper |
Constrained routing between non-visible vertices
Theoretical Computer Science | 2021-03-09 | Paper |
Bounded-degree spanners in the presence of polygonal obstacle
Theoretical Computer Science | 2021-01-25 | Paper |
Rectilinear link diameter and radius in a rectilinear polygonal domain
Computational Geometry | 2021-01-07 | Paper |
Fully-dynamic and kinetic conflict-free coloring of intervals with respect to points
(available as arXiv preprint) | 2020-11-25 | Paper |
Routing in polygonal domains
(available as arXiv preprint) | 2020-11-25 | Paper |
Routing on the visibility graph
(available as arXiv preprint) | 2020-11-25 | Paper |
scientific article; zbMATH DE number 7278008 (Why is no real title available?)
(available as arXiv preprint) | 2020-11-25 | Paper |
Graphs with large total angular resolution
Lecture Notes in Computer Science | 2020-10-26 | Paper |
Symmetric assembly puzzles are hard, beyond a few pieces
Computational Geometry | 2020-10-23 | Paper |
Routing in histograms
(available as arXiv preprint) | 2020-07-22 | Paper |
Routing in polygonal domains
Computational Geometry | 2020-04-22 | Paper |
Balanced line separators of unit disk graphs
Computational Geometry | 2020-04-22 | Paper |
Packing plane spanning graphs with short edges in complete geometric graphs
Computational Geometry | 2019-10-25 | Paper |
Faster algorithms for growing prioritized disks and rectangles
Computational Geometry | 2019-10-18 | Paper |
Spanning properties of Yao and -graphs in the presence of constraints
International Journal of Computational Geometry & Applications | 2019-09-24 | Paper |
Geometry and generation of a new graph planarity game
Journal of Graph Algorithms and Applications | 2019-09-16 | Paper |
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points
International Journal of Computational Geometry & Applications | 2019-09-09 | Paper |
| Competitive routing in the half-\(\theta_6\)-graph | 2019-05-10 | Paper |
Dynamic graph coloring
Algorithmica | 2019-04-25 | Paper |
On plane constrained bounded-degree spanners
Algorithmica | 2019-04-25 | Paper |
Routing on the Visibility Graph
(available as arXiv preprint) | 2019-02-27 | Paper |
Improved time-space trade-offs for computing Voronoi diagrams
Journal of Computational Geometry | 2019-02-27 | Paper |
Constrained generalized Delaunay graphs are plane spanners
Computational Geometry | 2018-10-31 | Paper |
Time-space trade-offs for triangulations and Voronoi diagrams
Computational Geometry | 2018-10-31 | Paper |
| Time-space trade-offs for triangulating a simple polygon | 2018-06-05 | Paper |
Competitive local routing with constraints
(available as arXiv preprint) | 2018-06-05 | Paper |
| On interference among moving sensors and related problems | 2018-06-05 | Paper |
New and improved spanning ratios for Yao graphs
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Packing short plane spanning trees in complete geometric graphs
(available as arXiv preprint) | 2018-04-19 | Paper |
| Improved time-space trade-offs for computing Voronoi diagrams | 2018-04-19 | Paper |
On interference among moving sensors and related problems
(available as arXiv preprint) | 2018-03-02 | Paper |
Continuous Yao graphs
Computational Geometry | 2018-02-12 | Paper |
Constrained routing between non-visible vertices
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Time-space trade-offs for triangulating a simple polygon
(available as arXiv preprint) | 2017-10-17 | Paper |
Upper and lower bounds for online routing on Delaunay triangulations
Discrete & Computational Geometry | 2017-10-10 | Paper |
Dynamic graph coloring
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Balanced line separators of unit disk graphs
Lecture Notes in Computer Science | 2017-09-22 | Paper |
| Hanabi is NP-complete, even for cheaters who look at their cards | 2017-07-17 | Paper |
The price of order
International Journal of Computational Geometry & Applications | 2017-05-19 | Paper |
Hanabi is NP-hard, even for cheaters who look at their cards
Theoretical Computer Science | 2017-05-12 | Paper |
| New and improved spanning ratios for Yao graphs | 2017-03-30 | Paper |
Symmetric assembly puzzles are hard, beyond a few pieces
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Symmetric assembly puzzles are hard, beyond a few pieces
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Towards tight bounds on theta-graphs: more is not always better
Theoretical Computer Science | 2016-01-21 | Paper |
Competitive local routing with constraints
Algorithms and Computation | 2016-01-11 | Paper |
Upper and lower bounds for online routing on Delaunay triangulations
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
SIAM Journal on Computing | 2015-11-18 | Paper |
Time-space trade-offs for triangulations and Voronoi diagrams
Lecture Notes in Computer Science | 2015-10-30 | Paper |
The price of order
Algorithms and Computation | 2015-09-11 | Paper |
Reprint of: Theta-3 is connected
Computational Geometry | 2015-04-27 | Paper |
The \(\varTheta_5\)-graph is a spanner
Computational Geometry | 2015-03-06 | Paper |
Theta-3 is connected
Computational Geometry | 2014-08-13 | Paper |
Upper bounds on the spanning ratio of constrained theta-graphs
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Making triangulations 4-connected using flips
Computational Geometry | 2014-01-22 | Paper |
The \(\theta_5\)-graph is a spanner
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
On the stretch factor of the theta-4 graph
Lecture Notes in Computer Science | 2013-08-12 | Paper |
On the spanning ratio of theta-graphs
Lecture Notes in Computer Science | 2013-08-12 | Paper |
On plane constrained bounded-degree spanners
Lecture Notes in Computer Science | 2012-06-29 | Paper |
