default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDApurva Mudgal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Apurva Mudgal, Supantha Pandit
:
Generalized class cover problem with axis-parallel strips. Comput. Geom. 119: 102065 (2024)- [i1]Apurva Mudgal:
Convexity of near-optimal orthogonal-pair-free sets on the unit sphere. CoRR abs/2403.18404 (2024) - 2023
- [j9]Raghunath Reddy Madireddy, Apurva Mudgal:
A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks. Algorithmica 85(1): 100-132 (2023) - 2022
- [j8]Raghunath Reddy Madireddy, Apurva Mudgal:
Weighted geometric set cover with rectangles of bounded integer side lengths. Discret. Appl. Math. 315: 36-55 (2022) - 2021
- [e1]Apurva Mudgal, C. R. Subramanian:
Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings. Lecture Notes in Computer Science 12601, Springer 2021, ISBN 978-3-030-67898-2 [contents] - 2020
- [j7]Daya Ram Gaur, Apurva Mudgal, Rishi Ranjan Singh:
Improved approximation algorithms for cumulative VRP with stochastic demands. Discret. Appl. Math. 280: 133-143 (2020) - [c9]Raghunath Reddy Madireddy, Apurva Mudgal:
A Constant-Factor Approximation Algorithm for Red-Blue Set Cover with Unit Disks. WAOA 2020: 204-219
2010 – 2019
- 2019
- [j6]Raghunath Reddy Madireddy, Apurva Mudgal:
NP-hardness of geometric set cover and hitting set with rectangles containing a common point. Inf. Process. Lett. 141: 1-8 (2019) - [j5]Raghunath Reddy Madireddy, Apurva Mudgal:
Approximability and hardness of geometric hitting set with axis-parallel rectangles. Inf. Process. Lett. 141: 9-15 (2019) - 2018
- [c8]Raghunath Reddy Madireddy, Apurva Mudgal, Supantha Pandit:
Hardness Results and Approximation Schemes for Discrete Packing and Domination Problems. COCOA 2018: 421-435 - 2016
- [j4]Apurva Mudgal, Supantha Pandit:
Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions. Discret. Appl. Math. 211: 143-162 (2016) - [c7]Daya Ram Gaur, Apurva Mudgal, Rishi Ranjan Singh:
Approximation Algorithms for Cumulative VRP with Stochastic Demands. CALDAM 2016: 176-189 - [c6]Raghunath Reddy Madireddy, Apurva Mudgal:
Stabbing Line Segments with Disks and Related Problems. CCCG 2016: 201-207 - 2015
- [c5]Apurva Mudgal, Supantha Pandit:
Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line. COCOA 2015: 126-137 - 2014
- [c4]Apurva Mudgal, Supantha Pandit:
Geometric Hitting Set and Set Cover Problem with Half-Strips. CCCG 2014 - [c3]Apurva Mudgal, Supantha Pandit:
Generalized Class Cover Problem with Axis-Parallel Strips. WALCOM 2014: 8-21 - 2013
- [j3]Daya Ram Gaur, Apurva Mudgal, Rishi Ranjan Singh:
Routing vehicles to minimize fuel consumption. Oper. Res. Lett. 41(6): 576-580 (2013)
2000 – 2009
- 2009
- [j2]Sven Koenig, Joseph S. B. Mitchell, Apurva Mudgal, Craig A. Tovey:
A Near-Tight Approximation Algorithm for the Robot Localization Problem. SIAM J. Comput. 39(2): 461-490 (2009) - 2006
- [c2]Sven Koenig, Apurva Mudgal, Craig A. Tovey:
A near-tight approximation lower bound and algorithm for the kidnapped robot problem. SODA 2006: 133-142 - 2005
- [j1]Apurva Mudgal, Craig A. Tovey, Sam Greenberg, Sven Koenig:
Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic. SIAM J. Discret. Math. 19(2): 431-447 (2005) - 2004
- [c1]Apurva Mudgal, Craig A. Tovey, Sven Koenig:
Analysis of Greedy Robot-Navigation Methods. AI&M 2004
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
