Samir Khuller

  • 6726 Citations
1988 …2020

Research output per year

If you made any changes in Pure these will be visible here soon.

Personal profile

Research Interests

Graph algorithms, discrete optimization, and scheduling.

Education/Academic qualification

PhD, Cornell University

… → 1990

MS, Cornell University

… → 1989

BTech, Indian Institute of Technology, Kanpur

… → 1986

Fingerprint Dive into the research topics where Samir Khuller is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

  • 4 Similar Profiles

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output

Analyzing the optimal neighborhood: Algorithms for partial and budgeted connected dominating set problems

Khuller, S., Purohit, M. & Sarpatwar, K. K., Jan 1 2020, In : SIAM Journal on Discrete Mathematics. 34, 1, p. 251-270 20 p.

Research output: Contribution to journalArticle

  • Multi-transversals for triangles and the Tuza's conjecture

    Chalermsook, P., Khuller, S., Sukprasert, P. & Uniyal, S., Jan 1 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 1955-1974 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2020-January).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Min-Max Correlation Clustering via MultiCut

    Ahmadi, S., Khuller, S. & Saha, B., Jan 1 2019, Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Proceedings. Lodi, A. & Nagarajan, V. (eds.). Springer Verlag, p. 13-26 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11480 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Near optimal coflow scheduling in networks

    Chowdhury, M., Khuller, S., Purohit, M., Yang, S. & You, J., Jun 17 2019, SPAA 2019 - Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 123-134 12 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
  • On the cost of essentially fair clusterings

    Bercea, I. O., Khuller, S., Rösner, C., Schmidt, M., Groß, M., Kumar, A. & Schmidt, D. R., Sep 1 2019, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019. Achlioptas, D. & Vegh, L. A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 18. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 145).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution