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