Concepedia
Statistics
Publications
40
Citations
1.5K
H-Index
21
Active since
1968
Affiliations
Illinois Institute of Technology(Current)
Indian Institute of Technology Delhi
Western Michigan University
University of Illinois Urbana-Champaign
Max Planck Society
Sanjiv Kapoor is an author at Illinois Institute of Technology specializing in computer science, computing, and algorithms.
Publications per year
1968–2012
Rectilinear shortest paths through polygonal obstacles in <i>O</i>(<i>n</i>(log<i>n</i>)<sup>2</sup>) time
Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya · 1987 · 118 citations
Computing, Computer Science, Mathematics +10
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane
Sanjiv Kapoor, Sachin Maheshwari, Joseph S. B. Mitchell · Discrete & Computational Geometry · 1997 · 114 citations · Full text
Computing, Computer Science, Mathematics +13
Efficient computation of geodesic shortest paths
Sanjiv Kapoor · 1999 · 110 citations · Full text
Computing, Computer Science, Algorithms +5
Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
Sanjiv Kapoor, H. Ramesh · SIAM Journal on Computing · 1995 · 108 citations
Computing, Computer Science, Algorithms +15
Fast algorithms for convex quadratic programming and multicommodity flows
Sanjiv Kapoor, Pravin M. Vaidya · 1986 · 93 citations
Computing, Computer Science, Algorithms +8
1–5 of 40