Translational polygon covering using intersection graphs. - Karen Daniels; Rajasekhar Inkulu (CCCG, 2001)

Finding a Rectilinear Shortest Path in R2 Using Corridor Based Staircase Structures. - Rajasekhar Inkulu; Sanjiv Kapoor (FSTTCS, 2007)

How much parallelism is there in irregular applications? - Milind Kulkarni 001; Martin Burtscher; Rajasekhar Inkulu; Keshav Pingali; Calin Cascaval (PPoPP, 2009)

Visibility queries in a polygonal region. - Rajasekhar Inkulu; Sanjiv Kapoor (Comput. Geom., 2009)

Planar rectilinear shortest path computation using corridors. - Rajasekhar Inkulu; Sanjiv Kapoor (Comput. Geom., 2009)

A near optimal algorithm for finding Euclidean shortest path in polygonal domain - Rajasekhar Inkulu; Sanjiv Kapoor; S. N. Maheshwari (CoRR, 2010)

Approximate Shortest Path through a Weighted Planar Subdivision - Rajasekhar Inkulu; Sanjiv Kapoor (CoRR, 2010)

Two-Point L1 Shortest Path Queries in the Plane. - Danny Z. Chen; Rajasekhar Inkulu; Haitao Wang 001 (CoRR, 2014)

A polynomial time algorithm for finding an approximate shortest path amid weighted regions. - Rajasekhar Inkulu; Sanjiv Kapoor (CoRR, 2015)

Coresets of obstacles in approximating Euclidean shortest path amid convex obstacles. - Rajasekhar Inkulu; Sanjiv Kapoor (CoRR, 2015)

Two-point L1 shortest path queries in the plane. - Danny Z. Chen; Rajasekhar Inkulu; Haitao Wang 001 (J. Comput. Geom., 2016)

Incremental Algorithms to Update Visibility Polygons. - R. Inkulu; Nitish P. Thakur (CALDAM, 2017)

Dynamic algorithms for visibility polygons. - R. Inkulu; K. Sowmya (CoRR, 2017)

Computing a Rectilinear Shortest Path amid Splinegons in Plane. - Tameem Choudhury; R. Inkulu (COCOA, 2018)

Fault-Tolerant Additive Weighted Geometric Spanners. - Sukanya Bhattacharjee; R. Inkulu (CALDAM, 2019)

Maintaining the Visibility Graph of a Dynamic Simple Polygon. - Tameem Choudhury; R. Inkulu (CALDAM, 2019)

Geodesic Fault-Tolerant Additive Weighted Spanners. - Sukanya Bhattacharjee; R. Inkulu (COCOON, 2019)

Approximate Euclidean Shortest Paths in Polygonal Domains. - R. Inkulu; Sanjiv Kapoor (ISAAC, 2019)

Minimum weight connectivity augmentation for planar straight-line graphs. - Hugo A. Akitaya; Rajasekhar Inkulu; Torrie L. Nichols; Diane L. Souvaine; Csaba D. Tóth; Charles R. Winston (Theor. Comput. Sci., 2019)

Visibility Polygon Queries Among Dynamic Polygonal Obstacles in Plane. - Sanjana Agrawal; R. Inkulu (COCOON, 2020)

Dynamic Algorithms for Visibility Polygons in Simple Polygons. - R. Inkulu; K. Sowmya; Nitish P. Thakur (Int. J. Comput. Geom. Appl., 2020)

Vertex Guarding for Dynamic Orthogonal Art Galleries. - Debangshu Banerjee 001; R. Inkulu (Int. J. Comput. Geom. Appl., 2021)

Vertex Fault-Tolerant Geometric Spanners for Weighted Points. - Sukanya Bhattacharjee; R. Inkulu (Int. J. Comput. Geom. Appl., 2022)

Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane. - Sanjana Agrawal; R. Inkulu (J. Comb. Optim., 2022)

Computing an L1 shortest path among splinegonal obstacles in the plane. - Tameem Choudhury; R. Inkulu (J. Comb. Optim., 2022)

Vertex fault-tolerant spanners for weighted points in polygonal domains. - R. Inkulu; Apurv Singh (Discret. Math. Algorithms Appl., 2023)

Constant Workspace Algorithms for Computing Relative Hulls in the Plane. - Himanshu Chhabra; R. Inkulu (CoRR, 2024)

Routing Among Convex Polygonal Obstacles in the Plane. - R. Inkulu; Pawan Kumar (Int. J. Found. Comput. Sci., 2024)