| 2026 | IPCO | Hedgegraph Polymatroids. | Karthekeyan Chandrasekaran, Chandra Chekuri, Weihang Wang, Weihao Zhu |
| 2026 | STOC | A Polylogarithmic Approximation for Buy-at-Bulk Network Design with Protection. | Chandra Chekuri, Rhea Jain |
| 2025 | ICALP | On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions. | Karthekeyan Chandrasekaran, Chandra Chekuri, Shubhang Kulkarni |
| 2025 | ICALP | Online Disjoint Spanning Trees and Polymatroid Bases. | Karthekeyan Chandrasekaran, Chandra Chekuri, Weihao Zhu |
| 2025 | SODA | A Polylogarithmic Approximation for Directed Steiner Forest in Planar Digraphs. | Chandra Chekuri, Rhea Jain |
| 2024 | AAAI | 1/2-Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations. | Chandra Chekuri, Pooja Kulkarni, Rucha Kulkarni, Ruta Mehta |
| 2024 | ESA | Approximation Algorithms for Hop Constrained and Buy-At-Bulk Network Design via Hop Constrained Oblivious Routing. | Chandra Chekuri, Rhea Jain |
| 2024 | ESA | From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs. | Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, Weihao Zhu |
| 2024 | SODA | Adaptive Out-Orientations with Applications. | Chandra Chekuri, Aleksander Bjrn Grodt Christiansen, Jacob Holm, Ivor van der Hoog, Kent Quanrud, Eva Rotenberg, Chris Schwiegelshohn |
| 2023 | ESA | Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. | Elfarouk Harb, Kent Quanrud, Chandra Chekuri |
| 2023 | ICALP | Approximation Algorithms for Network Design in Non-Uniform Fault Models. | Chandra Chekuri, Rhea Jain |
| 2022 | SODA | Densest Subgraph: Supermodularity, Iterative Peeling, and Flow. | Chandra Chekuri, Kent Quanrud, Manuel R. Torres |
| 2021 | ICALP | Revisiting Priority k-Center: Fairness and Outliers. | Tanvi Bajpai, Deeparnab Chakrabarty, Chandra Chekuri, Maryam Negahbani |
| 2021 | ICALP | Faster Algorithms for Rooted Connectivity in Directed Graphs. | Chandra Chekuri, Kent Quanrud |
| 2021 | ICALP | Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity. | Chandra Chekuri, Kent Quanrud |
| 2021 | SODA | Min-max Partitioning of Hypergraphs and Symmetric Submodular Functions. | Karthekeyan Chandrasekaran, Chandra Chekuri |
| 2021 | SAGT | On Submodular Prophet Inequalities and Correlation Gap. | Chandra Chekuri, Vasilis Livanos |
| 2020 | FOCS | Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time. | Karthekeyan Chandrasekaran, Chandra Chekuri |
| 2020 | SODA | Fast LP-based Approximations for Geometric Packing and Covering Problems. | Chandra Chekuri, Sariel Har-Peled, Kent Quanrud |
| 2019 | IPCO | \ell _1 -sparsity Approximation Bounds for Packing Integer Programs. | Chandra Chekuri, Kent Quanrud, Manuel R. Torres |
| 2019 | SODA | LP Relaxation and Tree Packing for Minimum k-cuts. | Chandra Chekuri, Kent Quanrud, Chao Xu |
| 2019 | SODA | Submodular Function Maximization in Parallel via the Multilinear Relaxation. | Chandra Chekuri, Kent Quanrud |
| 2019 | SODA | On Approximating (Sparse) Covering Integer Programs. | Chandra Chekuri, Kent Quanrud |
| 2019 | STOC | Parallelizing greedy for submodular set function maximization in matroids and beyond. | Chandra Chekuri, Kent Quanrud |
| 2018 | SODA | Congestion Minimization for Multipath Routing via Multiroute Flows. | Chandra Chekuri, Mark Idleman |
| 2018 | SODA | Randomized MWU for Positive LPs. | Chandra Chekuri, Kent Quanrud |
| 2018 | SODA | A Note on Iterated Rounding for the Survivable Network Design Problem. | Chandra Chekuri, Thapanapong Rukkanchanunt |
| 2017 | FOCS | Approximating the Held-Karp Bound for Metric TSP in Nearly-Linear Time. | Chandra Chekuri, Kent Quanrud |
| 2017 | SODA | Approximating Multicut and the Demand Graph. | Chandra Chekuri, Vivek Madan |
| 2017 | SODA | Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems. | Chandra Chekuri, Kent Quanrud |
| 2017 | SODA | Computing minimum cuts in hypergraphs. | Chandra Chekuri, Chao Xu |
| 2016 | ICALP | Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. | Chandra Chekuri, Alina Ene, Marcin Pilipczuk |
| 2016 | SODA | Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut. | Chandra Chekuri, Vivek Madan |
| 2016 | SODA | Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation. | Chandra Chekuri, Vivek Madan |
| 2016 | SODA | A Fast Approximation for Maximum Weight Matroid Intersection. | Chandra Chekuri, Kent Quanrud |
| 2015 | ESA | On Element-Connectivity Preserving Graph Simplification. | Chandra Chekuri, Thapanapong Rukkanchanunt, Chao Xu |
| 2015 | ICALP | Streaming Algorithms for Submodular Function Maximization. | Chandra Chekuri, Shalmoli Gupta, Kent Quanrud |
| 2015 | ISIT | Delay-constrained unicast and the triangle-cast problem. | Chandra Chekuri, Sudeep Kamath, Sreeram Kannan, Pramod Viswanath |
| 2015 | SODA | Degree-3 Treewidth Sparsifiers. | Chandra Chekuri, Julia Chuzhoy |
| 2014 | IPCO | Centrality of Trees for Capacitated k-Center. | Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson |
| 2014 | IPCO | The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs. | Chandra Chekuri, Alina Ene |
| 2014 | STOC | Polynomial bounds for the grid-minor theorem. | Chandra Chekuri, Julia Chuzhoy |
| 2013 | FOCS | Approximation Algorithms for Euler Genus and Related Problems. | Chandra Chekuri, Anastasios Sidiropoulos |
| 2013 | ICALP | Maximum Edge-Disjoint Paths in k-Sums of Graphs. | Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd |
| 2013 | SODA | Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion. | Chandra Chekuri, Alina Ene |
| 2013 | STOC | Large-treewidth graph decompositions and applications. | Chandra Chekuri, Julia Chuzhoy |
| 2012 | ICALP | Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs. | Chandra Chekuri, Alina Ene, Ali Vakilian |
| 2011 | FOCS | Approximation Algorithms for Submodular Multiway Partition. | Chandra Chekuri, Alina Ene |
| 2011 | ICALP | Submodular Cost Allocation Problem and Applications. | Chandra Chekuri, Alina Ene |
| 2011 | IPCO | Approximability of Capacitated Network Design. | Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula |
| 2011 | SODA | Prize-collecting Steiner Problems on Planar Graphs. | MohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dniel Marx |
| 2011 | SODA | Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding. | Chandra Chekuri, Jan Vondrk, Rico Zenklusen |
| 2011 | STOC | Submodular function maximization via the multilinear relaxation and contention resolution schemes. | Jan Vondrk, Chandra Chekuri, Rico Zenklusen |
| 2010 | FOCS | Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures. | Chandra Chekuri, Jan Vondrk, Rico Zenklusen |
| 2010 | SODA | Flow-Cut Gaps for Integer and Fractional Multiflows. | Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel |
| 2010 | WAOA | New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract). | Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard Matthew McCutchen, Benjamin Moseley, Louiqa Raschid |
| 2009 | ESA | Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. | Chandra Chekuri, Sungjin Im, Benjamin Moseley |
| 2009 | ICALP | A Graph Reduction Step Preserving Element-Connectivity and Applications. | Chandra Chekuri, Nitish Korula |
| 2009 | INFOCOM | Topology Formation for Wireless Mesh Network Planning. | Chun-cheng Chen, Chandra Chekuri, Diego Klabjan |
| 2009 | SODA | Online scheduling to minimize the maximum delay factor. | Chandra Chekuri, Benjamin Moseley |
| 2009 | WAOA | Longest Wait First for Broadcast Scheduling [Extended Abstract]. | Chandra Chekuri, Sungjin Im, Benjamin Moseley |
| 2008 | ICALP | Algorithms for 2-Route Cut Problems. | Chandra Chekuri, Sanjeev Khanna |
| 2008 | SODA | Set connectivity problems in undirected graphs and the directed Steiner network problem. | Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev |
| 2008 | SODA | Improved algorithms for orienteering and related problems. | Chandra Chekuri, Nitish Korula, Martin Pl |
| 2007 | FOCS | Buy-at-Bulk Network Design with Protection. | Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang |
| 2007 | IPCO | Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). | Gruia Calinescu, Chandra Chekuri, Martin Pl, Jan Vondrk |
| 2007 | SODA | Approximation algorithms for node-weighted buy-at-bulk network design. | Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
| 2006 | FOCS | Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. | Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour |
| 2006 | ISIT | On Achievable Information Rates in Single-Source Non-Uniform Demand Networks. | Chandra Chekuri, Christina Fragouli, Emina Soljanin |
| 2006 | STOC | Edge-disjoint paths in Planar graphs with constant congestion. | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
| 2005 | FOCS | A Recursive Greedy Algorithm for Walks in Directed Graphs. | Chandra Chekuri, Martin Pl |
| 2005 | ISIT | On average throughput and alphabet size in network coding. | Chandra Chekuri, Christina Fragouli, Emina Soljanin |
| 2005 | STOC | Multicommodity flow, well-linked terminals, and routing problems. | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
| 2004 | FOCS | Edge-Disjoint Paths in Planar Graphs. | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
| 2004 | STOC | Multi-processor scheduling to minimize flow time with epsilon resource augmentation. | Chandra Chekuri, Ashish Goel, Sanjeev Khanna, Amit Kumar |
| 2004 | STOC | The all-or-nothing multicommodity flow problem. | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
| 2003 | ICALP | Approximating Steiner k-Cuts. | Chandra Chekuri, Sudipto Guha, Joseph Naor |
| 2003 | ICALP | Multicommodity Demand Flow in a Tree. | Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd |
| 2003 | SODA | Embedding k-outerplanar graphs into l1. | Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair |
| 2003 | SODA | Edge disjoint paths revisited. | Chandra Chekuri, Sanjeev Khanna |
| 2002 | ICNP | Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks. | Li Li, Milind M. Buddhikot, Chandra Chekuri, Katherine Guo |
| 2002 | IPCO | Building Edge-Failure Resilient Networks. | Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz |
| 2002 | STOC | Approximation schemes for preemptive weighted flow time. | Chandra Chekuri, Sanjeev Khanna |
| 2001 | ICALP | A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines. | Chandra Chekuri, Sanjeev Khanna |
| 2001 | SODA | A deterministic algorithm for the cost-distance problem. | Chandra Chekuri, Sanjeev Khanna, Joseph Naor |
| 2001 | SODA | Approximation algorithms for the metric labeling problem via a new linear programming formulation. | Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin |
| 2001 | STOC | Algorithms for minimizing weighted flow time. | Chandra Chekuri, Sanjeev Khanna, An Zhu |
| 2000 | SODA | A PTAS for the multiple knapsack problem. | Chandra Chekuri, Sanjeev Khanna |
| 1999 | FOCS | Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. | 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 | SODA | On Multi-Dimensional Packing Problems. | Chandra Chekuri, Sanjeev Khanna |
| 1999 | SODA | Minimizing Weighted Completion Time on a Single Machine. | Chandra Chekuri, Rajeev Motwani |
| 1999 | WADS | Performance Guarantees for the TSP with a Parameterized Triangle Inequality. | Michael A. Bender, Chandra Chekuri |
| 1998 | FOCS | Approximating a Finite Metric by a Small Number of Tree Metrics. | Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin |
| 1998 | IPCO | An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. | Chandra Chekuri, Michael A. Bender |
| 1998 | SODA | Approximation Algorithms for Directed Steiner Problems. | Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li |
| 1998 | STOC | Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and | Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha |
| 1998 | VLDB | Filtering with Approximate Predicates. | Narayanan Shivakumar, Hector Garcia-Molina, Chandra Chekuri |
| 1997 | ICDT | Conjunctive Query Containment Revisited. | Chandra Chekuri, Anand Rajaraman |
| 1997 | SODA | Experimental Study of Minimum Cut Algorithms. | Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein |
| 1997 | SODA | Approximation Techniques for Average Completion Time Scheduling. | Chandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein |
| 1997 | STOC | Incremental Clustering and Dynamic Information Retrieval. | Moses Charikar, Chandra Chekuri, Toms Feder, Rajeev Motwani |
| 1996 | MICRO | Profile-driven Instruction Level Parallel Scheduling with Application to Super Blocks. | Chandra Chekuri, Richard Johnson, Rajeev Motwani, B. Natarajan, B. Ramakrishna Rau, Michael S. Schlansker |
| 1996 | SODA | Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication). | Donald Aingworth, Chandra Chekuri, Rajeev Motwani |
| 1995 | PODS | Scheduling Problems in Parallel Query Optimization. | Chandra Chekuri, Waqar Hasan, Rajeev Motwani |