‪David P. Wagner‬ - ‪Google Scholar‬

Get my own profile

Cited by

	All	Since 2019
Citations	58	13
h-index	3	2
i10-index	2	0

0

8

4

20032004200520062007200820092010201120122013201420152016201720182019202020212022202320241 1 4 1 1 5 8 4 1 5 2 5 3 1 2 7 1 1 1 3

Co-authors

Clifford SteinProfessor of IEOR and CS, Columbia UniversityVerified email at ieor.columbia.edu

David P. Wagner

David P. Wagner

Hanyang University

Verified email at hanyang.ac.kr

Path Planning Algorithms Computational Geometry


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Approximation algorithms for the minimum bends traveling salesman problem C Stein?, DP Wagner* International Conference on Integer Programming and Combinatorial …, 2001	34	2001
Path planning algorithms under the link-distance metric DP Wagner	13	2006
An O (n5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions DP Wagner, RS Drysdale, C Stein Computational Geometry 42 (5), 376-387, 2009	8	2009
The Unified Segment Tree and its Application to the Rectangle Intersection Problem DP Wagner Canadian Conference on Computational Geometry, 67-72, 2013	1	2013
An O (n^{5/2} log n) Algorithm for the Rectilinear Minimum Link-Distance Problem in Three Dimensions RS Drysdale, C Stein, DP Wagner	1	2005
Boolean operations with two dimensional segment trees RS Drysdale, DP Wagner	1	2005
The Rectilinear Minimum Bends Path Problem in Three Dimensions DP Wagner, RS Drysdale, C Stein		2002
An O (n5/2 logn) Algorithm for the Rectilinear Minimum Link-Distance Problem in Three Dimensions (Extended Abstract)(Dartmouth Computer Science Technical Report TR2005-538) RS Drysdale, C Stein, DP Wagner
The Rectilinear Minimum Bends Path Problem in Three Dimensions RS Drysdale, C Stein, DP Wagner

The system can't perform the operation now. Try again later.

Articles 1–9