Samir Khuller | |
---|---|
Born | 1965 |
Alma mater |
|
Known for | Connected dominating set |
Awards |
|
Scientific career | |
Fields | Computer Science |
Institutions | |
Thesis | Efficient Parallel Algorithms for Disjoint Paths and Connectivity (1990) |
Doctoral advisor | Vijay Vazirani |
Other academic advisors | Joseph S. B. Mitchell, Esther Arkin |
Doctoral students | Barna Saha |
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] [2]
He was named a Distinguished Scholar Teacher and received a Google Research Award in 2007. [3]
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. [2]
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 2 ln Δ + O(1), where Δ is the maximum degree of a vertex in G. [5]
Professor Sartaj Kumar Sahni is a computer scientist based in the United States, and is one of the pioneers in the field of data structures. He is a distinguished professor in the Department of Computer and Information Science and Engineering at the University of Florida.
In graph theory, a dominating set for a graph G is a subset D of its vertices, such that any vertex of G is in D, or has a neighbor in D. The domination numberγ(G) is the number of vertices in a smallest dominating set for G.
David A. Bader is a Distinguished Professor and Director of the Institute for Data Science at the New Jersey Institute of Technology. Previously, he served as the Chair of the Georgia Institute of Technology School of Computational Science & Engineering, where he was also a founding professor, and the executive director of High-Performance Computing at the Georgia Tech College of Computing. In 2007, he was named the first director of the Sony Toshiba IBM Center of Competence for the Cell Processor at Georgia Tech.
In graph theory, a connected dominating set and a maximum leaf spanning tree are two closely related structures defined on an undirected graph.
Éva Tardos is a Hungarian mathematician and the Jacob Gould Schurman Professor of Computer Science at Cornell University.
Vijay Virkumar Vazirani is an Indian American distinguished professor of computer science in the Donald Bren School of Information and Computer Sciences at the University of California, Irvine.
David Arthur Eppstein is an American computer scientist and mathematician. He is a distinguished professor of computer science at the University of California, Irvine. He is known for his work in computational geometry, graph algorithms, and recreational mathematics. In 2011, he was named an ACM Fellow.
Zvi Galil is an Israeli-American computer scientist and mathematician. He has served as the dean of the Columbia University School of Engineering and Applied Science and as the president of Tel Aviv University from 2007 through 2009. From 2010 to 2019, he was the dean of the Georgia Institute of Technology College of Computing.
Roberto Tamassia is an American Italian computer scientist, the Plastech Professor of Computer Science at Brown University, and served as the chair of the Brown Computer Science department from 2007 to 2014. His research specialty is in the design and analysis of algorithms for graph drawing, computational geometry, and computer security; he is also the author of several textbooks.
The Department of Computer Science at the University of British Columbia was established in May 1968. UBC CS is located at the UBC Point Grey campus in Vancouver, British Columbia, Canada. As of September 2022, it has 65 faculty, 62 staff, 248 graduate students, and 2,763 undergraduates.
Dinesh Manocha is an Indian-American computer scientist and the Paul Chrisman Iribe Professor of Computer Science at University of Maryland College Park, formerly at University of North Carolina at Chapel Hill. His research interests are in scientific computation, robotics, self-driving cars, affective computing, virtual and augmented reality and 3D computer graphics.
Ming C. Lin is an American computer scientist and a Barry Mersky and Capital One Endowed Professor at the University of Maryland, College Park, where she is also the former chair of the Department of Computer Science. Prior to moving to Maryland in 2018, Lin was the John R. & Louise S. Parker Distinguished Professor of Computer Science at the University of North Carolina at Chapel Hill.
Sundaraja Sitharama Iyengar is an Indian-born American computer scientist and the Distinguished University Professor, Ryder Professor and Director of Computer Science at Florida International University, Miami, Florida, USA. He also founded and directs the Robotics Research Laboratory at Louisiana State University (LSU). He has been a visiting professor or scientist at Oak Ridge National Laboratory, Jet Propulsion Laboratory, Naval Research Laboratory, and has been awarded the Satish Dhawan Visiting Chaired Professorship at the Indian Institute of Science, the Homi Bhaba Visiting Chaired Professor (IGCAR), and a professorship at the University of Paris (Sorbonne).
Joseph S. B. Mitchell is an American computer scientist and mathematician. He is Distinguished Professor and Department Chair of Applied Mathematics and Statistics and Research Professor of Computer Science at Stony Brook University.
Dorit S. Hochbaum is a professor of industrial engineering and operations research at the University of California, Berkeley. She is known for her work on approximation algorithms, particularly for facility location, covering and packing problems, and scheduling, and on flow and cut algorithms, Markov random fields, image segmentation and clustering.
Brendan Trexler Iribe is an American game programmer, entrepreneur and co-founder of Oculus VR, Inc. and Scaleform. He is the managing partner at BIG Ventures, an early-stage venture fund.
The College of Computer, Mathematical, and Natural Sciences (CMNS) at the University of Maryland, College Park, is home to ten academic departments and a dozen interdisciplinary research centers and institutes. CMNS is one of 13 schools and colleges within the University of Maryland, College Park.
Mohammad Taghi Hajiaghayi is a computer scientist known for his work in algorithms, game theory, social networks, network design, graph theory, and big data. He has over 200 publications with over 185 collaborators and 10 issued patents.
Naveen Garg is a Professor of Computer Science in Indian Institute of Technology Delhi, specializing in algorithms and complexity in theoretical computer science. He was awarded the Shanti Swarup Bhatnagar Prize for Science and Technology, India's highest prize for excellence in science, mathematics and technology, in the mathematical sciences category in the year 2016. Naveen Garg's contributions are primarily in the design and analysis of approximation algorithms for NP-hard combinatorial optimization problems arising in network design, scheduling, routing, facility location etc.
Barna Saha is an Indian-American theoretical computer scientist whose research interests include algorithmic applications of the probabilistic method, probabilistic databases, fine-grained complexity, and the analysis of big data. She is an associate professor and Jacobs Faculty Scholar in the Department of Computer Science & Engineering at the University of California, San Diego.