Matthias Stallmann
Bio
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 combinatorial optimization, particularly addressing intractable problems (NP-completeness) by identifying polynomial-time special cases or developing practical heuristics. He has also contributed to graph algorithms and algorithm animation tools.
Throughout his tenure, Stallmann held various leadership roles, including Assistant Director of Graduate Programs, where he advised thousands of master’s students. He chaired multiple departmental committees, led curriculum reforms, and played a pivotal role in developing computing infrastructure. He also served as NC State’s representative to AccessComputing, an NSF-funded initiative to increase the participation of people with disabilities in computing fields.
Stallmann earned his Ph.D. in computer science from the University of Colorado Boulder and both his B.S. and M.S. degrees from Yale University. He continues to be an active mentor and contributor to the department’s initiatives.
For master’s program advising, please contact csc-grad-advising@ncsu.edu.
Education
Ph.D. Computer Science University of Colorado, Boulder 1982
M.S. Computer Science Yale University 1978
B.A. Mathematics and Computer Science Yale University 1974
Area(s) of Expertise
Algorithms and Theory of Computation
Publications
-
Efficient algorithms for finding
2‐medians of a tree , Networks (2020) - Algorithm Animation with Galant , IEEE Computer Graphics and Applications (2017)
- Algorithm animation with Galant , IEEE computer graphics and applications (2017)
- Efficient Algorithms for Finding 2-Medians of a Tree , (2017)
- A gentle introduction to matroid algorithmics , (2016)
- Edge offset in drawings of layered graphs with evenly-spaced nodes on each layer , (2016)
- On size-constrained minimum s–t cut problems and size-constrained dense subgraph problems , Theoretical Computer Science (2015)
- Including blind people in computing through access to graphs , Proceedings of the 16th international ACM SIGACCESS conference on Computers & accessibility (2014)
- GSK: universally accessible graph sketching , Proceeding of the 44th ACM technical symposium on Computer science education (2013)
- Integrating communication skills in data structures and algorithms courses , 2013 IEEE Frontiers in Education Conference (FIE) (2013)