No. Title Author Year
1 Improved Time-Space Trade-Offs for Computing Voronoi Diagrams Banyassady, Bahareh et al. 2017
2 Computing the L1 Geodesic Diameter and Center of a Polygonal Domain Won Bae, Sang et al. 2016
3 Hanabi is NP-complete, Even for Cheaters who Look at Their Cards Baffier, Jean-Francois et al. 2016
4 On Interference Among Moving Sensors and Related Problems De Carufel, Jean-Lou et al. 2016
5 Packing Short Plane Spanning Trees in Complete Geometric Graphs Aichholzer, Oswin et al. 2016
6 Time-Space Trade-offs for Triangulating a Simple Polygon Aronov, Boris et al. 2016
7 A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon Ahn, Hee Kap et al. 2015
8 Space-Time Trade-offs for Stack-Based Algorithms Barba, Luis et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 8


DROPS-Home | Fulltext Search | Imprint Published by LZI