No. Title Author Year
1 Convex Hulls in Polygonal Domains Barba, Luis et al. 2018
2 Experimental Study of Compressed Stack Algorithms in Limited Memory Environments Baffier, Jean-François et al. 2018
3 Faster Algorithms for Growing Prioritized Disks and Rectangles Ahn, Hee-Kap et al. 2017
4 High Dimensional Consistent Digital Segments Chiu, Man-Kwun et al. 2017
5 Improved Time-Space Trade-Offs for Computing Voronoi Diagrams Banyassady, Bahareh et al. 2017
6 Routing in Polygonal Domains Banyassady, Bahareh et al. 2017
7 Routing on the Visibility Graph Bose, Prosenjit et al. 2017
8 Computing the L1 Geodesic Diameter and Center of a Polygonal Domain Won Bae, Sang et al. 2016
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
Current Page :
Number of result pages: 2
Number of documents: 14


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