Matt Stallmann
Computer Science
- Phone: 919-515-7978
- Email: mfms@ncsu.edu
- Office: Engineering Building II (EB2) 2252
- Website: https://www.engr.ncsu.edu/people/mfms/
Research Interests
- Algorithms and Theory of Computation
- Data Sciences and Analytics
- Graphics, Human-Computer Interaction, & User Experience
- Parallel and Distributed Systems
- Scientific and High-Performance Computing
Publications
- Efficient algorithms for finding2-mediansof a tree
- Oudjit, A., & Stallmann, M. F. (2021), NETWORKS, 77(3), 383–402. https://doi.org/10.1002/net.21978
- Algorithm Animation with Galant
- Stallmann, M. F. (2017), IEEE COMPUTER GRAPHICS AND APPLICATIONS, 37(1), 8–14. https://doi.org/10.1109/mcg.2017.2
- Efficient Algorithms for Finding 2-Medians of a Tree
- Stallmann, M., & Oudjit, A. (2017). , . North Carolina State University. Dept. of Computer Science.
- A gentle introduction to matroid algorithmics
- Stallmann, M. (2016). , . North Carolina State University. Dept. of Computer Science.
- Edge offset in drawings of layered graphs with evenly-spaced nodes on each layer
- Stallmann, M. (2016). , . North Carolina State University. Dept. of Computer Science.
- On size-constrained minimum s-t cut problems and size-constrained dense subgraph problems
- Chen, W., Samatova, N. F., Stallmann, M. F., Hendrix, W., & Ying, W. (2016), THEORETICAL COMPUTER SCIENCE, 609, 434–442. https://doi.org/10.1016/j.tcs.2015.10.031
- Including blind people in computing through access to graphs
- Balik, S. P., Mealin, S. P., Stallmann, M. F., Rodman, R. D., Glatz, M. L., & Sigler, V. J. (2014), Proceedings of the 16th international ACM SIGACCESS conference on Computers & accessibility, 91–98.
- GSK: universally accessible graph sketching
- Balik, S. P., Mealin, S. P., Stallmann, M. F., & Rodman, R. D. (2013), Proceeding of the 44th ACM technical symposium on Computer science education, 221–226.
- Integrating communication skills in data structures and algorithms courses
- Eberle, W., Karro, J., Lerner, N., & Stallmann, M. (2013), 2013 IEEE Frontiers in Education Conference (FIE), 1503–1509.
- A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study
- Stallmann, M. F. (2012), Journal of Experimental Algorithmics (JEA), 17, 1–3.
