default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSamir Khuller
Person information
- affiliation: Northwestern University, Evanston, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c114]Arpita Biswas, Yiduo Ke, Samir Khuller, Quanquan C. Liu:
Fair Allocation of Conflicting Courses under Additive Utilities. AAMAS 2024: 2162-2164- [c113]Gruia Calinescu, Sami Davies, Samir Khuller, Shirley Zhang:
Online Flexible Busy Time Scheduling on Heterogeneous Machines. ESA 2024: 37:1-37:18 - [c112]Anxin Guo, Jingwei Li, Pattara Sukprasert, Samir Khuller, Amol Deshpande, Koyel Mukherjee:
To Store or Not to Store: a graph theoretical approach for Dataset Versioning. IPDPS 2024: 479-493 - [i33]Gruia Calinescu
, Sami Davies, Samir Khuller, Shirley Zhang:
Online Flexible Busy Time Scheduling on Heterogeneous Machines. CoRR abs/2402.11109 (2024) - [i32]Anxin Guo, Jingwei Li, Pattara Sukprasert, Samir Khuller, Amol Deshpande, Koyel Mukherjee:
To Store or Not to Store: a graph theoretical approach for Dataset Versioning. CoRR abs/2402.11741 (2024) - 2023
- [j114]Samir Khuller:
Special Issue on papers from the 2019 Workshop on Models and Algorithms for Planning and Scheduling Problems. J. Sched. 26(5): 411 (2023) - [c111]Quanquan C. Liu, Yiduo Ke, Samir Khuller:
Scalable Auction Algorithms for Bipartite Maximum Matching Problems. APPROX/RANDOM 2023: 28:1-28:24 - [c110]Arpita Biswas, Yiduo Ke, Samir Khuller, Quanquan C. Liu:
An Algorithmic Approach to Address Course Enrollment Challenges. FORC 2023: 8:1-8:23 - [i31]Arpita Biswas, Yiduo Ke, Samir Khuller, Quanquan C. Liu:
An Algorithmic Approach to Address Course Enrollment Challenges. CoRR abs/2304.07982 (2023) - [i30]Quanquan C. Liu, Yiduo Ke, Samir Khuller:
Scalable Auction Algorithms for Bipartite Maximum Matching Problems. CoRR abs/2307.08979 (2023) - 2022
- [j113]Sapna Grover, Neelima Gupta, Samir Khuller:
LP-based approximation for uniform capacitated facility location problem. Discret. Optim. 45: 100723 (2022) - [c109]Sheng Yang, Samir Khuller, Sunav Choudhary, Subrata Mitra, Kanak Mahadik:
Correlated Stochastic Knapsack with a Submodular Objective. ESA 2022: 91:1-91:14 - [c108]Saba Ahmadi, Pranjal Awasthi, Samir Khuller, Matthäus Kleindessner, Jamie Morgenstern, Pattara Sukprasert, Ali Vakilian:
Individual Preference Stability for Clustering. ICML 2022: 197-246 - [c107]Sami Davies, Samir Khuller, Shirley Zhang:
Balancing Flow Time and Energy Consumption. SPAA 2022: 369-380 - [i29]Sami Davies, Samir Khuller, Shirley Zhang:
Balancing Flow Time and Energy Consumption. CoRR abs/2206.01360 (2022) - [i28]Sheng Yang, Samir Khuller, Sunav Choudhary, Subrata Mitra, Kanak Mahadik:
Correlated Stochastic Knapsack with a Submodular Objective. CoRR abs/2207.01551 (2022) - [i27]Saba Ahmadi, Pranjal Awasthi, Samir Khuller, Matthäus Kleindessner, Jamie Morgenstern, Pattara Sukprasert, Ali Vakilian:
Individual Preference Stability for Clustering. CoRR abs/2207.03600 (2022) - 2021
- [c106]Sheng Yang, Samir Khuller, Sunav Choudhary, Subrata Mitra, Kanak Mahadik:
Scheduling ML training on unreliable spot instances. UCC Companion 2021: 29:1-29:8 - [e2]Samir Khuller, Virginia Vassilevska Williams:
STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021. ACM 2021, ISBN 978-1-4503-8053-9 [contents] - 2020
- [j112]Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang:
On Scheduling Coflows. Algorithmica 82(12): 3604-3629 (2020) - [j111]Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar:
Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems. SIAM J. Discret. Math. 34(1): 251-270 (2020) - [c105]Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Samir Khuller, Aravind Srinivasan, Leonidas Tsepenekas:
A Pairwise Fair and Community-preserving Approach to k-Center Clustering. ICML 2020: 1178-1189 - [c104]Saba Ahmadi, Faez Ahmed, John P. Dickerson, Mark D. Fuge, Samir Khuller:
An Algorithm for Multi-Attribute Diverse Matching. IJCAI 2020: 3-9 - [c103]Parinya Chalermsook, Samir Khuller, Pattara Sukprasert, Sumedha Uniyal:
Multi-transversals for Triangles and the Tuza's Conjecture. SODA 2020: 1955-1974 - [i26]Parinya Chalermsook, Samir Khuller, Pattara Sukprasert, Sumedha Uniyal:
Multi-transversals for Triangles and the Tuza's Conjecture. CoRR abs/2001.00257 (2020) - [i25]Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Samir Khuller, Aravind Srinivasan, Leonidas Tsepenekas:
A Pairwise Fair and Community-preserving Approach to k-Center Clustering. CoRR abs/2007.07384 (2020)
2010 – 2019
- 2019
- [j110]Samir Khuller, Sheng Yang:
Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm. Algorithmica 81(6): 2592-2605 (2019) - [j109]Samir Khuller, Jingling Li, Pascal Sturmfels, Kevin Sun, Prayaag Venkat:
Select and permute: An improved online framework for scheduling to minimize weighted completion time. Theor. Comput. Sci. 795: 420-431 (2019) - [c102]Ioana Oriana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt:
On the Cost of Essentially Fair Clusterings. APPROX-RANDOM 2019: 18:1-18:22 - [c101]Saba Ahmadi, Samir Khuller, Barna Saha:
Min-Max Correlation Clustering via MultiCut. IPCO 2019: 13-26 - [c100]Mosharaf Chowdhury, Samir Khuller, Manish Purohit, Sheng Yang, Jie You:
Near Optimal Coflow Scheduling in Networks. SPAA 2019: 123-134 - [i24]Mosharaf Chowdhury, Samir Khuller, Manish Purohit, Sheng Yang, Jie You:
Near Optimal Coflow Scheduling in Networks. CoRR abs/1906.06851 (2019) - [i23]Saba Ahmadi, Sainyam Galhotra, Samir Khuller, Barna Saha, Roy Schwartz:
Min-Max Correlation Clustering via MultiCut. CoRR abs/1907.00117 (2019) - [i22]Saba Ahmadi, Faez Ahmed, John P. Dickerson, Mark D. Fuge, Samir Khuller:
Algorithms for Optimal Diverse Matching. CoRR abs/1909.03350 (2019) - 2018
- [j108]Riley Murray, Samir Khuller, Megan Chao:
Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms. Algorithmica 80(10): 2777-2798 (2018) - [c99]Sapna Grover, Neelima Gupta, Samir Khuller, Aditya Pancholi:
Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem. FSTTCS 2018: 23:1-23:22 - [c98]Samir Khuller, Sheng Yang:
Revisiting Connected Dominating Sets: An Optimal Local Algorithm? ITA 2018: 1-9 - [c97]Samir Khuller, Jingling Li, Pascal Sturmfels, Kevin Sun, Prayaag Venkat:
Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time. LATIN 2018: 669-682 - [c96]Mikhail Sorokin, Galen Stetsyuk, Raghav Gupta, Alex Busch, Brian Russin, Celeste Lyn Paul, Samir Khuller:
Ring graphs in VR: exploring a new and novel method for node placement and link visibility in VR-based graph analysis. SIGGRAPH ASIA Posters 2018: 72:1-72:2 - [c95]Saurabh Kumar, Samir Khuller:
Brief Announcement: A Greedy 2 Approximation for the Active Time Problem. SPAA 2018: 347-349 - [p4]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Greedy Methods. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 55-69 - [i21]Ioana Oriana Bercea, Martin Groß, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt:
On the cost of essentially fair clusterings. CoRR abs/1811.10319 (2018) - 2017
- [j107]Jessica Chang, Samir Khuller, Koyel Mukherjee:
LP rounding and combinatorial algorithms for minimizing active and busy time. J. Sched. 20(6): 657-680 (2017) - [c94]Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang:
On Scheduling Coflows - (Extended Abstract). IPCO 2017: 13-24 - [c93]Frederic Koehler, Samir Khuller:
Busy Time Scheduling on a Bounded Number of Machines (Extended Abstract). WADS 2017: 521-532 - [i20]Samir Khuller, Jingling Li, Pascal Sturmfels, Kevin Sun, Prayaag Venkat:
Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time. CoRR abs/1704.06677 (2017) - 2016
- [j106]Samir Khuller, Barna Saha, Kanthi K. Sarpatwar:
New Approximation Results for Resource Replication Problems. Algorithmica 74(3): 969-991 (2016) - [c92]Samir Khuller, Sheng Yang:
Revisiting Connected Dominating Sets: An Optimal Local Algorithm? APPROX-RANDOM 2016: 11:1-11:12 - [c91]Ioana Oriana Bercea, Volkan Isler, Samir Khuller:
Minimizing Uncertainty through Sensor Placement with Angle Constraints. CCCG 2016: 287-294 - [c90]Riley Murray, Megan Chao, Samir Khuller:
Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and LP-based Approximation Algorithms. ESA 2016: 68:1-68:17 - [c89]Samir Khuller, Manish Purohit:
Brief Announcement: Improved Approximation Algorithms for Scheduling Co-Flows. SPAA 2016: 239-240 - [r7]Samir Khuller:
Assignment Problem. Encyclopedia of Algorithms 2016: 150-152 - [r6]Samir Khuller, Balaji Raghavachari:
Graph Connectivity. Encyclopedia of Algorithms 2016: 872-875 - [i19]Ioana Oriana Bercea, Volkan Isler, Samir Khuller:
Minimizing Uncertainty through Sensor Placement with Angle Constraints. CoRR abs/1607.05791 (2016) - [i18]Jessica Chang, Samir Khuller, Koyel Mukherjee:
LP Rounding and Combinatorial Algorithms for Minimizing Active and Busy Time. CoRR abs/1610.08154 (2016) - [i17]Riley Murray, Samir Khuller, Megan Chao:
Scheduling Distributed Clusters of Parallel Machines: Primal-Dual and LP-based Approximation Algorithms [Full Version]. CoRR abs/1610.09058 (2016) - 2015
- [c88]Hal Daumé III, Samir Khuller, Manish Purohit, Gregory Sanders:
On Correcting Inputs: Inverse Optimization for Online Structured Prediction. FSTTCS 2015: 38-51 - [i16]Hal Daumé III, Samir Khuller, Manish Purohit, Gregory Sanders:
On Correcting Inputs: Inverse Optimization for Online Structured Prediction. CoRR abs/1510.03130 (2015) - 2014
- [j105]Jessica Chang, Harold N. Gabow, Samir Khuller:
A Model for Minimizing Active Processor Time. Algorithmica 70(3): 368-405 (2014) - [j104]Sonika Arora, Neelima Gupta, Samir Khuller, Yogish Sabharwal, Swati Singhal:
Facility location with red-blue demands. Oper. Res. Lett. 42(6-7): 462-465 (2014) - [j103]K. Ashwin Kumar, Abdul Quamar, Amol Deshpande, Samir Khuller:
SWORD: workload-aware data placement and replica selection for cloud data management systems. VLDB J. 23(6): 845-870 (2014) - [c87]Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar:
Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems. SODA 2014: 1702-1713 - [c86]Jessica Chang, Samir Khuller, Koyel Mukherjee:
LP rounding and combinatorial algorithms for minimizing active and busy time. SPAA 2014: 118-127 - [p3]Samir Khuller, Balaji Raghavachari:
Graph and Network Algorithms. Computing Handbook, 3rd ed. (1) 2014: 5: 1-24 - 2013
- [j102]Geet Duggal, Rob Patro, Emre Sefer, Hao Wang, Darya Filippova, Samir Khuller, Carl Kingsford:
Resolving spatial inconsistencies in chromosome conformation measurements. Algorithms Mol. Biol. 8: 8 (2013) - [c85]Jessica Chang, Samir Khuller:
A Min-Edge Cost Flow Framework for Capacitated Covering Problems. ALENEX 2013: 14-25 - [c84]Leana Golubchik, Samir Khuller, Koyel Mukherjee, Yuan Yao:
To send or not to send: Reducing the cost of data transmission. INFOCOM 2013: 2472-2478 - [c83]Koyel Mukherjee, Samir Khuller, Amol Deshpande:
Algorithms for the Thermal Scheduling Problem. IPDPS 2013: 949-960 - [c82]Frederic Koehler, Samir Khuller:
Optimal Batch Schedules for Parallel Machines. WADS 2013: 475-486 - [i15]K. Ashwin Kumar, Amol Deshpande, Samir Khuller:
Data Placement and Replica Selection for Improving Co-location in Distributed Environments. CoRR abs/1302.4168 (2013) - [i14]Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar:
Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems. CoRR abs/1311.2309 (2013) - [i13]Hal Daumé III, Kevin Duh, Samir Khuller:
Discrete Algorithms Meet Machine Learning (NII Shonan Meeting 2013-6). NII Shonan Meet. Rep. 2013 (2013) - 2012
- [j101]Samir Khuller, Yoo-Ah Kim, Azarakhsh Malekian:
Improved Approximation Algorithms for Data Migration. Algorithmica 63(1-2): 347-362 (2012) - [j100]Alix L. H. Chow, Leana Golubchik, Samir Khuller, Yuan Yao:
Performance tradeoffs in structured peer to peer streaming. J. Parallel Distributed Comput. 72(3): 323-337 (2012) - [j99]Edward Bortnikov, Samir Khuller, Jian Li, Yishay Mansour, Joseph Naor:
The load-distance balancing problem. Networks 59(1): 22-29 (2012) - [j98]Samir Khuller:
Algorithms column: An overview of the recent progress on matrix multiplication by Virginia Vassilevska Williams. SIGACT News 43(4): 57-59 (2012) - [j97]Samir Khuller, Sudipto Guha:
Special Issue in Honor of Rajeev Motwani (1962-2009): Guest Editors' Foreword. Theory Comput. 8(1): 53-54 (2012) - [c81]Samir Khuller, Barna Saha, Kanthi K. Sarpatwar:
New Approximation Results for Resource Replication Problems. APPROX-RANDOM 2012: 218-230 - [c80]Jessica Chang, Harold N. Gabow, Samir Khuller:
A Model for Minimizing Active Processor Time. ESA 2012: 289-300 - [c79]Marek Cygan, MohammadTaghi Hajiaghayi, Samir Khuller:
LP Rounding for k-Centers with Non-uniform Hard Capacities. FOCS 2012: 273-282 - [c78]Barna Saha, Samir Khuller:
Set Cover Revisited: Hypergraph Cover with Hard Capacities. ICALP (1) 2012: 762-773 - [c77]Koyel Mukherjee, Samir Khuller, Amol Deshpande:
Saving on cooling: the thermal scheduling problem. SIGMETRICS 2012: 397-398 - [c76]Geet Duggal, Rob Patro, Emre Sefer, Hao Wang, Darya Filippova, Samir Khuller, Carl Kingsford:
Resolving Spatial Inconsistencies in Chromosome Conformation Data. WABI 2012: 288-300 - [i12]Jessica Chang, Harold N. Gabow, Samir Khuller:
A Model for Minimizing Active Processor Time. CoRR abs/1208.0312 (2012) - [i11]Marek Cygan, MohammadTaghi Hajiaghayi, Samir Khuller:
LP Rounding for k-Centers with Non-uniform Hard Capacities. CoRR abs/1208.3054 (2012) - 2011
- [j96]Amol Deshpande, Samir Khuller, Azarakhsh Malekian, Mohammed Toossi:
Energy Efficient Monitoring in Sensor Networks. Algorithmica 59(1): 94-114 (2011) - [j95]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) - [j94]Samir Khuller, Azarakhsh Malekian, Julián Mestre:
To fill or not to fill: The gas station problem. ACM Trans. Algorithms 7(3): 36:1-36:16 (2011) - [j93]Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller:
Broadcast scheduling: Algorithms and complexity. ACM Trans. Algorithms 7(4): 47:1-47:14 (2011) - [c75]Andreas Thor, Philip Anderson, Louiqa Raschid, Saket Navlakha, Barna Saha, Samir Khuller, Xiao-Ning Zhang:
Link Prediction for Annotation Graphs Using Graph Summarization. ISWC (1) 2011: 714-729 - [c74]Jian Li, Samir Khuller:
Generalized Machine Activation Problems. SODA 2011: 80-94 - 2010
- [j92]Samir Khuller, Yoo-Ah Kim, Yung-Chun (Justin) Wan:
Broadcasting on Networks of Workstations. Algorithmica 57(4): 848-868 (2010) - [j91]Samir Khuller, Michael W. Mahoney:
SIGACT news algorithms column: computation in large-scale scientific and internet data applications is a focus of MMDS 2010. SIGACT News 41(4): 65-72 (2010) - [j90]Gagan Aggarwal, Rina Panigrahy, Tomás Feder, Dilys Thomas, Krishnaram Kenthapadi, Samir Khuller, An Zhu:
Achieving anonymity via clustering. ACM Trans. Algorithms 6(3): 49:1-49:19 (2010) - [c73]Jian Li, Amol Deshpande, Samir Khuller:
On Computing Compression Trees for Data Collection in Wireless Sensor Networks. INFOCOM 2010: 2115-2123 - [c72]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 - [c71]Samir Khuller, Jian Li, Barna Saha:
Energy Efficient Scheduling via Partial Shutdown. SODA 2010: 1360-1372 - [c70]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 - [i10]Samir Khuller, Jian Li, Barna Saha:
Energy Efficient Scheduling via Partial Shutdown. Scheduling 2010
2000 – 2009
- 2009
- [j89]Leana Golubchik, Sanjeev Khanna, Samir Khuller, Ramakrishna Thurimella, An Zhu:
Approximation algorithms for data placement on parallel disks. ACM Trans. Algorithms 5(4): 34:1-34:26 (2009) - [c69]Samir Khuller, Barna Saha:
On Finding Dense Subgraphs. ICALP (1) 2009: 597-608 - [c68]Jian Li, Amol Deshpande, Samir Khuller:
Minimizing Communication Cost in Distributed Multi-query Processing. ICDE 2009: 772-783 - [c67]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 - [c66]Saeed Alaei, Esteban Arcaute, Samir Khuller, Wenjing Ma, Azarakhsh Malekian, John A. 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) - [c65]Richard Matthew McCutchen, Samir Khuller:
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity. APPROX-RANDOM 2008: 165-178 - [c64]Samir Khuller, Julián Mestre:
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection. ESA 2008: 601-610 - [c63]Amol Deshpande, Samir Khuller, Azarakhsh Malekian, Mohammed Toossi:
Energy Efficient Monitoring in Sensor Networks. LATIN 2008: 436-448 - [c62]Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller:
Broadcast scheduling: algorithms and complexity. SODA 2008: 473-482 - [r5]Samir Khuller:
Assignment Problem. Encyclopedia of Algorithms 2008 - [r4]Samir Khuller, Balaji Raghavachari:
Graph Connectivity. Encyclopedia of Algorithms 2008 - 2007
- [j87]Samir Khuller, Yoo Ah Kim:
Broadcasting in Heterogeneous Networks. Algorithmica 48(1): 1-21 (2007) - [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. Comput. Networks 51(15): 4237-4251 (2007) - [j84]Samir Khuller:
Introduction. SIGACT News 38(3): 106 (2007) - [j83]Samir Khuller:
Problems column. ACM Trans. Algorithms 3(3): 35 (2007) - [c61]Samir Khuller, Azarakhsh Malekian, Julián Mestre:
To Fill or Not to Fill: The Gas Station Problem. ESA 2007: 534-545 - [c60]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 - [r3]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Greedy Methods. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r2]Samir Khuller, Yung-Chun (Justin) Wan, Yoo-Ah Kim:
Broadcasting on Networks of Workstations. Handbook of Parallel Computing 2007 - 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. Comput. Networks 50(6): 826-841 (2006) - [j80]Kurt Rohloff, Samir Khuller, Guy Kortsarz:
Approximating the Minimal Sensor Selection for Supervisory Control. Discret. Event Dyn. Syst. 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]Samir Khuller:
Problems column. ACM Trans. Algorithms 2(1): 130-134 (2006) - [c59]Srinivas R. Kashyap, Samir Khuller, Yung-Chun (Justin) Wan, Leana Golubchik:
Fast Reconfiguration of Data Placement in Parallel Disks. ALENEX 2006: 95-107 - [c58]Samir Khuller, Yoo Ah Kim, Azarakhsh Malekian:
Improved Algorithms for Data Migration. APPROX-RANDOM 2006: 164-175 - [c57]Jens Bleiholder, Samir Khuller, Felix Naumann, Louiqa Raschid, Yao Wu:
Query Planning in the Presence of Overlapping Sources. EDBT 2006: 811-828 - [c56]Abhishek Kashyap, Samir Khuller, Mark A. Shayman:
Relay Placement for Higher Order Connectivity in Wireless Sensor Networks. INFOCOM 2006 - [c55]Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, An Zhu:
Achieving anonymity via clustering. PODS 2006: 153-162 - [c54]Moses Charikar, Samir Khuller:
A robust maximum completion time measure for scheduling. SODA 2006: 324-333 - 2005
- [j73]Samir Khuller:
Four colors suffice! SIGACT News 36(2): 43-44 (2005) - [j72]Samir Khuller:
Problems column. ACM Trans. Algorithms 1(1): 157-159 (2005) - [c53]Samir Khuller, Kwangil Lee, Mark A. Shayman:
On Degree Constrained Shortest Paths. ESA 2005: 259-270 - [c52]Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan:
Broadcasting on networks of workstations. SPAA 2005: 279-288 - 2004
- [j71]Klaus Jansen, Samir Khuller:
Guest Editors' Introduction. Algorithmica 38(3): 415-416 (2004) - [j70]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) - [j69]Rajiv Gandhi, Samir Khuller, Aravind Srinivasan:
Approximation algorithms for partial covering problems. J. Algorithms 53(1): 55-84 (2004) - [j68]William C. Cheng, Cheng-Fu Chou, Leana Golubchik, Samir Khuller, Yung-Chun (Justin) Wan:
A coordinated data collection approach: design, evaluation, and comparison. IEEE J. Sel. Areas Commun. 22(10): 2004-2018 (2004) - [j67]Samir Khuller, Yoo Ah Kim:
Equivalence of two linear programming relaxations for broadcast scheduling. Oper. Res. Lett. 32(5): 473-478 (2004) - [j66]Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan:
Algorithms for Data Migration with Cloning. SIAM J. Comput. 33(2): 448-461 (2004) - [c51]Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger:
Approximation Schemes for Broadcasting in Heterogenous Networks. APPROX-RANDOM 2004: 163-170 - [c50]Leana Golubchik, Samir Khuller, Yoo Ah Kim, Svetlana Shargorodskaya, Yung-Chun (Justin) Wan:
Data Migration on Parallel Disks. ESA 2004: 689-701 - [c49]Samir Khuller, Yoo Ah Kim:
On broadcasting in heterogenous networks. SODA 2004: 1011-1020 - 2003
- [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) - [c48]Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan:
On Generalized Gossiping and Broadcasting (Extended Abstract). ESA 2003: 373-384 - [c47]Srinivas R. Kashyap, Samir Khuller:
Algorithms for Non-uniform Size Data Placement on Parallel Disks. FSTTCS 2003: 265-276 - [c46]Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan:
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. ICALP 2003: 164-175 - [c45]William C. Cheng, Cheng-Fu Chou, Leana Golubchik, Samir Khuller, Yung-Chun (Justin) Wan:
Large-scale Data Collection: a Coordinated Approach. INFOCOM 2003: 218-228 - [c44]Suman Banerjee, Christopher Kommareddy, Koushik Kar, Samrat Bhattacharjee, Samir Khuller:
Construction of an Efficient Overlay Multicast Infrastructure for Real-time Applications. INFOCOM 2003: 1521-1531 - [c43]Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan:
Algorithms for data migration with cloning. PODS 2003: 27-36 - [c42]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]Samir Khuller:
Algorithms column: the vertex cover problem. SIGACT News 33(2): 31-33 (2002) - [j60]William C. Cheng, Cheng-Fu Chou, Leana Golubchik, Samir Khuller:
A performance study of Bistro, a scalable upload architecture. SIGMETRICS Perform. Evaluation Rev. 29(4): 31-39 (2002) - [c41]Cheng-Fu Chou, Samir Khuller, Yung-Chun (Justin) Wan, Leana Golubchik, William C. Cheng:
Scalable and Secure Data Collection Using Bistro. DG.O 2002 - [c40]Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan:
Dependent Rounding in Bipartite Graphs. FOCS 2002: 323-332 - [c39]Rajiv Gandhi, Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan:
Algorithms for Minimizing Response Time in Broadcast Scheduling. IPCO 2002: 425-438 - [c38]Leonid Zosin, Samir Khuller:
On directed Steiner trees. SODA 2002: 59-63 - [c37]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]Refael Hassin, Samir Khuller:
z-Approximations. J. Algorithms 41(2): 429-442 (2001) - [j58]Ruth Ben-Yashar, Samir Khuller, Sarit Kraus:
Optimal collective dichotomous choice under partial order constraints. Math. Soc. Sci. 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]Samir Khuller:
Algorithms column. SIGACT News 32(2): 28-31 (2001) - [c36]Rajiv Gandhi, Samir Khuller, Aravind Srinivasan:
Approximation Algorithms for Partial Covering Problems. ICALP 2001: 225-236 - [c35]Suman Banerjee, Samir Khuller:
A Clustering Scheme for Hierarchical Control in Multi-hop Wireless Networks. INFOCOM 2001: 1028-1037 - [c34]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. Discret. Appl. Math. 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. Discret. 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 Perform. Evaluation Rev. 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) - [c33]Leana Golubchik, Sanjeev Khanna, Samir Khuller, Ramakrishna Thurimella, An Zhu:
Approximation algorithms for data placement on parallel disks. SODA 2000: 223-232 - [c32]Samir Khuller, Randeep Bhatia, Robert Pless:
On local search and placement of meters in networks. SODA 2000: 319-328 - [e1]Klaus Jansen, Samir Khuller:
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 [contents]
1990 – 1999
- 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]William I. Gasarch, Samir Khuller:
The Book Review Column. SIGACT News 30(3): 8 (1999) - [c31]Randeep Bhatia, Samir Khuller, Robert Pless, Yoram J. Sussmann:
The Full Degree Spanning Tree Problem. SODA 1999: 864-865 - [c30]Samir Khuller, Balaji Raghavachari, An Zhu:
A Uniform Framework for Approximating Weighted Connectivity Problems. SODA 1999: 937-938 - [p2]Samir Khuller, Balaji Raghavachari:
Advanced Combinatorial Algorithms. Algorithms and Theory of Computation Handbook 1999 - [p1]Samir Khuller, Balaji Raghavachari:
Basic Graph Algorithms. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j40]Sudipto Guha, Samir Khuller:
Approximation Algorithms for Connected Dominating Sets. Algorithmica 20(4): 374-387 (1998) - [j39]Samir Khuller:
Problems. J. Algorithms 28(1): 192-195 (1998) - [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]Samir Khuller:
Open problems: 16. SIGACT News 29(1): 15-17 (1998) - [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 Trans. Syst. Man Cybern. Part C 28(1): 29-38 (1998) - [c29]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 - [c28]Sudipto Guha, Samir Khuller:
Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. FSTTCS 1998: 54-65 - [c27]Sudipto Guha, Samir Khuller:
Greedy Strikes Back: Improved Facility Location Algorithms. SODA 1998: 649-657 - [c26]Moses Charikar, Samir Khuller, Balaji Raghavachari:
Algorithms for Capacitated Vehicle Routing. STOC 1998: 349-358 - [c25]Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann:
Facility Location with Dynamic Distance Function (Extended Abstract). SWAT 1998: 23-34 - 1997
- [j34]Samir Khuller:
Problems. J. Algorithms 23(2): 401-403 (1997) - [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]Samir Khuller:
Open problems: 15. SIGACT News 28(3): 33-36 (1997) - [c24]Samir Khuller, Robert Pless, Yoram J. Sussmann:
Fault Tolerant K-Center Problems. CIAC 1997: 37-48 - [c23]Sudipto Guha, Samir Khuller:
Connected facility location problems. Network Design: Connectivity and Facilities Location 1997: 179-190 - [r1]Samir Khuller, Balaji Raghavachari:
Graph and Network Algorithms. The Computer Science and Engineering Handbook 1997: 203-225 - 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. Discret. Appl. Math. 69(3): 281-289 (1996) - [j29]Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld:
Landmarks in Graphs. Discret. Appl. Math. 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]Samir Khuller:
Open Problems: 13. SIGACT News 27(2): 52-54 (1996) - [j25]Samir Khuller:
Open Problems 14. SIGACT News 27(4): 11 (1996) - [c22]Samir Khuller, Yoram J. Sussmann:
The Capacitated K-Center Problem (Extended Abstract). ESA 1996: 152-166 - [c21]Sudipto Guha, Samir Khuller:
Approximation Algorithms for Connected Dominating Sets. ESA 1996: 179-193 - [c20]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]Samir Khuller:
Open Problems: 11. SIGACT News 26(1): 33 (1995) - [c19]Randeep Bhatia, Samir Khuller, Joseph Naor:
The Loading Time Scheduling Problem (Extended Abstract). FOCS 1995: 72-81 - [c18]Samir Khuller, Ehud Rivlin, Azriel Rosenfeld:
Graphbots: Mobility in Discrete Spaces. ICALP 1995: 593-604 - [c17]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) - [c16]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Approximating the Minimum Equivalent Diagraph. SODA 1994: 177-186 - [c15]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. Discret. Math. 6(3): 477-490 (1993) - [c14]Samir Khuller, Uzi Vishkin, Neal E. Young:
A primal-dual parallel approximation technique applied to weighted set and vertex cover. IPCO 1993: 333-341 - [c13]Samir Khuller, Balaji Raghavachari, Neal E. Young:
Balancing Minimum Spanning and Shortest Path Trees. SODA 1993: 243-250 - [c12]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) - [c11]Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber:
Efficient Minimum Cost Matching Using Quadrangle Inequality. FOCS 1992: 583-592 - [c10]Samir Khuller, Ramakrishna Thurimella:
Approximation Algorithms for Graph Augmentation. ICALP 1992: 330-341 - [c9]Samir Khuller, Uzi Vishkin:
Biconnectivity Approximations and Graph Carvings. STOC 1992: 759-770 - 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) - [c8]Samir Khuller, Joseph Naor:
Flow in Planar Graphs: A Survey of Results. Planar Graphs 1991: 59-84 - [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
- [b1]Samir Khuller:
Efficient Parallel Algorithms for Disjoint Paths and Connectivity. Cornell University, USA, 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]Samir Khuller:
Open problems. SIGACT News 21(1): 12 (1990) - [c5]Samir Khuller, Joseph Naor:
Flow in Planar Graphs with Vertex Capacities. IPCO 1990: 367-384
1980 – 1989
- 1989
- [j2]Samir Khuller:
On Computing Graph Closures. Inf. Process. Lett. 31(5): 249-255 (1989) - [j1]Samir Khuller:
Open problems: 3. SIGACT News 20(4): 24 (1989) - [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]Samir Khuller:
Parallel Algorithms for the Subgraph Homeomorphism Problem. WADS 1989: 303-315 - 1988
- [c1]Samir Khuller:
Extending Planar Graph Algorithms to K 3, 3-free Graphs. FSTTCS 1988: 67-79
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
