No. Title Author Year
1 Nearest-Neighbor Decompositions of Drawings Cleve, Jonas et al. 2022
2 On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem Afshani, Peyman et al. 2022
3 Pushing Blocks by Sweeping Lines A. Akitaya, Hugo et al. 2022
4 Adjacency Graphs of Polyhedral Surfaces Arseneva, Elena et al. 2021
5 Chasing Puppies: Mobile Beacon Routing on Closed Curves Abrahamsen, Mikkel et al. 2021
6 Terrain Prickliness: Theoretical Grounds for High Complexity Viewsheds Acharyya, Ankush et al. 2021
7 Uncertain Curve Simplification Buchin, Kevin et al. 2021
8 Fréchet Distance for Uncertain Curves Buchin, Kevin et al. 2020
9 Trajectory Visibility Eades, Patrick et al. 2020
10 A Manual Comparison of Convex Hull Algorithms (Multimedia Exposition) Löffler, Maarten 2019
11 Computation in Low-Dimensional Geometry and Topology (Dagstuhl Seminar 19352) Löffler, Maarten et al. 2019
12 Geometric Multicut Abrahamsen, Mikkel et al. 2019
13 Global Curve Simplification van de Kerkhof, Mees et al. 2019
14 Preprocessing Ambiguous Imprecise Points van der Hoog, Ivor et al. 2019
15 An Experimental Comparison of Two Definitions for Groups of Moving Entities (Short Paper) Wiratma, Lionov et al. 2018
16 Convex Partial Transversals of Planar Regions Keikha, Vahideh et al. 2018
17 Dynamic Smooth Compressed Quadtrees van der Hoog, Ivor et al. 2018
18 On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance van Kreveld, Marc et al. 2018
19 Applications of Topology to the Analysis of 1-Dimensional Objects (Dagstuhl Seminar 17072) Burton, Benjamin et al. 2017
20 Folding Free-Space Diagrams: Computing the Fréchet Distance between 1-Dimensional Curves (Multimedia Contribution) Buchin, Kevin et al. 2017
21 A Refined Definition for Groups of Moving Entities and its Computation van Kreveld, Marc et al. 2016
22 Grouping Time-Varying Data for Interactive Exploration van Goethem, Arthur et al. 2016
23 Homotopy Measures for Representative Trajectories Chambers, Erin et al. 2016
24 On the Complexity of Minimum-Link Path Problems Kostitsyna, Irina et al. 2016
25 Recognizing a DOG is Hard, But Not When It is Thin and Unit Evans, William et al. 2016
26 Trajectory Grouping Structure under Geodesic Distance Kostitsyna, Irina et al. 2015
27 Listing all maximal cliques in sparse graphs in near-optimal time Eppstein, David et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 27


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