No. Title Author Year
1 On Flipping the Fréchet Distance Filtser, Omrit et al. 2023
2 Computing β-Stretch Paths in Drawings of Graphs Arkin, Esther M. et al. 2020
3 Cutting Polygons into Small Pieces with Chords: Laser-Based Localization Arkin, Esther M. et al. 2020
4 Planar Bichromatic Bottleneck Spanning Trees Abu-Affash, A. Karim et al. 2020
5 Probing a Set of Trajectories to Maximize Captured Information Fekete, Sándor P. et al. 2020
6 Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint Huang, Chien-Chung et al. 2019
7 Network Optimization on Partitioned Pairs of Points Arkin, Esther M. et al. 2017
8 TSP With Locational Uncertainty: The Adversarial Model Citovsky, Gui et al. 2017
9 Computing the L1 Geodesic Diameter and Center of a Polygonal Domain Won Bae, Sang et al. 2016
10 Universal Guard Problems Fekete, Sándor P. et al. 2016
11 Shortest Path to a Segment and Quickest Visibility Queries Arkin, Esther M. et al. 2015
12 Locating Battery Charging Stations to Facilitate Almost Shortest Paths Arkin, Esther M. et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 12

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