No. Title Author Year
1 Faster Algorithms for Growing Prioritized Disks and Rectangles Ahn, Hee-Kap et al. 2017
2 Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points de Berg, Mark et al. 2017
3 Improved Time-Space Trade-Offs for Computing Voronoi Diagrams Banyassady, Bahareh et al. 2017
4 Routing in Polygonal Domains Banyassady, Bahareh et al. 2017
5 Routing on the Visibility Graph Bose, Prosenjit et al. 2017
6 Hanabi is NP-complete, Even for Cheaters who Look at Their Cards Baffier, Jean-Francois et al. 2016
7 On Interference Among Moving Sensors and Related Problems De Carufel, Jean-Lou et al. 2016
8 Packing Short Plane Spanning Trees in Complete Geometric Graphs Aichholzer, Oswin et al. 2016
9 Time-Space Trade-offs for Triangulating a Simple Polygon Aronov, Boris et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 9


DROPS-Home | Fulltext Search | Imprint Published by LZI