Prahlad Narasimhan Kasthurirangan

According to our database, Prahlad Narasimhan Kasthurirangan authored at least 8 papers between 2021 and 2026.

Collaborative distances:

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

2026

Line Segment Visibility in Simple Polygons: Exact, Robust, Scalable Computation and Applications.

Sándor P. Fekete, Prahlad Narasimhan Kasthurirangan, Phillip Keldenich, Fabian Kollhoff, Chek-Manh Loi, Michael Perk

Proceedings of the 42nd International Symposium on Computational Geometry, 2026

Covering and Partitioning Complex Objects with Small Pieces.

Anders Aamand, Mikkel Abrahamsen, Reilly Browne, Mayank Goswami, Prahlad Narasimhan Kasthurirangan, Linda Kleist, Joseph S. B. Mitchell, Valentin Polishchuk, Jack Stade

Proceedings of the 42nd International Symposium on Computational Geometry, 2026

2025

Provable Methods for Searching with an Imperfect Sensor.

Prahlad Narasimhan Kasthurirangan, Linh Nguyen, Michael Perk, Nilanjan Chakraborty, Joseph S. B. Mitchell

Proceedings of the IEEE International Conference on Robotics and Automation, 2025

2024

One-sided terrain guarding and chordal graphs.

Prahlad Narasimhan Kasthurirangan

Discret. Appl. Math., 2024

2023

Dominator Coloring and CD Coloring in Almost Cluster Graphs.

Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple Polygon.

Reilly Browne, Prahlad Narasimhan Kasthurirangan, Joseph S. B. Mitchell, Valentin Polishchuk

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Dominator Coloring Parameterized by Cluster Vertex Deletion Number.

Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman

CoRR, 2022

2021

One-Sided Discrete Terrain Guarding and Chordal Graphs.

Prahlad Narasimhan Kasthurirangan

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021