No. Title Author Year
1 Circumscribing Polygons and Polygonizations for Disjoint Line Segments Akitaya, Hugo A. et al. 2019
2 Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers Akitaya, Hugo A. et al. 2019
3 Convex Hulls in Polygonal Domains Barba, Luis et al. 2018
4 Experimental Study of Compressed Stack Algorithms in Limited Memory Environments Baffier, Jean-François et al. 2018
5 Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain Arseneva, Elena et al. 2018
6 Faster Algorithms for Growing Prioritized Disks and Rectangles Ahn, Hee-Kap et al. 2017
7 High Dimensional Consistent Digital Segments Chiu, Man-Kwun et al. 2017
8 Improved Time-Space Trade-Offs for Computing Voronoi Diagrams Banyassady, Bahareh et al. 2017
9 Routing in Polygonal Domains Banyassady, Bahareh et al. 2017
10 Routing on the Visibility Graph Bose, Prosenjit et al. 2017
11 Computing the L1 Geodesic Diameter and Center of a Polygonal Domain Won Bae, Sang et al. 2016
12 Hanabi is NP-complete, Even for Cheaters who Look at Their Cards Baffier, Jean-Francois et al. 2016
13 On Interference Among Moving Sensors and Related Problems De Carufel, Jean-Lou et al. 2016
14 Packing Short Plane Spanning Trees in Complete Geometric Graphs Aichholzer, Oswin et al. 2016
15 Time-Space Trade-offs for Triangulating a Simple Polygon Aronov, Boris et al. 2016
16 A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon Ahn, Hee Kap et al. 2015
17 Space-Time Trade-offs for Stack-Based Algorithms Barba, Luis et al. 2013
Current Page :
Number of result pages: 1
Number of documents: 17


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