No. Title Author Year
1 Local Routing in Sparse and Lightweight Geometric Graphs Ashvinkumar, Vikrant et al. 2019
2 Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers Akitaya, Hugo A. et al. 2019
3 Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain Arseneva, Elena et al. 2018
4 Faster Algorithms for Growing Prioritized Disks and Rectangles Ahn, Hee-Kap et al. 2017
5 Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points de Berg, Mark et al. 2017
6 Improved Time-Space Trade-Offs for Computing Voronoi Diagrams Banyassady, Bahareh et al. 2017
7 Routing in Polygonal Domains Banyassady, Bahareh et al. 2017
8 Routing on the Visibility Graph Bose, Prosenjit et al. 2017
9 Hanabi is NP-complete, Even for Cheaters who Look at Their Cards Baffier, Jean-Francois et al. 2016
10 On Interference Among Moving Sensors and Related Problems De Carufel, Jean-Lou et al. 2016
11 Packing Short Plane Spanning Trees in Complete Geometric Graphs Aichholzer, Oswin et al. 2016
12 Time-Space Trade-offs for Triangulating a Simple Polygon Aronov, Boris et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 12


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI