Rajasekhar Inkulu

According to our database, Rajasekhar Inkulu authored at least 27 papers between 2001 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Vertex fault-tolerant spanners for weighted points in polygonal domains.

R. Inkulu, Apurv Singh

Discret. Math. Algorithms Appl., February, 2023

2022

Computing an L₁ shortest path among splinegonal obstacles in the plane.

Tameem Choudhury, R. Inkulu

J. Comb. Optim., 2022

Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane.

Sanjana Agrawal, R. Inkulu

J. Comb. Optim., 2022

Vertex Fault-Tolerant Geometric Spanners for Weighted Points.

Sukanya Bhattacharjee, R. Inkulu

Int. J. Comput. Geom. Appl., 2022

2021

Vertex Guarding for Dynamic Orthogonal Art Galleries.

Debangshu Banerjee, R. Inkulu

Int. J. Comput. Geom. Appl., 2021

Routing Among Convex Polygonal Obstacles in the Plane.

R. Inkulu, Pawan Kumar

Proceedings of the Combinatorial Optimization and Applications, 2021

2020

Dynamic Algorithms for Visibility Polygons in Simple Polygons.

R. Inkulu, K. Sowmya, Nitish P. Thakur

Int. J. Comput. Geom. Appl., 2020

Visibility Polygon Queries Among Dynamic Polygonal Obstacles in Plane.

Sanjana Agrawal, R. Inkulu

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

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

Approximate Euclidean Shortest Paths in Polygonal Domains.

R. Inkulu, Sanjiv Kapoor

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Geodesic Fault-Tolerant Additive Weighted Spanners.

Sukanya Bhattacharjee, R. Inkulu

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Maintaining the Visibility Graph of a Dynamic Simple Polygon.

Tameem Choudhury, R. Inkulu

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

Fault-Tolerant Additive Weighted Geometric Spanners.

Sukanya Bhattacharjee, R. Inkulu

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Computing a Rectilinear Shortest Path amid Splinegons in Plane.

Tameem Choudhury, R. Inkulu

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Dynamic algorithms for visibility polygons.

R. Inkulu, K. Sowmya

CoRR, 2017

Incremental Algorithms to Update Visibility Polygons.

R. Inkulu, Nitish P. Thakur

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Two-point L1 shortest path queries in the plane.

Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang

J. Comput. Geom., 2016

2015

Coresets of obstacles in approximating Euclidean shortest path amid convex obstacles.

Rajasekhar Inkulu, Sanjiv Kapoor

CoRR, 2015

A polynomial time algorithm for finding an approximate shortest path amid weighted regions.

Rajasekhar Inkulu, Sanjiv Kapoor

CoRR, 2015

2014

Two-Point L₁ Shortest Path Queries in the Plane.

Danny Z. Chen, Rajasekhar Inkulu, Haitao Wang

CoRR, 2014

2010

Approximate Shortest Path through a Weighted Planar Subdivision

Rajasekhar Inkulu, Sanjiv Kapoor

CoRR, 2010

A near optimal algorithm for finding Euclidean shortest path in polygonal domain

Rajasekhar Inkulu, Sanjiv Kapoor, S. N. Maheshwari

CoRR, 2010

2009

Planar rectilinear shortest path computation using corridors.

Rajasekhar Inkulu, Sanjiv Kapoor

Comput. Geom., 2009

Visibility queries in a polygonal region.

Rajasekhar Inkulu, Sanjiv Kapoor

Comput. Geom., 2009

How much parallelism is there in irregular applications?

Milind Kulkarni, Martin Burtscher, Rajasekhar Inkulu, Keshav Pingali, Calin Cascaval

Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2009

2007

Finding a Rectilinear Shortest Path in R² Using Corridor Based Staircase Structures.

Rajasekhar Inkulu, Sanjiv Kapoor

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2001

Translational polygon covering using intersection graphs.

Karen Daniels, Rajasekhar Inkulu

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001