Samir Khuller

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