Items where Author is "Gupta, Anupam"

Article

Gupta, Anupam ; Krishnaswamy, Ravishankar ; Kumar, Amit ; Segev, Danny (2009) Scheduling with Outliers Lecture Notes in Computer Science, 5687 . pp. 149-162. ISSN 0302-9743

Srivastava, Abhishek ; Taly, Arun B. ; Gupta, Anupam ; Murali, Thyloth ; Noone, Mohan L. ; Thirthahalli, Jagadisha ; Gangadhar, B. N. ; Kumar, J. Keshav ; Jayakumar, P. N. (2008) Stroke with supernumerary phantom limb: case study, review of literature and pathogenesis Acta Neuropsychiatrica, 20 (5). pp. 256-264. ISSN 0924-2708

Chakrabarti, Amit ; Chekuri, Chandra ; Gupta, Anupam ; Kumar, Amit (2007) Approximation Algorithms for the Unsplittable Flow Problem Algorithmica, 47 (1). pp. 53-78. ISSN 0178-4617

Gupta, Anupam ; Hajiaghayi, MohammadTaghi ; Kumar, Amit (2007) Stochastic Steiner Tree with Non-uniform Inflation Lecture Notes in Computer Science, 4627 . pp. 134-148. ISSN 0302-9743

Chekuri, Chandra ; Gupta, Anupam ; Kumar, Amit (2005) On a bidirected relaxation for the MULTIWAY CUT problem Discrete Applied Mathematics, 150 (1-3). pp. 67-79. ISSN 0166-218X

Gupta, Anupam ; Kumar, Amit (2005) Where’s the Winner? Max-Finding and Sorting with Metric Costs Lecture Notes in Computer Science, 3624 . pp. 74-85. ISSN 0302-9743

Conference or Workshop Item

Gupta, Anupam ; Kumar, Amit ; Panigrahi, Debmalya (2020) Caching with time windows In: STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, June 22 - 26, 2020, Chicago IL USA.

Gupta, Anupam ; Krishnaswamy, Ravishankar ; Kumar, Amit ; Singla, Sahil (2020) Online Carpooling using Expander Decompositions In: 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020).

Gupta, Anupam ; Kumar, Amit ; Nagarajan, Viswanath ; Shen, Xiangkun (2020) Stochastic Makespan Minimization in Structured Set Systems In: Integer Programming and Combinatorial Optimization, June 8–10, 2020, London, UK.

Garg, Naveen ; Gupta, Anupam ; Kumar, Amit ; Singla, Sahil (2019) Non-clairvoyant precedence constrained scheduling In: 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, Jul 9 2019 → Jul 12 2019, Patras, Greece.

Gupta, Anupam ; Krishnaswamy, Ravishankar ; Kumar, Amit ; Panigrahi, Debmalya (2019) Elastic Caching In: Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan 6-9, 2019, California, USA.

Gupta, Anupam ; Kumar, Amit ; Nagarajan, Viswanath ; Shen, Xiangkun (2019) Stochastic Load Balancing on Unrelated Machines In: ACM-SIAM Symposium on Discrete Algorithms (SODA).

Cohen-Addad, Vincent ; Gupta, Anupam ; Kumar, Amit ; Lee, Euiwoong ; Li, Jason (2019) Tight FPT Approximations for k-Median and k-Means In: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), 8-12 July 2019, Patras, Greece.

Gupta, Anupam ; Guruganesh, Guru ; Kumar, Amit ; Wajc, David (2018) Fully-Dynamic Bin Packing with Limited Repacking In: International Colloquium on Automata, Languages and Programming (ICALP), July 9-13, 2018, Prague, Czech Republic.

Groß, Martin ; Gupta, Anupam ; Kumar, Amit ; Matuschke, Jannik ; Schmidt, Daniel R. ; Schmidt, Melanie ; Verschae, José (2018) A Local-Search Algorithm for Steiner Forest In: Innovations in Theoretical Computer Science (ITCS), January 11-14, 2018, Massachusetts, USA.

Gupta, Anupam ; Kumar, Amit ; Li, Jason (2018) Non-Preemptive Flow-Time Minimization via Rejections In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018).

Gupta, Anupam ; Krishnaswamy, Ravishankar ; Kumar, Amit ; Panigrahi, Debmalya (2017) Online and dynamic algorithms for set cover In: STOC 2017: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, June 19 - 23, 2017, Montreal, Canada.

Gupta, Anupam ; Kumar, Amit (2015) Greedy Algorithms for Steiner Forest In: STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing, June 14 - 17, 2015, Portland, Oregon USA.

Gupta, Anupam ; Kumar, Amit ; Stein, Cliff (2013) Maintaining Assignments Online: Matching, Scheduling, and Flows In: Proceedings of the 2014 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).

Gupta, Anupam ; Kumar, Amit (2013) Online Steiner Tree with Deletions In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 2014.

Gupta, Anupam ; Kumar, Amit (2009) A constant-factor approximation for stochastic Steiner forest In: STOC '09: Proceedings of the forty-first annual ACM symposium on Theory of computing, 31 May 2009- 2 June 2009, Bethesda MD USA.

Golovin, Daniel ; Gupta, Anupam ; Kumar, Amit ; Tangwongsan, Kanat (2008) All-Norms and All-L_p-Norms Approximation Algorithms In: Foundations of Software Technology and Theoretical Computer Science (Bangalore) 2008, 2008.

Breitbart, Yuri ; Garofalakis, Minos ; Gupta, Anupam ; Kumar, Amit ; Rastogi, Rajeev (2007) On Configuring BGP Route Reflectors In: 2007 2nd International Conference on Communication Systems Software and Middleware, 7-12 January 2007, Bangalore, India.

Gupta, Anupam ; Kumar, Amit ; Rastogi, Rajeev (2003) Exploring the trade-off between label size and stack depth in MPLS routing In: IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), 30 March-3 April 2003, San Francisco, CA, USA.

Gupta, Anupam ; Kumar, Amit ; Roughgarden, Tim (2003) Simpler and better approximation algorithms for network design In: STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 9 - 11, 2003, San Diego CA USA.

Gupta, Anupam ; Kleinberg, Jon ; Kumar, Amit ; Rastogi, Rajeev ; Yener, Bulent (2001) Provisioning a virtual private network In: STOC '01: Proceedings of the thirty-third annual ACM symposium on Theory of computing.

Gu, Albert ; Gupta, Anupam ; Kumar, Amit (1982) The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online In: STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing.