| Samir Khuller | |
| Birth Date: | 1965 |
| Fields: | Computer Science |
| Thesis Title: | Efficient Parallel Algorithms for Disjoint Paths and Connectivity |
| Thesis Url: | https://ecommons.cornell.edu/items/a5d95413-0cce-424c-afdc-dcb47b176e61 |
| Thesis Year: | 1990 |
| Doctoral Advisor: | Vijay Vazirani |
| Academic Advisors: | Joseph S. B. Mitchell, Esther Arkin |
| Known For: | Connected dominating set |
Samir Khuller (born 1965) is a professor of Computer Science and the Peter and Adrienne Barris Chair of Computer Science at Northwestern University. He was previously Professor and Elizabeth Stevinson Iribe Chair of Computer Science in the University of Maryland's Department of Computer Science. His research is in the area of algorithm design, specifically on combinatorial optimization, graphs and networks and scheduling.
Khuller obtained his undergraduate degree from the Indian Institute of Technology Kanpur and was awarded a PhD in 1990 from Cornell University as a student of Vijay Vazirani. From 1990 to 1992, he was a research associate at UMIACS (the Institute for Advanced Computer Studies), a division of the University of Maryland. In 1992 he joined the faculty of the University of Maryland Department of Computer Science. He became the Elizabeth Stevinson Iribe Chair of Computer Science at the Department of Computer Science in 2012, a position he held until 2017.[1]
He was named a Distinguished Scholar Teacher and received a Google Research Award in 2007.[2]
Khuller joined Northwestern University's McCormick School of Engineering in March 2019 as the first Peter and Adrienne Barris Chair of Computer Science at the Department of Computer Science.[3]
He was named an EATCS Fellow in 2021, and elected to the Board of Directors of the Computing Research Association in 2023.He was named to the 2022 class of ACM Fellows, "for contributions to algorithm design with real-world implications and for mentoring and community-building".[4]
Khuller and Guha designed an approximation algorithms for the minimum connected dominating set problem that achieves a factor of, where Δ is the maximum degree of a vertex in G.[5]