Chandra Chekuri Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2010
102Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design. SIAM J. Comput. 39(5): 1772-1798 (2010)
2009
101Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Alina Ene, Nitish Korula: Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs. APPROX-RANDOM 2009: 42-55
100Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Iftah Gamzu: Truthful Mechanisms via Greedy Iterative Packing. APPROX-RANDOM 2009: 56-69
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sungjin Im, Benjamin Moseley: Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. ESA 2009: 444-455
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Nitish Korula: A Graph Reduction Step Preserving Element-Connectivity and Applications. ICALP (1) 2009: 254-265
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChun-cheng Chen, Chandra Chekuri, D. Klabjan: Topology Formation for Wireless Mesh Network Planning. INFOCOM 2009: 2671-2675
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Benjamin Moseley: Online scheduling to minimize the maximum delay factor. SODA 2009: 1116-1125
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled: On the set multi-cover problem in geometric settings. Symposium on Computational Geometry 2009: 341-350
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd: A Note on Multiflows and Treewidth. Algorithmica 54(3): 400-412 (2009)
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Luca Trevisan: Foreword. Algorithmica 55(1): 111-112 (2009)
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Nitish Korula: A Graph Reduction Step Preserving Element-Connectivity and Applications CoRR abs/0902.2795: (2009)
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sungjin Im, Benjamin Moseley: Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling CoRR abs/0906.2048: (2009)
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sungjin Im, Benjamin Moseley: Longest Wait First for Broadcast Scheduling CoRR abs/0906.2395: (2009)
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Iftah Gamzu: Truthful Mechanisms via Greedy Iterative Packing CoRR abs/0906.2466: (2009)
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled: On the Set Multi-Cover Problem in Geometric Settings CoRR abs/0909.0537: (2009)
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Jan Vondrák: Randomized Pipage Rounding for Matroid Polytopes and Applications CoRR abs/0909.4348: (2009)
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGruia Calinescu, Chandra Chekuri, Jan Vondrák: Disjoint bases in a polymatroid. Random Struct. Algorithms 35(4): 418-430 (2009)
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd: Edge-Disjoint Paths in Planar Graphs with Constant Congestion. SIAM J. Comput. 39(1): 281-301 (2009)
2008
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Nitish Korula: Pruning 2-Connected Graphs. FSTTCS 2008: 119-130
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Nitish Korula: Single-Sink Network Design with Vertex Connectivity Requirements. FSTTCS 2008: 131-142
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna: Algorithms for 2-Route Cut Problems. ICALP (1) 2008: 472-484
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Guy Even, Anupam Gupta, Danny Segev: Set connectivity problems in undirected graphs and the directed Steiner network problem. SODA 2008: 532-541
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Nitish Korula, Martin Pál: Improved algorithms for orienteering and related problems. SODA 2008: 661-670
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri: Multicommodity Flow, Well-linked Terminals and Routing Problems. Encyclopedia of Algorithms 2008
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Nitish Korula: Min-Cost 2-Connected Subgraphs With k Terminals CoRR abs/0802.2528: (2008)
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Benjamin Moseley: Online Scheduling to Minimize the Maximum Delay Factor CoRR abs/0807.1891: (2008)
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, F. Bruce Shepherd: Approximate Integer Decompositions for Undirected Network Design Problems. SIAM J. Discrete Math. 23(1): 163-177 (2008)
2007
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSpyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang: Buy-at-Bulk Network Design with Protection. FOCS 2007: 634-644
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGruia 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
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximation algorithms for node-weighted buy-at-bulk network design. SODA 2007: 1265-1274
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd: Multicommodity demand flow in a tree and packing integer programs. ACM Transactions on Algorithms 3(3): (2007)
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna: Edge-disjoint paths revisited. ACM Transactions on Algorithms 3(4): (2007)
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar: Approximation Algorithms for the Unsplittable Flow Problem. Algorithmica 47(1): 53-78 (2007)
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Nitish Korula: Approximation Algorithms for Orienteering with Time Windows CoRR abs/0711.4825: (2007)
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra 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)
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, F. Bruce Shepherd, G. Oriolo, Maria Grazia Scutellà: Hardness of robust network design. Networks 50(1): 50-54 (2007)
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri: Routing and network design with robustness to changing or uncertain traffic demands. SIGACT News 38(3): 106-129 (2007)
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra 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
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra 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
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Martin Pál: An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem. APPROX-RANDOM 2006: 95-103
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour: Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. FOCS 2006: 677-686
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd: Edge-disjoint paths in Planar graphs with constant congestion. STOC 2006: 757-766
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra 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)
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Guy Even, Guy Kortsarz: A greedy approximation algorithm for the group Steiner problem. Discrete Applied Mathematics 154(1): 15-34 (2006)
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Christina Fragouli, Emina Soljanin: On average throughput and alphabet size in network coding. IEEE Transactions on Information Theory 52(6): 2410-2424 (2006)
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Daniele Micciancio: Special Issue: FOCS 2003. J. Comput. Syst. Sci. 72(2): 205 (2006)
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra 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)
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sudipto Guha, Joseph Naor: The Steiner k-Cut Problem. SIAM J. Discrete Math. 20(1): 261-271 (2006)
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra 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
53no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra 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
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMoses Charikar, Chandra Chekuri, Martin Pál: Sampling Bounds for Stochastic Optimization. APPROX-RANDOM 2005: 257-269
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Martin Pál: A Recursive Greedy Algorithm for Walks in Directed Graphs. FOCS 2005: 245-253
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd: Multicommodity flow, well-linked terminals, and routing problems. STOC 2005: 183-192
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz: Building Edge-Failure Resilient Networks. Algorithmica 43(1-2): 17-41 (2005)
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Anupam Gupta, Amit Kumar: On a bidirected relaxation for the MULTIWAY CUT problem. Discrete Applied Mathematics 150(1-3): 67-79 (2005)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLi Li, Milind M. Buddhikot, Chandra Chekuri, Katherine Guo: Routing bandwidth guaranteed paths with local restoration in label switched networks. IEEE Journal on Selected Areas in Communications 23(2): 437-449 (2005)
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna: A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem. SIAM J. Comput. 35(3): 713-728 (2005)
2004
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Amit Kumar: Maximum Coverage Problem with Group Budget Constraints and Applications. APPROX-RANDOM 2004: 72-83
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd: Edge-Disjoint Paths in Planar Graphs. FOCS 2004: 71-80
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd: The all-or-nothing multicommodity flow problem. STOC 2004: 156-165
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Ashish Goel, Sanjeev Khanna, Amit Kumar: Multi-processor scheduling to minimize flow time with epsilon resource augmentation. STOC 2004: 363-372
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna: On Multidimensional Packing Problems. SIAM J. Comput. 33(4): 837-851 (2004)
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMoses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani: Incremental Clustering and Dynamic Information Retrieval. SIAM J. Comput. 33(6): 1417-1440 (2004)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra 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
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sudipto Guha, Joseph Naor: Approximating Steiner k-Cuts. ICALP 2003: 189-199
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd: Multicommodity Demand Flow in a Tree. ICALP 2003: 410-425
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair: Embedding k-outerplanar graphs into l1. SODA 2003: 527-536
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna: Edge disjoint paths revisited. SODA 2003: 628-637
2002
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmit Chakrabarti, Chandra Chekuri, Anupam Gupta, Amit Kumar: Approximation Algorithms for the Unsplittable Flow Problem. APPROX 2002: 51-66
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErran 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
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz: Building Edge-Failure Resilient Networks. IPCO 2002: 439-456
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna: Approximation schemes for preemptive weighted flow time. STOC 2002: 297-305
2001
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna: A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines. ICALP 2001: 848-861
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin: Approximation algorithms for the metric labeling problem via a new linear programming formulation. SODA 2001: 109-118
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna, Joseph Naor: A deterministic algorithm for the cost-distance problem. SODA 2001: 232-233
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna, An Zhu: Algorithms for minimizing weighted flow time. STOC 2001: 84-93
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna: Approximation Schemes for Preemptive Weighted Flow Time Electronic Colloquium on Computational Complexity (ECCC) 8(065): (2001)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Michael A. Bender: An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. J. Algorithms 41(2): 212-224 (2001)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein: Approximation Techniques for Average Completion Time Scheduling. SIAM J. Comput. 31(1): 146-166 (2001)
2000
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Kavita Ramanan, Philip A. Whiting, Lisa Zhang: Blocking probability estimates in a partitioned sector TDMA system. DIAL-M 2000: 28-34
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna: A PTAS for the multiple knapsack problem. SODA 2000: 213-222
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael A. Bender, Chandra Chekuri: Performance guarantees for the TSP with a parameterized triangle inequality. Inf. Process. Lett. 73(1-2): 17-21 (2000)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Anand Rajaraman: Conjunctive query containment revisited. Theor. Comput. Sci. 239(2): 211-229 (2000)
1999
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFoto 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
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Sanjeev Khanna: On Multi-Dimensional Packing Problems. SODA 1999: 185-194
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Rajeev Motwani: Minimizing Weighted Completion Time on a Single Machine. SODA 1999: 873-874
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael A. Bender, Chandra Chekuri: Performance Guarantees for the TSP with a Parameterized Triangle Inequality. WADS 1999: 80-85
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra 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)
14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMoses 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)
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDonald 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
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMoses 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
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Michael A. Bender: An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. IPCO 1998: 383-393
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMoses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li: Approximation Algorithms for Directed Steiner Problems. SODA 1998: 192-200
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMoses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha: Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median. STOC 1998: 114-123
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNarayanan Shivakumar, Hector Garcia-Molina, Chandra Chekuri: Filtering with Approximate Predicates. VLDB 1998: 263-274
1997
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Anand Rajaraman: Conjunctive Query Containment Revisited. ICDT 1997: 56-70
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein: Experimental Study of Minimum Cut Algorithms. SODA 1997: 324-333
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Rajeev Motwani, B. Natarajan, Clifford Stein: Approximation Techniques for Average Completion Time Scheduling. SODA 1997: 609-618
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMoses Charikar, Chandra Chekuri, Tomás Feder, Rajeev Motwani: Incremental Clustering and Dynamic Information Retrieval. STOC 1997: 626-635
1996
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra 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
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDonald Aingworth, Chandra Chekuri, Rajeev Motwani: Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication). SODA 1996: 547-553
1995
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChandra Chekuri, Waqar Hasan, Rajeev Motwani: Scheduling Problems in Parallel Query Optimization. PODS 1995: 255-265

Coauthor Index

1Foto N. Afrati [19]
2Donald Aingworth [2] [13]
3Spyridon Antonakopoulos [75]
4Evripidis Bampis [19]
5Michael A. Bender [11] [16] [21] [25]
6Milind M. Buddhikot [33] [47]
7Gruia Calinescu [74] [86]
8Amit Chakrabarti [34] [70]
9Moses Charikar [4] [9] [10] [12] [14] [40] [52]
10Chun-cheng Chen [97]
11To-Yat Cheung [10] [14]
12Julia Chuzhoy [64] [68]
13Paul Claisse [60]
14Kenneth L. Clarkson [88] [95]
15Zuo Dai [10] [14]
16Alina Ene [101]
17René-Jean Essiambre [60]
18Guy Even [59] [81]
19Tomás Feder [4] [40]
20Steven Fortune [60]
21Christina Fragouli [58]
22Iftah Gamzu [89] [100]
23Hector Garcia-Molina [8]
24Ashish Goel [9] [10] [12] [14] [42]
25Andrew V. Goldberg [6]
26Sudipto Guha [9] [10] [12] [14] [38] [55]
27Jinhong Katherine Guo [33]
28Katherine Guo [47]
29Anupam Gupta [32] [34] [36] [48] [49] [56] [70] [81]
30Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi) [62] [73] [102]
31Sariel Har-Peled [88] [95]
32Waqar Hasan [1]
33Sungjin Im [90] [91] [99]
34Piotr Indyk [13]
35Klaus Jansen [53]
36Richard Johnson [3]
37David R. Karger [6] [19]
38Sanjeev Khanna [18] [19] [22] [26] [27] [28] [29] [30] [31] [35] [39] [41] [42] [43] [44] [46] [50] [54] [61] [71] [82] [85] [94]
39Daniel C. Kilper [60]
40D. Klabjan [97]
41Guy Kortsarz [59] [62] [73] [102]
42Nitish Korula [69] [78] [80] [83] [84] [92] [98] [101]
43Amit Kumar [32] [34] [42] [45] [48] [49] [70]
44Wonsuck Lee [60]
45Matthew S. Levine [6]
46Liane Lewin-Eytan [64] [68]
47Erran L. Li (Li Li, Li (Erran) Li) [33]
48Li Li [47]
49Ming Li [10] [14]
50Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu) [19]
51Daniele Micciancio [57]
52Ioannis Milis [19]
53Benjamin Moseley [77] [90] [91] [96] [99]
54Rajeev Motwani [1] [2] [3] [4] [5] [13] [15] [17] [24] [40]
55Marcelo Mydlarz [37] [72]
56Joseph Naor (Seffi Naor) [28] [29] [32] [38] [39] [49] [55] [64] [68]
57B. Natarajan [3] [5] [24]
58Ilan Newman [36] [56]
59Nachi K. Nithi [60]
60Ariel Orda [64] [68]
61G. Oriolo [67]
62Martin Pál (Martin Pal) [51] [52] [63] [65] [74] [80]
63Serge A. Plotkin [12]
64Maurice Queyranne [19]
65Yuri Rabinovich [36] [56]
66Anand Rajaraman [7] [20]
67Kavita Ramanan [23]
68B. Ramakrishna Rau [3]
69Danny Raz [32] [49]
70José D. P. Rolim [53]
71Mohammad R. Salavatipour [62] [73] [102]
72Iraj Saniee [60]
73Michael S. Schlansker [3]
74Maria Grazia Scutellà [67]
75Danny Segev [81]
76F. Bruce Shepherd [37] [43] [44] [50] [54] [60] [61] [67] [72] [75] [76] [85] [94]
77Narayanan Shivakumar [8]
78Alistair Sinclair [36] [56]
79Martin Skutella [19]
80Emina Soljanin [58]
81Clifford Stein [5] [6] [19] [24]
82Maxim Sviridenko [19]
83Luca Trevisan [53] [93]
84Jan Vondrák [74] [86] [87]
85Christopher A. White [60]
86Philip A. Whiting [23]
87Gordon T. Wilfong [60]
88Lisa Zhang [23] [60] [75]
89An Zhu [27]
90Leonid Zosin [29] [39]

Colors in the list of coauthors

Copyright © Sun Mar 14 22:39:24 2010 by Michael Ley (ley@uni-trier.de)