Anurag Murty Naredla

About Me

My research interests are in the field of algorithms and data structures. Until now, I have mostly worked on algorithms that are deterministic, geometric, and exact. However, my interests are not confined by any of these qualifiers.

-------------------

Previously, I was a Postdoctoral Researcher at the University of Bonn (with Heiko Röglin in the Theory Group).

Earlier, I was a Ph.D. student (advised by Anna Lubiw) at the David R. Cheriton School of Computer Science at the University of Waterloo. 

During my Ph.D., I mainly worked on facility location problems in computational geometry. 

My thesis introduced the notion of visibility centers (roughly speaking, determining an optimal location for a guard in an art gallery), and geodesic edge centers (roughly speaking, a point not too far-away from any edge of a simple polygon). I have also worked on dispersion problems (roughly, choosing "far apart" points from a given set of objects) in 1D and 2D.

---------------------

I have a Master's Degree in Computational Science from the Indian Institute of Science, Bangalore. My master's thesis (on parallel algorithms in computational topology) was jointly supervised by Prof. Vijay Natarajan and Prof. Sathish Vadhiyar.

Publications

Faster Approximation Algorithms for k-center via Data Reduction.
ICML 2025
Filtser, Arnold; Jiang, Shaofeng; Li, Yi; Naredla, Anurag Murty; Psarros, Ioannis;

Yang, Qiaoyuan and Zhang, Qin.

The Most Conspicuous Point.
(Manuscript under review)
Frederik Brüning, Anurag Murty Naredla and Eunjin Oh.

Algorithms for the Collaborative Delivery Problem with Monitored Constraints.
WALCOM 2025
Lotte Blank, Kien Huynh, Kelin Luo,  Anurag Murty Naredla

The Geodesic Edge Center of a Simple Polygon. SoCG 2023

Anna Lubiw, Anurag Murty Naredla

Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search. Math-AI Workshop. NeuRIPS 2023, IJCAI 2024
Abbas Mehrabian, Ankit Anand, Hyunjik Kim, Nicolas Sonnerat, Matej Balog, Gheorghe Comanici, Tudor Berariu, Andrew Lee, Anian Ruoss, Anna Bulanova, Daniel Toyama, Sam Blackwell, Bernardino Romera Paredes, Petar Velickovic, Laurent Orseau, Joonkyung Lee, Anurag Murty Naredla, Doina Precup, Adam Zsolt Wagner

Token Swapping on Trees. DMTCS 2022

Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal,
Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte

Shortest Beer Path Queries in Interval Graphs. ISAAC 2022

Rathish Das, Meng He, Eitan Kondratovsky, Ian Munro, Anurag Murty Naredla and Kaiyu Wu.

The Visibility Center of a Simple Polygon. ESA 2021

Anna Lubiw, Anurag Murty Naredla

Distant Representatives for Rectangles in the Plane. ESA 2021

Therese C. Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud

Dispersion for Intervals: A Geometric Approach. SOSA 2021

Therese C. Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud

Reconstructing a Polyhedron between Polygons in Parallel Slices. CCCG 2019

Therese C. Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen D. Merkel, Anurag Murty Naredla

Integral Unit Bar-Visibility Graphs. CCCG 2018

Therese C. Biedl, Ahmad Biniaz, Veronika Irvine, Philipp Kindermann, Anurag Murty Naredla, Alexi Turcotte

Efficient homology computations on multicore and manycore systems.  HiPC 2013

N. Anurag Murty, Vijay Natarajan, Sathish S. Vadhiyar