Amit Kumar

ORCID

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 80

Top Venues

Publications

Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
Random Separating Hyperplane Theorem and Learning Polytopes. ICALP (2024)
Ragesh Jaiswal, Amit Kumar, Jatin Yadav
FPT Approximation for Capacitated Sum of Radii. ITCS (2024)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
-Taxi Problem. SODA (2024)
Ragesh Jaiswal, Amit Kumar, Jatin Yadav
FPT Approximation for Capacitated Sum of Radii. CoRR (2024)
Ragesh Jaiswal, Amit Kumar
Universal Weak Coreset. AAAI (2024)
Ragesh Jaiswal, Amit Kumar
Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free Reductions. ISAAC (2023)
Ragesh Jaiswal, Amit Kumar
Universal Weak Coreset. CoRR (2023)
Ragesh Jaiswal, Amit Kumar
Clustering What Matters in Constrained Settings. CoRR (2023)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. APPROX/RANDOM (2023)
Jatin Batra, Naveen Garg, Amit Kumar
Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time. SIAM J. Comput. 52 (6) (2023)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. CoRR (2023)
Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
Online Discrepancy with Recourse for Vectors and Graphs. SODA (2022)
Keerti Anand, Rong Ge, Amit Kumar, Debmalya Panigrahi
Online Algorithms with Multiple Predictions. ICML (2022)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
A Hitting Set Relaxation for $k$-Server and an Extension to Time-Windows. FOCS (2022)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
Caching with Time Windows and Delays. SIAM J. Comput. 51 (4) (2022)
Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
Stochastic makespan minimization in structured set systems. Math. Program. 192 (1) (2022)
Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
How many Clusters? - An algorithmic answer. SODA (2022)
Keerti Anand, Rong Ge, Amit Kumar, Debmalya Panigrahi
Online Algorithms with Multiple Predictions. CoRR (2022)
Keerti Anand, Rong Ge, Amit Kumar, Debmalya Panigrahi
A Regression Approach to Learning-Augmented Online Algorithms. CoRR (2022)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
A Hitting Set Relaxation for k-Server and an Extension to Time-Windows. CoRR (2021)
Naveen Garg, Sanjeev Khanna, Amit Kumar
Hardness of Approximation for Orienteering with Multiple Time Windows. SODA (2021)
Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
Online Discrepancy with Recourse for Vectors and Graphs. CoRR (2021)
Anupam Gupta, Amit Kumar, Sahil Singla
Bag-of-Tasks Scheduling on Related Machines. CoRR (2021)
Keerti Anand, Rong Ge, Amit Kumar, Debmalya Panigrahi
A Regression Approach to Learning-Augmented Online Algorithms. NeurIPS (2021)
Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
Finding k in Latent k- polytope. ICML (2021)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
A Hitting Set Relaxation for $k$-Server and an Extension to Time-Windows. FOCS (2021)
Anupam Gupta, Amit Kumar, Sahil Singla
Bag-Of-Tasks Scheduling on Related Machines. APPROX-RANDOM (2021)
Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
Stochastic Load Balancing on Unrelated Machines. Math. Oper. Res. 46 (1) (2021)
Dishant Goyal, Ragesh Jaiswal, Amit Kumar
FPT Approximation for Constrained Metric k-Median/Means. IPEC (2020)
Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
Algorithms for finding k in k-means. CoRR (2020)
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
Online Carpooling Using Expander Decompositions. FSTTCS (2020)
Ragesh Jaiswal, Amit Kumar
Multiplicative Rank-1 Approximation using Length-Squared Sampling. SOSA (2020)
Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
Stochastic Makespan Minimization in Structured Set Systems. CoRR (2020)
Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract). IPCO (2020)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
Caching with Time Windows and Delays. CoRR (2020)
Dishant Goyal, Ragesh Jaiswal, Amit Kumar
FPT Approximation for Constrained Metric k-Median/Means. CoRR (2020)
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
Caching with time windows. STOC (2020)
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
Online Carpooling using Expander Decompositions. CoRR (2020)
Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal, Amit Kumar
On Sampling Based Algorithms for k-Means. FSTTCS (2020)
Dishant Goyal, Ragesh Jaiswal, Amit Kumar
Streaming PTAS for Constrained k-Means. CoRR (2019)
Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li
Tight FPT Approximations for $k$-Median and k-Means. CoRR (2019)
Aakash Agrawal, Krunal Shah, Amit Kumar, Ranveer Chandra
Battery Scheduling Problem. TAMC (2019)
Ragesh Jaiswal, Amit Kumar
Multiplicative Rank-1 Approximation using Length-Squared Sampling. CoRR (2019)
Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li
Tight FPT Approximations for k-Median and k-Means. ICALP (2019)
Naveen Garg, Anupam Gupta, Amit Kumar, Sahil Singla
Non-clairvoyant Precedence Constrained Scheduling. CoRR (2019)
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi
Elastic Caching. SODA (2019)
Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
Stochastic Load Balancing on Unrelated Machines. CoRR (2019)
Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal, Amit Kumar
-Low Rank Approximation. CoRR (2019)
Naveen Garg, Anupam Gupta, Amit Kumar, Sahil Singla
Non-Clairvoyant Precedence Constrained Scheduling. ICALP (2019)
Anupam Gupta, Amit Kumar, Jason Li
Non-Preemptive Flow-Time Minimization via Rejections. CoRR (2018)
Anna Adamaszek, Antonios Antoniadis, Amit Kumar, Tobias Mömke
Approximating Airports and Railways. STACS (2018)
Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
Approximate Clustering with Same-Cluster Queries. ITCS (2018)
Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar
Sampling in Space Restricted Settings. Algorithmica 80 (5) (2018)
Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
Faster Algorithms for the Constrained k-means Problem. Theory Comput. Syst. 62 (1) (2018)
Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae
A Local-Search Algorithm for Steiner Forest. ITCS (2018)
Anamitra Roy Choudhury, Syamantak Das, Naveen Garg, Amit Kumar
Rejecting jobs to minimize load and maximum flow-time. J. Comput. Syst. Sci. 91 (2018)
Jatin Batra, Naveen Garg, Amit Kumar
Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-Polynomial Time. FOCS (2018)
Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
Stochastic Load Balancing on Unrelated Machines. SODA (2018)
Anupam Gupta, Amit Kumar, Jason Li
Non-Preemptive Flow-Time Minimization via Rejections. ICALP (2018)
Jatin Batra, Naveen Garg, Amit Kumar
Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-polynomial time. CoRR (2018)
Björn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, David Wajc
Fully-Dynamic Bin Packing with Little Repacking. ICALP (2018)
Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
Approximate Clustering with Same-Cluster Queries. CoRR (2017)
Aditya Ahuja, Vinay J. Ribeiro, Ranveer Chandra, Amit Kumar
SpectraMap: Efficiently Constructing a Spatio-temporal RF Spectrum Occupancy Map. COMSNETS (Revised Selected Papers and Invited Papers) (2017)
Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar
The Heterogeneous Capacitated k-Center Problem. IPCO (2017)
Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae
A Local-Search Algorithm for Steiner Forest. CoRR (2017)
Anupam Gupta, Guru Guruganesh, Amit Kumar, David Wajc
Fully-Dynamic Bin Packing with Limited Repacking. CoRR (2017)
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi
Online and dynamic algorithms for set cover. STOC (2017)
S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. Algorithmica 77 (2) (2017)
Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar
The Heterogeneous Capacitated $k$-Center Problem. CoRR (2016)
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi
Online and Dynamic Algorithms for Set Cover. CoRR (2016)
Suman Kalyan Bera, Syamantak Das, Amit Kumar
Minimizing average flow-time under knapsack constraint. Theor. Comput. Sci. 609 (2016)
Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
Faster Algorithms for the Constrained k-Means Problem. STACS (2016)
Albert Gu, Anupam Gupta, Amit Kumar
The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online. SIAM J. Comput. 45 (1) (2016)
Anamitra Roy Choudhury, Syamantak Das, Amit Kumar
Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model. FSTTCS (2015)
Ravishankar Krishnaswamy, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal, Barna Saha
Facility Location with Matroid or Knapsack Constraints. Math. Oper. Res. 40 (2) (2015)
Jatin Batra, Naveen Garg, Amit Kumar, Tobias Mömke, Andreas Wiese
New Approximation Schemes for Unsplittable Flow on a Path. SODA (2015)
Anamitra Roy Choudhury, Syamantak Das, Naveen Garg, Amit Kumar
Rejecting jobs to Minimize Load and Maximum Flow-time. SODA (2015)
Anupam Gupta, Amit Kumar
Greedy Algorithms for Steiner Forest. STOC (2015)
Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar
Sampling in Space Restricted Settings. COCOON (2015)
Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
Faster Algorithms for the Constrained k-means Problem. CoRR (2015)
Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy
Approximation algorithms for the partition vertex cover problem. Theor. Comput. Sci. 555 (2014)
Anupam Gupta, Amit Kumar
Online Steiner Tree with Deletions. SODA (2014)
Anupam Gupta, Amit Kumar
Greedy Algorithms for Steiner Forest. CoRR (2014)
Suman Kalyan Bera, Syamantak Das, Amit Kumar
Minimizing Average Flow-Time under Knapsack Constraint. COCOON (2014)
Anamitra Roy Choudhury, Syamantak Das, Naveen Garg, Amit Kumar
Rejecting Jobs to Minimize Load and Maximum Flow-time. CoRR (2014)
Anupam Gupta, Amit Kumar, Cliff Stein
Maintaining Assignments Online: Matching, Scheduling, and Flows. SODA (2014)
Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar
Sampling in Space Restricted Settings. CoRR (2014)
Ragesh Jaiswal, Amit Kumar, Sandeep Sen
A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems. Algorithmica 70 (1) (2014)
Albert Gu, Anupam Gupta, Amit Kumar
The power of deferral: maintaining a constant-competitive steiner tree online. STOC (2013)
Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy
Approximation Algorithms for the Partition Vertex Cover Problem. WALCOM (2013)
Anupam Gupta, Amit Kumar
Online Steiner Tree with Deletions. CoRR (2013)
Albert Gu, Anupam Gupta, Amit Kumar
The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online. CoRR (2013)
S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. ICALP (1) (2013)
Ragesh Jaiswal, Amit Kumar, Sandeep Sen
A simple D^2-sampling based PTAS for k-means and other Clustering Problems CoRR (2012)
S. Anand, Naveen Garg, Amit Kumar
Resource augmentation for weighted flow-time explained by dual fitting. SODA (2012)
Khaled M. Elbassioni, Naveen Garg, Divya Gupta, Amit Kumar, Vishal Narula, Arindam Pal
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees. FSTTCS (2012)
Ragesh Jaiswal, Amit Kumar, Sandeep Sen
A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems. COCOON (2012)
Ravishankar Krishnaswamy, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal, Barna Saha
The Matroid Median Problem. SODA (2011)
Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy
Approximation Algorithms for Edge Partitioned Vertex Cover Problems CoRR (2011)
Yigal Bejerano, Keon-Taek Lee, Seung-Jae Han, Amit Kumar
Single-path routing for life time maximization in multi-hop wireless networks. Wirel. Networks 17 (1) (2011)

Amit Kumar.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Amit Kumar