No. |
Title |
Author |
Year |
---|

1 |
Oriented Spanners |
Buchin, Kevin et al. |
2023 |

2 |
The Tight Spanning Ratio of the Rectangle Delaunay Triangulation |
van Renssen, André et al. |
2023 |

3 |
A Simple Dynamization of Trapezoidal Point Location in Planar Subdivisions |
Brankovic, Milutin et al. |
2020 |

4 |
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon |
Korman, Matias et al. |
2020 |

5 |
Local Routing in Sparse and Lightweight Geometric Graphs |
Ashvinkumar, Vikrant et al. |
2019 |

6 |
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers |
Akitaya, Hugo A. et al. |
2019 |

7 |
Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain |
Arseneva, Elena et al. |
2018 |

8 |
Faster Algorithms for Growing Prioritized Disks and Rectangles |
Ahn, Hee-Kap et al. |
2017 |

9 |
Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points |
de Berg, Mark et al. |
2017 |

10 |
Improved Time-Space Trade-Offs for Computing Voronoi Diagrams |
Banyassady, Bahareh et al. |
2017 |

11 |
Routing in Polygonal Domains |
Banyassady, Bahareh et al. |
2017 |

12 |
Routing on the Visibility Graph |
Bose, Prosenjit et al. |
2017 |

13 |
Hanabi is NP-complete, Even for Cheaters who Look at Their Cards |
Baffier, Jean-Francois et al. |
2016 |

14 |
On Interference Among Moving Sensors and Related Problems |
De Carufel, Jean-Lou et al. |
2016 |

15 |
Packing Short Plane Spanning Trees in Complete Geometric Graphs |
Aichholzer, Oswin et al. |
2016 |

16 |
Time-Space Trade-offs for Triangulating a Simple Polygon |
Aronov, Boris et al. |
2016 |