Anurag Murty Naredla

Most-cited papers

Token Swapping on Trees
Ahmad Biniaz, Kshitij Jain, A. Lubiw, Z. Masárová +5 more
2019Discrete Mathematics & Theoretical Computer Science19 citations Open access
Semantic Scholar
Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search
Abbas Mehrabian, Ankit Anand, Hyunjik Kim, Nicolas Sonnerat +15 more
2023International Joint Conference on Artificial Intelligence14 citations
Semantic Scholar
Shortest Beer Path Queries in Interval Graphs
Rathish Das, Meng He, Eitan Kondratovsky, J. Munro +2 more
2022International Symposium on Algorithms and Computation6 citations Open access
Semantic Scholar
Dispersion for Intervals: A Geometric Approach
T. Biedl, A. Lubiw, Anurag Murty Naredla, P. D. Ralbovsky +1 more
2021SIAM Symposium on Simplicity in Algorithms5 citations Open access
Semantic Scholar
Faster Approximation Algorithms for k-Center via Data Reduction
Arnold Filtser, Shao-Feng-H.-C. Jiang, Yi Li, Anurag Murty Naredla +3 more
2025International Conference on Machine Learning4 citations
Semantic Scholar
The Visibility Center of a Simple Polygon
A. Lubiw, Anurag Murty Naredla
2021Embedded Systems and Applications4 citations
Semantic Scholar
Separating Two Points with Obstacles in the Plane: Improved Upper and Lower Bounds
Jack Spalding-Jamieson, Anurag Murty Naredla
2025Embedded Systems and Applications2 citations
Semantic Scholar
Distant Representatives for Rectangles in the Plane
T. Biedl, A. Lubiw, Anurag Murty Naredla, P. D. Ralbovsky +1 more
2021Embedded Systems and Applications2 citations
Semantic Scholar
Visibility Queries in Simple Polygons
S. Bhore, Chih-Hung Liu, Anurag Murty Naredla, Yakov Nekrich +5 more
2026International Colloquium on Automata, Languages and Programming1 citations
Semantic Scholar
The Art of Being Difficult: Combining Human and AI Strengths to Find Adversarial Instances for Heuristics
Henri Nikoleit, Ankit Anand, Anurag Murty Naredla, H. Röglin
2026arXiv.org1 citations
Semantic Scholar
Algorithms for the Collaborative Delivery Problem with Monitored Constraints
Lotte Blank, Kien C. Huynh, Ke-Lin Luo, Anurag Murty Naredla
2025Workshop on Algorithms and Computation1 citations
Semantic Scholar
The Geodesic Edge Center of a Simple Polygon
A. Lubiw, Anurag Murty Naredla
2023Discrete & Computational Geometry1 citations Open access
Semantic Scholar
Reconstructing a Polyhedron between Polygons in Parallel Slices
T. Biedl, Pavle Bulatovic, Veronika Irvine, A. Lubiw +2 more
2020Canadian Conference on Computational Geometry0 citations
Semantic Scholar
Integral Unit Bar-Visibility Graphs
T. Biedl, Ahmad Biniaz, Veronika Irvine, Philipp Kindermann +2 more
2018Canadian Conference on Computational Geometry0 citations
Semantic Scholar