Amit Kumar - RankMe

183 papers A* 57A 10B 11C 1Misc 3Journal 78Unranked 22

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	An Optimal Online Algorithm for Robust Flow Time Scheduling. SODA Anupam Gupta, Amit Kumar, Debmalya Panigrahi, Zhaozi Wang
2026	A	`conf`	Efficient Algorithms for the Disjoint Shortest Paths Problem and Its Extensions. ITCS Keerti Choudhary, Amit Kumar, Lakshay Saggi
2026	J	`jnl`	FPT approximation for capacitated sum of radii. J. Comput. Syst. Sci. Ragesh Jaiswal, Amit Kumar, Jatin Yadav
2026	J	`jnl`	Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems. CoRR Sujoy Bhore, Anupam Gupta, Amit Kumar
2026	J	`jnl`	Learning-Augmented Algorithms for k-median via Online Learning. CoRR Anish Hebbar, Rong Ge, Amit Kumar, Debmalya Panigrahi
2025	J	`jnl`	Clustering What Matters in Constrained Settings. Algorithmica Ragesh Jaiswal, Amit Kumar
2025	J	`jnl`	Efficient Algorithms for Disjoint Shortest Paths Problem and its Extensions. CoRR Keerti Choudhary, Amit Kumar, Lakshay Saggi
2025	A*	`conf`	Robust-Sorting and Applications to Ulam-Median. ICALP Ragesh Jaiswal, Amit Kumar, Jatin Yadav
2025	J	`jnl`	Robust-Sorting and Applications to Ulam-Median. CoRR Ragesh Jaiswal, Amit Kumar, Jatin Yadav
2025	A*	`conf`	Tight Results for Online Convex Paging. STOC Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2024	A	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2024, London School of Economics, London, UK, August 28-30, 2024 APPROX/RANDOM Amit Kumar, Noga Ron-Zewi
2024	A*	`conf`	Centralized Selection with Preferences in the Presence of Biases. ICML L. Elisa Celis, Amit Kumar, Nisheeth K. Vishnoi, Andrew Xu
2024	J	`jnl`	Centralized Selection with Preferences in the Presence of Biases. CoRR L. Elisa Celis, Amit Kumar, Nisheeth K. Vishnoi, Andrew Xu
2024	A	`conf`	FPT Approximation for Capacitated Sum of Radii. ITCS Ragesh Jaiswal, Amit Kumar, Jatin Yadav
2024	J	`jnl`	FPT Approximation for Capacitated Sum of Radii. CoRR Ragesh Jaiswal, Amit Kumar, Jatin Yadav
2024	A*	`conf`	Poly-logarithmic Competitiveness for the SODA Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2024	A*	`conf`	Random Separating Hyperplane Theorem and Learning Polytopes. ICALP Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
2024	A*	`conf`	Universal Weak Coreset. AAAI Ragesh Jaiswal, Amit Kumar
2023	A*	`conf`	Bias in Evaluation Processes: An Optimization-Based Model. NeurIPS L. Elisa Celis, Amit Kumar, Anay Mehrotra, Nisheeth K. Vishnoi
2023	J	`jnl`	Bias in Evaluation Processes: An Optimization-Based Model. CoRR L. Elisa Celis, Amit Kumar, Anay Mehrotra, Nisheeth K. Vishnoi
2023	J	`jnl`	Clustering What Matters in Constrained Settings. CoRR Ragesh Jaiswal, Amit Kumar
2023	B	`conf`	Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free Reductions. ISAAC Ragesh Jaiswal, Amit Kumar
2023	J	`jnl`	Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time. SIAM J. Comput. Jatin Batra, Naveen Garg, Amit Kumar
2023	A	`conf`	Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. APPROX/RANDOM Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2023	J	`jnl`	Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. CoRR Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2023	J	`jnl`	Random Separating Hyperplane Theorem and Learning Polytopes. CoRR Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
2023	J	`jnl`	Universal Weak Coreset. CoRR Ragesh Jaiswal, Amit Kumar
2022	J	`jnl`	A Regression Approach to Learning-Augmented Online Algorithms. CoRR Keerti Anand, Rong Ge, Amit Kumar, Debmalya Panigrahi
2022	J	`jnl`	Caching with Time Windows and Delays. SIAM J. Comput. Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2022	A*	`conf`	How many Clusters? - An algorithmic answer. SODA Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
2022	A*	`conf`	Online Algorithms with Multiple Predictions. ICML Keerti Anand, Rong Ge, Amit Kumar, Debmalya Panigrahi
2022	J	`jnl`	Online Algorithms with Multiple Predictions. CoRR Keerti Anand, Rong Ge, Amit Kumar, Debmalya Panigrahi
2022	A*	`conf`	Online Discrepancy with Recourse for Vectors and Graphs. SODA Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
2022	J	`jnl`	Stochastic makespan minimization in structured set systems. Math. Program. Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
2021	A*	`conf`	A Hitting Set Relaxation for $k$-Server and an Extension to Time-Windows. FOCS Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2021	J	`jnl`	A Hitting Set Relaxation for k-Server and an Extension to Time-Windows. CoRR Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2021	A*	`conf`	A Regression Approach to Learning-Augmented Online Algorithms. NeurIPS Keerti Anand, Rong Ge, Amit Kumar, Debmalya Panigrahi
2021	—	`conf`	Bag-Of-Tasks Scheduling on Related Machines. APPROX-RANDOM Anupam Gupta, Amit Kumar, Sahil Singla
2021	J	`jnl`	Bag-of-Tasks Scheduling on Related Machines. CoRR Anupam Gupta, Amit Kumar, Sahil Singla
2021	A*	`conf`	Finding k in Latent k- polytope. ICML Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
2021	A*	`conf`	Hardness of Approximation for Orienteering with Multiple Time Windows. SODA Naveen Garg, Sanjeev Khanna, Amit Kumar
2021	J	`jnl`	Online Discrepancy with Recourse for Vectors and Graphs. CoRR Anupam Gupta, Vijaykrishna Gurunathan, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
2021	J	`jnl`	Stochastic Load Balancing on Unrelated Machines. Math. Oper. Res. Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
2020	J	`jnl`	Algorithms for finding k in k-means. CoRR Chiranjib Bhattacharyya, Ravindran Kannan, Amit Kumar
2020	J	`jnl`	Caching with Time Windows and Delays. CoRR Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2020	A*	`conf`	Caching with time windows. STOC Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2020	B	`conf`	FPT Approximation for Constrained Metric k-Median/Means. IPEC Dishant Goyal, Ragesh Jaiswal, Amit Kumar
2020	J	`jnl`	FPT Approximation for Constrained Metric k-Median/Means. CoRR Dishant Goyal, Ragesh Jaiswal, Amit Kumar
2020	—	`conf`	Multiplicative Rank-1 Approximation using Length-Squared Sampling. SOSA Ragesh Jaiswal, Amit Kumar
2020	—	`conf`	On Sampling Based Algorithms for k-Means. FSTTCS Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal, Amit Kumar
2020	—	`conf`	Online Carpooling Using Expander Decompositions. FSTTCS Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
2020	J	`jnl`	Online Carpooling using Expander Decompositions. CoRR Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla
2020	B	`conf`	Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract). IPCO Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
2020	J	`jnl`	Stochastic Makespan Minimization in Structured Set Systems. CoRR Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
2019	C	`conf`	Battery Scheduling Problem. TAMC Aakash Agrawal, Krunal Shah, Amit Kumar, Ranveer Chandra
2019	A*	`conf`	Elastic Caching. SODA Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi
2019	J	`jnl`	Multiplicative Rank-1 Approximation using Length-Squared Sampling. CoRR Ragesh Jaiswal, Amit Kumar
2019	A*	`conf`	Non-Clairvoyant Precedence Constrained Scheduling. ICALP Naveen Garg, Anupam Gupta, Amit Kumar, Sahil Singla
2019	J	`jnl`	Non-clairvoyant Precedence Constrained Scheduling. CoRR Naveen Garg, Anupam Gupta, Amit Kumar, Sahil Singla
2019	J	`jnl`	Stochastic Load Balancing on Unrelated Machines. CoRR Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
2019	J	`jnl`	Streaming PTAS for Binary 𝓁 CoRR Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal, Amit Kumar
2019	J	`jnl`	Streaming PTAS for Constrained k-Means. CoRR Dishant Goyal, Ragesh Jaiswal, Amit Kumar
2019	J	`jnl`	Tight FPT Approximations for $k$-Median and k-Means. CoRR Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li
2019	A*	`conf`	Tight FPT Approximations for k-Median and k-Means. ICALP Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, Jason Li
2018	A	`conf`	A Local-Search Algorithm for Steiner Forest. ITCS Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae
2018	A	`conf`	Approximate Clustering with Same-Cluster Queries. ITCS Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
2018	A	`conf`	Approximating Airports and Railways. STACS Anna Adamaszek, Antonios Antoniadis, Amit Kumar, Tobias Mömke
2018	A*	`conf`	Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-Polynomial Time. FOCS Jatin Batra, Naveen Garg, Amit Kumar
2018	J	`jnl`	Constant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-polynomial time. CoRR Jatin Batra, Naveen Garg, Amit Kumar
2018	J	`jnl`	Faster Algorithms for the Constrained k-means Problem. Theory Comput. Syst. Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
2018	A*	`conf`	Fully-Dynamic Bin Packing with Little Repacking. ICALP Björn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, David Wajc
2018	A*	`conf`	Non-Preemptive Flow-Time Minimization via Rejections. ICALP Anupam Gupta, Amit Kumar, Jason Li
2018	J	`jnl`	Non-Preemptive Flow-Time Minimization via Rejections. CoRR Anupam Gupta, Amit Kumar, Jason Li
2018	J	`jnl`	Rejecting jobs to minimize load and maximum flow-time. J. Comput. Syst. Sci. Anamitra Roy Choudhury, Syamantak Das, Naveen Garg, Amit Kumar
2018	J	`jnl`	Sampling in Space Restricted Settings. Algorithmica Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar
2018	A*	`conf`	Stochastic Load Balancing on Unrelated Machines. SODA Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen
2017	J	`jnl`	A Local-Search Algorithm for Steiner Forest. CoRR Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae
2017	J	`jnl`	Approximate Clustering with Same-Cluster Queries. CoRR Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
2017	J	`jnl`	Fully-Dynamic Bin Packing with Limited Repacking. CoRR Anupam Gupta, Guru Guruganesh, Amit Kumar, David Wajc
2017	J	`jnl`	Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. Algorithmica S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar
2017	A*	`conf`	Online and dynamic algorithms for set cover. STOC Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi
2017	—	`conf`	SpectraMap: Efficiently Constructing a Spatio-temporal RF Spectrum Occupancy Map. COMSNETS (Revised Selected Papers and Invited Papers) Aditya Ahuja, Vinay J. Ribeiro, Ranveer Chandra, Amit Kumar
2017	B	`conf`	The Heterogeneous Capacitated k-Center Problem. IPCO Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar
2016	A	`conf`	Faster Algorithms for the Constrained k-Means Problem. STACS Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
2016	J	`jnl`	Minimizing average flow-time under knapsack constraint. Theor. Comput. Sci. Suman Kalyan Bera, Syamantak Das, Amit Kumar
2016	J	`jnl`	Online and Dynamic Algorithms for Set Cover. CoRR Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Debmalya Panigrahi
2016	J	`jnl`	The Heterogeneous Capacitated $k$-Center Problem. CoRR Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Amit Kumar
2016	J	`jnl`	The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online. SIAM J. Comput. Albert Gu, Anupam Gupta, Amit Kumar
2015	J	`jnl`	Facility Location with Matroid or Knapsack Constraints. Math. Oper. Res. Ravishankar Krishnaswamy, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal, Barna Saha
2015	J	`jnl`	Faster Algorithms for the Constrained k-means Problem. CoRR Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar
2015	A*	`conf`	Greedy Algorithms for Steiner Forest. STOC Anupam Gupta, Amit Kumar
2015	—	`conf`	Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model. FSTTCS Anamitra Roy Choudhury, Syamantak Das, Amit Kumar
2015	A*	`conf`	New Approximation Schemes for Unsplittable Flow on a Path. SODA Jatin Batra, Naveen Garg, Amit Kumar, Tobias Mömke, Andreas Wiese
2015	A*	`conf`	Rejecting jobs to Minimize Load and Maximum Flow-time. SODA Anamitra Roy Choudhury, Syamantak Das, Naveen Garg, Amit Kumar
2015	Misc	`conf`	Sampling in Space Restricted Settings. COCOON Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar
2014	J	`jnl`	A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems. Algorithmica Ragesh Jaiswal, Amit Kumar, Sandeep Sen
2014	J	`jnl`	Approximation algorithms for the partition vertex cover problem. Theor. Comput. Sci. Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy
2014	J	`jnl`	Greedy Algorithms for Steiner Forest. CoRR Anupam Gupta, Amit Kumar
2014	A*	`conf`	Maintaining Assignments Online: Matching, Scheduling, and Flows. SODA Anupam Gupta, Amit Kumar, Cliff Stein
2014	Misc	`conf`	Minimizing Average Flow-Time under Knapsack Constraint. COCOON Suman Kalyan Bera, Syamantak Das, Amit Kumar
2014	A*	`conf`	Online Steiner Tree with Deletions. SODA Anupam Gupta, Amit Kumar
2014	J	`jnl`	Rejecting Jobs to Minimize Load and Maximum Flow-time. CoRR Anamitra Roy Choudhury, Syamantak Das, Naveen Garg, Amit Kumar
2014	J	`jnl`	Sampling in Space Restricted Settings. CoRR Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar
2013	B	`conf`	Approximation Algorithms for the Partition Vertex Cover Problem. WALCOM Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy
2013	—	`conf`	Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. ICALP (1) S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar
2013	J	`jnl`	Online Steiner Tree with Deletions. CoRR Anupam Gupta, Amit Kumar
2013	J	`jnl`	The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online. CoRR Albert Gu, Anupam Gupta, Amit Kumar
2013	A*	`conf`	The power of deferral: maintaining a constant-competitive steiner tree online. STOC Albert Gu, Anupam Gupta, Amit Kumar
2012	Misc	`conf`	A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems. COCOON Ragesh Jaiswal, Amit Kumar, Sandeep Sen
2012	J	`jnl`	A simple D^2-sampling based PTAS for k-means and other Clustering Problems CoRR Ragesh Jaiswal, Amit Kumar, Sandeep Sen
2012	—	`conf`	Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees. FSTTCS Khaled M. Elbassioni, Naveen Garg, Divya Gupta, Amit Kumar, Vishal Narula, Arindam Pal
2012	A*	`conf`	Constant factor approximation algorithm for the knapsack median problem. SODA Amit Kumar
2012	—	`conf`	Efficient on-line algorithm for maintaining k-cover of sparse bit-strings. FSTTCS Amit Kumar, Preeti Ranjan Panda, Smruti R. Sarangi
2012	A*	`conf`	Resource augmentation for weighted flow-time explained by dual fitting. SODA S. Anand, Naveen Garg, Amit Kumar
2011	J	`jnl`	Approximation Algorithms for Edge Partitioned Vertex Cover Problems CoRR Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy
2011	B	`conf`	Contact Center Scheduling with Strict Resource Requirements. IPCO Aman Dhesi, Pranav Gupta, Amit Kumar, Gyana R. Parija, Sambuddha Roy
2011	A	`conf`	Minimum Cost Resource Allocation for Meeting Job Requirements. IPDPS Venkatesan T. Chakaravarthy, Gyana R. Parija, Sambuddha Roy, Yogish Sabharwal, Amit Kumar
2011	A*	`conf`	On LP-Based Approximability for Strict CSPs. SODA Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi
2011	A	`conf`	Resource Allocation for Covering Time Varying Demands. ESA Venkatesan T. Chakaravarthy, Amit Kumar, Sambuddha Roy, Yogish Sabharwal
2011	—	`conf`	Scheduling Resources for Throughput Maximization. APPROX-RANDOM Venkatesan T. Chakaravarthy, Amit Kumar, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal
2011	J	`jnl`	Single-path routing for life time maximization in multi-hop wireless networks. Wirel. Networks Yigal Bejerano, Keon-Taek Lee, Seung-Jae Han, Amit Kumar
2011	A*	`conf`	The Matroid Median Problem. SODA Ravishankar Krishnaswamy, Amit Kumar, Viswanath Nagarajan, Yogish Sabharwal, Barna Saha
2011	B	`ed.`	WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings WALCOM Naoki Katoh, Amit Kumar
2010	J	`jnl`	Assigning Papers to Referees. Algorithmica Naveen Garg, Telikepalli Kavitha, Amit Kumar, Kurt Mehlhorn, Julián Mestre
2010	A*	`conf`	Clustering with Spectral Norm and the k-Means Algorithm. FOCS Amit Kumar, Ravindran Kannan
2010	J	`jnl`	Clustering with Spectral Norm and the k-means Algorithm CoRR Amit Kumar, Ravindran Kannan
2010	J	`jnl`	Linear-time approximation schemes for clustering problems in any dimensions. J. ACM Amit Kumar, Yogish Sabharwal, Sandeep Sen
2009	A*	`conf`	A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation. STOC Jivitej S. Chadha, Naveen Garg, Amit Kumar, V. N. Muralidhara
2009	A*	`conf`	A constant-factor approximation for stochastic Steiner forest. STOC Anupam Gupta, Amit Kumar
2009	J	`jnl`	On the Optimality of a Class of LP-based Algorithms CoRR Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi
2009	J	`jnl`	On the Optimality of a Class of LP-based Algorithms. Electron. Colloquium Comput. Complex. Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi
2009	J	`jnl`	Scheduling with Outliers CoRR Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev
2009	—	`conf`	Scheduling with Outliers. APPROX-RANDOM Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev
2008	—	`conf`	All-Norms and All-L_p-Norms Approximation Algorithms. FSTTCS Daniel Golovin, Anupam Gupta, Amit Kumar, Kanat Tangwongsan
2008	B	`conf`	Minimizing Total Flow-Time: The Unrelated Case. ISAAC Naveen Garg, Amit Kumar, V. N. Muralidhara
2008	B	`conf`	Single-path routing for life time maximization in multi-hop wireless networks. LCN Yigal Bejerano, Seung-Jae Han, Keon-Taek Lee, Amit Kumar
2007	J	`jnl`	Approximation Algorithms for the Unsplittable Flow Problem. Algorithmica Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar
2007	J	`jnl`	Approximation via cost sharing: Simpler and better approximation algorithms for network design. J. ACM Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden
2007	J	`jnl`	Efficient load-balancing routing for wireless mesh networks. Comput. Networks Yigal Bejerano, Seung-Jae Han, Amit Kumar
2007	A*	`conf`	Minimizing Average Flow-time: Upper and Lower Bounds. FOCS Naveen Garg, Amit Kumar
2007	—	`conf`	On Configuring BGP Route Reflectors. COMSWARE Yuri Breitbart, Minos N. Garofalakis, Anupam Gupta, Amit Kumar, Rajeev Rastogi
2007	—	`conf`	Order Scheduling Models: Hardness and Algorithms. FSTTCS Naveen Garg, Amit Kumar, Vinayaka Pandit
2007	—	`conf`	Stochastic Steiner Tree with Non-uniform Inflation. APPROX-RANDOM Anupam Gupta, MohammadTaghi Hajiaghayi, Amit Kumar
2007	—	`conf`	The Priority FSTTCS Amit Kumar, Yogish Sabharwal
2006	—	`conf`	Better Algorithms for Minimizing Average Flow-Time on Related Machines. ICALP (1) Naveen Garg, Amit Kumar
2006	—	`conf`	Enhanced distributed hash tables for complex queries. COMSWARE Pankaj Garg, Amit Kumar, Huzur Saran
2006	J	`jnl`	Fairness Measures for Resource Allocation. SIAM J. Comput. Amit Kumar, Jon M. Kleinberg
2006	A*	`conf`	Minimizing average flow time on related machines. STOC Naveen Garg, Amit Kumar
2005	J	`jnl`	Building Edge-Failure Resilient Networks. Algorithmica Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz
2005	A*	`conf`	Join-distinct aggregate estimation over update streams. PODS Sumit Ganguly, Minos N. Garofalakis, Amit Kumar, Rajeev Rastogi
2005	A*	`conf`	Linear Time Algorithms for Clustering Problems in Any Dimensions. ICALP Amit Kumar, Yogish Sabharwal, Sandeep Sen
2005	J	`jnl`	On a bidirected relaxation for the MULTIWAY CUT problem. Discret. Appl. Math. Chandra Chekuri, Anupam Gupta, Amit Kumar
2005	J	`jnl`	Wavelet synopses for general error metrics. ACM Trans. Database Syst. Minos N. Garofalakis, Amit Kumar
2005	—	`conf`	Where's the Winner? Max-Finding and Sorting with Metric Costs. APPROX-RANDOM Anupam Gupta, Amit Kumar
2005	J	`jnl`	XML stream processing using tree-edit distance embeddings. ACM Trans. Database Syst. Minos N. Garofalakis, Amit Kumar
2004	A*	`conf`	A Simple Linear Time (1+έ)-Approximation Algorithm for k-Means Clustering in Any Dimensions. FOCS Amit Kumar, Yogish Sabharwal, Sandeep Sen
2004	A*	`conf`	Deterministic Wavelet Thresholding for Maximum-Error Metrics. PODS Minos N. Garofalakis, Amit Kumar
2004	—	`conf`	Maximum Coverage Problem with Group Budget Constraints and Applications. APPROX-RANDOM Chandra Chekuri, Amit Kumar
2004	A*	`conf`	Multi-processor scheduling to minimize flow time with epsilon resource augmentation. STOC Chandra Chekuri, Ashish Goel, Sanjeev Khanna, Amit Kumar
2004	J	`jnl`	Primal-Dual Algorithms for Connected Facility Location Problems. Algorithmica Chaitanya Swamy, Amit Kumar
2004	J	`jnl`	Traveling with a Pez Dispenser (or, Routing Issues in MPLS). SIAM J. Comput. Anupam Gupta, Amit Kumar, Rajeev Rastogi
2003	A*	`conf`	Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. FOCS Anupam Gupta, Amit Kumar, Martin Pál, Tim Roughgarden
2003	A*	`conf`	Correlating XML data streams using tree-edit distance embeddings. PODS Minos N. Garofalakis, Amit Kumar
2003	A*	`conf`	Exploring the trade-off between label size and stack depth in MPLS Routing. INFOCOM Anupam Gupta, Amit Kumar, Rajeev Rastogi
2003	J	`jnl`	Optimal configuration of OSPF aggregates. IEEE/ACM Trans. Netw. Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalakis, Amit Kumar
2003	A*	`conf`	Simpler and better approximation algorithms for network design. STOC Anupam Gupta, Amit Kumar, Tim Roughgarden
2003	B	`conf`	Tree based MPLS routing. SPAA Anupam Gupta, Amit Kumar, Mikkel Thorup
2002	A*	`conf`	A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. FOCS Amit Kumar, Anupam Gupta, Tim Roughgarden
2002	—	`—`	Algorithms for Network Management. Amit Kumar
2002	J	`jnl`	Algorithms for provisioning virtual private networks in the hose model. IEEE/ACM Trans. Netw. Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, Bülent Yener
2002	—	`conf`	Approximation Algorithms for the Unsplittable Flow Problem. APPROX Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar
2002	B	`conf`	Building Edge-Failure Resilient Networks. IPCO Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz
2002	J	`jnl`	Connectivity and Inference Problems for Temporal Networks. J. Comput. Syst. Sci. David Kempe, Jon M. Kleinberg, Amit Kumar
2002	A*	`conf`	Optimal Configuration of OSPF Aggregates. INFOCOM Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalakis, Amit Kumar
2002	—	`conf`	Primal-Dual Algorithms for Connected Facility Location Problems. APPROX Chaitanya Swamy, Amit Kumar
2001	A*	`conf`	Algorithms for provisioning virtual private networks in the hose model. SIGCOMM Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, Bülent Yener
2001	A*	`conf`	Provisioning a virtual private network: a network design problem for multicommodity flow. STOC Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev Rastogi, Bülent Yener
2001	A*	`conf`	Sorting and Selection with Structured Costs. FOCS Anupam Gupta, Amit Kumar
2001	A*	`conf`	Traveling with a Pez Dispenser (Or, Routing Issues in MPLS). FOCS Anupam Gupta, Amit Kumar, Rajeev Rastogi
2001	J	`jnl`	Wavelength Conversion in Optical Networks. J. Algorithms Jon M. Kleinberg, Amit Kumar
2000	A*	`conf`	Connectivity and inference problems for temporal networks. STOC David Kempe, Jon M. Kleinberg, Amit Kumar
2000	A*	`conf`	Fairness Measures for Resource Allocation. FOCS Amit Kumar, Jon M. Kleinberg
1999	A*	`conf`	Wavelength Conversion in Optical Networks. SODA Jon M. Kleinberg, Amit Kumar