Jeff Abrahamson;Ali Shokoufandeh;Pawel Winter
Department of Computer Science, Drexel University, Philadelphia, PA, USA;Department of Computer Science, Drexel University, Philadelphia, PA, USA;Department of Computer Science, University of Copenhagen, Denmark
Finding the hidden path: time bounds for all-pairs shortest paths
SIAM Journal on Computing
The convex-hull-and-line traveling salesman problem: a solvable case
Information Processing Letters
Euclidean TSP on two polygons
Theoretical Computer Science