World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
59
Citations
16680
World Ranking
3382
National Ranking
1638

Overview

Samir Khuller is affiliated with Northwestern University in the United States and conducts research primarily within the field of Computer Science. The scientist's work spans multiple subfields, including Computer Networks and Communications, Oncology, Computational Theory and Mathematics, Molecular Biology, and Industrial and Manufacturing Engineering.

Their research addresses several main topics such as Complexity and Algorithms in Graphs, CAR-T cell therapy research, Single-cell and spatial transcriptomics, Optimization and Search Problems, Cancer Immunotherapy and Biomarkers, Facility Location and Emergency Management, and Vehicle Routing Optimization Methods.

Among the recent papers authored or co-authored by Samir Khuller are:

  • The landscape of receptor-mediated precision cancer combination therapy via a single-cell perspective, 2022, Nature Communications
  • Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems, 2020, SIAM Journal on Discrete Mathematics
  • On Scheduling Coflows, 2020, Algorithmica
  • A Pairwise Fair and Community-preserving Approach to k-Center Clustering, 2020, arXiv (Cornell University)
  • LP-based approximation for uniform capacitated facility location problem, 2022, Discrete Optimization

Frequent co-authors collaborating with Samir Khuller include Pattara Sukprasert, Alejandro A. Schäffer, Saba Ahmadi, Eytan Ruppin, and Rahulsimham Vegesna.

The scientist's work has appeared in several publication venues with notable frequency, including:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Nature Communications
  • SIAM Journal on Discrete Mathematics
  • Algorithmica

Best Publications

  • The budgeted maximum coverage problem

    Samir Khuller;Anna Moss;Joseph (Seffi) Naor

  • Landmarks in graphs

    Samir Khuller;Balaji Raghavachari;Azriel Rosenfeld

  • A clustering scheme for hierarchical control in multi-hop wireless networks

    S. Banerjee;S. Khuller

  • Greedy strikes back: improved facility location algorithms

    Sudipto Guha;Samir Khuller

  • Approximation Algorithms for Connected Dominating Sets

    S. Guha;S. Khuller

  • Approximation Algorithms for Connected Dominating Sets

    Sudipto Guha;Samir Khuller

  • Construction of an efficient overlay multicast infrastructure for real-time applications

    S. Banerjee;C. Kommareddy;K. Kar;B. Bhattacharjee

  • Achieving anonymity via clustering

    Gagan Aggarwal;Rina Panigrahy;Tomás Feder;Dilys Thomas

  • Algorithms for facility location problems with outliers

    Moses Charikar;Samir Khuller;David M. Mount;Giri Narasimhan

  • Balancing minimum spanning trees and shortest-path trees

    S. Khuller;B. Raghavachari;N. Young

  • Achieving anonymity via clustering

    Gagan Aggarwal;Tomás Feder;Krishnaram Kenthapadi;Samir Khuller

  • Biconnectivity approximations and graph carvings

    Samir Khuller;Uzi Vishkin

  • On Finding Dense Subgraphs

    Samir Khuller;Barna Saha

  • Dependent rounding and its applications to approximation algorithms

    Rajiv Gandhi;Samir Khuller;Srinivasan Parthasarathy;Aravind Srinivasan

  • Approximation algorithms for partial covering problems

    Rajiv Gandhi;Samir Khuller;Aravind Srinivasan

  • Improved methods for approximating node weighted Steiner trees and connected dominating sets

    Sudipto Guha;Samir Khuller

  • The Capacitated K -Center Problem

    Samir Khuller;Yoram J. Sussmann

  • On-line algorithms for weighted bipartite matching and stable marriages

    Samir Khuller;Stephen G. Mitchell;Vijay V. Vazirani

  • Improved Approximation Algorithms for Uniform Connectivity Problems

    Samir Khuller;Balaji Raghavachari

  • Approximation algorithms for finding highly connected subgraphs

    Samir Khuller

Frequent Co-Authors

Neal E. Young
Neal E. Young University of California, Riverside
Leana Golubchik
Leana Golubchik University of Southern California
Aravind Srinivasan
Aravind Srinivasan University of Maryland, College Park
Sudipto Guha
Sudipto Guha University of Pennsylvania
Joseph (Seffi) Naor
Joseph (Seffi) Naor Technion – Israel Institute of Technology
Amol Deshpande
Amol Deshpande University of Maryland, College Park
Baruch Schieber
Baruch Schieber New Jersey Institute of Technology
Uzi Vishkin
Uzi Vishkin University of Maryland, College Park
Robert Pless
Robert Pless George Washington University
Guy Kortsarz
Guy Kortsarz Rutgers, The State University of New Jersey

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens up diverse academic and career pathways. Prospective students often consider degrees closely tied to tech, such as an electrical engineering degree online admissions. This makes it convenient for working professionals to access quality programs remotely, without compromising on academic standards.

For those seeking rapid entry into the tech workforce, quick certifications that pay well can be an excellent choice. These certifications require less time than traditional degrees and can significantly boost earning potential.

If you already hold a bachelor’s degree, you might opt for the quickest cheapest masters degree programs to fast-track your qualifications while minimizing costs. These accelerated online options help you develop advanced skills to stay competitive in the job market.

Lastly, choosing which master's degree is most in demand in USA is an important consideration. Degrees in areas like computer science, analytics, and engineering are consistently sought after by employers and can open doors to high-growth careers in the tech industry.

Best Scientists Citing Samir Khuller

Trending Scientists