| 2009 |
|---|
| 85 | EE | Chandra Chekuri,
Benjamin Moseley:
Online scheduling to minimize the maximum delay factor.
SODA 2009: 1116-1125 |
| 84 | EE | Chandra Chekuri,
Nitish Korula:
A Graph Reduction Step Preserving Element-Connectivity and Applications
CoRR abs/0902.2795: (2009) |
| 2008 |
|---|
| 83 | EE | Chandra Chekuri,
Nitish Korula:
Pruning 2-Connected Graphs.
FSTTCS 2008 |
| 82 | EE | Chandra Chekuri,
Nitish Korula:
Single-Sink Network Design with Vertex Connectivity Requirements.
FSTTCS 2008 |
| 81 | EE | Chandra Chekuri,
Sanjeev Khanna:
Algorithms for 2-Route Cut Problems.
ICALP (1) 2008: 472-484 |
| 80 | EE | Chandra Chekuri,
Guy Even,
Anupam Gupta,
Danny Segev:
Set connectivity problems in undirected graphs and the directed Steiner network problem.
SODA 2008: 532-541 |
| 79 | EE | Chandra Chekuri,
Nitish Korula,
Martin Pál:
Improved algorithms for orienteering and related problems.
SODA 2008: 661-670 |
| 78 | EE | Chandra Chekuri:
Multicommodity Flow, Well-linked Terminals and Routing Problems.
Encyclopedia of Algorithms 2008 |
| 77 | EE | Chandra Chekuri,
Nitish Korula:
Min-Cost 2-Connected Subgraphs With k Terminals
CoRR abs/0802.2528: (2008) |
| 76 | EE | Chandra Chekuri,
Benjamin Moseley:
Online Scheduling to Minimize the Maximum Delay Factor
CoRR abs/0807.1891: (2008) |
| 2007 |
|---|
| 75 | EE | Spyridon Antonakopoulos,
Chandra Chekuri,
F. Bruce Shepherd,
Lisa Zhang:
Buy-at-Bulk Network Design with Protection.
FOCS 2007: 634-644 |
| 74 | EE | Gruia Calinescu,
Chandra Chekuri,
Martin Pál,
Jan Vondrák:
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract).
IPCO 2007: 182-196 |
| 73 | EE | Chandra Chekuri,
Mohammad Taghi Hajiaghayi,
Guy Kortsarz,
Mohammad R. Salavatipour:
Approximation algorithms for node-weighted buy-at-bulk network design.
SODA 2007: 1265-1274 |
| 72 | EE | Chandra Chekuri,
Marcelo Mydlarz,
F. Bruce Shepherd:
Multicommodity demand flow in a tree and packing integer programs.
ACM Transactions on Algorithms 3(3): (2007) |
| 71 | EE | Chandra Chekuri,
Sanjeev Khanna:
Edge-disjoint paths revisited.
ACM Transactions on Algorithms 3(4): (2007) |
| 70 | EE | Amit Chakrabarti,
Chandra Chekuri,
Anupam Gupta,
Amit Kumar:
Approximation Algorithms for the Unsplittable Flow Problem.
Algorithmica 47(1): 53-78 (2007) |
| 69 | EE | Chandra Chekuri,
Nitish Korula:
Approximation Algorithms for Orienteering with Time Windows
CoRR abs/0711.4825: (2007) |
| 68 | EE | Chandra Chekuri,
Julia Chuzhoy,
Liane Lewin-Eytan,
Joseph Naor,
Ariel Orda:
Non-Cooperative Multicast and Facility Location Games.
IEEE Journal on Selected Areas in Communications 25(6): 1193-1206 (2007) |
| 67 | EE | Chandra Chekuri,
F. Bruce Shepherd,
G. Oriolo,
Maria Grazia Scutellá:
Hardness of robust network design.
Networks 50(1): 50-54 (2007) |
| 66 | EE | Chandra Chekuri:
Routing and network design with robustness to changing or uncertain traffic demands.
SIGACT News 38(3): 106-129 (2007) |
| 65 | EE | Chandra Chekuri,
Martin Pál:
An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem.
Theory of Computing 3(1): 197-209 (2007) |
| 2006 |
|---|
| 64 | EE | Chandra Chekuri,
Julia Chuzhoy,
Liane Lewin-Eytan,
Joseph Naor,
Ariel Orda:
Non-cooperative multicast and facility location games.
ACM Conference on Electronic Commerce 2006: 72-81 |
| 63 | EE | Chandra Chekuri,
Martin Pál:
An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem.
APPROX-RANDOM 2006: 95-103 |
| 62 | EE | Chandra Chekuri,
Mohammad Taghi Hajiaghayi,
Guy Kortsarz,
Mohammad R. Salavatipour:
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design.
FOCS 2006: 677-686 |
| 61 | EE | Chandra Chekuri,
Sanjeev Khanna,
F. Bruce Shepherd:
Edge-disjoint paths in Planar graphs with constant congestion.
STOC 2006: 757-766 |
| 60 | EE | 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:
Design tools for transparent optical networks.
Bell Labs Technical Journal 11(2): 129-143 (2006) |
| 59 | EE | Chandra Chekuri,
Guy Even,
Guy Kortsarz:
A greedy approximation algorithm for the group Steiner problem.
Discrete Applied Mathematics 154(1): 15-34 (2006) |
| 58 | EE | Chandra Chekuri,
Christina Fragouli,
Emina Soljanin:
On average throughput and alphabet size in network coding.
IEEE Transactions on Information Theory 52(6): 2410-2424 (2006) |
| 57 | EE | Chandra Chekuri,
Daniele Micciancio:
Special Issue: FOCS 2003.
J. Comput. Syst. Sci. 72(2): 205 (2006) |
| 56 | EE | Chandra Chekuri,
Anupam Gupta,
Ilan Newman,
Yuri Rabinovich,
Alistair Sinclair:
Embedding k-Outerplanar Graphs into l 1.
SIAM J. Discrete Math. 20(1): 119-136 (2006) |
| 55 | EE | Chandra Chekuri,
Sudipto Guha,
Joseph Naor:
The Steiner k-Cut Problem.
SIAM J. Discrete Math. 20(1): 261-271 (2006) |
| 54 | EE | Chandra Chekuri,
Sanjeev Khanna,
F. Bruce Shepherd:
An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow.
Theory of Computing 2(1): 137-146 (2006) |
| 2005 |
|---|
| 53 | | Chandra Chekuri,
Klaus Jansen,
José D. P. Rolim,
Luca Trevisan:
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
Springer 2005 |
| 52 | EE | Moses Charikar,
Chandra Chekuri,
Martin Pál:
Sampling Bounds for Stochastic Optimization.
APPROX-RANDOM 2005: 257-269 |
| 51 | EE | Chandra Chekuri,
Martin Pál:
A Recursive Greedy Algorithm for Walks in Directed Graphs.
FOCS 2005: 245-253 |
| 50 | EE | Chandra Chekuri,
Sanjeev Khanna,
F. Bruce Shepherd:
Multicommodity flow, well-linked terminals, and routing problems.
STOC 2005: 183-192 |
| 49 | EE | Chandra Chekuri,
Anupam Gupta,
Amit Kumar,
Joseph Naor,
Danny Raz:
Building Edge-Failure Resilient Networks.
Algorithmica 43(1-2): 17-41 (2005) |
| 48 | EE | Chandra Chekuri,
Anupam Gupta,
Amit Kumar:
On a bidirected relaxation for the MULTIWAY CUT problem.
Discrete Applied Mathematics 150(1-3): 67-79 (2005) |
| 47 | EE | Li Li,
Milind M. Buddhikot,
Chandra Chekuri,
K. Guo:
Routing bandwidth guaranteed paths with local restoration in label switched networks.
IEEE Journal on Selected Areas in Communications 23(2): 437-449 (2005) |
| 46 | EE | Chandra Chekuri,
Sanjeev Khanna:
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem.
SIAM J. Comput. 35(3): 713-728 (2005) |
| 2004 |
|---|
| 45 | EE | Chandra Chekuri,
Amit Kumar:
Maximum Coverage Problem with Group Budget Constraints and Applications.
APPROX-RANDOM 2004: 72-83 |
| 44 | EE | Chandra Chekuri,
Sanjeev Khanna,
F. Bruce Shepherd:
Edge-Disjoint Paths in Planar Graphs.
FOCS 2004: 71-80 |
| 43 | EE | Chandra Chekuri,
Sanjeev Khanna,
F. Bruce Shepherd:
The all-or-nothing multicommodity flow problem.
STOC 2004: 156-165 |
| 42 | EE | Chandra Chekuri,
Ashish Goel,
Sanjeev Khanna,
Amit Kumar:
Multi-processor scheduling to minimize flow time with epsilon resource augmentation.
STOC 2004: 363-372 |
| 41 | EE | Chandra Chekuri,
Sanjeev Khanna:
On Multidimensional Packing Problems.
SIAM J. Comput. 33(4): 837-851 (2004) |
| 40 | EE | Moses Charikar,
Chandra Chekuri,
Tomás Feder,
Rajeev Motwani:
Incremental Clustering and Dynamic Information Retrieval.
SIAM J. Comput. 33(6): 1417-1440 (2004) |
| 39 | EE | Chandra Chekuri,
Sanjeev Khanna,
Joseph Naor,
Leonid Zosin:
A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem.
SIAM J. Discrete Math. 18(3): 608-625 (2004) |
| 2003 |
|---|
| 38 | EE | Chandra Chekuri,
Sudipto Guha,
Joseph Naor:
Approximating Steiner k-Cuts.
ICALP 2003: 189-199 |
| 37 | EE | Chandra Chekuri,
Marcelo Mydlarz,
F. Bruce Shepherd:
Multicommodity Demand Flow in a Tree.
ICALP 2003: 410-425 |
| 36 | EE | Chandra Chekuri,
Anupam Gupta,
Ilan Newman,
Yuri Rabinovich,
Alistair Sinclair:
Embedding k-outerplanar graphs into l1.
SODA 2003: 527-536 |
| 35 | EE | Chandra Chekuri,
Sanjeev Khanna:
Edge disjoint paths revisited.
SODA 2003: 628-637 |
| 2002 |
|---|
| 34 | EE | Amit Chakrabarti,
Chandra Chekuri,
Anupam Gupta,
Amit Kumar:
Approximation Algorithms for the Unsplittable Flow Problem.
APPROX 2002: 51-66 |
| 33 | EE | Erran L. Li,
Milind M. Buddhikot,
Chandra Chekuri,
Jinhong Katherine Guo:
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks.
ICNP 2002: 110-121 |
| 32 | EE | Chandra Chekuri,
Anupam Gupta,
Amit Kumar,
Joseph Naor,
Danny Raz:
Building Edge-Failure Resilient Networks.
IPCO 2002: 439-456 |
| 31 | EE | Chandra Chekuri,
Sanjeev Khanna:
Approximation schemes for preemptive weighted flow time.
STOC 2002: 297-305 |
| 2001 |
|---|
| 30 | EE | Chandra Chekuri,
Sanjeev Khanna:
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines.
ICALP 2001: 848-861 |
| 29 | EE | Chandra Chekuri,
Sanjeev Khanna,
Joseph Naor,
Leonid Zosin:
Approximation algorithms for the metric labeling problem via a new linear programming formulation.
SODA 2001: 109-118 |
| 28 | EE | Chandra Chekuri,
Sanjeev Khanna,
Joseph Naor:
A deterministic algorithm for the cost-distance problem.
SODA 2001: 232-233 |
| 27 | EE | Chandra Chekuri,
Sanjeev Khanna,
An Zhu:
Algorithms for minimizing weighted flow time.
STOC 2001: 84-93 |
| 26 | EE | Chandra Chekuri,
Sanjeev Khanna:
Approximation Schemes for Preemptive Weighted Flow Time
Electronic Colloquium on Computational Complexity (ECCC) 8(065): (2001) |
| 25 | EE | Chandra Chekuri,
Michael A. Bender:
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines.
J. Algorithms 41(2): 212-224 (2001) |
| 24 | EE | Chandra Chekuri,
Rajeev Motwani,
B. Natarajan,
Clifford Stein:
Approximation Techniques for Average Completion Time Scheduling.
SIAM J. Comput. 31(1): 146-166 (2001) |
| 2000 |
|---|
| 23 | EE | Chandra Chekuri,
Kavita Ramanan,
Philip A. Whiting,
Lisa Zhang:
Blocking probability estimates in a partitioned sector TDMA system.
DIAL-M 2000: 28-34 |
| 22 | EE | Chandra Chekuri,
Sanjeev Khanna:
A PTAS for the multiple knapsack problem.
SODA 2000: 213-222 |
| 21 | EE | Michael A. Bender,
Chandra Chekuri:
Performance guarantees for the TSP with a parameterized triangle inequality.
Inf. Process. Lett. 73(1-2): 17-21 (2000) |
| 20 | EE | Chandra Chekuri,
Anand Rajaraman:
Conjunctive query containment revisited.
Theor. Comput. Sci. 239(2): 211-229 (2000) |
| 1999 |
|---|
| 19 | EE | Foto N. Afrati,
Evripidis Bampis,
Chandra Chekuri,
David R. Karger,
Claire Kenyon,
Sanjeev Khanna,
Ioannis Milis,
Maurice Queyranne,
Martin Skutella,
Clifford Stein,
Maxim Sviridenko:
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.
FOCS 1999: 32-44 |
| 18 | EE | Chandra Chekuri,
Sanjeev Khanna:
On Multi-Dimensional Packing Problems.
SODA 1999: 185-194 |
| 17 | EE | Chandra Chekuri,
Rajeev Motwani:
Minimizing Weighted Completion Time on a Single Machine.
SODA 1999: 873-874 |
| 16 | EE | Michael A. Bender,
Chandra Chekuri:
Performance Guarantees for the TSP with a Parameterized Triangle Inequality.
WADS 1999: 80-85 |
| 15 | EE | Chandra Chekuri,
Rajeev Motwani:
Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine.
Discrete Applied Mathematics 98(1-2): 29-38 (1999) |
| 14 | | Moses Charikar,
Chandra Chekuri,
To-Yat Cheung,
Zuo Dai,
Ashish Goel,
Sudipto Guha,
Ming Li:
Approximation Algorithms for Directed Steiner Problems.
J. Algorithms 33(1): 73-91 (1999) |
| 13 | | Donald Aingworth,
Chandra Chekuri,
Piotr Indyk,
Rajeev Motwani:
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication).
SIAM J. Comput. 28(4): 1167-1181 (1999) |
| 1998 |
|---|
| 12 | EE | Moses Charikar,
Chandra Chekuri,
Ashish Goel,
Sudipto Guha,
Serge A. Plotkin:
Approximating a Finite Metric by a Small Number of Tree Metrics.
FOCS 1998: 379-388 |
| 11 | EE | Chandra Chekuri,
Michael A. Bender:
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines.
IPCO 1998: 383-393 |
| 10 | | Moses Charikar,
Chandra Chekuri,
To-Yat Cheung,
Zuo Dai,
Ashish Goel,
Sudipto Guha,
Ming Li:
Approximation Algorithms for Directed Steiner Problems.
SODA 1998: 192-200 |
| 9 | EE | Moses Charikar,
Chandra Chekuri,
Ashish Goel,
Sudipto Guha:
Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median.
STOC 1998: 114-123 |
| 8 | EE | Narayanan Shivakumar,
Hector Garcia-Molina,
Chandra Chekuri:
Filtering with Approximate Predicates.
VLDB 1998: 263-274 |
| 1997 |
|---|
| 7 | EE | Chandra Chekuri,
Anand Rajaraman:
Conjunctive Query Containment Revisited.
ICDT 1997: 56-70 |
| 6 | | Chandra Chekuri,
Andrew V. Goldberg,
David R. Karger,
Matthew S. Levine,
Clifford Stein:
Experimental Study of Minimum Cut Algorithms.
SODA 1997: 324-333 |
| 5 | | Chandra Chekuri,
Rajeev Motwani,
B. Natarajan,
Clifford Stein:
Approximation Techniques for Average Completion Time Scheduling.
SODA 1997: 609-618 |
| 4 | EE | Moses Charikar,
Chandra Chekuri,
Tomás Feder,
Rajeev Motwani:
Incremental Clustering and Dynamic Information Retrieval.
STOC 1997: 626-635 |
| 1996 |
|---|
| 3 | EE | Chandra Chekuri,
Richard Johnson,
Rajeev Motwani,
B. Natarajan,
B. Ramakrishna Rau,
Michael S. Schlansker:
Profile-driven Instruction Level Parallel Scheduling with Application to Super Blocks.
MICRO 1996: 58-67 |
| 2 | | Donald Aingworth,
Chandra Chekuri,
Rajeev Motwani:
Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication).
SODA 1996: 547-553 |
| 1995 |
|---|
| 1 | EE | Chandra Chekuri,
Waqar Hasan,
Rajeev Motwani:
Scheduling Problems in Parallel Query Optimization.
PODS 1995: 255-265 |
