Chandra Chekuri

271 papers A* 75A 13B 15Journal 137Unranked 24

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Node-Weighted Multicut in Planar Digraphs. CoRR Chandra Chekuri, Rhea Jain
2025	A*	`conf`	A Polylogarithmic Approximation for Directed Steiner Forest in Planar Digraphs. SODA Chandra Chekuri, Rhea Jain
2025	J	`jnl`	Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization Problems. CoRR Elfarouk Harb, Yousef Yassin, Chandra Chekuri
2025	A	`conf`	Covering a Few Submodular Constraints and Applications. APPROX/RANDOM Tanvi Bajpai, Chandra Chekuri, Pooja Kulkarni
2025	J	`jnl`	Covering a Few Submodular Constraints and Applications. CoRR Tanvi Bajpai, Chandra Chekuri, Pooja Kulkarni
2025	J	`jnl`	Cycle Cancellation for Submodular Fractional Allocations and Applications. CoRR Chandra Chekuri, Pooja Kulkarni, Ruta Mehta, Jan Vondrák
2025	J	`jnl`	Hedgegraph Polymatroids. CoRR Karthekeyan Chandrasekaran, Chandra Chekuri, Weihang Wang, Weihao Zhu
2025	J	`jnl`	Hypergraph Splitting-Off via Element-Connectivity Preserving Reductions. CoRR Karthekeyan Chandrasekaran, Chandra Chekuri, Shubhang Kulkarni
2025	A*	`conf`	On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions. ICALP Karthekeyan Chandrasekaran, Chandra Chekuri, Shubhang Kulkarni
2025	J	`jnl`	On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions. CoRR Karthekeyan Chandrasekaran, Chandra Chekuri, Shubhang Kulkarni
2025	A*	`conf`	Online Disjoint Spanning Trees and Polymatroid Bases. ICALP Karthekeyan Chandrasekaran, Chandra Chekuri, Weihao Zhu
2025	J	`jnl`	Online Disjoint Spanning Trees and Polymatroid Bases. CoRR Karthekeyan Chandrasekaran, Chandra Chekuri, Weihao Zhu
2025	J	`jnl`	Polyhedral aspects of feedback vertex set and pseudoforest deletion set. Math. Program. Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini, Shubhang Kulkarni, Stefan Weltge
2025	A	`conf`	Streaming Algorithms for Network Design. APPROX/RANDOM Chandra Chekuri, Rhea Jain, Sepideh Mahabadi, Ali Vakilian
2025	J	`jnl`	Streaming Algorithms for Network Design. CoRR Chandra Chekuri, Rhea Jain, Sepideh Mahabadi, Ali Vakilian
2025	J	`jnl`	Uncrossed Multiflows and Applications to Disjoint Paths. CoRR Chandra Chekuri, Guyslain Naves, Joseph Poremba, F. Bruce Shepherd
2024	A*	`conf`	1/2-Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations. AAAI Chandra Chekuri, Pooja Kulkarni, Rucha Kulkarni, Ruta Mehta
2024	J	`jnl`	A Polylogarithmic Approximation for Directed Steiner Forest in Planar Digraphs. CoRR Chandra Chekuri, Rhea Jain
2024	A*	`conf`	Adaptive Out-Orientations with Applications. SODA Chandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn
2024	A	`conf`	Approximation Algorithms for Hop Constrained and Buy-At-Bulk Network Design via Hop Constrained Oblivious Routing. ESA Chandra Chekuri, Rhea Jain
2024	J	`jnl`	Approximation Algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing. CoRR Chandra Chekuri, Rhea Jain
2024	J	`jnl`	Approximation Algorithms for Network Design in Non-Uniform Fault Models. CoRR Chandra Chekuri, Rhea Jain
2024	J	`jnl`	Colorful Priority CoRR Chandra Chekuri, Junkai Song
2024	—	`conf`	Contention Resolution for the SOSA Chandra Chekuri, Junkai Song, Weizhong Zhang
2024	A	`conf`	From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs. ESA Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, Weihao Zhu
2024	J	`jnl`	From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs. CoRR Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, Weihao Zhu
2024	J	`jnl`	Improved Throughput for All-or-Nothing Multicommodity Flows With Arbitrary Demands. IEEE/ACM Trans. Netw. Anya Chaturvedi, Chandra Chekuri, Mengxue Liu, Andréa W. Richa, Matthias Rost, Stefan Schmid, Jamison Weber
2024	J	`jnl`	On Sparsest Cut and Conductance in Directed Polymatroidal Networks. CoRR Chandra Chekuri, Anand Louis
2024	J	`jnl`	On submodular prophet inequalities and correlation gap. Theor. Comput. Sci. Chandra Chekuri, Vasilis Livanos
2024	A	`conf`	On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms. APPROX/RANDOM Karthekeyan Chandrasekaran, Chandra Chekuri, Manuel R. Torres, Weihao Zhu
2023	J	`jnl`	1/2 Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations. CoRR Chandra Chekuri, Pooja Kulkarni, Rucha Kulkarni, Ruta Mehta
2023	J	`jnl`	Adaptive Out-Orientations with Applications. CoRR Chandra Chekuri, Aleksander Bjørn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn
2023	A*	`conf`	Approximation Algorithms for Network Design in Non-Uniform Fault Models. ICALP Chandra Chekuri, Rhea Jain
2023	A	`conf`	Bicriteria Approximation Algorithms for Priority Matroid Median. APPROX/RANDOM Tanvi Bajpai, Chandra Chekuri
2023	A	`conf`	Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. ESA Elfarouk Harb, Kent Quanrud, Chandra Chekuri
2023	J	`jnl`	Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. CoRR Elfarouk Harb, Kent Quanrud, Chandra Chekuri
2023	J	`jnl`	Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs. CoRR Caleb Ju, Serif Yesil, Mengyuan Sun, Chandra Chekuri, Edgar Solomonik
2023	A	`conf`	Independent Sets in Elimination Graphs with a Submodular Objective. APPROX/RANDOM Chandra Chekuri, Kent Quanrud
2023	J	`jnl`	Independent Sets in Elimination Graphs with a Submodular Objective. CoRR Chandra Chekuri, Kent Quanrud
2023	J	`jnl`	Min-Max Partitioning of Hypergraphs and Symmetric Submodular Functions. Comb. Karthekeyan Chandrasekaran, Chandra Chekuri
2023	J	`jnl`	On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms. CoRR Chandra Chekuri, Manuel R. Torres
2023	J	`jnl`	Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set. CoRR Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini, Shubhang Kulkarni, Stefan Weltge
2022	J	`jnl`	(1-ε)-approximate fully dynamic densest subgraph: linear space and faster update time. CoRR Chandra Chekuri, Kent Quanrud
2022	J	`jnl`	Algorithms for Intersection Graphs for t-Intervals and t-Pseudodisks. Theory Comput. Chandra Chekuri, Tanmay Inamdar
2022	J	`jnl`	Algorithms for covering multiple submodular constraints and applications. J. Comb. Optim. Chandra Chekuri, Tanmay Inamdar, Kent Quanrud, Kasturi R. Varadarajan, Zhao Zhang
2022	—	`conf`	Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions. FSTTCS Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, Chao Xu
2022	J	`jnl`	Approximating Flexible Graph Connectivity via Räcke Tree based Rounding. CoRR Chandra Chekuri, Rhea Jain
2022	J	`jnl`	Augmentation based Approximation Algorithms for Flexible Network Design. CoRR Chandra Chekuri, Rhea Jain
2022	J	`jnl`	Bicriteria Approximation Algorithms for Priority Matroid Median. CoRR Tanvi Bajpai, Chandra Chekuri
2022	A*	`conf`	Densest Subgraph: Supermodularity, Iterative Peeling, and Flow. SODA Chandra Chekuri, Kent Quanrud, Manuel R. Torres
2022	A*	`conf`	Faster and Scalable Algorithms for Densest Subgraph and Decomposition. NeurIPS Elfarouk Harb, Kent Quanrud, Chandra Chekuri
2022	J	`jnl`	Hypergraph Math. Oper. Res. Karthekeyan Chandrasekaran, Chandra Chekuri
2022	J	`jnl`	Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands. SIGMETRICS Perform. Evaluation Rev. Anya Chaturvedi, Chandra Chekuri, Andréa W. Richa, Matthias Rost, Stefan Schmid, Jamison Weber
2021	—	`ed.`	41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, Virtual Conference, December 15-17, 2021 FSTTCS Mikolaj Bojanczyk, Chandra Chekuri
2021	—	`conf`	Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. APPROX-RANDOM Chandra Chekuri, Kent Quanrud, Manuel R. Torres
2021	A*	`conf`	Faster Algorithms for Rooted Connectivity in Directed Graphs. ICALP Chandra Chekuri, Kent Quanrud
2021	J	`jnl`	Faster Algorithms for Rooted Connectivity in Directed Graphs. CoRR Chandra Chekuri, Kent Quanrud
2021	A*	`conf`	Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity. ICALP Chandra Chekuri, Kent Quanrud
2021	J	`jnl`	Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Global Connectivity Problems. CoRR Chandra Chekuri, Kent Quanrud
2021	A*	`conf`	Min-max Partitioning of Hypergraphs and Symmetric Submodular Functions. SODA Karthekeyan Chandrasekaran, Chandra Chekuri
2021	J	`jnl`	Node-weighted Network Design in Planar and Minor-closed Families of Graphs. ACM Trans. Algorithms Chandra Chekuri, Alina Ene, Ali Vakilian
2021	B	`conf`	On Submodular Prophet Inequalities and Correlation Gap. SAGT Chandra Chekuri, Vasilis Livanos
2021	J	`jnl`	On Submodular Prophet Inequalities and Correlation Gap. CoRR Chandra Chekuri, Vasilis Livanos
2021	A*	`conf`	Revisiting Priority k-Center: Fairness and Outliers. ICALP Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani
2021	J	`jnl`	Revisiting Priority k-Center: Fairness and Outliers. CoRR Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani
2020	J	`jnl`	Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. CoRR Chandra Chekuri, Kent Quanrud, Manuel R. Torres
2020	A*	`conf`	Fast LP-based Approximations for Geometric Packing and Covering Problems. SODA Chandra Chekuri, Sariel Har-Peled, Kent Quanrud
2020	A*	`conf`	Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time. FOCS Karthekeyan Chandrasekaran, Chandra Chekuri
2020	J	`jnl`	Hypergraph k-cut for fixed k in deterministic polynomial time. CoRR Karthekeyan Chandrasekaran, Chandra Chekuri
2020	J	`jnl`	LP Relaxation and Tree Packing for Minimum k-Cut. SIAM J. Discret. Math. Chandra Chekuri, Kent Quanrud, Chao Xu
2020	J	`jnl`	On the Hardness of Approximating the k-Way Hypergraph Cut problem. Theory Comput. Chandra Chekuri, Shi Li
2020	J	`jnl`	ℓ Math. Program. Chandra Chekuri, Kent Quanrud, Manuel R. Torres
2019	J	`jnl`	$\ell_1$-sparsity Approximation Bounds for Packing Integer Programs. CoRR Chandra Chekuri, Kent Quanrud, Manuel R. Torres
2019	J	`jnl`	Algorithms for Intersection Graphs of Multiple Intervals and Pseudo Disks. CoRR Chandra Chekuri, Tanmay Inamdar
2019	—	`conf`	LP Relaxation and Tree Packing for Minimum k-cuts. SOSA Chandra Chekuri, Kent Quanrud, Chao Xu
2019	J	`jnl`	Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs. CoRR Chandra Chekuri, Alina Ene, Ali Vakilian
2019	A*	`conf`	On Approximating (Sparse) Covering Integer Programs. SODA Chandra Chekuri, Kent Quanrud
2019	J	`jnl`	On Approximating Partial Set Cover and Generalizations. CoRR Chandra Chekuri, Kent Quanrud, Zhao Zhang
2019	A*	`conf`	Parallelizing greedy for submodular set function maximization in matroids and beyond. STOC Chandra Chekuri, Kent Quanrud
2019	A*	`conf`	Submodular Function Maximization in Parallel via the Multilinear Relaxation. SODA Chandra Chekuri, Kent Quanrud
2019	B	`conf`	\ell _1 -sparsity Approximation Bounds for Packing Integer Programs. IPCO Chandra Chekuri, Kent Quanrud, Manuel R. Torres
2018	—	`conf`	A Note on Iterated Rounding for the Survivable Network Design Problem. SOSA Chandra Chekuri, Thapanapong Rukkanchanunt
2018	J	`jnl`	Approximation Algorithms for Euler Genus and Related Problems. SIAM J. Comput. Chandra Chekuri, Anastasios Sidiropoulos
2018	—	`conf`	Congestion Minimization for Multipath Routing via Multiroute Flows. SOSA Chandra Chekuri, Mark Idleman
2018	J	`jnl`	Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. SIAM J. Discret. Math. Chandra Chekuri, Alina Ene, Marcin Pilipczuk
2018	J	`jnl`	Fast Approximations for Metric-TSP via Linear Programming. CoRR Chandra Chekuri, Kent Quanrud
2018	J	`jnl`	LP Relaxation and Tree Packing for Minimum k-cuts. CoRR Chandra Chekuri, Kent Quanrud, Chao Xu
2018	J	`jnl`	Minimum Cuts and Sparsification in Hypergraphs. SIAM J. Comput. Chandra Chekuri, Chao Xu
2018	J	`jnl`	On Approximating (Sparse) Covering Integer Programs. CoRR Chandra Chekuri, Kent Quanrud
2018	J	`jnl`	Parallelizing greedy for submodular set function maximization in matroids and beyond. CoRR Chandra Chekuri, Kent Quanrud
2018	—	`conf`	Perturbation Resilient Clustering for k-Center and Related Problems via LP Relaxations. APPROX-RANDOM Chandra Chekuri, Shalmoli Gupta
2018	J	`jnl`	Perturbation Resilient Clustering for k-Center and Related Problems via LP Relaxations. CoRR Chandra Chekuri, Shalmoli Gupta
2018	A*	`conf`	Randomized MWU for Positive LPs. SODA Chandra Chekuri, Kent Quanrud
2018	J	`jnl`	Submodular Function Maximization in Parallel via the Multilinear Relaxation. CoRR Chandra Chekuri, Kent Quanrud
2017	J	`jnl`	A note on approximate strengths of edges in a hypergraph. CoRR Chandra Chekuri, Chao Xu
2017	A*	`conf`	Approximating Multicut and the Demand Graph. SODA Chandra Chekuri, Vivek Madan
2017	A*	`conf`	Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time. FOCS Chandra Chekuri, Kent Quanrud
2017	J	`jnl`	Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time. CoRR Chandra Chekuri, Kent Quanrud
2017	A*	`conf`	Computing minimum cuts in hypergraphs. SODA Chandra Chekuri, Chao Xu
2017	A*	`conf`	Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems. SODA Chandra Chekuri, Kent Quanrud
2016	A*	`conf`	A Fast Approximation for Maximum Weight Matroid Intersection. SODA Chandra Chekuri, Kent Quanrud
2016	J	`jnl`	A note on the Survivable Network Design Problem. CoRR Chandra Chekuri, Thapanapong Rukkanchanunt
2016	J	`jnl`	Approximating Multicut and the Demand Graph. CoRR Chandra Chekuri, Vivek Madan
2016	J	`jnl`	Computing minimum cuts in hypergraphs. CoRR Chandra Chekuri, Chao Xu
2016	A*	`conf`	Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. ICALP Chandra Chekuri, Alina Ene, Marcin Pilipczuk
2016	A*	`conf`	Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation. SODA Chandra Chekuri, Vivek Madan
2016	—	`ch.`	Graph Coloring. Encyclopedia of Algorithms Michael Langberg, Chandra Chekuri
2016	—	`ch.`	Multicommodity Flow, Well-linked Terminals and Routing Problems. Encyclopedia of Algorithms Chandra Chekuri
2016	J	`jnl`	Polynomial Bounds for the Grid-Minor Theorem. J. ACM Chandra Chekuri, Julia Chuzhoy
2016	A*	`conf`	Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut. SODA Chandra Chekuri, Vivek Madan
2015	J	`jnl`	Approximability of Capacitated Network Design. Algorithmica Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula
2015	J	`jnl`	Centrality of trees for capacitated k-center. Math. Program. Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson
2015	A*	`conf`	Degree-3 Treewidth Sparsifiers. SODA Chandra Chekuri, Julia Chuzhoy
2015	B	`conf`	Delay-constrained unicast and the triangle-cast problem. ISIT Chandra Chekuri, Sudeep Kamath, Sreeram Kannan, Pramod Viswanath
2015	J	`jnl`	Multicommodity Flows and Cuts in Polymatroidal Networks. SIAM J. Comput. Chandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath
2015	A	`conf`	On Element-Connectivity Preserving Graph Simplification. ESA Chandra Chekuri, Thapanapong Rukkanchanunt, Chao Xu
2015	A	`conf`	On Multiplicative Weight Updates for Concave and Submodular Function Maximization. ITCS Chandra Chekuri, T. S. Jayram, Jan Vondrák
2015	J	`jnl`	Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut. CoRR Chandra Chekuri, Vivek Madan
2015	—	`conf`	Streaming Algorithms for Submodular Function Maximization. ICALP (1) Chandra Chekuri, Shalmoli Gupta, Kent Quanrud
2015	J	`jnl`	Streaming Algorithms for Submodular Function Maximization. CoRR Chandra Chekuri, Shalmoli Gupta, Kent Quanrud
2015	J	`jnl`	The all-or-nothing flow problem in directed graphs with symmetric demand pairs. Math. Program. Chandra Chekuri, Alina Ene
2014	J	`jnl`	A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests. SIAM J. Discret. Math. Chandra Chekuri, Nitish Korula
2014	B	`conf`	Centrality of Trees for Capacitated k-Center. IPCO Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson
2014	J	`jnl`	Degree-3 Treewidth Sparsifiers. CoRR Chandra Chekuri, Julia Chuzhoy
2014	A*	`conf`	Polynomial bounds for the grid-minor theorem. STOC Chandra Chekuri, Julia Chuzhoy
2014	A*	`ed.`	Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014 SODA Chandra Chekuri
2014	J	`jnl`	Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes. SIAM J. Comput. Chandra Chekuri, Jan Vondrák, Rico Zenklusen
2014	B	`conf`	The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs. IPCO Chandra Chekuri, Alina Ene
2013	A*	`conf`	Approximation Algorithms for Euler Genus and Related Problems. FOCS Chandra Chekuri, Anastasios Sidiropoulos
2013	J	`jnl`	Approximation algorithms for Euler genus and related problems CoRR Chandra Chekuri, Anastasios Sidiropoulos
2013	J	`jnl`	Flow-cut gaps for integer and fractional multiflows. J. Comb. Theory B Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel
2013	J	`jnl`	Large-Treewidth Graph Decompositions and Applications CoRR Chandra Chekuri, Julia Chuzhoy
2013	A*	`conf`	Large-treewidth graph decompositions and applications. STOC Chandra Chekuri, Julia Chuzhoy
2013	J	`jnl`	Maximum Edge-Disjoint Paths in $k$-sums of Graphs CoRR Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd
2013	—	`conf`	Maximum Edge-Disjoint Paths in k-Sums of Graphs. ICALP (1) Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd
2013	A*	`conf`	Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion. SODA Chandra Chekuri, Alina Ene
2013	J	`jnl`	Polynomial Bounds for the Grid-Minor Theorem CoRR Chandra Chekuri, Julia Chuzhoy
2013	J	`jnl`	The All-or-Nothing Multicommodity Flow Problem. SIAM J. Comput. Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
2012	J	`jnl`	Improved algorithms for orienteering and related problems. ACM Trans. Algorithms Chandra Chekuri, Nitish Korula, Martin Pál
2012	A	`conf`	Multicommodity flows and cuts in polymatroidal networks. ITCS Chandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath
2012	—	`conf`	Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs. ICALP (1) Chandra Chekuri, Alina Ene, Ali Vakilian
2012	J	`jnl`	On the set multicover problem in geometric settings. ACM Trans. Algorithms Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled
2012	J	`jnl`	Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor. Theory Comput. Chandra Chekuri, Sungjin Im, Benjamin Moseley
2012	—	`conf`	Prize-Collecting Survivable Network Design in Node-Weighted Graphs. APPROX-RANDOM Chandra Chekuri, Alina Ene, Ali Vakilian
2012	J	`jnl`	Pruning 2-Connected Graphs. Algorithmica Chandra Chekuri, Nitish Korula
2011	B	`conf`	Approximability of Capacitated Network Design. IPCO Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula
2011	J	`jnl`	Approximation Algorithms for Submodular Multiway Partition CoRR Chandra Chekuri, Alina Ene
2011	A*	`conf`	Approximation Algorithms for Submodular Multiway Partition. FOCS Chandra Chekuri, Alina Ene
2011	J	`jnl`	Buy-at-Bulk Network Design with Protection. Math. Oper. Res. Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang
2011	J	`jnl`	Maximizing a Monotone Submodular Function Subject to a Matroid Constraint. SIAM J. Comput. Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák
2011	A*	`conf`	Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding. SODA Chandra Chekuri, Jan Vondrák, Rico Zenklusen
2011	J	`jnl`	Multicommodity Flows and Cuts in Polymatroidal Networks CoRR Chandra Chekuri, Sreeram Kannan, Adnan Raja, Pramod Viswanath
2011	A*	`conf`	Prize-collecting Steiner Problems on Planar Graphs. SODA MohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dániel Marx
2011	J	`jnl`	Set connectivity problems in undirected graphs and the directed steiner network problem. ACM Trans. Algorithms Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev
2011	J	`jnl`	Submodular Cost Allocation Problem and Applications CoRR Chandra Chekuri, Alina Ene
2011	—	`conf`	Submodular Cost Allocation Problem and Applications. ICALP (1) Chandra Chekuri, Alina Ene
2011	J	`jnl`	Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes CoRR Chandra Chekuri, Jan Vondrák, Rico Zenklusen
2011	A*	`conf`	Submodular function maximization via the multilinear relaxation and contention resolution schemes. STOC Jan Vondrák, Chandra Chekuri, Rico Zenklusen
2010	J	`jnl`	Approximability of Capacitated Network Design CoRR Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula
2010	J	`jnl`	Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design. SIAM J. Comput. Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
2010	A*	`conf`	Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures. FOCS Chandra Chekuri, Jan Vondrák, Rico Zenklusen
2010	J	`jnl`	Flow-Cut Gaps for Integer and Fractional Multiflows CoRR Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel
2010	A*	`conf`	Flow-Cut Gaps for Integer and Fractional Multiflows. SODA Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel
2010	B	`conf`	New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract). WAOA Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard Matthew McCutchen, Benjamin Moseley, Louiqa Raschid
2010	J	`jnl`	Prize-Collecting Steiner Tree and Forest in Planar Graphs CoRR Chandra Chekuri, Alina Ene, Nitish Korula
2009	J	`jnl`	A Graph Reduction Step Preserving Element-Connectivity and Applications CoRR Chandra Chekuri, Nitish Korula
2009	—	`conf`	A Graph Reduction Step Preserving Element-Connectivity and Applications. ICALP (1) Chandra Chekuri, Nitish Korula
2009	J	`jnl`	A Note on Multiflows and Treewidth. Algorithmica Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
2009	J	`jnl`	Disjoint bases in a polymatroid. Random Struct. Algorithms Gruia Calinescu, Chandra Chekuri, Jan Vondrák
2009	J	`jnl`	Edge-Disjoint Paths in Planar Graphs with Constant Congestion. SIAM J. Comput. Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
2009	J	`jnl`	Foreword. Algorithmica Chandra Chekuri, Luca Trevisan
2009	J	`jnl`	Longest Wait First for Broadcast Scheduling CoRR Chandra Chekuri, Sungjin Im, Benjamin Moseley
2009	B	`conf`	Longest Wait First for Broadcast Scheduling [Extended Abstract]. WAOA Chandra Chekuri, Sungjin Im, Benjamin Moseley
2009	J	`jnl`	Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling CoRR Chandra Chekuri, Sungjin Im, Benjamin Moseley
2009	A	`conf`	Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. ESA Chandra Chekuri, Sungjin Im, Benjamin Moseley
2009	J	`jnl`	On the Set Multi-Cover Problem in Geometric Settings CoRR Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled
2009	—	`conf`	On the set multi-cover problem in geometric settings. SCG Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled
2009	A*	`conf`	Online scheduling to minimize the maximum delay factor. SODA Chandra Chekuri, Benjamin Moseley
2009	J	`jnl`	Randomized Pipage Rounding for Matroid Polytopes and Applications CoRR Chandra Chekuri, Jan Vondrák
2009	A*	`conf`	Topology Formation for Wireless Mesh Network Planning. INFOCOM Chun-cheng Chen, Chandra Chekuri, Diego Klabjan
2009	J	`jnl`	Truthful Mechanisms via Greedy Iterative Packing CoRR Chandra Chekuri, Iftah Gamzu
2009	—	`conf`	Truthful Mechanisms via Greedy Iterative Packing. APPROX-RANDOM Chandra Chekuri, Iftah Gamzu
2009	—	`conf`	Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs. APPROX-RANDOM Chandra Chekuri, Alina Ene, Nitish Korula
2008	—	`conf`	Algorithms for 2-Route Cut Problems. ICALP (1) Chandra Chekuri, Sanjeev Khanna
2008	J	`jnl`	Approximate Integer Decompositions for Undirected Network Design Problems. SIAM J. Discret. Math. Chandra Chekuri, F. Bruce Shepherd
2008	A*	`conf`	Improved algorithms for orienteering and related problems. SODA Chandra Chekuri, Nitish Korula, Martin Pál
2008	J	`jnl`	Min-Cost 2-Connected Subgraphs With k Terminals CoRR Chandra Chekuri, Nitish Korula
2008	—	`ch.`	Multicommodity Flow, Well-linked Terminals and Routing Problems. Encyclopedia of Algorithms Chandra Chekuri
2008	J	`jnl`	Online Scheduling to Minimize the Maximum Delay Factor CoRR Chandra Chekuri, Benjamin Moseley
2008	—	`conf`	Pruning 2-Connected Graphs. FSTTCS Chandra Chekuri, Nitish Korula
2008	A*	`conf`	Set connectivity problems in undirected graphs and the directed Steiner network problem. SODA Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev
2008	—	`conf`	Single-Sink Network Design with Vertex Connectivity Requirements. FSTTCS Chandra Chekuri, Nitish Korula
2007	J	`jnl`	An O(log Theory Comput. Chandra Chekuri, Martin Pál
2007	J	`jnl`	Approximation Algorithms for Orienteering with Time Windows CoRR Chandra Chekuri, Nitish Korula
2007	J	`jnl`	Approximation Algorithms for the Unsplittable Flow Problem. Algorithmica Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar
2007	A*	`conf`	Approximation algorithms for node-weighted buy-at-bulk network design. SODA Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
2007	A*	`conf`	Buy-at-Bulk Network Design with Protection. FOCS Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang
2007	J	`jnl`	Edge-disjoint paths revisited. ACM Trans. Algorithms Chandra Chekuri, Sanjeev Khanna
2007	J	`jnl`	Hardness of robust network design. Networks Chandra Chekuri, F. Bruce Shepherd, Gianpaolo Oriolo, Maria Grazia Scutellà
2007	B	`conf`	Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). IPCO Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák
2007	J	`jnl`	Multicommodity demand flow in a tree and packing integer programs. ACM Trans. Algorithms Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd
2007	J	`jnl`	Non-Cooperative Multicast and Facility Location Games. IEEE J. Sel. Areas Commun. Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda
2007	J	`jnl`	Routing and network design with robustness to changing or uncertain traffic demands. SIGACT News Chandra Chekuri
2006	J	`jnl`	A greedy approximation algorithm for the group Steiner problem. Discret. Appl. Math. Chandra Chekuri, Guy Even, Guy Kortsarz
2006	—	`conf`	An APPROX-RANDOM Chandra Chekuri, Martin Pál
2006	J	`jnl`	An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow. Theory Comput. Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
2006	A*	`conf`	Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. FOCS Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour
2006	J	`jnl`	Design tools for transparent optical networks. Bell Labs Tech. J. Chandra Chekuri, Paul Claisse, René-Jean Essiambre, Steven Fortune, Daniel C. Kilper, Wonsuck Lee, Nachi K. Nithi, Iraj Saniee, F. Bruce Shepherd, Christopher A. White, Gordon T. Wilfong, Lisa Zhang
2006	A*	`conf`	Edge-disjoint paths in Planar graphs with constant congestion. STOC Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
2006	J	`jnl`	Embedding SIAM J. Discret. Math. Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
2006	A*	`conf`	Non-cooperative multicast and facility location games. EC Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda
2006	B	`conf`	On Achievable Information Rates in Single-Source Non-Uniform Demand Networks. ISIT Chandra Chekuri, Christina Fragouli, Emina Soljanin
2006	J	`jnl`	On average throughput and alphabet size in network coding. IEEE Trans. Inf. Theory Chandra Chekuri, Christina Fragouli, Emina Soljanin
2006	J	`jnl`	Special Issue: FOCS 2003. J. Comput. Syst. Sci. Chandra Chekuri, Daniele Micciancio
2006	J	`jnl`	The Steiner SIAM J. Discret. Math. Chandra Chekuri, Sudipto Guha, Joseph Naor
2005	J	`jnl`	A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem. SIAM J. Comput. Chandra Chekuri, Sanjeev Khanna
2005	A*	`conf`	A Recursive Greedy Algorithm for Walks in Directed Graphs. FOCS Chandra Chekuri, Martin Pál
2005	—	`ed.`	Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings APPROX-RANDOM Chandra Chekuri, Klaus Jansen, José D. P. Rolim, Luca Trevisan
2005	J	`jnl`	Building Edge-Failure Resilient Networks. Algorithmica Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz
2005	A*	`conf`	Multicommodity flow, well-linked terminals, and routing problems. STOC Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
2005	J	`jnl`	On a bidirected relaxation for the MULTIWAY CUT problem. Discret. Appl. Math. Chandra Chekuri, Anupam Gupta, Amit Kumar
2005	B	`conf`	On average throughput and alphabet size in network coding. ISIT Chandra Chekuri, Christina Fragouli, Emina Soljanin
2005	J	`jnl`	Routing bandwidth guaranteed paths with local restoration in label switched networks. IEEE J. Sel. Areas Commun. Li (Erran) Li, Milind M. Buddhikot, Chandra Chekuri, Katherine Guo
2005	—	`conf`	Sampling Bounds for Stochastic Optimization. APPROX-RANDOM Moses Charikar, Chandra Chekuri, Martin Pál
2004	J	`jnl`	A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem. SIAM J. Discret. Math. Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin
2004	—	`ch.`	Approximation Algorithms for Minimizing AverageWeighted Completion Time. Handbook of Scheduling Chandra Chekuri, Sanjeev Khanna
2004	A*	`conf`	Edge-Disjoint Paths in Planar Graphs. FOCS Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
2004	J	`jnl`	Incremental Clustering and Dynamic Information Retrieval. SIAM J. Comput. Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani
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`	On Multidimensional Packing Problems. SIAM J. Comput. Chandra Chekuri, Sanjeev Khanna
2004	A*	`conf`	The all-or-nothing multicommodity flow problem. STOC Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
2003	A*	`conf`	Approximating Steiner k-Cuts. ICALP Chandra Chekuri, Sudipto Guha, Joseph Naor
2003	A*	`conf`	Edge disjoint paths revisited. SODA Chandra Chekuri, Sanjeev Khanna
2003	A*	`conf`	Embedding k-outerplanar graphs into l1. SODA Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
2003	A*	`conf`	Multicommodity Demand Flow in a Tree. ICALP Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd
2002	—	`conf`	Approximation Algorithms for the Unsplittable Flow Problem. APPROX Amit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar
2002	A*	`conf`	Approximation schemes for preemptive weighted flow time. STOC Chandra Chekuri, Sanjeev Khanna
2002	B	`conf`	Building Edge-Failure Resilient Networks. IPCO Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz
2002	B	`conf`	Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks. ICNP Li Li, Milind M. Buddhikot, Chandra Chekuri, Katherine Guo
2001	A*	`conf`	A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines. ICALP Chandra Chekuri, Sanjeev Khanna
2001	A*	`conf`	A deterministic algorithm for the cost-distance problem. SODA Chandra Chekuri, Sanjeev Khanna, Joseph Naor
2001	A*	`conf`	Algorithms for minimizing weighted flow time. STOC Chandra Chekuri, Sanjeev Khanna, An Zhu
2001	J	`jnl`	An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. J. Algorithms Chandra Chekuri, Michael A. Bender
2001	J	`jnl`	Approximation Schemes for Preemptive Weighted Flow Time Electron. Colloquium Comput. Complex. Chandra Chekuri, Sanjeev Khanna
2001	J	`jnl`	Approximation Techniques for Average Completion Time Scheduling. SIAM J. Comput. Chandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein
2001	A*	`conf`	Approximation algorithms for the metric labeling problem via a new linear programming formulation. SODA Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin
2000	A*	`conf`	A PTAS for the multiple knapsack problem. SODA Chandra Chekuri, Sanjeev Khanna
2000	—	`conf`	Blocking probability estimates in a partitioned sector TDMA system. DIAL-M Chandra Chekuri, Kavita Ramanan, Philip A. Whiting, Lisa Zhang
2000	J	`jnl`	Conjunctive query containment revisited. Theor. Comput. Sci. Chandra Chekuri, Anand Rajaraman
2000	J	`jnl`	Performance guarantees for the TSP with a parameterized triangle inequality. Inf. Process. Lett. Michael A. Bender, Chandra Chekuri
1999	J	`jnl`	Approximation Algorithms for Directed Steiner Problems. J. Algorithms Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li
1999	A*	`conf`	Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. FOCS Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko
1999	J	`jnl`	Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication). SIAM J. Comput. Donald Aingworth, Chandra Chekuri, Piotr Indyk, Rajeev Motwani
1999	A*	`conf`	Minimizing Weighted Completion Time on a Single Machine. SODA Chandra Chekuri, Rajeev Motwani
1999	A*	`conf`	On Multi-Dimensional Packing Problems. SODA Chandra Chekuri, Sanjeev Khanna
1999	B	`conf`	Performance Guarantees for the TSP with a Parameterized Triangle Inequality. WADS Michael A. Bender, Chandra Chekuri
1999	J	`jnl`	Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine. Discret. Appl. Math. Chandra Chekuri, Rajeev Motwani
1998	B	`conf`	An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. IPCO Chandra Chekuri, Michael A. Bender
1998	A*	`conf`	Approximating a Finite Metric by a Small Number of Tree Metrics. FOCS Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin
1998	A*	`conf`	Approximation Algorithms for Directed Steiner Problems. SODA Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li
1998	—	`—`	Approximation algorithms for scheduling problems. Chandra Chekuri
1998	A*	`conf`	Filtering with Approximate Predicates. VLDB Narayanan Shivakumar, Hector Garcia-Molina, Chandra Chekuri
1998	A*	`conf`	Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and STOC Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha
1997	A*	`conf`	Approximation Techniques for Average Completion Time Scheduling. SODA Chandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein
1997	A	`conf`	Conjunctive Query Containment Revisited. ICDT Chandra Chekuri, Anand Rajaraman
1997	A*	`conf`	Experimental Study of Minimum Cut Algorithms. SODA Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein
1997	A*	`conf`	Incremental Clustering and Dynamic Information Retrieval. STOC Moses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani
1996	A*	`conf`	Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication). SODA Donald Aingworth, Chandra Chekuri, Rajeev Motwani
1996	A*	`conf`	Profile-driven Instruction Level Parallel Scheduling with Application to Super Blocks. MICRO Chandra Chekuri, Richard Johnson, Rajeev Motwani, B. Natarajan, B. Ramakrishna Rau, Michael S. Schlansker
1995	A*	`conf`	Scheduling Problems in Parallel Query Optimization. PODS Chandra Chekuri, Waqar Hasan, Rajeev Motwani