Search the dblp DataBase
Chandra Chekuri :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Chandra Chekuri , Anand Rajaraman Conjunctive Query Containment Revisited. [Citation Graph (9, 16)][DBLP ] ICDT, 1997, pp:56-70 [Conf ] Chandra Chekuri , Waqar Hasan , Rajeev Motwani Scheduling Problems in Parallel Query Optimization. [Citation Graph (3, 12)][DBLP ] PODS, 1995, pp:255-265 [Conf ] Narayanan Shivakumar , Hector Garcia-Molina , Chandra Chekuri Filtering with Approximate Predicates. [Citation Graph (3, 17)][DBLP ] VLDB, 1998, pp:263-274 [Conf ] Amit Chakrabarti , Chandra Chekuri , Anupam Gupta , Amit Kumar Approximation Algorithms for the Unsplittable Flow Problem. [Citation Graph (0, 0)][DBLP ] APPROX, 2002, pp:51-66 [Conf ] Moses Charikar , Chandra Chekuri , Martin Pál Sampling Bounds for Stochastic Optimization. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2005, pp:257-269 [Conf ] Chandra Chekuri , Amit Kumar Maximum Coverage Problem with Group Budget Constraints and Applications. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:72-83 [Conf ] Chandra Chekuri , Martin Pál An O (logn ) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2006, pp:95-103 [Conf ] Chandra Chekuri , Kavita Ramanan , Philip A. Whiting , Lisa Zhang Blocking probability estimates in a partitioned sector TDMA system. [Citation Graph (0, 0)][DBLP ] DIAL-M, 2000, pp:28-34 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] FOCS, 1999, pp:32-44 [Conf ] Chandra Chekuri , Sanjeev Khanna , F. Bruce Shepherd Edge-Disjoint Paths in Planar Graphs. [Citation Graph (0, 0)][DBLP ] FOCS, 2004, pp:71-80 [Conf ] Chandra Chekuri , Martin Pál A Recursive Greedy Algorithm for Walks in Directed Graphs. [Citation Graph (0, 0)][DBLP ] FOCS, 2005, pp:245-253 [Conf ] Moses Charikar , Chandra Chekuri , Ashish Goel , Sudipto Guha , Serge A. Plotkin Approximating a Finite Metric by a Small Number of Tree Metrics. [Citation Graph (0, 0)][DBLP ] FOCS, 1998, pp:379-388 [Conf ] Chandra Chekuri , Mohammad Taghi Hajiaghayi , Guy Kortsarz , Mohammad R. Salavatipour Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. [Citation Graph (0, 0)][DBLP ] FOCS, 2006, pp:677-686 [Conf ] Chandra Chekuri , Sudipto Guha , Joseph Naor Approximating Steiner k-Cuts. [Citation Graph (0, 0)][DBLP ] ICALP, 2003, pp:189-199 [Conf ] Chandra Chekuri , Sanjeev Khanna A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines. [Citation Graph (0, 0)][DBLP ] ICALP, 2001, pp:848-861 [Conf ] Chandra Chekuri , Marcelo Mydlarz , F. Bruce Shepherd Multicommodity Demand Flow in a Tree. [Citation Graph (0, 0)][DBLP ] ICALP, 2003, pp:410-425 [Conf ] Erran L. Li , Milind M. Buddhikot , Chandra Chekuri , Jinhong Katherine Guo Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks. [Citation Graph (0, 0)][DBLP ] ICNP, 2002, pp:110-121 [Conf ] Chandra Chekuri , Anupam Gupta , Amit Kumar , Joseph Naor , Danny Raz Building Edge-Failure Resilient Networks. [Citation Graph (0, 0)][DBLP ] IPCO, 2002, pp:439-456 [Conf ] Chandra Chekuri , Michael A. Bender An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. [Citation Graph (0, 0)][DBLP ] IPCO, 1998, pp:383-393 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] MICRO, 1996, pp:58-67 [Conf ] Chandra Chekuri , Julia Chuzhoy , Liane Lewin-Eytan , Joseph Naor , Ariel Orda Non-cooperative multicast and facility location games. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2006, pp:72-81 [Conf ] Donald Aingworth , Chandra Chekuri , Rajeev Motwani Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication). [Citation Graph (0, 0)][DBLP ] SODA, 1996, pp:547-553 [Conf ] Moses Charikar , Chandra Chekuri , To-Yat Cheung , Zuo Dai , Ashish Goel , Sudipto Guha , Ming Li Approximation Algorithms for Directed Steiner Problems. [Citation Graph (0, 0)][DBLP ] SODA, 1998, pp:192-200 [Conf ] Chandra Chekuri , Andrew V. Goldberg , David R. Karger , Matthew S. Levine , Clifford Stein Experimental Study of Minimum Cut Algorithms. [Citation Graph (0, 0)][DBLP ] SODA, 1997, pp:324-333 [Conf ] Chandra Chekuri , Anupam Gupta , Ilan Newman , Yuri Rabinovich , Alistair Sinclair Embedding k-outerplanar graphs into l1. [Citation Graph (0, 0)][DBLP ] SODA, 2003, pp:527-536 [Conf ] Chandra Chekuri , Sanjeev Khanna A PTAS for the multiple knapsack problem. [Citation Graph (0, 0)][DBLP ] SODA, 2000, pp:213-222 [Conf ] Chandra Chekuri , Sanjeev Khanna Edge disjoint paths revisited. [Citation Graph (0, 0)][DBLP ] SODA, 2003, pp:628-637 [Conf ] Chandra Chekuri , Sanjeev Khanna On Multi-Dimensional Packing Problems. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:185-194 [Conf ] Chandra Chekuri , Sanjeev Khanna , Joseph Naor A deterministic algorithm for the cost-distance problem. [Citation Graph (0, 0)][DBLP ] SODA, 2001, pp:232-233 [Conf ] Chandra Chekuri , Sanjeev Khanna , Joseph Naor , Leonid Zosin Approximation algorithms for the metric labeling problem via a new linear programming formulation. [Citation Graph (0, 0)][DBLP ] SODA, 2001, pp:109-118 [Conf ] Chandra Chekuri , Rajeev Motwani Minimizing Weighted Completion Time on a Single Machine. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:873-874 [Conf ] Chandra Chekuri , Rajeev Motwani , B. Natarajan , Clifford Stein Approximation Techniques for Average Completion Time Scheduling. [Citation Graph (0, 0)][DBLP ] SODA, 1997, pp:609-618 [Conf ] Moses Charikar , Chandra Chekuri , Tomás Feder , Rajeev Motwani Incremental Clustering and Dynamic Information Retrieval. [Citation Graph (0, 0)][DBLP ] STOC, 1997, pp:626-635 [Conf ] Moses Charikar , Chandra Chekuri , Ashish Goel , Sudipto Guha Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k -Median. [Citation Graph (0, 0)][DBLP ] STOC, 1998, pp:114-123 [Conf ] Chandra Chekuri , Ashish Goel , Sanjeev Khanna , Amit Kumar Multi-processor scheduling to minimize flow time with epsilon resource augmentation. [Citation Graph (0, 0)][DBLP ] STOC, 2004, pp:363-372 [Conf ] Chandra Chekuri , Sanjeev Khanna Approximation schemes for preemptive weighted flow time. [Citation Graph (0, 0)][DBLP ] STOC, 2002, pp:297-305 [Conf ] Chandra Chekuri , Sanjeev Khanna , F. Bruce Shepherd The all-or-nothing multicommodity flow problem. [Citation Graph (0, 0)][DBLP ] STOC, 2004, pp:156-165 [Conf ] Chandra Chekuri , Sanjeev Khanna , F. Bruce Shepherd Multicommodity flow, well-linked terminals, and routing problems. [Citation Graph (0, 0)][DBLP ] STOC, 2005, pp:183-192 [Conf ] Chandra Chekuri , Sanjeev Khanna , F. Bruce Shepherd Edge-disjoint paths in Planar graphs with constant congestion. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:757-766 [Conf ] Chandra Chekuri , Sanjeev Khanna , An Zhu Algorithms for minimizing weighted flow time. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:84-93 [Conf ] Michael A. Bender , Chandra Chekuri Performance Guarantees for the TSP with a Parameterized Triangle Inequality. [Citation Graph (0, 0)][DBLP ] WADS, 1999, pp:80-85 [Conf ] Chandra Chekuri , Anupam Gupta , Amit Kumar , Joseph Naor , Danny Raz Building Edge-Failure Resilient Networks. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2005, v:43, n:1-2, pp:17-41 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Bell Labs Technical Journal, 2006, v:11, n:2, pp:129-143 [Journal ] Chandra Chekuri , Guy Even , Guy Kortsarz A greedy approximation algorithm for the group Steiner problem. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2006, v:154, n:1, pp:15-34 [Journal ] Chandra Chekuri , Anupam Gupta , Amit Kumar On a bidirected relaxation for the MULTIWAY CUT problem. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2005, v:150, n:1-3, pp:67-79 [Journal ] Chandra Chekuri , Rajeev Motwani Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1999, v:98, n:1-2, pp:29-38 [Journal ] Michael A. Bender , Chandra Chekuri Performance guarantees for the TSP with a parameterized triangle inequality. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:73, n:1-2, pp:17-21 [Journal ] Moses Charikar , Chandra Chekuri , To-Yat Cheung , Zuo Dai , Ashish Goel , Sudipto Guha , Ming Li Approximation Algorithms for Directed Steiner Problems. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1999, v:33, n:1, pp:73-91 [Journal ] Chandra Chekuri , Michael A. Bender An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2001, v:41, n:2, pp:212-224 [Journal ] Chandra Chekuri , Daniele Micciancio Special Issue: FOCS 2003. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2006, v:72, n:2, pp:205- [Journal ] Donald Aingworth , Chandra Chekuri , Piotr Indyk , Rajeev Motwani Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication). [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1999, v:28, n:4, pp:1167-1181 [Journal ] Moses Charikar , Chandra Chekuri , Tomás Feder , Rajeev Motwani Incremental Clustering and Dynamic Information Retrieval. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2004, v:33, n:6, pp:1417-1440 [Journal ] Chandra Chekuri , Sanjeev Khanna On Multidimensional Packing Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2004, v:33, n:4, pp:837-851 [Journal ] Chandra Chekuri , Sanjeev Khanna A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2005, v:35, n:3, pp:713-728 [Journal ] Chandra Chekuri , Rajeev Motwani , B. Natarajan , Clifford Stein Approximation Techniques for Average Completion Time Scheduling. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2001, v:31, n:1, pp:146-166 [Journal ] Chandra Chekuri , Sudipto Guha , Joseph Naor The Steiner k -Cut Problem. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2006, v:20, n:1, pp:261-271 [Journal ] Chandra Chekuri , Anupam Gupta , Ilan Newman , Yuri Rabinovich , Alistair Sinclair Embedding k -Outerplanar Graphs into l 1 . [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2006, v:20, n:1, pp:119-136 [Journal ] Chandra Chekuri , Sanjeev Khanna , Joseph Naor , Leonid Zosin A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2004, v:18, n:3, pp:608-625 [Journal ] Chandra Chekuri , Anand Rajaraman Conjunctive query containment revisited. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2000, v:239, n:2, pp:211-229 [Journal ] Chandra Chekuri , Christina Fragouli , Emina Soljanin On average throughput and alphabet size in network coding. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2006, v:52, n:6, pp:2410-2424 [Journal ] Gruia Calinescu , Chandra Chekuri , Martin Pál , Jan Vondrák Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). [Citation Graph (0, 0)][DBLP ] IPCO, 2007, pp:182-196 [Conf ] Chandra Chekuri , Mohammad Taghi Hajiaghayi , Guy Kortsarz , Mohammad R. Salavatipour Approximation algorithms for node-weighted buy-at-bulk network design. [Citation Graph (0, 0)][DBLP ] SODA, 2007, pp:1265-1274 [Conf ] Amit Chakrabarti , Chandra Chekuri , Anupam Gupta , Amit Kumar Approximation Algorithms for the Unsplittable Flow Problem. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2007, v:47, n:1, pp:53-78 [Journal ] Chandra Chekuri , Marcelo Mydlarz , F. Bruce Shepherd Multicommodity demand flow in a tree and packing integer programs. [Citation Graph (0, 0)][DBLP ] ACM Transactions on Algorithms, 2007, v:3, n:3, pp:- [Journal ] Truthful Mechanisms via Greedy Iterative Packing. [Citation Graph (, )][DBLP ] Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs. [Citation Graph (, )][DBLP ] On the set multi-cover problem in geometric settings. [Citation Graph (, )][DBLP ] Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. [Citation Graph (, )][DBLP ] Buy-at-Bulk Network Design with Protection. [Citation Graph (, )][DBLP ] Single-Sink Network Design with Vertex Connectivity Requirements. [Citation Graph (, )][DBLP ] Pruning 2-Connected Graphs. [Citation Graph (, )][DBLP ] Algorithms for 2-Route Cut Problems. [Citation Graph (, )][DBLP ] A Graph Reduction Step Preserving Element-Connectivity and Applications. [Citation Graph (, )][DBLP ] Topology Formation for Wireless Mesh Network Planning. [Citation Graph (, )][DBLP ] Improved algorithms for orienteering and related problems. [Citation Graph (, )][DBLP ] Set connectivity problems in undirected graphs and the directed Steiner network problem. [Citation Graph (, )][DBLP ] Online scheduling to minimize the maximum delay factor. [Citation Graph (, )][DBLP ] Flow-Cut Gaps for Integer and Fractional Multiflows. [Citation Graph (, )][DBLP ] Longest Wait First for Broadcast Scheduling [Extended Abstract]. [Citation Graph (, )][DBLP ] A Note on Multiflows and Treewidth. [Citation Graph (, )][DBLP ] Foreword. [Citation Graph (, )][DBLP ] Approximation Algorithms for Orienteering with Time Windows [Citation Graph (, )][DBLP ] Min-Cost 2-Connected Subgraphs With k Terminals [Citation Graph (, )][DBLP ] Online Scheduling to Minimize the Maximum Delay Factor [Citation Graph (, )][DBLP ] A Graph Reduction Step Preserving Element-Connectivity and Applications [Citation Graph (, )][DBLP ] Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling [Citation Graph (, )][DBLP ] Longest Wait First for Broadcast Scheduling [Citation Graph (, )][DBLP ] Truthful Mechanisms via Greedy Iterative Packing [Citation Graph (, )][DBLP ] On the Set Multi-Cover Problem in Geometric Settings [Citation Graph (, )][DBLP ] Randomized Pipage Rounding for Matroid Polytopes and Applications [Citation Graph (, )][DBLP ] Prize-Collecting Steiner Tree and Forest in Planar Graphs [Citation Graph (, )][DBLP ] Flow-Cut Gaps for Integer and Fractional Multiflows [Citation Graph (, )][DBLP ] Search in 0.011secs, Finished in 0.018secs