The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Samir Khuller: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Samir Khuller, Yossi Matias
    A Simple Randomized Sieve Algorithm for the Closest-Pair Problem [Citation Graph (1, 0)][DBLP]
    Inf. Comput., 1995, v:118, n:1, pp:34-37 [Journal]
  2. Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger
    Approximation Schemes for Broadcasting in Heterogenous Networks. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:163-170 [Conf]
  3. Samir Khuller, Yoo Ah Kim, Azarakhsh Malekian
    Improved Algorithms for Data Migration. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:164-175 [Conf]
  4. Samir Khuller, Robert Pless, Yoram J. Sussmann
    Fault Tolerant K-Center Problems. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:37-48 [Conf]
  5. Cheng-Fu Chou, Samir Khuller, Yung-Chun (Justin) Wan, Leana Golubchik, William C. Cheng
    Scalable and Secure Data Collection Using Bistro. [Citation Graph (0, 0)][DBLP]
    DG.O, 2002, pp:- [Conf]
  6. Jens Bleiholder, Samir Khuller, Felix Naumann, Louiqa Raschid, Yao Wu
    Query Planning in the Presence of Overlapping Sources. [Citation Graph (0, 0)][DBLP]
    EDBT, 2006, pp:811-828 [Conf]
  7. Leana Golubchik, Samir Khuller, Yoo Ah Kim, Svetlana Shargorodskaya, Yung-Chun (Justin) Wan
    Data Migration on Parallel Disks. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:689-701 [Conf]
  8. Sudipto Guha, Samir Khuller
    Approximation Algorithms for Connected Dominating Sets. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:179-193 [Conf]
  9. Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan
    On Generalized Gossiping and Broadcasting (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:373-384 [Conf]
  10. Samir Khuller, Kwangil Lee, Mark A. Shayman
    On Degree Constrained Shortest Paths. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:259-270 [Conf]
  11. Samir Khuller, Yoram J. Sussmann
    The Capacitated K-Center Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:152-166 [Conf]
  12. Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber
    Efficient Minimum Cost Matching Using Quadrangle Inequality [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:583-592 [Conf]
  13. Randeep Bhatia, Samir Khuller, Joseph Naor
    The Loading Time Scheduling Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:72-81 [Conf]
  14. Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy 0002, Aravind Srinivasan
    Dependent Rounding in Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:323-332 [Conf]
  15. Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani
    Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:300-305 [Conf]
  16. Samir Khuller, Baruch Schieber
    Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:288-293 [Conf]
  17. Sudipto Guha, Samir Khuller
    Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:54-65 [Conf]
  18. Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari
    Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:6-17 [Conf]
  19. Srinivas R. Kashyap, Samir Khuller
    Algorithms for Non-uniform Size Data Placement on Parallel Disks. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:265-276 [Conf]
  20. Samir Khuller
    Extending Planar Graph Algorithms to K 3, 3-free Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1988, pp:67-79 [Conf]
  21. Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan
    An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:164-175 [Conf]
  22. Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
    Approximation Algorithms for Partial Covering Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:225-236 [Conf]
  23. Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani
    On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:728-738 [Conf]
  24. Samir Khuller, Ehud Rivlin, Azriel Rosenfeld
    Graphbots: Mobility in Discrete Spaces. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:593-604 [Conf]
  25. Samir Khuller, Ramakrishna Thurimella
    Approximation Algorithms for Graph Augmentation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:330-341 [Conf]
  26. Suman Banerjee, Samir Khuller
    A Clustering Scheme for Hierarchical Control in Multi-hop Wireless Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2001, pp:1028-1037 [Conf]
  27. Suman Banerjee, Christopher Kommareddy, Koushik Kar, Samrat Bhattacharjee, Samir Khuller
    Construction of an Efficient Overlay Multicast Infrastructure for Real-time Applications. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2003, pp:- [Conf]
  28. William C. Cheng, Cheng-Fu Chou, Leana Golubchik, Samir Khuller, Yung-Chun (Justin) Wan
    Large-scale Data Collection: a Coordinated Approach. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2003, pp:- [Conf]
  29. 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. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:105-117 [Conf]
  30. Rajiv Gandhi, Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan
    Algorithms for Minimizing Response Time in Broadcast Scheduling. [Citation Graph (0, 0)][DBLP]
    IPCO, 2002, pp:425-438 [Conf]
  31. Samir Khuller, Joseph Naor
    Flow in Planar Graphs with Vertex Capacities. [Citation Graph (0, 0)][DBLP]
    IPCO, 1990, pp:367-384 [Conf]
  32. Samir Khuller, Uzi Vishkin, Neal E. Young
    A primal-dual parallel approximation technique applied to weighted set and vertex cover. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:333-341 [Conf]
  33. Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, An Zhu
    Achieving anonymity via clustering. [Citation Graph (0, 0)][DBLP]
    PODS, 2006, pp:153-162 [Conf]
  34. Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan
    Algorithms for data migration with cloning. [Citation Graph (0, 0)][DBLP]
    PODS, 2003, pp:27-36 [Conf]
  35. Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang
    Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:47-58 [Conf]
  36. Randeep Bhatia, Samir Khuller, Robert Pless, Yoram J. Sussmann
    The Full Degree Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:864-865 [Conf]
  37. Moses Charikar, Samir Khuller
    A robust maximum completion time measure for scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:324-333 [Conf]
  38. Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan
    Algorithms for facility location problems with outliers. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:642-651 [Conf]
  39. Leana Golubchik, Sanjeev Khanna, Samir Khuller, Ramakrishna Thurimella, An Zhu
    Approximation algorithms for data placement on parallel disks. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:223-232 [Conf]
  40. Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or
    Capacitated vertex covering with applications. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:858-865 [Conf]
  41. Sudipto Guha, Samir Khuller
    Greedy Strikes Back: Improved Facility Location Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:649-657 [Conf]
  42. Samir Khuller, Randeep Bhatia, Robert Pless
    On local search and placement of meters in networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:319-328 [Conf]
  43. Samir Khuller, Yoo Ah Kim
    On broadcasting in heterogenous networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1011-1020 [Conf]
  44. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Balancing Minimum Spanning and Shortest Path Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:243-250 [Conf]
  45. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Approximating the Minimum Equivalent Diagraph. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:177-186 [Conf]
  46. Samir Khuller, Balaji Raghavachari, An Zhu
    A Uniform Framework for Approximating Weighted Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:937-938 [Conf]
  47. Leonid Zosin, Samir Khuller
    On directed Steiner trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:59-63 [Conf]
  48. Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan
    Broadcasting on networks of workstations. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:279-288 [Conf]
  49. Moses Charikar, Samir Khuller, Balaji Raghavachari
    Algorithms for Capacitated Vehicle Routing. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:349-358 [Conf]
  50. Samir Khuller, Balaji Raghavachari
    Improved approximation algorithms for uniform connectivity problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:1-10 [Conf]
  51. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Low degree spanning trees of small weight. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:412-421 [Conf]
  52. Samir Khuller, Uzi Vishkin
    Biconnectivity Approximations and Graph Carvings [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:759-770 [Conf]
  53. Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann
    Facility Location with Dynamic Distance Function (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:23-34 [Conf]
  54. Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell
    Geometric Knapsack Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:165-176 [Conf]
  55. Samir Khuller
    Parallel Algorithms for the Subgraph Homeomorphism Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:303-315 [Conf]
  56. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Designing Multi-Commodity Flow Trees. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:433-441 [Conf]
  57. Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell
    Geometric Knapsack Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:10, n:5, pp:399-427 [Journal]
  58. Leana Golubchik, Samir Khuller, Yoo Ah Kim, Svetlana Shargorodskaya, Yung-Chun (Justin) Wan
    Data Migration on Parallel Disks: Algorithms and Evaluation. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:1, pp:137-158 [Journal]
  59. Sudipto Guha, Samir Khuller
    Approximation Algorithms for Connected Dominating Sets. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:4, pp:374-387 [Journal]
  60. Nili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari
    Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:4, pp:422-437 [Journal]
  61. Rajiv Gandhi, Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan
    Algorithms for Minimizing Response Time in Broadcast Scheduling. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:38, n:4, pp:597-608 [Journal]
  62. Klaus Jansen, Samir Khuller
    Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:3, pp:415-416 [Journal]
  63. Samir Khuller, Joseph Naor
    Flow in Planar Graphs with Vertex Capacities. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:3, pp:200-225 [Journal]
  64. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Balancing Minimum Spanning Trees and Shortest-Path Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:4, pp:305-321 [Journal]
  65. 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. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 2003, v:46, n:1, pp:50-51 [Journal]
  66. Suman Banerjee, Christopher Kommareddy, Koushik Kar, Bobby Bhattacharjee, Samir Khuller
    OMNI: An efficient overlay multicast infrastructure for real-time applications. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2006, v:50, n:6, pp:826-841 [Journal]
  67. Samir Khuller, Balaji Raghavachari, Neal E. Young
    On Strongly Connected Digraphs with Bounded Cycle Length [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  68. Samir Khuller, Uzi Vishkin, Neal E. Young
    A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Cover [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  69. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Approximating the Minimum Equivalent Digraph [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  70. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Low-Degree Spanning Trees of Small Weight [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  71. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Balancing Minimum Spanning and Shortest Path Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  72. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  73. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Designing Multi-Commodity Flow Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  74. Samir Khuller, Balaji Raghavachari
    Graph and Network Algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:1, pp:43-45 [Journal]
  75. Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld
    Landmarks in Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:70, n:3, pp:217-229 [Journal]
  76. Samir Khuller, Azriel Rosenfeld, Angela Y. Wu
    Centers of sets of pixels. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:297-306 [Journal]
  77. Samir Khuller, Balaji Raghavachari, Neal E. Young
    On Strongly Connected Digraphs with Bounded Cycle Length. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:69, n:3, pp:281-289 [Journal]
  78. Sudipto Guha, Samir Khuller
    Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:150, n:1, pp:57-74 [Journal]
  79. Samir Khuller
    Extending Planar Graph Algorithms to K_3,3-Free Graphs [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:84, n:1, pp:13-25 [Journal]
  80. Samir Khuller
    Addendum to "An O(|V|2) algorithm for single connectedness". [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:5-6, pp:263- [Journal]
  81. Samir Khuller
    On Computing Graph Closures. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:5, pp:249-255 [Journal]
  82. Samir Khuller
    Coloring Algorithms for K_5-Minor Free Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:4, pp:203-208 [Journal]
  83. Samir Khuller
    An O(|V|2) algorithm for single connectedness. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:72, n:3-4, pp:105-107 [Journal]
  84. Samir Khuller, Joseph S. B. Mitchell
    On a Triangle Counting Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:33, n:6, pp:319-321 [Journal]
  85. Samir Khuller, Anna Moss, Joseph Naor
    The Budgeted Maximum Coverage Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:70, n:1, pp:39-45 [Journal]
  86. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Designing Multi-Commodity Flow Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:1, pp:49-55 [Journal]
  87. Samir Khuller, Baruch Schieber
    On Independent Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:6, pp:321-323 [Journal]
  88. Samir Khuller, Uzi Vishkin
    On the Parallel Complexity of Digraph Reachability. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:5, pp:239-241 [Journal]
  89. Samir Khuller, An Zhu
    The General Steiner Tree-Star problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:4, pp:215-220 [Journal]
  90. Samir Khuller, Uzi Vishkin
    Biconnectivity Approximations and Graph Carvings. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:2, pp:214-235 [Journal]
  91. Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy 0002, Aravind Srinivasan
    Dependent rounding and its applications to approximation algorithms. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:3, pp:324-360 [Journal]
  92. Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber
    Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:19, n:1, pp:116-143 [Journal]
  93. Randeep Bhatia, Samir Khuller, Joseph Naor
    The Loading Time Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:36, n:1, pp:1-33 [Journal]
  94. 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. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:2, pp:310-324 [Journal]
  95. Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
    Approximation algorithms for partial covering problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:53, n:1, pp:55-84 [Journal]
  96. Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or
    Capacitated vertex covering. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:1, pp:257-270 [Journal]
  97. Sudipto Guha, Samir Khuller
    Greedy Strikes Back: Improved Facility Location Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:31, n:1, pp:228-248 [Journal]
  98. Refael Hassin, Samir Khuller
    z-Approximations. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:429-442 [Journal]
  99. Srinivas R. Kashyap, Samir Khuller
    Algorithms for non-uniform size data placement on parallel disks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:60, n:2, pp:144-167 [Journal]
  100. Samir Khuller
    Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:2, pp:401-403 [Journal]
  101. Samir Khuller
    Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:28, n:1, pp:192-195 [Journal]
  102. Samir Khuller, Pankaj K. Agarwal, Joseph O'Rourke
    Open Problems Presented at SCG'98. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:30, n:2, pp:449-453 [Journal]
  103. Samir Khuller, Manfred Göbel, Jochen Walter
    Bases for Polynomial Invariants of Conjugates of Permutation Groups. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:32, n:1, pp:58-61 [Journal]
  104. Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan
    On generalized gossiping and broadcasting. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:59, n:2, pp:81-106 [Journal]
  105. Samir Khuller, Balaji Raghavachari
    Improved Approximation Algorithms for Uniform Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:2, pp:434-450 [Journal]
  106. Samir Khuller, Ramakrishna Thurimella
    Approximation Algorithms for Graph Augmentation. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:2, pp:214-225 [Journal]
  107. Samir Khuller, Uzi Vishkin, Neal E. Young
    A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:2, pp:280-289 [Journal]
  108. Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann
    Facility Location with Dynamic Distance Functions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:3, pp:199-217 [Journal]
  109. Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan
    An improved approximation algorithm for vertex cover with hard capacities. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:1, pp:16-33 [Journal]
  110. Randeep Bhatia, Samir Khuller, Robert Pless, Yoram J. Sussmann
    The full-degree spanning tree problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:4, pp:203-209 [Journal]
  111. Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang
    Approximation algorithms for channel allocation problems in broadcast networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:47, n:4, pp:225-236 [Journal]
  112. Samir Khuller, Yoo Ah Kim
    Equivalence of two linear programming relaxations for broadcast scheduling. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:5, pp:473-478 [Journal]
  113. Moses Charikar, Samir Khuller, Balaji Raghavachari
    Algorithms for Capacitated Vehicle Routing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:665-682 [Journal]
  114. Samir Khuller, Randeep Bhatia, Robert Pless
    On Local Search and Placement of Meters in Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:2, pp:470-487 [Journal]
  115. Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan
    Algorithms for Data Migration with Cloning. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:448-461 [Journal]
  116. Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani
    Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:3, pp:486-506 [Journal]
  117. Samir Khuller, Balaji Raghavachari, Michael R. Fellows
    Approximating the Minimum Equivalent Digraph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:4, pp:859-872 [Journal]
  118. Samir Khuller, Balaji Raghavachari, Neal E. Young
    Low-Degree Spanning Trees of Small Weight. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:2, pp:355-368 [Journal]
  119. Samir Khuller, Baruch Schieber
    Efficient Parallel Algorithms for Testing k-Connectivity and Finding Disjoint s-t Paths in Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:2, pp:352-375 [Journal]
  120. Samir Khuller, Joseph Naor, Philip N. Klein
    The Lattice Structure of Flow in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:3, pp:477-490 [Journal]
  121. Samir Khuller, Yoram J. Sussmann
    The Capacitated K-Center Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:3, pp:403-418 [Journal]
  122. William C. Cheng, Cheng-Fu Chou, Leana Golubchik, Samir Khuller
    A performance study of Bistro, a scalable upload architecture. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2002, v:29, n:4, pp:31-39 [Journal]
  123. Samrat Bhattacharjee, William C. Cheng, Cheng-Fu Chou, Leana Golubchik, Samir Khuller
    Bistro: a framework for building scalable wide-area Upload applications. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS Performance Evaluation Review, 2000, v:28, n:2, pp:29-35 [Journal]
  124. Samir Khuller
    Problems column. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:1, pp:157-159 [Journal]
  125. Samir Khuller
    Problems column. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:1, pp:130-134 [Journal]
  126. Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani
    On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:127, n:2, pp:255-267 [Journal]
  127. Samir Khuller, Robert Pless, Yoram J. Sussmann
    Fault tolerant K-center problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:242, n:1-2, pp:237-245 [Journal]
  128. Samir Khuller, Vijay V. Vazirani
    Planar Graph Coloring is not Self-Reducible, Assuming P != NP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:88, n:1, pp:183-189 [Journal]
  129. Samir Khuller, Azarakhsh Malekian, Julián Mestre
    To Fill or Not to Fill: The Gas Station Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:534-545 [Conf]
  130. Abhishek Kashyap, Samir Khuller, Mark A. Shayman
    Relay Placement for Higher Order Connectivity in Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  131. Samir Khuller, Maria Vanina Martinez, Dana S. Nau, Gerardo I. Simari, Amy Sliva, V. S. Subrahmanian
    Finding Most Probable Worlds of Probabilistic Logic Programs. [Citation Graph (0, 0)][DBLP]
    SUM, 2007, pp:45-59 [Conf]
  132. Samir Khuller, Yoo Ah Kim
    Broadcasting in Heterogeneous Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:48, n:1, pp:1-21 [Journal]
  133. Abhishek Kashyap, Kwangil Lee, Mehdi Kalantari, Samir Khuller, Mark A. Shayman
    Integrated topology control and routing in wireless optical mesh networks. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2007, v:51, n:15, pp:4237-4251 [Journal]
  134. Samir Khuller
    Problems column. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:3, pp:- [Journal]

  135. Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity. [Citation Graph (, )][DBLP]


  136. An Optimal Incremental Algorithm for Minimizing Lateness with Rejection. [Citation Graph (, )][DBLP]


  137. On Finding Dense Subgraphs. [Citation Graph (, )][DBLP]


  138. Minimizing Communication Cost in Distributed Multi-query Processing. [Citation Graph (, )][DBLP]


  139. On Computing Compression Trees for Data Collection in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  140. On the tradeoff between playback delay and buffer space in streaming. [Citation Graph (, )][DBLP]


  141. Online allocation of display advertisements subject to advanced sales contracts. [Citation Graph (, )][DBLP]


  142. Energy Efficient Monitoring in Sensor Networks. [Citation Graph (, )][DBLP]


  143. Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs. [Citation Graph (, )][DBLP]


  144. Broadcast scheduling: algorithms and complexity. [Citation Graph (, )][DBLP]


  145. Energy Efficient Scheduling via Partial Shutdown. [Citation Graph (, )][DBLP]


  146. Computing most probable worlds of action probabilistic logic programs: scalable estimation for 1030, 000 worlds. [Citation Graph (, )][DBLP]


  147. On Computing Compression Trees for Data Collection in Sensor Networks [Citation Graph (, )][DBLP]


  148. Energy Efficient Scheduling via Partial Shutdown [Citation Graph (, )][DBLP]


Search in 0.896secs, Finished in 0.905secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002