Matthias Stallmann
About
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.
Research Performance Summary
First Recorded Paper
AN AUGMENTING PATHS ALGORITHM FOR THE MATROID PARITY PROBLEM ON BINARY MATROIDS.
Year: 1983
Citations: 2
Venue: N/A
Latest Recorded Paper
Growing and Managing Your Research Group
Year: 2023
Citations: 0
Venue: 2023 ASEE Annual Conference & Exposition
Last 10 Years Publication Activity
This timeline shows the professor's yearly publication activity.