☰

Anupam Gupta - Publications

Affiliations: 
2000 University of California, Berkeley, Berkeley, CA, United States 
Tree Info Similar researchers PubMed Report error

38 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2023 Zhu H, Gupta AK, Wu X, Goldsworthy M, Wang R, Mikkilineni M, Müller R. A validation study for a bat-inspired sonar sensing simulator. Plos One. 18: e0280631. PMID 36662796 DOI: 10.1371/journal.pone.0280631  0.383
2019 Sidiropoulos A, Badoiu M, Dhamdhere K, Gupta A, Indyk P, Rabinovich Y, Racke H, Ravi R. Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces Siam Journal On Discrete Mathematics. 33: 454-473. DOI: 10.1137/17M1113527  0.41
2019 Abraham I, Gavoille C, Gupta A, Neiman O, Talwar K. Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs Siam Journal On Computing. 48: 1120-1145. DOI: 10.1137/17M1112406  0.378
2018 Bansal N, Gupta A, Guruganesh G. On the Lovász Theta Function for Independent Sets in Sparse Graphs Siam Journal On Computing. 47: 1039-1055. DOI: 10.1137/15M1051002  0.395
2017 Gupta A, Nagarajan V, Ravi R. Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems Mathematics of Operations Research. 42: 876-896. DOI: 10.1287/Moor.2016.0831  0.421
2016 Math SB, Gupta A, Yadav R, Shukla D. The rights of persons with disability bill, 2014: Implications for neurological disability. Annals of Indian Academy of Neurology. 19: S28-S33. PMID 27891022 DOI: 10.4103/0972-2327.192884  0.316
2016 Gupta A, Molinaro M. How the Experts Algorithm Can Help Solve LPs Online Mathematics of Operations Research. 41: 1404-1431. DOI: 10.1287/Moor.2016.0782  0.302
2016 Friggstad Z, Gupta A, Singh M. An improved integrality gap for asymmetric TSP paths Mathematics of Operations Research. 41: 745-757. DOI: 10.1287/Moor.2015.0752  0.322
2016 Babenko M, Goldberg AV, Gupta A, Nagarajan V. Algorithms for Hub Label Optimization Acm Transactions On Algorithms. 13: 16. DOI: 10.1145/2996593  0.328
2016 Gu A, Gupta A, Kumar A. The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online Siam Journal On Computing. 45: 1-28. DOI: 10.1137/140955276  0.332
2015 Gupta A, Krishnaswamy R, Nagarajan V, Ravi R. Running Errands in Time: Approximation Algorithms for Stochastic Orienteering Mathematics of Operations Research. 40: 56-79. DOI: 10.1287/Moor.2014.0656  0.307
2014 Gupta A, Nagarajan V. Approximating sparse covering integer programs online Mathematics of Operations Research. 39: 998-1011. DOI: 10.1287/Moor.2014.0652  0.327
2014 Englert M, Gupta A, Krauthgamer R, R̈acke H, Talgam-Cohen I, Talwar K. Vertex sparsifiers: New results from old techniques Siam Journal On Computing. 43: 1239-1262. DOI: 10.1137/130908440  0.305
2014 Bansal N, Buchbinder N, Gupta A, Naor J(. A randomized O ( log^2 k )-competitive algorithm for metric bipartite matching Algorithmica. 68: 390-403. DOI: 10.1007/S00453-012-9676-9  0.312
2014 Blelloch GE, Gupta A, Koutis I, Miller GL, Peng R, Tangwongsan K. Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs Theory of Computing Systems. 55: 521-554. DOI: 10.1007/S00224-013-9444-5  0.72
2013 Gupta A, Hardt M, Roth A, Ullman J. Privately releasing conjunctions and the statistical Quer y Barrier Siam Journal On Computing. 42: 1494-1520. DOI: 10.1137/110857714  0.302
2012 Gupta A, Krishnaswamy R, Ravi R. Online and Stochastic Survivable Network Design Siam Journal On Computing. 41: 1649-1672. DOI: 10.1137/09076725X  0.349
2012 Chan T-H, Gupta A. Approximating TSP on Metrics with Bounded Global Growth Siam Journal On Computing. 41: 587-617. DOI: 10.1137/090749396  0.34
2011 Chekuri C, Even G, Gupta A, Segev D. Set connectivity problems in undirected graphs and the directed steiner network problem Acm Transactions On Algorithms. 7. DOI: 10.1145/1921659.1921664  0.359
2011 Gupta A, Pál M, Ravi R, Sinha A. Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems Siam Journal On Computing. 40: 1361-1401. DOI: 10.1137/080732250  0.303
2011 Bansal N, Gupta A, Li J, Mestre J, Nagarajan V, Rudra A. When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings Algorithmica (New York). 1-30. DOI: 10.1007/S00453-011-9511-8  0.33
2011 Gupta A, Talwar K. Making doubling metrics geodesic Algorithmica (New York). 59: 66-80. DOI: 10.1007/S00453-010-9397-X  0.329
2010 Chan THH, Gupta A, Talwar K. Ultra-low-dimensional embeddings for doubling metrics Journal of the Acm. 57. DOI: 10.1145/1734213.1734215  0.303
2010 Gupta A, Hajiaghayi M, Nagarajan V, Ravi R. Dial a Ride from k -forest Acm Transactions On Algorithms. 6: 41. DOI: 10.1145/1721837.1721857  0.336
2010 Gupta A, Nagarajan V, Ravi R. An improved approximation algorithm for requirement cut Operations Research Letters. 38: 322-325. DOI: 10.1016/J.Orl.2010.02.009  0.335
2009 Chan THH, Dhamdhere K, Gupta A, Kleinberg J, Slivkins A. Metric embeddings with relaxed guarantees Siam Journal On Computing. 38: 2303-2329. DOI: 10.1137/060670511  0.309
2008 Chuzhoy J, Gupta A, Naor J, Sinha A. On the approximability of some network design problems Acm Transactions On Algorithms. 4. DOI: 10.1145/1361192.1361200  0.316
2007 Gupta A, Ravi R, Sinha A. LP Rounding Approximation Algorithms for Stochastic Network Design Mathematics of Operations Research. 32: 345-364. DOI: 10.1287/Moor.1060.0237  0.303
2007 Gupta A, Kumar A, Pál M, Roughgarden T. Approximation via cost sharing: Simpler and better approximation algorithms for network design Journal of the Acm. 54. DOI: 10.1145/1236457.1236458  0.321
2006 Gupta A, Srinivasan A. Theory of Computing. 2: 53-64. DOI: 10.4086/Toc.2006.V002A003  0.3
2006 Chekuri C, Gupta A, Newman I, Rabinovich Y, Sinclair A. Embedding k-outerplanar graphs into l1 Siam Journal On Discrete Mathematics. 20: 119-136. DOI: 10.1137/S0895480102417379  0.563
2006 Dhamdhere K, Gupta A, Ravi R. Approximation Algorithms for Minimizing Average Distortion Theory of Computing Systems \/ Mathematical Systems Theory. 39: 93-111. DOI: 10.1007/S00224-005-1259-6  0.307
2005 Gupta A, Kumar A, Rastogi R. Traveling with a Pez Dispenser (or, Routing Issues in MPLS) Siam Journal On Computing. 34: 453-474. DOI: 10.1137/S0097539702409927  0.31
2005 Chekuri C, Gupta A, Kumar A. On a bidirected relaxation for the MULTIWAY CUT problem Discrete Applied Mathematics. 150: 67-79. DOI: 10.1016/J.Dam.2005.04.003  0.315
2004 Gupta A, Newman I, Rabinovich Y, Sinclair A. Cuts, Trees and ℓ 1 -Embeddings of Graphs* Combinatorica. 24: 233-269. DOI: 10.1007/S00493-004-0015-X  0.561
2002 Chakrabarti A, Chekuri C, Gupta A, Kumar A. Approximation algorithms for the unsplittable flow problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2462: 51-67. DOI: 10.1007/S00453-006-1210-5  0.376
2002 Chakrabarti A, Chekuri C, Gupta A, Kumar A. Approximation Algorithms for the Unsplittable Flow Problem Lecture Notes in Computer Science. 51-66. DOI: 10.1007/3-540-45753-4_7  0.378
2001 Gupta A. Improved Bandwidth Approximation for Trees and Chordal Graphs Journal of Algorithms. 40: 24-36. DOI: 10.1006/Jagm.2000.1118  0.353
Show low-probability matches.