R. Inkulu

27 papers B 1C 3Misc 2Journal 17Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
A divide-and-conquer based preprocessing for routing in a simple polygon.
J. Comb. Optim.
Siddharth Gaur, R. Inkulu
2025 J jnl
Local Routing on a Convex Polytope in R^3.
CoRR
Sreehari Chandran, R. Inkulu
2024 J jnl
Constant Workspace Algorithms for Computing Relative Hulls in the Plane.
CoRR
Himanshu Chhabra, R. Inkulu
2024 J jnl
Routing Among Convex Polygonal Obstacles in the Plane.
Int. J. Found. Comput. Sci.
R. Inkulu, Pawan Kumar
2023 J jnl
Vertex fault-tolerant spanners for weighted points in polygonal domains.
Discret. Math. Algorithms Appl.
R. Inkulu, Apurv Singh
2022 — ed.
Algorithms and Discrete Applied Mathematics - 8th International Conference, CALDAM 2022, Puducherry, India, February 10-12, 2022, Proceedings
CALDAM
Niranjan Balachandran, R. Inkulu
2022 J jnl
Computing an L
J. Comb. Optim.
Tameem Choudhury, R. Inkulu
2022 J jnl
Vertex Fault-Tolerant Geometric Spanners for Weighted Points.
Int. J. Comput. Geom. Appl.
Sukanya Bhattacharjee, R. Inkulu
2022 J jnl
Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane.
J. Comb. Optim.
Sanjana Agrawal, R. Inkulu
2021 C conf
Routing Among Convex Polygonal Obstacles in the Plane.
COCOA
R. Inkulu, Pawan Kumar
2021 J jnl
Vertex Fault-Tolerant Spanners for Weighted Points in Polygonal Domains.
CoRR
R. Inkulu, Apurv Singh
2021 J jnl
Vertex Guarding for Dynamic Orthogonal Art Galleries.
Int. J. Comput. Geom. Appl.
Debangshu Banerjee, R. Inkulu
2020 J jnl
Dynamic Algorithms for Visibility Polygons in Simple Polygons.
Int. J. Comput. Geom. Appl.
R. Inkulu, K. Sowmya, Nitish P. Thakur
2020 J jnl
Vertex Fault-Tolerant Geometric Spanners for Weighted Points.
CoRR
Sukanya Bhattacharjee, R. Inkulu
2020 C conf
Vertex Fault-Tolerant Spanners for Weighted Points in Polygonal Domains.
COCOA
R. Inkulu, Apurv Singh
2020 J jnl
Vertex guarding for dynamic orthogonal art galleries.
CoRR
Debangshu Banerjee, R. Inkulu
2020 Misc conf
Visibility Polygon Queries Among Dynamic Polygonal Obstacles in Plane.
COCOON
Sanjana Agrawal, R. Inkulu
2020 J jnl
Visibility Polygons and Visibility Graphs among Dynamic Polygonal Obstacles in the Plane.
CoRR
Sanjana Agrawal, R. Inkulu
2019 B conf
Approximate Euclidean Shortest Paths in Polygonal Domains.
ISAAC
R. Inkulu, Sanjiv Kapoor
2019 — conf
Fault-Tolerant Additive Weighted Geometric Spanners.
CALDAM
Sukanya Bhattacharjee, R. Inkulu
2019 Misc conf
Geodesic Fault-Tolerant Additive Weighted Spanners.
COCOON
Sukanya Bhattacharjee, R. Inkulu
2019 — conf
Maintaining the Visibility Graph of a Dynamic Simple Polygon.
CALDAM
Tameem Choudhury, R. Inkulu
2018 C conf
Computing a Rectilinear Shortest Path amid Splinegons in Plane.
COCOA
Tameem Choudhury, R. Inkulu
2017 J jnl
Computing a rectilinear shortest path amid splinegons in plane.
CoRR
Tameem Choudhury, R. Inkulu
2017 J jnl
Dynamic algorithms for visibility polygons.
CoRR
R. Inkulu, K. Sowmya
2017 J jnl
Fault-Tolerant Additive Weighted Geometric Spanners.
CoRR
R. Inkulu, Sukanya Bhattacharjee
2017 — conf
Incremental Algorithms to Update Visibility Polygons.
CALDAM
R. Inkulu, Nitish P. Thakur