R. Inkulu

Pawan Kumar

Int. J. Found. Comput. Sci., September, 2024

2023

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

[BibT_eX]

[DOI]

Apurv Singh

Discret. Math. Algorithms Appl., February, 2023

2022

Computing an L1 shortest path among splinegonal obstacles in the plane.

[BibT_eX]

[DOI]

Tameem Choudhury

J. Comb. Optim., 2022

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

[BibT_eX]

[DOI]

Sanjana Agrawal

J. Comb. Optim., 2022

Vertex Fault-Tolerant Geometric Spanners for Weighted Points.

[BibT_eX]

[DOI]

Sukanya Bhattacharjee

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

2021

Vertex Guarding for Dynamic Orthogonal Art Galleries.

[BibT_eX]

[DOI]

Debangshu Banerjee

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

2020

Dynamic Algorithms for Visibility Polygons in Simple Polygons.

[BibT_eX]

[DOI]

K. Sowmya

Nitish P. Thakur

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

Visibility Polygon Queries Among Dynamic Polygonal Obstacles in Plane.

[BibT_eX]

[DOI]

Sanjana Agrawal

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

2019

Minimum weight connectivity augmentation for planar straight-line graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Approximate Euclidean Shortest Paths in Polygonal Domains.

[BibT_eX]

[DOI]

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

Geodesic Fault-Tolerant Additive Weighted Spanners.

[BibT_eX]

[DOI]

Sukanya Bhattacharjee

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

Maintaining the Visibility Graph of a Dynamic Simple Polygon.

[BibT_eX]

[DOI]

Tameem Choudhury

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

Fault-Tolerant Additive Weighted Geometric Spanners.

[BibT_eX]

[DOI]

Sukanya Bhattacharjee

Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018

Computing a Rectilinear Shortest Path amid Splinegons in Plane.

[BibT_eX]

[DOI]

Tameem Choudhury

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

Dynamic algorithms for visibility polygons.

[BibT_eX]

[DOI]

K. Sowmya

CoRR, 2017

Incremental Algorithms to Update Visibility Polygons.

[BibT_eX]

[DOI]

Nitish P. Thakur

Proceedings of the Algorithms and Discrete Applied Mathematics, 2017

2016

Two-point L1 shortest path queries in the plane.

[BibT_eX]

[DOI]

Danny Z. Chen

Haitao Wang

J. Comput. Geom., 2016

2015

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

[BibT_eX]

[DOI]

CoRR, 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

2014

Two-Point L1 Shortest Path Queries in the Plane.

[BibT_eX]

[DOI]

Danny Z. Chen

Haitao Wang

CoRR, 2014

2010

Approximate Shortest Path through a Weighted Planar Subdivision

[BibT_eX]

[DOI]

CoRR, 2010

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

[BibT_eX]

[DOI]

S. N. Maheshwari

CoRR, 2010

2009

Planar rectilinear shortest path computation using corridors.

[BibT_eX]

[DOI]

Comput. Geom., 2009

Visibility queries in a polygonal region.

[BibT_eX]

[DOI]

Comput. Geom., 2009

How much parallelism is there in irregular applications?

[BibT_eX]

[DOI]

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

2007

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

[BibT_eX]

[DOI]

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

2001

Translational polygon covering using intersection graphs.

[BibT_eX]

[DOI]

Karen Daniels