No. Title Author Year
1 On One-Round Discrete Voronoi Games de Berg, Mark et al. 2019
2 The Dominating Set Problem in Geometric Intersection Graphs de Berg, Mark et al. 2018
3 Dynamic Conflict-Free Colorings in the Plane de Berg, Mark et al. 2017
4 Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces de Berg, Mark et al. 2017
5 Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points de Berg, Mark et al. 2017
6 Minimum Perimeter-Sum Partitions in the Plane Abrahamsen, Mikkel et al. 2017
7 Range-Clustering Queries Abrahamsen, Mikkel et al. 2017
8 Shortcuts for the Circle Bae, Sang Won et al. 2017
9 Faster Algorithms for Computing Plurality Points de Berg, Mark et al. 2016
10 Fine-Grained Complexity Analysis of Two Classic TSP Variants de Berg, Mark et al. 2016
11 Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes de Berg, Mark et al. 2016
12 10491 Results of the break-out group: Aggregation de Berg, Mark et al. 2011
13 10491 Results of the break-out group: Gulls Data van Loon, Emiel et al. 2011
14 The Traveling Salesman Problem under Squared Euclidean Distances van Nijnatten, Fred et al. 2010
15 Kinetic kd-Trees and Longest-Side kd-Trees Abam, Mohammad et al. 2008
16 The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree Arge, Lars et al. 2005
Current Page :
Number of result pages: 1
Number of documents: 16


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