| 2013 | ||
|---|---|---|
| j101 | Geet Duggal, Robert Patro, Emre Sefer, Hao Wang, Darya Filippova, Samir Khuller, Carl Kingsford: Resolving spatial inconsistencies in chromosome conformation measurements. Algorithms for Molecular Biology 8: 8 (2013) | |
| c80 | Jessica Chang, Samir Khuller: A Min-Edge Cost Flow Framework for Capacitated Covering Problems. ALENEX 2013: 14-25 | |
| i12 | K. Ashwin Kumar, Amol Deshpande, Samir Khuller: Data Placement and Replica Selection for Improving Co-location in Distributed Environments. CoRR abs/1302.4168 (2013) | |
| 2012 | ||
| j100 | Samir Khuller, Yoo-Ah Kim, Azarakhsh Malekian: Improved Approximation Algorithms for Data Migration. Algorithmica 63(1-2): 347-362 (2012) | |
| j99 | Alix L. H. Chow, Leana Golubchik, Samir Khuller, Yuan Yao: Performance tradeoffs in structured peer to peer streaming. J. Parallel Distrib. Comput. 72(3): 323-337 (2012) | |
| j98 | Edward Bortnikov, Samir Khuller, Jian Li, Yishay Mansour, Joseph Naor: The load-distance balancing problem. Networks 59(1): 22-29 (2012) | |
| j97 | Samir Khuller: Algorithms column: An overview of the recent progress on matrix multiplication by Virginia Vassilevska Williams. SIGACT News 43(4): 57-59 (2012) | |
| j96 | Samir Khuller, Sudipto Guha: Special Issue in Honor of Rajeev Motwani (1962-2009): Guest Editors' Foreword. Theory of Computing 8(1): 53-54 (2012) | |
| c79 | Samir Khuller, Barna Saha, Kanthi K. Sarpatwar: New Approximation Results for Resource Replication Problems. APPROX-RANDOM 2012: 218-230 | |
| c78 | Jessica Chang, Harold N. Gabow, Samir Khuller: A Model for Minimizing Active Processor Time. ESA 2012: 289-300 | |
| c77 | Marek Cygan, MohammadTaghi Hajiaghayi, Samir Khuller: LP Rounding for k-Centers with Non-uniform Hard Capacities. FOCS 2012: 273-282 | |
| c76 | Barna Saha, Samir Khuller: Set Cover Revisited: Hypergraph Cover with Hard Capacities. ICALP (1) 2012: 762-773 | |
| c75 | Koyel Mukherjee, Samir Khuller, Amol Deshpande: Saving on cooling: the thermal scheduling problem. SIGMETRICS 2012: 397-398 | |
| c74 | Geet Duggal, Robert Patro, Emre Sefer, Hao Wang, Darya Filippova, Samir Khuller, Carl Kingsford: Resolving Spatial Inconsistencies in Chromosome Conformation Data. WABI 2012: 288-300 | |
| i11 | Jessica Chang, Harold N. Gabow, Samir Khuller: A Model for Minimizing Active Processor Time. CoRR abs/1208.0312 (2012) | |
| i10 | Marek Cygan, MohammadTaghi Hajiaghayi, Samir Khuller: LP Rounding for k-Centers with Non-uniform Hard Capacities. CoRR abs/1208.3054 (2012) | |
| 2011 | ||
| j95 | Amol Deshpande, Samir Khuller, Azarakhsh Malekian, Mohammed Toossi: Energy Efficient Monitoring in Sensor Networks. Algorithmica 59(1): 94-114 (2011) | |
| j94 | Abhishek Kashyap, Samir Khuller, Mark A. Shayman: Relay placement for fault tolerance in wireless networks in higher dimensions. Comput. Geom. 44(4): 206-215 (2011) | |
| j93 | Samir Khuller, Azarakhsh Malekian, Julián Mestre: To fill or not to fill: The gas station problem. ACM Transactions on Algorithms 7(3): 36 (2011) | |
| j92 | Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller: Broadcast scheduling: Algorithms and complexity. ACM Transactions on Algorithms 7(4): 47 (2011) | |
| c73 | Andreas Thor, Philip Anderson, Louiqa Raschid, Saket Navlakha, Barna Saha, Samir Khuller, Xiao-Ning Zhang: Link Prediction for Annotation Graphs Using Graph Summarization. International Semantic Web Conference (1) 2011: 714-729 | |
| c72 | ||
| 2010 | ||
| j91 | Samir Khuller, Yoo-Ah Kim, Yung-Chun (Justin) Wan: Broadcasting on Networks of Workstations. Algorithmica 57(4): 848-868 (2010) | |
| j90 | Gagan Aggarwal, Rina Panigrahy, Tomás Feder, Dilys Thomas, Krishnaram Kenthapadi, Samir Khuller, An Zhu: Achieving anonymity via clustering. ACM Transactions on Algorithms 6(3) (2010) | |
| c71 | Jian Li, Amol Deshpande, Samir Khuller: On Computing Compression Trees for Data Collection in Wireless Sensor Networks. INFOCOM 2010: 2115-2123 | |
| c70 | Barna Saha, Allison Hoch, Samir Khuller, Louiqa Raschid, Xiao-Ning Zhang: Dense Subgraphs with Restrictions and Applications to Gene Annotation Graphs. RECOMB 2010: 456-472 | |
| c69 | Samir Khuller, Jian Li, Barna Saha: Energy Efficient Scheduling via Partial Shutdown. SODA 2010: 1360-1372 | |
| c68 | Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard Matthew McCutchen, Benjamin Moseley, Louiqa Raschid: New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract). WAOA 2010: 71-82 | |
| 2009 | ||
| j89 | Leana Golubchik, Sanjeev Khanna, Samir Khuller, Ramakrishna Thurimella, An Zhu: Approximation algorithms for data placement on parallel disks. ACM Transactions on Algorithms 5(4) (2009) | |
| c67 | ||
| c66 | Jian Li, Amol Deshpande, Samir Khuller: Minimizing Communication Cost in Distributed Multi-query Processing. ICDE 2009: 772-783 | |
| c65 | 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 | |
| c64 | 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 | |
| i9 | Jian Li, Amol Deshpande, Samir Khuller: On Computing Compression Trees for Data Collection in Sensor Networks. CoRR abs/0907.5442 (2009) | |
| i8 | Samir Khuller, Jian Li, Barna Saha: Energy Efficient Scheduling via Partial Shutdown. CoRR abs/0912.1329 (2009) | |
| 2008 | ||
| j88 | 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) | |
| c63 | Richard Matthew McCutchen, Samir Khuller: Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity. APPROX-RANDOM 2008: 165-178 | |
| c62 | Samir Khuller, Julián Mestre: An Optimal Incremental Algorithm for Minimizing Lateness with Rejection. ESA 2008: 601-610 | |
| c61 | Amol Deshpande, Samir Khuller, Azarakhsh Malekian, Mohammed Toossi: Energy Efficient Monitoring in Sensor Networks. LATIN 2008: 436-448 | |
| c60 | Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller: Broadcast scheduling: algorithms and complexity. SODA 2008: 473-482 | |
| r2 | ||
| r1 | ||
| 2007 | ||
| j87 | ||
| j86 | 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) | |
| j85 | 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) | |
| j84 | ||
| j83 | ||
| c59 | Samir Khuller, Azarakhsh Malekian, Julián Mestre: To Fill or Not to Fill: The Gas Station Problem. ESA 2007: 534-545 | |
| c58 | 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 | |
| 2006 | ||
| j82 | 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) | |
| j81 | 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) | |
| j80 | Kurt Rohloff, Samir Khuller, Guy Kortsarz: Approximating the Minimal Sensor Selection for Supervisory Control. Discrete Event Dynamic Systems 16(1): 143-170 (2006) | |
| j79 | Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan: Dependent rounding and its applications to approximation algorithms. J. ACM 53(3): 324-360 (2006) | |
| j78 | Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan: On generalized gossiping and broadcasting. J. Algorithms 59(2): 81-106 (2006) | |
| j77 | Srinivas R. Kashyap, Samir Khuller: Algorithms for non-uniform size data placement on parallel disks. J. Algorithms 60(2): 144-167 (2006) | |
| j76 | 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) | |
| j75 | Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang: Approximation algorithms for channel allocation problems in broadcast networks. Networks 47(4): 225-236 (2006) | |
| j74 | ||
| c57 | Srinivas R. Kashyap, Samir Khuller, Yung-Chun (Justin) Wan, Leana Golubchik: Fast Reconfiguration of Data Placement in Parallel Disks. ALENEX 2006: 95-107 | |
| c56 | Samir Khuller, Yoo Ah Kim, Azarakhsh Malekian: Improved Algorithms for Data Migration. APPROX-RANDOM 2006: 164-175 | |
| c55 | Jens Bleiholder, Samir Khuller, Felix Naumann, Louiqa Raschid, Yao Wu: Query Planning in the Presence of Overlapping Sources. EDBT 2006: 811-828 | |
| c54 | Abhishek Kashyap, Samir Khuller, Mark A. Shayman: Relay Placement for Higher Order Connectivity in Wireless Sensor Networks. INFOCOM 2006 | |
| c53 | Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, An Zhu: Achieving anonymity via clustering. PODS 2006: 153-162 | |
| c52 | Moses Charikar, Samir Khuller: A robust maximum completion time measure for scheduling. SODA 2006: 324-333 | |
| 2005 | ||
| j73 | ||
| j72 | ||
| c51 | Samir Khuller, Kwangil Lee, Mark A. Shayman: On Degree Constrained Shortest Paths. ESA 2005: 259-270 | |
| c50 | Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan: Broadcasting on networks of workstations. SPAA 2005: 279-288 | |
| 2004 | ||
| j71 | 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) | |
| j70 | Rajiv Gandhi, Samir Khuller, Aravind Srinivasan: Approximation algorithms for partial covering problems. J. Algorithms 53(1): 55-84 (2004) | |
| j69 | 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) | |
| j68 | Samir Khuller, Yoo Ah Kim: Equivalence of two linear programming relaxations for broadcast scheduling. Oper. Res. Lett. 32(5): 473-478 (2004) | |
| j67 | Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan: Algorithms for Data Migration with Cloning. SIAM J. Comput. 33(2): 448-461 (2004) | |
| c49 | Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger: Approximation Schemes for Broadcasting in Heterogenous Networks. APPROX-RANDOM 2004: 163-170 | |
| c48 | Leana Golubchik, Samir Khuller, Yoo Ah Kim, Svetlana Shargorodskaya, Yung-Chun (Justin) Wan: Data Migration on Parallel Disks. ESA 2004: 689-701 | |
| c47 | ||
| 2003 | ||
| j66 | ||
| j65 | 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) | |
| j64 | Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or: Capacitated vertex covering. J. Algorithms 48(1): 257-270 (2003) | |
| j63 | Samir Khuller, Randeep Bhatia, Robert Pless: On Local Search and Placement of Meters in Networks. SIAM J. Comput. 32(2): 470-487 (2003) | |
| c46 | Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan: On Generalized Gossiping and Broadcasting (Extended Abstract). ESA 2003: 373-384 | |
| c45 | Srinivas R. Kashyap, Samir Khuller: Algorithms for Non-uniform Size Data Placement on Parallel Disks. FSTTCS 2003: 265-276 | |
| c44 | Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan: An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. ICALP 2003: 164-175 | |
| c43 | Suman Banerjee, Christopher Kommareddy, Koushik Kar, Samrat Bhattacharjee, Samir Khuller: Construction of an Efficient Overlay Multicast Infrastructure for Real-time Applications. INFOCOM 2003 | |
| c42 | William C. Cheng, Cheng-Fu Chou, Leana Golubchik, Samir Khuller, Yung-Chun (Justin) Wan: Large-scale Data Collection: a Coordinated Approach. INFOCOM 2003 | |
| c41 | Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan: Algorithms for data migration with cloning. PODS 2003: 27-36 | |
| c40 | Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang: Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. RANDOM-APPROX 2003: 47-58 | |
| 2002 | ||
| j62 | Samir Khuller, An Zhu: The General Steiner Tree-Star problem. Inf. Process. Lett. 84(4): 215-220 (2002) | |
| j61 | ||
| j60 | 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) | |
| c39 | Cheng-Fu Chou, Samir Khuller, Yung-Chun (Justin) Wan, Leana Golubchik, William C. Cheng: Scalable and Secure Data Collection Using Bistro. DG.O 2002 | |
| c38 | Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan: Dependent Rounding in Bipartite Graphs. FOCS 2002: 323-332 | |
| c37 | Rajiv Gandhi, Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan: Algorithms for Minimizing Response Time in Broadcast Scheduling. IPCO 2002: 425-438 | |
| c36 | ||
| c35 | Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or: Capacitated vertex covering with applications. SODA 2002: 858-865 | |
| i7 | Samir Khuller, Balaji Raghavachari, Neal E. Young: On Strongly Connected Digraphs with Bounded Cycle Length. CoRR cs.DS/0205011 (2002) | |
| i6 | 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) | |
| i5 | Samir Khuller, Balaji Raghavachari, Neal E. Young: Approximating the Minimum Equivalent Digraph. CoRR cs.DS/0205040 (2002) | |
| i4 | Samir Khuller, Balaji Raghavachari, Neal E. Young: Low-Degree Spanning Trees of Small Weight. CoRR cs.DS/0205043 (2002) | |
| i3 | Samir Khuller, Balaji Raghavachari, Neal E. Young: Balancing Minimum Spanning and Shortest Path Trees. CoRR cs.DS/0205045 (2002) | |
| i2 | 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) | |
| i1 | Samir Khuller, Balaji Raghavachari, Neal E. Young: Designing Multi-Commodity Flow Trees. CoRR cs.DS/0205077 (2002) | |
| 2001 | ||
| j59 | ||
| j58 | Ruth Ben-Yashar, Samir Khuller, Sarit Kraus: Optimal collective dichotomous choice under partial order constraints. Mathematical Social Sciences 41(3): 349-364 (2001) | |
| j57 | Moses Charikar, Samir Khuller, Balaji Raghavachari: Algorithms for Capacitated Vehicle Routing. SIAM J. Comput. 31(3): 665-682 (2001) | |
| j56 | ||
| c34 | Rajiv Gandhi, Samir Khuller, Aravind Srinivasan: Approximation Algorithms for Partial Covering Problems. ICALP 2001: 225-236 | |
| c33 | Suman Banerjee, Samir Khuller: A Clustering Scheme for Hierarchical Control in Multi-hop Wireless Networks. INFOCOM 2001: 1028-1037 | |
| c32 | Moses Charikar, Samir Khuller, David M. Mount, Giri Narasimhan: Algorithms for facility location problems with outliers. SODA 2001: 642-651 | |
| 2000 | ||
| j55 | 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) | |
| j54 | Samir Khuller, Azriel Rosenfeld, Angela Y. Wu: Centers of sets of pixels. Discrete Applied Mathematics 103(1-3): 297-306 (2000) | |
| j53 | Samir Khuller: Addendum to "An O(|V|2) algorithm for single connectedness". Inf. Process. Lett. 74(5-6): 263 (2000) | |
| j52 | Randeep Bhatia, Samir Khuller, Joseph Naor: The Loading Time Scheduling Problem. J. Algorithms 36(1): 1-33 (2000) | |
| j51 | Randeep Bhatia, Samir Khuller, Robert Pless, Yoram J. Sussmann: The full-degree spanning tree problem. Networks 36(4): 203-209 (2000) | |
| j50 | Samir Khuller, Yoram J. Sussmann: The Capacitated K-Center Problem. SIAM J. Discrete Math. 13(3): 403-418 (2000) | |
| j49 | 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) | |
| j48 | Samir Khuller, Robert Pless, Yoram J. Sussmann: Fault tolerant K-center problems. Theor. Comput. Sci. 242(1-2): 237-245 (2000) | |
| c31 | Leana Golubchik, Sanjeev Khanna, Samir Khuller, Ramakrishna Thurimella, An Zhu: Approximation algorithms for data placement on parallel disks. SODA 2000: 223-232 | |
| c30 | Samir Khuller, Randeep Bhatia, Robert Pless: On local search and placement of meters in networks. SODA 2000: 319-328 | |
| e1 | Klaus Jansen, Samir Khuller (Eds.): Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings. Lecture Notes in Computer Science 1913, Springer 2000, isbn 3-540-67996-0 | |
| 1999 | ||
| j47 | Sudipto Guha, Samir Khuller: Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Inf. Comput. 150(1): 57-74 (1999) | |
| j46 | Samir Khuller, Anna Moss, Joseph Naor: The Budgeted Maximum Coverage Problem. Inf. Process. Lett. 70(1): 39-45 (1999) | |
| j45 | Samir Khuller: An O(|V|2) algorithm for single connectedness. Inf. Process. Lett. 72(3-4): 105-107 (1999) | |
| j44 | Samir Khuller, Pankaj K. Agarwal, Joseph O'Rourke: Open Problems Presented at SCG'98. J. Algorithms 30(2): 449-453 (1999) | |
| j43 | Sudipto Guha, Samir Khuller: Greedy Strikes Back: Improved Facility Location Algorithms. J. Algorithms 31(1): 228-248 (1999) | |
| j42 | Samir Khuller, Manfred Göbel, Jochen Walter: Bases for Polynomial Invariants of Conjugates of Permutation Groups. J. Algorithms 32(1): 58-61 (1999) | |
| j41 | ||
| c29 | Randeep Bhatia, Samir Khuller, Robert Pless, Yoram J. Sussmann: The Full Degree Spanning Tree Problem. SODA 1999: 864-865 | |
| c28 | Samir Khuller, Balaji Raghavachari, An Zhu: A Uniform Framework for Approximating Weighted Connectivity Problems. SODA 1999: 937-938 | |
| 1998 | ||
| j40 | Sudipto Guha, Samir Khuller: Approximation Algorithms for Connected Dominating Sets. Algorithmica 20(4): 374-387 (1998) | |
| j39 | ||
| j38 | Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann: Facility Location with Dynamic Distance Functions. J. Comb. Optim. 2(3): 199-217 (1998) | |
| j37 | ||
| j36 | Samir Khuller: Book review: Selected Papers on Computer Science by Donald E. Knuth. SIGACT News 29(2): 21-26 (1998) | |
| j35 | Samir Khuller, Ehud Rivlin, Azriel Rosenfeld: Graphbots: cooperative motion planning in discrete spaces. IEEE Transactions on Systems, Man, and Cybernetics, Part C 28(1): 29-38 (1998) | |
| c27 | 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 | |
| c26 | Sudipto Guha, Samir Khuller: Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. FSTTCS 1998: 54-65 | |
| c25 | Sudipto Guha, Samir Khuller: Greedy Strikes Back: Improved Facility Location Algorithms. SODA 1998: 649-657 | |
| c24 | Moses Charikar, Samir Khuller, Balaji Raghavachari: Algorithms for Capacitated Vehicle Routing. STOC 1998: 349-358 | |
| c23 | Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann: Facility Location with Dynamic Distance Function (Extended Abstract). SWAT 1998: 23-34 | |
| 1997 | ||
| j34 | ||
| j33 | 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) | |
| j32 | ||
| p1 | Samir Khuller, Balaji Raghavachari: Graph and Network Algorithms. The Computer Science and Engineering Handbook 1997: 203-225 | |
| c22 | ||
| 1996 | ||
| j31 | Samir Khuller, Balaji Raghavachari: Graph and Network Algorithms. ACM Comput. Surv. 28(1): 43-45 (1996) | |
| j30 | Samir Khuller, Balaji Raghavachari, Neal E. Young: On Strongly Connected Digraphs with Bounded Cycle Length. Discrete Applied Mathematics 69(3): 281-289 (1996) | |
| j29 | Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld: Landmarks in Graphs. Discrete Applied Mathematics 70(3): 217-229 (1996) | |
| j28 | Samir Khuller, Balaji Raghavachari: Improved Approximation Algorithms for Uniform Connectivity Problems. J. Algorithms 21(2): 434-450 (1996) | |
| j27 | Samir Khuller, Balaji Raghavachari, Neal E. Young: Low-Degree Spanning Trees of Small Weight. SIAM J. Comput. 25(2): 355-368 (1996) | |
| j26 | ||
| j25 | ||
| c21 | Samir Khuller, Yoram J. Sussmann: The Capacitated K-Center Problem (Extended Abstract). ESA 1996: 152-166 | |
| c20 | Sudipto Guha, Samir Khuller: Approximation Algorithms for Connected Dominating Sets. ESA 1996: 179-193 | |
| c19 | 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 | |
| 1995 | ||
| j24 | Samir Khuller, Balaji Raghavachari, Neal E. Young: Balancing Minimum Spanning Trees and Shortest-Path Trees. Algorithmica 14(4): 305-321 (1995) | |
| j23 | Samir Khuller, Yossi Matias: A Simple Randomized Sieve Algorithm for the Closest-Pair Problem. Inf. Comput. 118(1): 34-37 (1995) | |
| j22 | 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) | |
| j21 | Samir Khuller, Balaji Raghavachari, Neal E. Young: Approximating the Minimum Equivalent Digraph. SIAM J. Comput. 24(4): 859-872 (1995) | |
| j20 | ||
| c18 | Randeep Bhatia, Samir Khuller, Joseph Naor: The Loading Time Scheduling Problem (Extended Abstract). FOCS 1995: 72-81 | |
| c17 | Samir Khuller, Ehud Rivlin, Azriel Rosenfeld: Graphbots: Mobility in Discrete Spaces. ICALP 1995: 593-604 | |
| c16 | Samir Khuller, Balaji Raghavachari: Improved approximation algorithms for uniform connectivity problems. STOC 1995: 1-10 | |
| 1994 | ||
| j19 | Samir Khuller, Joseph Naor: Flow in Planar Graphs with Vertex Capacities. Algorithmica 11(3): 200-225 (1994) | |
| j18 | Samir Khuller, Balaji Raghavachari, Neal E. Young: Designing Multi-Commodity Flow Trees. Inf. Process. Lett. 50(1): 49-55 (1994) | |
| j17 | Samir Khuller, Uzi Vishkin: On the Parallel Complexity of Digraph Reachability. Inf. Process. Lett. 52(5): 239-241 (1994) | |
| j16 | Samir Khuller, Uzi Vishkin: Biconnectivity Approximations and Graph Carvings. J. ACM 41(2): 214-235 (1994) | |
| j15 | 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) | |
| j14 | 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) | |
| c15 | Samir Khuller, Balaji Raghavachari, Neal E. Young: Approximating the Minimum Equivalent Diagraph. SODA 1994: 177-186 | |
| c14 | Samir Khuller, Balaji Raghavachari, Neal E. Young: Low degree spanning trees of small weight. STOC 1994: 412-421 | |
| 1993 | ||
| j13 | Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell: Geometric Knapsack Problems. Algorithmica 10(5): 399-427 (1993) | |
| j12 | Samir Khuller, Ramakrishna Thurimella: Approximation Algorithms for Graph Augmentation. J. Algorithms 14(2): 214-225 (1993) | |
| j11 | Samir Khuller, Joseph Naor, Philip N. Klein: The Lattice Structure of Flow in Planar Graphs. SIAM J. Discrete Math. 6(3): 477-490 (1993) | |
| c13 | Samir Khuller, Uzi Vishkin, Neal E. Young: A primal-dual parallel approximation technique applied to weighted set and vertex cover. IPCO 1993: 333-341 | |
| c12 | Samir Khuller, Balaji Raghavachari, Neal E. Young: Balancing Minimum Spanning and Shortest Path Trees. SODA 1993: 243-250 | |
| c11 | Samir Khuller, Balaji Raghavachari, Neal E. Young: Designing Multi-Commodity Flow Trees. WADS 1993: 433-441 | |
| 1992 | ||
| j10 | Samir Khuller, Baruch Schieber: On Independent Spanning Trees. Inf. Process. Lett. 42(6): 321-323 (1992) | |
| j9 | 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) | |
| c10 | Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber: Efficient Minimum Cost Matching Using Quadrangle Inequality. FOCS 1992: 583-592 | |
| c9 | Samir Khuller, Ramakrishna Thurimella: Approximation Algorithms for Graph Augmentation. ICALP 1992: 330-341 | |
| c8 | ||
| 1991 | ||
| j8 | 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) | |
| j7 | Samir Khuller, Vijay V. Vazirani: Planar Graph Coloring is not Self-Reducible, Assuming P != NP. Theor. Comput. Sci. 88(1): 183-189 (1991) | |
| c7 | Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani: On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. ICALP 1991: 728-738 | |
| c6 | Esther M. Arkin, Samir Khuller, Joseph S. B. Mitchell: Geometric Knapsack Problems. WADS 1991: 165-176 | |
| 1990 | ||
| j6 | Samir Khuller: Extending Planar Graph Algorithms to K_3,3-Free Graphs. Inf. Comput. 84(1): 13-25 (1990) | |
| j5 | Samir Khuller, Joseph S. B. Mitchell: On a Triangle Counting Problem. Inf. Process. Lett. 33(6): 319-321 (1990) | |
| j4 | Samir Khuller: Coloring Algorithms for K_5-Minor Free Graphs. Inf. Process. Lett. 34(4): 203-208 (1990) | |
| j3 | ||
| c5 | ||
| 1989 | ||
| j2 | ||
| j1 | ||
| c4 | Samir Khuller, Baruch Schieber: Efficient Parallel Algorithms for Testing Connectivity and Finding Disjoint s-t Paths in Graphs (Extended Summary). FOCS 1989: 288-293 | |
| c3 | 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 | |
| c2 | ||
| 1988 | ||
| c1 | ||
Colors in the list of coauthors
Last update Fri May 24 02:35:45 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page