Rajasekhar Inkulu

15 papers A* 1B 2Journal 10Unranked 2
YearRankTypeTitle / Venue / Authors
2019 J jnl
Minimum weight connectivity augmentation for planar straight-line graphs.
Theor. Comput. Sci.
Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth, Charles R. Winston
2017 B conf
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs.
WALCOM
Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth, Charles R. Winston
2016 J jnl
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs.
CoRR
Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth, Charles R. Winston
2016 J jnl
Two-point L1 shortest path queries in the plane.
J. Comput. Geom.
Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang
2015 J jnl
A polynomial time algorithm for finding an approximate shortest path amid weighted regions.
CoRR
Rajasekhar Inkulu, Sanjiv Kapoor
2015 J jnl
Coresets of obstacles in approximating Euclidean shortest path amid convex obstacles.
CoRR
Rajasekhar Inkulu, Sanjiv Kapoor
2014 J jnl
Two-Point L
CoRR
Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang
2014 A* conf
Two-Point L1 Shortest Path Queries in the Plane.
SoCG
Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang
2010 J jnl
A near optimal algorithm for finding Euclidean shortest path in polygonal domain
CoRR
Rajasekhar Inkulu, Sanjiv Kapoor, S. N. Maheshwari
2010 J jnl
Approximate Shortest Path through a Weighted Planar Subdivision
CoRR
Rajasekhar Inkulu, Sanjiv Kapoor
2009 B conf
How much parallelism is there in irregular applications?
PPoPP
Milind Kulkarni, Martin Burtscher, Rajasekhar Inkulu, Keshav Pingali, Calin Cascaval
2009 J jnl
Planar rectilinear shortest path computation using corridors.
Comput. Geom.
Rajasekhar Inkulu, Sanjiv Kapoor
2009 J jnl
Visibility queries in a polygonal region.
Comput. Geom.
Rajasekhar Inkulu, Sanjiv Kapoor
2007 — conf
Finding a Rectilinear Shortest Path in R
FSTTCS
Rajasekhar Inkulu, Sanjiv Kapoor
2001 — conf
Translational polygon covering using intersection graphs.
CCCG
Karen Daniels, Rajasekhar Inkulu