No. Title Author Year
1 Augmenting Graphs to Minimize the Radius Gudmundsson, Joachim et al. 2021
2 Approximating the Packedness of Polygonal Curves Gudmundsson, Joachim et al. 2020
3 On β-Plurality Points in Spatial Voting Games Aronov, Boris et al. 2020
4 Local Routing in Sparse and Lightweight Geometric Graphs Ashvinkumar, Vikrant et al. 2019
5 Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements Gaspers, Serge et al. 2017
6 Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons Gudmundsson, Joachim et al. 2017
7 Shortcuts for the Circle Bae, Sang Won et al. 2017
8 Turbocharging Treewidth Heuristics Gaspers, Serge et al. 2017
9 Faster Algorithms for Computing Plurality Points de Berg, Mark et al. 2016
10 Representation, Analysis and Visualization of Moving Objects (Dagstuhl Seminar 12512) Gudmundsson, Joachim et al. 2013
11 10491 Results of the break-out group: Gulls Data van Loon, Emiel et al. 2011
12 10491 Results of the break-out group: Similarity measures Gudmundsson, Joachim et al. 2011
13 09451 Abstracts Collection -- Geometric Networks, Metric Space Embeddings and Spatial Data Mining Das, Gautam et al. 2010
14 06481 Abstracts Collection -- Geometric Networks and Metric Space Embeddings Gudmundsson, Joachim et al. 2007
15 A Simple Algorithm for I/O-efficiently Pruning Dense Spanners Gudmundsson, Joachim et al. 2005
Current Page :
Number of result pages: 1
Number of documents: 15

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