- On the Set Multi-Cover Problem in Geometric Settings Chandra Chekuri
- EdgeDisjoint Paths in Planar Graphs with Constant Congestion
- Longest Wait First for Broadcast Scheduling Chandra Chekuri , Sungjin Im , and Benjamin Moseley
- Experimental Study of Minimum Cut Algorithms
- A Recursive Greedy Algorithm for Walks in Directed Graphs Chandra Chekuri
- Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
- On Achievable Information Rates in SingleSource NonUniform Demand Networks
- Scheduling Problems in Parallel Query Optimization Chandra Chekuri \Lambda
- Maximum Coverage Problem with Group Budget Constraints and Applications
- Approximation Algorithms for Directed Steiner Problems \Lambda Moses Charikar y
- Approximation Algorithms for Directed Steiner Problems \Lambda Moses Charikar y
- Performance Guarantees for the TSP with a Parameterized Triangle Inequality
- Improved Algorithms for Orienteering and Related Problems
- Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
- Buy-at-Bulk Network Design with Protection Spyridon Antonakopoulos
- Multicommodity Flow, Welllinked Terminals, and Routing Problems
- Set Connectivity Problems in Undirected Graphs and the Directed Steiner Network Problem
- Blocking Probability Estimates in a Partitioned Sector TDMA System
- APPROXIMATION ALGORITHMS FOR SCHEDULING a dissertation
- Edge Disjoint Paths Revisited \Lambda Chandra Chekuri y Sanjeev Khanna z
- Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication)
- Online Scheduling to Minimize the Maximum Delay Factor Chandra Chekuri
- On Multidimensional Packing Problems \Lambda Chandra Chekuri y Sanjeev Khanna z
- The All-or-Nothing Multicommodity Flow Problem Chandra Chekuri
- IEEE TRANSACTION ON INFORMATION THEORY (TO APPEAR) 1 On Average Throughput and Alphabet Size
- Improved Algorithms for Orienteering and Related Problems Chandra Chekuri
- Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine
- A PTAS for the Multiple Knapsack Problem \Lambda Chandra Chekuri y Sanjeev Khanna z
- ProfileDriven Instruction Level Parallel Scheduling with Application to Super Blocks
- Non-Cooperative Multicast and Facility Location Games [Extended Abstract]
- Approximation Algorithms for the Unsplittable Flow Problem Amit Chakrabarti
- Algorithms for Minimizing Weighted Flow Time [Extended Abstract]
- Embedding kOuterplanar Graphs into ` 1 Chandra Chekuri Anupam Gupta y Ilan Newman z Yuri Rabinovich z Alistair Sinclair x
- On Multidimensional Packing Problems Chandra Chekuri \Lambda Sanjeev Khanna y
- Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
- EdgeDisjoint Paths in Planar Graphs C. Chekuri \Lambda S. Khanna y F. B. Shepherd z
- On a bidirected relaxation for the Multiway Cut problem Chandra Chekuri \Lambda Anupam Gupta y Amit Kumar z
- The Steiner k-Cut Problem Chandra Chekuri
- Conjunctive Query Containment Revisited \Lambda Chandra Chekuri y Anand Rajaraman z
- An LP Formulation and Approximation Algorithms for the Metric Labeling Problem \Lambda
- Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures
- New Models and Algorithms for Throughput Maximization in Broadcast Scheduling
- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
- Foundations of Software Technology and Theoretical Computer Science (Bangalore) 2008. Editors: R. Hariharan, M. Mukund, V. Vinay; pp -
- Foundations of Software Technology and Theoretical Computer Science (Bangalore) 2008. Editors: R. Hariharan, M. Mukund, V. Vinay; pp -
- Algorithms for 2-Route Cut Problems Chandra Chekuri1
- Algorithms for 2-Route Cut Problems Chandra Chekuri
- Approximation Algorithms for Orienteering with Time Windows Chandra Chekuri
- Set Connectivity Problems in Undirected Graphs and the Directed Steiner Network Problem
- Disjoint Bases in a Polymatroid Gruia Calinescu
- Approximation Algorithms for Node-Weighted Buy-at-Bulk Network Design
- Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design M. T. Hajiaghayi
- A Note on Multiflows and Treewidth Chandra Chekuri
- Edge-Disjoint Paths in Planar Graphs with Constant Congestion Chandra Chekuri
- Sampling Bounds for Stochastic Optimization Moses Charikar1
- Building Edge-Failure Resilient Networks January 3, 2005
- Approximation Algorithms for
- Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication)
- EMBEDDING KOUTERPLANAR GRAPHS INTO # 1 # CHANDRA CHEKURI + , ANUPAM GUPTA # , ILAN NEWMAN , YURI RABINOVICH # ,
- A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines
- Approximation Techniques for Average Completion Time Scheduling \Lambda
- An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related
- Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding Chandra Chekuri
- Multicommodity Demand Flow in a Tree and Packing Integer Programs
- A Deterministic Algorithm for the COSTDISTANCE Problem Chandra Chekuri \Lambda Sanjeev Khanna y Joseph (Seffi) Naor z
- Pruning 2-Connected Graphs Chandra Chekuri
- Web Search Using Automatic Classification Chandra Chekuri
- Buy-at-Bulk Network Design with Protection Spyridon Antonakopoulos
- Edge Disjoint Paths Revisited Chandra Chekuri \Lambda Sanjeev Khanna y
- Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and kmedian
- Multi-processor Scheduling to Minimize Flow Time with Resource Augmentation
- Maximizing a Submodular Set Function subject to a Matroid Constraint
- Approximation Techniques for Average Completion Time Scheduling C. Chekuri \Lambda
- Routing and Network Design with Robustness to Changing or Uncertain Traffic Demands
- INCREMENTAL CLUSTERING AND DYNAMIC INFORMATION RETRIEVAL \Lambda
- Filtering with Approximate Predicates \Lambda Narayanan Shivakumar, Hector GarciaMolina, Chandra S. Chekuri
- Conjunctive Query Containment Revisited (Extended Abstract)
- Approximation Schemes for Preemptive Weighted Flow Time Chandra Chekuri
- A greedy approximation algorithm for the group Steiner problem
- Approximate Integer Decompositions for Undirected Network Design Problems
- An LP Formulation and Approximation Algorithms for the Metric Labeling Problem
- Approximation Algorithms for Submodular Multiway Partition Chandra Chekuri
