No. Title Author Year
1 Segment Visibility Counting Queries in Polygons Buchin, Kevin et al. 2022
2 Uncertain Curve Simplification Buchin, Kevin et al. 2021
3 Fr├ęchet Distance for Uncertain Curves Buchin, Kevin et al. 2020
4 Kinetic Geodesic Voronoi Diagrams in a Simple Polygon Korman, Matias et al. 2020
5 Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain Arseneva, Elena et al. 2018
6 Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces de Berg, Mark et al. 2017
7 Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points de Berg, Mark 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 Hanabi is NP-complete, Even for Cheaters who Look at Their Cards Baffier, Jean-Francois et al. 2016
11 On Interference Among Moving Sensors and Related Problems De Carufel, Jean-Lou et al. 2016
12 Packing Short Plane Spanning Trees in Complete Geometric Graphs Aichholzer, Oswin et al. 2016
13 Time-Space Trade-offs for Triangulating a Simple Polygon Aronov, Boris et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 13


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