| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Samir Khuller Samir Khuller, Yoo Ah Kim : On broadcasting in heterogenous networks. SODA 2004 : 1011-1020 Samir Khuller, Yoo Ah Kim , Yung-Chun (Justin) Wan : On Generalized Gossiping and Broadcasting (Extended Abstract). ESA 2003 : 373-384 Srinivas Kashyap , Samir Khuller: Algorithms for Non-uniform Size Data Placement on Parallel Disks. FSTTCS 2003 : 265-276 Rajiv Gandhi , Eran Halperin , Samir Khuller, Guy Kortsarz , Aravind Srinivasan : An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. ICALP 2003 : 164-175 Suman Banerjee , Christopher Kommareddy , Koushik Kar , Samrat Bhattacharjee , Samir Khuller: Construction of an Efficient Overlay Multicast Infrastructure for Real-time Applications. INFOCOM 2003 William C. Cheng , Cheng-Fu Chou , Leana Golubchik , Samir Khuller, Yung-Chun (Justin) Wan : Large-scale Data Collection: a Coordinated Approach. INFOCOM 2003 Samir Khuller, Yoo Ah Kim , Yung-Chun (Justin) Wan : Algorithms for data migration with cloning. PODS 2003 : 27-36 Rajiv Gandhi , Samir Khuller, Aravind Srinivasan , Nan Wang : Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. RANDOM-APPROX 2003 : 47-58 Leana Golubchik , William C. Cheng , Cheng-Fu Chou , Samir Khuller, Hanan Samet , C. Justin Wan : Bistro: a scalable and secure data transfer service for digital government applications. Commun. ACM 46 (1): 50-51 (2003) Sudipto Guha , Refael Hassin , Samir Khuller, Einat Or : Capacitated vertex covering. J. Algorithms 48 (1): 257-270 (2003) Samir Khuller, Randeep Bhatia , Robert Pless : On Local Search and Placement of Meters in Networks. SIAM J. Comput. 32 (2): 470-487 (2003) Rajiv Gandhi , Samir Khuller, Srinivasan Parthasarathy , Aravind Srinivasan : Dependent Rounding in Bipartite Graphs. FOCS 2002 : 323-332 Rajiv Gandhi , Samir Khuller, Yoo Ah Kim , Yung-Chun (Justin) Wan : Algorithms for Minimizing Response Time in Broadcast Scheduling. IPCO 2002 : 425-438 Leonid Zosin , Samir Khuller: On directed Steiner trees. SODA 2002 : 59-63 Sudipto Guha , Refael Hassin , Samir Khuller, Einat Or : Capacitated vertex covering with applications. SODA 2002 : 858-865 Samir Khuller, An Zhu : The General Steiner Tree-Star problem. Inf. Process. Lett. 84 (4): 215-220 (2002) William C. Cheng , Cheng-Fu Chou , Leana Golubchik , Samir Khuller: A performance study of Bistro, a scalable upload architecture. SIGMETRICS Performance Evaluation Review 29 (4): 31-39 (2002) Rajiv Gandhi , Samir Khuller, Aravind Srinivasan : Approximation Algorithms for Partial Covering Problems. ICALP 2001 : 225-236 Suman Banerjee , Samir Khuller: A Clustering Scheme for Hierarchical Control in Multi-hop Wireless Networks. INFOCOM 2001 : 1028-1037 Moses Charikar , Samir Khuller, David M. Mount , Giri Narasimhan : Algorithms for facility location problems with outliers. SODA 2001 : 642-651 Refael Hassin , Samir Khuller: z-Approximations. J. Algorithms 41 (2): 429-442 (2001) Moses Charikar , Samir Khuller, Balaji Raghavachari : Algorithms for Capacitated Vehicle Routing. SIAM J. Comput. 31 (3): 665-682 (2001) Klaus Jansen , Samir Khuller: Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings Springer 2000 Leana Golubchik , Sanjeev Khanna , Samir Khuller, Ramakrishna Thurimella , An Zhu : Approximation algorithms for data placement on parallel disks. SODA 2000 : 223-232 Samir Khuller, Randeep Bhatia , Robert Pless : On local search and placement of meters in networks. SODA 2000 : 319-328 Nili Guttmann-Beck , Refael Hassin , Samir Khuller, Balaji Raghavachari : Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. Algorithmica 28 (4): 422-437 (2000) Samir Khuller, Azriel Rosenfeld , Angela Y. Wu : Centers of sets of pixels. Discrete Applied Mathematics 103 (1-3): 297-306 (2000) Samir Khuller: Addendum to "An O(|V| 2 ) algorithm for single connectedness". Inf. Process. Lett. 74 (5-6): 263 (2000) Randeep Bhatia , Samir Khuller, Joseph Naor : The Loading Time Scheduling Problem. J. Algorithms 36 (1): 1-33 (2000) Randeep Bhatia , Samir Khuller, Robert Pless , Yoram J. Sussmann : The full-degree spanning tree problem. Networks 36 (4): 203-209 (2000) Samir Khuller, Yoram J. Sussmann : The Capacitated K -Center Problem. SIAM J. Discrete Math. 13 (3): 403-418 (2000) Samrat Bhattacharjee , William C. Cheng , Cheng-Fu Chou , Leana Golubchik , Samir Khuller: Bistro: a framework for building scalable wide-area Upload applications. SIGMETRICS Performance Evaluation Review 28 (2): 29-35 (2000) Samir Khuller, Robert Pless , Yoram J. Sussmann : Fault tolerant K-center problems. Theor. Comput. Sci. 242 (1-2): 237-245 (2000) Randeep Bhatia , Samir Khuller, Robert Pless , Yoram J. Sussmann : The Full Degree Spanning Tree Problem. SODA 1999 : 864-865 Samir Khuller, Balaji Raghavachari , An Zhu : A Uniform Framework for Approximating Weighted Connectivity Problems. SODA 1999 : 937-938 Sudipto Guha , Samir Khuller: Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Inf. Comput. 150 (1): 57-74 (1999) Samir Khuller, Anna Moss , Joseph Naor : The Budgeted Maximum Coverage Problem. Inf. Process. Lett. 70 (1): 39-45 (1999) Samir Khuller: An O(|V|2) algorithm for single connectedness. Inf. Process. Lett. 72 (3-4): 105-107 (1999) Samir Khuller, Pankaj K. Agarwal , Joseph O'Rourke : Open Problems Presented at SCG'98. J. Algorithms 30 (2): 449-453 (1999) Sudipto Guha , Samir Khuller: Greedy Strikes Back: Improved Facility Location Algorithms. J. Algorithms 31 (1): 228-248 (1999) Samir Khuller, Manfred Göbel , Jochen Walter : Bases for Polynomial Invariants of Conjugates of Permutation Groups. J. Algorithms 32 (1): 58-61 (1999) Sudipto Guha , Samir Khuller: Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. FSTTCS 1998 : 54-65 Nili Guttmann-Beck , Refael Hassin , Samir Khuller, Balaji Raghavachari : Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. FSTTCS 1998 : 6-17 Sudipto Guha , Samir Khuller: Greedy Strikes Back: Improved Facility Location Algorithms. SODA 1998 : 649-657 Moses Charikar , Samir Khuller, Balaji Raghavachari : Algorithms for Capacitated Vehicle Routing. STOC 1998 : 349-358 Randeep Bhatia , Sudipto Guha , Samir Khuller, Yoram J. Sussmann : Facility Location with Dynamic Distance Function (Extended Abstract). SWAT 1998 : 23-34 Sudipto Guha , Samir Khuller: Approximation Algorithms for Connected Dominating Sets. Algorithmica 20 (4): 374-387 (1998) Samir Khuller: Problems. J. Algorithms 28 (1): 192-195 (1998) Randeep Bhatia , Sudipto Guha , Samir Khuller, Yoram J. Sussmann : Facility Location with Dynamic Distance Functions. J. Comb. Optim. 2 (3): 199-217 (1998) Samir Khuller, Robert Pless , Yoram J. Sussmann : Fault Tolerant K-Center Problems. CIAC 1997 : 37-48 Samir Khuller, Balaji Raghavachari : Graph and Network Algorithms. The Computer Science and Engineering Handbook 1997 : 203-225 Samir Khuller: Problems. J. Algorithms 23 (2): 401-403 (1997) Sándor P. Fekete , Samir Khuller, Monika Klemmstein , Balaji Raghavachari , Neal E. Young : A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. J. Algorithms 24 (2): 310-324 (1997) Samir Khuller, Yoram J. Sussmann : The Capacitated K-Center Problem (Extended Abstract). ESA 1996 : 152-166 Sudipto Guha , Samir Khuller: Approximation Algorithms for Connected Dominating Sets. ESA 1996 : 179-193 Sándor P. Fekete , Samir Khuller, Monika Klemmstein , Balaji Raghavachari , Neal E. Young : A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. IPCO 1996 : 105-117 Samir Khuller, Balaji Raghavachari : Graph and Network Algorithms. ACM Comput. Surv. 28 (1): 43-45 (1996) Samir Khuller, Balaji Raghavachari , Neal E. Young : On Strongly Connected Digraphs with Bounded Cycle Length. Discrete Applied Mathematics 69 (3): 281-289 (1996) Samir Khuller, Balaji Raghavachari , Azriel Rosenfeld : Landmarks in Graphs. Discrete Applied Mathematics 70 (3): 217-229 (1996) Samir Khuller, Balaji Raghavachari : Improved Approximation Algorithms for Uniform Connectivity Problems. J. Algorithms 21 (2): 434-450 (1996) Samir Khuller, Balaji Raghavachari , Neal E. Young : Low-Degree Spanning Trees of Small Weight. SIAM J. Comput. 25 (2): 355-368 (1996) Randeep Bhatia , Samir Khuller, Joseph Naor : The Loading Time Scheduling Problem (Extended Abstract). FOCS 1995 : 72-81 Samir Khuller, Ehud Rivlin , Azriel Rosenfeld : Graphbots: Mobility in Discrete Spaces. ICALP 1995 : 593-604 Samir Khuller, Balaji Raghavachari : Improved approximation algorithms for uniform connectivity problems. STOC 1995 : 1-10 Samir Khuller, Balaji Raghavachari , Neal E. Young : Balancing Minimum Spanning Trees and Shortest-Path Trees. Algorithmica 14 (4): 305-321 (1995) Samir Khuller, Yossi Matias : A Simple Randomized Sieve Algorithm for the Closest-Pair Problem Inf. Comput. 118 (1): 34-37 (1995) Alok Aggarwal , Amotz Bar-Noy , Samir Khuller, Dina Kravets , Baruch Schieber : Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality. J. Algorithms 19 (1): 116-143 (1995) Samir Khuller, Balaji Raghavachari , Michael R. Fellows : Approximating the Minimum Equivalent Digraph. SIAM J. Comput. 24 (4): 859-872 (1995) Samir Khuller, Balaji Raghavachari , Neal E. Young : Approximating the Minimum Equivalent Diagraph. SODA 1994 : 177-186 Samir Khuller, Balaji Raghavachari , Neal E. Young : Low degree spanning trees of small weight. STOC 1994 : 412-421 Samir Khuller, Joseph Naor : Flow in Planar Graphs with Vertex Capacities. Algorithmica 11 (3): 200-225 (1994) Samir Khuller, Balaji Raghavachari , Neal E. Young : Designing Multi-Commodity Flow Trees. Inf. Process. Lett. 50 (1): 49-55 (1994) Samir Khuller, Uzi Vishkin : On the Parallel Complexity of Digraph Reachability. Inf. Process. Lett. 52 (5): 239-241 (1994) Samir Khuller, Uzi Vishkin : Biconnectivity Approximations and Graph Carvings. J. ACM 41 (2): 214-235 (1994) Samir Khuller, Uzi Vishkin , Neal E. Young : A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers. J. Algorithms 17 (2): 280-289 (1994) Samir Khuller, Stephen G. Mitchell , Vijay V. Vazirani : On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. Theor. Comput. Sci. 127 (2): 255-267 (1994) Samir Khuller, Uzi Vishkin , Neal E. Young : A primal-dual parallel approximation technique applied to weighted set and vertex cover. IPCO 1993 : 333-341 Samir Khuller, Balaji Raghavachari , Neal E. Young : Balancing Minimum Spanning and Shortest Path Trees. SODA 1993 : 243-250 Samir Khuller, Balaji Raghavachari , Neal E. Young : Designing Multi-Commodity Flow Trees. WADS 1993 : 433-441 Esther M. Arkin , Samir Khuller, Joseph S. B. Mitchell : Geometric Knapsack Problems. Algorithmica 10 (5): 399-427 (1993) Samir Khuller, Ramakrishna Thurimella : Approximation Algorithms for Graph Augmentation. J. Algorithms 14 (2): 214-225 (1993) Samir Khuller, Joseph Naor , Philip N. Klein : The Lattice Structure of Flow in Planar Graphs. SIAM J. Discrete Math. 6 (3): 477-490 (1993) Alok Aggarwal , Amotz Bar-Noy , Samir Khuller, Dina Kravets , Baruch Schieber : Efficient Minimum Cost Matching Using Quadrangle Inequality FOCS 1992 : 583-592 Samir Khuller, Ramakrishna Thurimella : Approximation Algorithms for Graph Augmentation. ICALP 1992 : 330-341 Samir Khuller, Uzi Vishkin : Biconnectivity Approximations and Graph Carvings STOC 1992 : 759-770 Samir Khuller, Baruch Schieber : On Independent Spanning Trees. Inf. Process. Lett. 42 (6): 321-323 (1992) Samir Khuller, Stephen G. Mitchell , Vijay V. Vazirani : Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph. SIAM J. Comput. 21 (3): 486-506 (1992) Samir Khuller, Stephen G. Mitchell , Vijay V. Vazirani : On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. ICALP 1991 : 728-738 Esther M. Arkin , Samir Khuller, Joseph S. B. Mitchell : Geometric Knapsack Problems. WADS 1991 : 165-176 Samir Khuller, Baruch Schieber : Efficient Parallel Algorithms for Testing k-Connectivity and Finding Disjoint s-t Paths in Graphs. SIAM J. Comput. 20 (2): 352-375 (1991) Samir Khuller, Vijay V. Vazirani : Planar Graph Coloring is not Self-Reducible, Assuming P != NP. Theor. Comput. Sci. 88 (1): 183-189 (1991) Samir Khuller, Joseph Naor : Flow in Planar Graphs with Vertex Capacities. IPCO 1990 : 367-384 Samir Khuller: Extending Planar Graph Algorithms to K_3,3-Free Graphs Inf. Comput. 84 (1): 13-25 (1990) Samir Khuller, Joseph S. B. Mitchell : On a Triangle Counting Problem. Inf. Process. Lett. 33 (6): 319-321 (1990) Samir Khuller: Coloring Algorithms for K_5-Minor Free Graphs. Inf. Process. Lett. 34 (4): 203-208 (1990) Samir Khuller, Baruch Schieber : Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary) FOCS 1989 : 288-293 Samir Khuller, Stephen G. Mitchell , Vijay V. Vazirani : Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph FOCS 1989 : 300-305 Samir Khuller: Parallel Algorithms for the Subgraph Homeomorphism Problem. WADS 1989 : 303-315 Samir Khuller: On Computing Graph Closures. Inf. Process. Lett. 31 (5): 249-255 (1989) Samir Khuller: Extending Planar Graph Algorithms to K 3, 3 -free Graphs. FSTTCS 1988 : 67-79 1 [ 62 ] 2 [ 18 ] [ 34 ] 3 [ 12 ] [ 21 ] 4 [ 82 ] [ 96 ] 5 [ 18 ] [ 34 ] 6 [ 39 ] [ 52 ] [ 55 ] [ 67 ] [ 71 ] [ 72 ] [ 76 ] [ 90 ] 7 [ 69 ] [ 96 ] 8 [ 56 ] [ 79 ] [ 81 ] 9 [ 69 ] [ 84 ] [ 92 ] [ 95 ] 10 [ 69 ] [ 84 ] [ 92 ] [ 95 ] 11 [ 45 ] [ 48 ] 12 [ 33 ] 13 [ 83 ] [ 88 ] [ 89 ] [ 93 ] [ 97 ] 14 [ 60 ] 15 [ 69 ] [ 77 ] [ 84 ] [ 92 ] [ 95 ] 16 [ 46 ] [ 52 ] [ 54 ] [ 55 ] [ 57 ] [ 59 ] [ 61 ] [ 65 ] [ 86 ] [ 91 ] 17 [ 58 ] [ 75 ] 18 [ 97 ] 19 [ 58 ] [ 75 ] [ 80 ] [ 86 ] [ 91 ] 20 [ 78 ] 21 [ 96 ] 22 [ 98 ] 23 [ 77 ] 24 [ 88 ] [ 94 ] [ 99 ] [ 100 ] 25 [ 19 ] 26 [ 45 ] [ 48 ] 27 [ 96 ] 28 [ 97 ] 29 [ 18 ] [ 34 ] 30 [ 35 ] 31 [ 7 ] [ 12 ] [ 21 ] 32 [ 4 ] [ 13 ] [ 14 ] [ 25 ] 33 [ 64 ] 34 [ 81 ] 35 [ 9 ] [ 19 ] [ 30 ] [ 39 ] [ 64 ] [ 72 ] 36 [ 81 ] 37 [ 62 ] 38 [ 86 ] [ 91 ] 39 [ 89 ] 40 [ 51 ] [ 67 ] [ 68 ] [ 71 ] [ 76 ] [ 90 ] 41 [ 22 ] [ 23 ] [ 29 ] [ 31 ] [ 32 ] [ 33 ] [ 36 ] [ 37 ] [ 40 ] [ 41 ] [ 42 ] [ 43 ] [ 44 ] [ 45 ] [ 48 ] [ 50 ] [ 56 ] [ 58 ] [ 66 ] [ 75 ] [ 79 ] 42 [ 38 ] 43 [ 38 ] [ 42 ] [ 74 ] 44 [ 92 ] 45 [ 5 ] [ 11 ] [ 15 ] [ 18 ] [ 34 ] 46 [ 83 ] [ 89 ] [ 93 ] [ 97 ] 47 [ 47 ] [ 51 ] [ 52 ] [ 55 ] [ 67 ] [ 68 ] [ 70 ] [ 71 ] 48 [ 17 ] [ 20 ] [ 77 ] 49 [ 4 ] [ 10 ] [ 13 ] [ 14 ] [ 25 ] 50 [ 16 ] [ 24 ] [ 26 ] [ 27 ] [ 28 ] 51 [ 60 ] 52 [ 92 ] 53 [ 88 ] [ 94 ] [ 95 ] [ 99 ] 54 [ 93 ] 55 [ 74 ] 56 [ 22 ] [ 23 ] [ 24 ] [ 26 ] [ 29 ] [ 31 ] [ 32 ] [ 36 ] [ 40 ] [ 43 ] [ 45 ] [ 48 ] 57 [ 66 ] [ 77 ] [ 85 ] 58 [ 87 ]  ©2004 Association for Computing Machinery |
