1. S. Gaur, R. Inkulu: Two-point approximate shortest paths among convex polygonal obstacles in the plane.

    2. [under review]

  2. S. Gaur, R. Inkulu: A recursive algorithm for routing amid convex polygonal obstacles in the plane.

    3. [under review]

  3. S. Chandran, R. Inkulu: Local routing on a convex polytope in R3.

    4. [under review]

  4. S. Gaur, R. Inkulu: Routing among convex polygonal obstacles in the plane using a simplified domain.

    5. JoCO, 2026.

  5. H. Chhabra, R. Inkulu: Constant workspace algorithms for computing relative hulls in the plane.

    6. IJCGA, 35(03n04): 51-70, 2025.

  6. S. Gaur, R. Inkulu: A divide-and-conquer based preprocessing for routing in a simple polygon.

    7. JoCO, 50(02): 1-18, 2025.

  7. R. Inkulu, P. Kumar: Routing among convex polygonal obstacles in the plane.

    8. IJFCS, 35(06): 723-739, 2024.

    COCOA, pp 1-11, 2021.

  8. D. Banerjee, R. Inkulu: Vertex guarding for dynamic orthogonal art galleries.

    9. IJCGA, 31(02n03):123–140, 2021.

  9. S. Agrawal, R. Inkulu: Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane.

    10. JoCO, 44:3056-3082, 2022.

    COCOON, pp 136-148, 2020.

  10. R. Inkulu, A. Singh: Vertex fault-tolerant spanners for weighted points in polygonal domains.

    11. DMAA, 15(2):1-18, 2022.

    COCOA, pp 471–485, 2020.

  11. T. Choudhury, R. Inkulu: Computing an L1 shortest path among splinegonal obstacles in the plane.

    12. JoCO, 44:1594–1614, 2020.

    COCOA, pp 169–182, 2018.

  12. T. Choudhury, R. Inkulu: Maintaining the visibility graph of a dynamic simple polygon.

    13. CALDAM, pp 42-52, 2019.

  13. R. Inkulu, K. Sowmya, N. P. Thakur: Dynamic algorithms for visibility polygons in simple polygons.

    14. IJCGA, 30(1):51–78, 2020.

    CALDAM, pp 205–218, 2017.

  14. R. Inkulu, S. Kapoor: Approximate Euclidean shortest paths in polygonal domains.

    15. ISAAC, pp 11:1–11:17, 2019.

  15. S. Bhattacharjee, R. Inkulu: Vertex fault-tolerant geometric spanners for weighted points.

    16. IJCGA, 32(03n04):175-199, 2022.

    COCOON, pp 38-51, 2019.

    CALDAM, pp 29-41, 2019.

  16. H. Akitaya, R. Inkulu, T. Nichols, D. Souvaine, C. Toth: Minimum weight connectivity augmentation for PSLGs.

    17. TCS, 789:50–63, 2019.

    WALCOM, pp 204-216, 2017.

    FWCG, pp 1-2, 2016.

  17. R. Inkulu, S. Kapoor: A polynomial time algorithm for finding an approximate shortest path amid weighted regions.

    18. arXiv 1501.00340, pp 1-25, 2015.   [slides]

  18. D. Z. Chen, R. Inkulu, H. Wang: Two-point L1 shortest path queries in the plane.

    19. JoCG, 7(1):473–519, 2016.

    SoCG, pp 406-415, 2014.

  19. R. Inkulu, S. Kapoor: ANN queries: covering Voronoi diagram with hyperboxes.

    20. WFCG, pp 1-7, 2011.

  20. R. Inkulu, S. Kapoor, S. N. Maheshwari: A near optimal algorithm for finding Euclidean shortest path in polygonal domain.

    21. arXiv 1011.6481, pp 1-50, 2011.   [slides]

  21. R. Inkulu, S. Kapoor: Visibility queries in a polygonal region.

    22. CGTA, 42(9):852–864, 2009.

  22. M. Kulkarni, M. Burtscher, R. Inkulu, K. Pingali, C. Cascaval: How much parallelism is there in irregular applications?.

    23. PPoPP, pp 3–14, 2009.

  23. K. Daniels, R. Inkulu: Translational polygon covering using intersection graphs.

    24. CCCG, pp 61-64, 2007.

  24. R. Inkulu, S. Kapoor: Planar rectilinear shortest path computation using corridors.

    25. CGTA, 42(9):873–884, 2009.

    FSTTCS, pp 412-423, 2007.