Explore professors working in graph algorithms and related research areas.
Use YourScholar to discover research opportunities and identify
professors whose work aligns with your academic interests.
Professors in Graph Algorithms
Showing page 1 of 1 —
10 professors available publicly
Subhash Suri
graph algorithms
computational geometry
network optimization
Subhash Suri is a Distinguished Professor and past Department Chair of Computer Science at the University of California, Santa Barbara. Before coming to UCSB, he was an Associate Professor at Washington University in St. Louis (1994-2000), and a research scientist at Bellcore (19...
Wayne Goddard
Graph Algorithms
Domination Parameters in Graphs
Distance in Graphs
Wayne Goddard is a Professor with a joint appointment in the School of Computing and the School of Mathematical and Statistical Sciences at Clemson University. He is a highly versatile scholar with two PhDs—one in Mathematics from the University of Natal and another in Applied ...
Debmalya Panigrahi
Theoretical Computer Science
Algorithm Design
Computational Complexity
I am a Professor of Computer Science at Duke University, where I currently also serve as Associate Chair. Previously, I (briefly) worked at Microsoft Research and Bell Labs, and was a visitor at Google Research and the Simons Institute for Theory of Computing. I obtained my PhD i...
Gopi Meenakshisundaram
Geometry Processing
Topological Data Analysis
Graph Algorithms
Dr. Meenakshisundaram’s research can be considered under the broad areas of computer graphics, computer vision, and HCI. His research usually has a strong flavor of geometry, topology, graph algorithms, user-interaction and collaboration.
Erik Saule
Multi Objective Optimization
Approximation Algorithms
Parallel Computing
Erik Saule is an Associate Professor in the Computer Science department of UNC Charlotte and has been a faculty of UNC Charlotte since August 2013. He received his License and Maitrise in Computer Science in 2003 from University of Versailles, France and his Master and PhD in Com...
Matthias Stallmann
Combinatorial Optimization
NP-Completeness Special Cases
Practical Heuristics for Intractable Problems
Matthias F. Stallmann is a professor emeritus in the Department of Computer Science at NC State University. He joined the department in 1984 and served for 40 years, contributing significantly to its growth and academic excellence.
Stallmann’s research focuses on combinatori...
Amir Nayyeri
Graph Algorithms
Computational Topology
Geometric Algorithms
Amir Nayyeri is an Associate Professor of Electrical Engineering and Computer Science at Oregon State University. He is a theoretical computer scientist whose research focuses on the design and analysis of algorithms in areas such as graph theory, geometry, and topology, often wi...
Berthe Choueiry
Constraint Satisfaction
Abstraction and Reformulation
Scheduling and Resource Allocation
Dr. Berthe Choueiry is an Associate Professor in the School of Computing at the University of Nebraska–Lincoln, where she conducts research and teaches in the field of artificial intelligence and algorithms. Her research interests include constraint satisfaction, abstraction an...
Huaming Zhang
Algorithm Design
Graph Theory
Graph Algorithms
Huaming Zhang, Ph.D. is Interim Chair and Professor in the Department of Computer Science at the University of Alabama in Huntsville. His areas of expertise include Algorithm Design and Graph Theory.
Joshua Booth
Sparse Linear Algebra
Graph Algorithms
Fault Tolerance in HPC
I research scalable systems and scientific computing for HPC. In particular, I focus on sparse linear algebra, graph algorithms, fault tolerance, power, and scheduling. I am working on integrating these topics into surrogate models, quantum computing, and AI at scale for scient...