No. Title Author Year
1 Euclidean TSP in Narrow Strips Alkema, Henk et al. 2020
2 On β-Plurality Points in Spatial Voting Games Aronov, Boris et al. 2020
3 Preclustering Algorithms for Imprecise Points Abam, Mohammad Ali et al. 2020
4 On One-Round Discrete Voronoi Games de Berg, Mark et al. 2019
5 The Dominating Set Problem in Geometric Intersection Graphs de Berg, Mark et al. 2018
6 Dynamic Conflict-Free Colorings in the Plane de Berg, Mark et al. 2017
7 Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces de Berg, Mark et al. 2017
8 Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points de Berg, Mark et al. 2017
9 Minimum Perimeter-Sum Partitions in the Plane Abrahamsen, Mikkel et al. 2017
10 Range-Clustering Queries Abrahamsen, Mikkel et al. 2017
11 Shortcuts for the Circle Bae, Sang Won et al. 2017
12 Faster Algorithms for Computing Plurality Points de Berg, Mark et al. 2016
13 Fine-Grained Complexity Analysis of Two Classic TSP Variants de Berg, Mark et al. 2016
14 Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes de Berg, Mark et al. 2016
15 10491 Results of the break-out group: Aggregation de Berg, Mark et al. 2011
16 10491 Results of the break-out group: Gulls Data van Loon, Emiel et al. 2011
17 The Traveling Salesman Problem under Squared Euclidean Distances van Nijnatten, Fred et al. 2010
18 Kinetic kd-Trees and Longest-Side kd-Trees Abam, Mohammad et al. 2008
19 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: 19


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