Analysis of Greedy Robot-Navigation Methods. - Apurva Mudgal; Craig A. Tovey; Sven Koenig (AI&M, 2004)

Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic. - Apurva Mudgal; Craig A. Tovey; Sam Greenberg; Sven Koenig (SIAM J. Discret. Math., 2005)

A near-tight approximation lower bound and algorithm for the kidnapped robot problem. - Sven Koenig; Apurva Mudgal; Craig A. Tovey (SODA, 2006)

A Near-Tight Approximation Algorithm for the Robot Localization Problem. - Sven Koenig; Joseph S. B. Mitchell; Apurva Mudgal; Craig A. Tovey (SIAM J. Comput., 2009)

Worst-case robot navigation in deterministic environments. - Apurva Mudgal (2009)

Routing vehicles to minimize fuel consumption. - Daya Ram Gaur; Apurva Mudgal; Rishi Ranjan Singh (Oper. Res. Lett., 2013)

Geometric Hitting Set and Set Cover Problem with Half-Strips. - Apurva Mudgal; Supantha Pandit (CCCG, 2014)

Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line. - Apurva Mudgal; Supantha Pandit (COCOA, 2015)

Approximation Algorithms for Cumulative VRP with Stochastic Demands. - Daya Ram Gaur; Apurva Mudgal; Rishi Ranjan Singh (CALDAM, 2016)

Stabbing Line Segments with Disks and Related Problems. - Raghunath Reddy Madireddy; Apurva Mudgal (CCCG, 2016)

Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions. - Apurva Mudgal; Supantha Pandit (Discret. Appl. Math., 2016)

Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems. - Raghunath Reddy Madireddy; Apurva Mudgal; Supantha Pandit (COCOA, 2018)

NP-hardness of geometric set cover and hitting set with rectangles containing a common point. - Raghunath Reddy Madireddy; Apurva Mudgal (Inf. Process. Lett., 2019)

Approximability and hardness of geometric hitting set with axis-parallel rectangles. - Raghunath Reddy Madireddy; Apurva Mudgal (Inf. Process. Lett., 2019)

Improved approximation algorithms for cumulative VRP with stochastic demands. - Daya Ram Gaur; Apurva Mudgal; Rishi Ranjan Singh (Discret. Appl. Math., 2020)

Weighted geometric set cover with rectangles of bounded integer side lengths. - Raghunath Reddy Madireddy; Apurva Mudgal (Discret. Appl. Math., 2022)

A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks. - Raghunath Reddy Madireddy; Apurva Mudgal (Algorithmica, 2023)

Generalized class cover problem with axis-parallel strips. - Apurva Mudgal; Supantha Pandit (Comput. Geom., 2024)

Convexity of near-optimal orthogonal-pair-free sets on the unit sphere. - Apurva Mudgal (CoRR, 2024)

Hardness and Approximation Schemes for Discrete Packing and Domination. - Raghunath Reddy Madireddy; Apurva Mudgal; Supantha Pandit (CoRR, 2025)