Publication | Date of Publication | Type |
---|
Generalized sweeping line spanners | 2024-02-20 | Paper |
The mutual visibility problem for fat robots | 2024-01-16 | Paper |
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon | 2023-10-26 | Paper |
Generalized sweeping line spanners | 2023-08-10 | Paper |
Covering a set of line segments with a few squares | 2023-03-22 | Paper |
Local Routing in Sparse and Lightweight Geometric Graphs | 2023-02-03 | Paper |
Graphs with large total angular resolution | 2023-01-05 | Paper |
Local routing in a tree metric \(1\)-spanner | 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 | 2022-06-13 | Paper |
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers | 2022-05-11 | Paper |
Local routing in sparse and lightweight geometric graphs | 2022-05-03 | Paper |
Translation invariant Fréchet distance queries | 2021-11-19 | Paper |
Snipperclips: cutting tools into desired polygons using themselves | 2021-09-17 | Paper |
Bounded-degree spanners in the presence of polygonal obstacles | 2021-04-21 | Paper |
Local routing in a tree metric 1-spanner | 2021-04-21 | Paper |
Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers | 2021-04-19 | Paper |
Constrained routing between non-visible vertices | 2021-03-09 | Paper |
Bounded-degree spanners in the presence of polygonal obstacle | 2021-01-25 | Paper |
Rectilinear link diameter and radius in a rectilinear polygonal domain | 2021-01-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q5136216 | 2020-11-25 | Paper |
Routing in Polygonal Domains | 2020-11-25 | Paper |
Routing on the visibility graph | 2020-11-25 | Paper |
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. | 2020-11-25 | Paper |
Graphs with large total angular resolution | 2020-10-26 | Paper |
Symmetric assembly puzzles are hard, beyond a few pieces | 2020-10-23 | Paper |
Routing in histograms | 2020-07-22 | Paper |
Routing in polygonal domains | 2020-04-22 | Paper |
Balanced line separators of unit disk graphs | 2020-04-22 | Paper |
Packing plane spanning graphs with short edges in complete geometric graphs | 2019-10-25 | Paper |
Faster algorithms for growing prioritized disks and rectangles | 2019-10-18 | Paper |
Spanning Properties of Yao and 𝜃-Graphs in the Presence of Constraints | 2019-09-24 | Paper |
Geometry and Generation of a New Graph Planarity Game | 2019-09-16 | Paper |
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points | 2019-09-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q5743479 | 2019-05-10 | Paper |
On plane constrained bounded-degree spanners | 2019-04-25 | Paper |
Dynamic graph coloring | 2019-04-25 | Paper |
Improved Time-Space Trade-offs for Computing Voronoi Diagrams | 2019-02-27 | Paper |
Routing on the Visibility Graph | 2019-02-27 | Paper |
Time-space trade-offs for triangulations and Voronoi diagrams | 2018-10-31 | Paper |
Constrained generalized Delaunay graphs are plane spanners | 2018-10-31 | Paper |
On interference among moving sensors and related problems | 2018-06-05 | Paper |
Time-space trade-offs for triangulating a simple polygon | 2018-06-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q5745388 | 2018-06-05 | Paper |
New and Improved Spanning Ratios for Yao Graphs | 2018-04-23 | Paper |
Improved Time-Space Trade-offs for Computing Voronoi Diagrams | 2018-04-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q4636491 | 2018-04-19 | Paper |
On interference among moving sensors and related problems | 2018-03-02 | Paper |
Continuous Yao graphs | 2018-02-12 | Paper |
Constrained routing between non-visible vertices | 2017-10-23 | Paper |
Time-space trade-offs for triangulating a simple polygon | 2017-10-17 | Paper |
Upper and lower bounds for online routing on Delaunay triangulations | 2017-10-10 | Paper |
Dynamic graph coloring | 2017-09-22 | Paper |
Balanced line separators of unit disk graphs | 2017-09-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q5282800 | 2017-07-17 | Paper |
The Price of Order | 2017-05-19 | Paper |
Hanabi is NP-hard, even for cheaters who look at their cards | 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 | 2017-02-01 | Paper |
Towards tight bounds on theta-graphs: more is not always better | 2016-01-21 | Paper |
Competitive Local Routing with Constraints | 2016-01-11 | Paper |
Upper and Lower Bounds for Online Routing on Delaunay Triangulations | 2015-11-19 | Paper |
Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles | 2015-11-18 | Paper |
Time-Space Trade-offs for Triangulations and Voronoi Diagrams | 2015-10-30 | Paper |
The Price of Order | 2015-09-11 | Paper |
Reprint of: Theta-3 is connected | 2015-04-27 | Paper |
The \(\varTheta_5\)-graph is a spanner | 2015-03-06 | Paper |
Theta-3 is connected | 2014-08-13 | Paper |
Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs | 2014-03-31 | Paper |
Making triangulations 4-connected using flips | 2014-01-22 | Paper |
The θ 5-Graph is a Spanner | 2013-12-06 | Paper |
On the Stretch Factor of the Theta-4 Graph | 2013-08-12 | Paper |
On the Spanning Ratio of Theta-Graphs | 2013-08-12 | Paper |
On plane constrained bounded-degree spanners | 2012-06-29 | Paper |