Matt Stallmann Oudjit, A., & Stallmann, M. F. (2021). Efficient algorithms for finding2-mediansof a tree. NETWORKS, 77(3), 383–402. https://doi.org/10.1002/net.21978 Stallmann, M. F. (2017). Algorithm Animation with Galant. IEEE COMPUTER GRAPHICS AND APPLICATIONS, 37(1), 8–14. https://doi.org/10.1109/mcg.2017.2 Stallmann, M., & Oudjit, A. (2017). Efficient Algorithms for Finding 2-Medians of a Tree. North Carolina State University. Dept. of Computer Science. Stallmann, M. (2016). A gentle introduction to matroid algorithmics. North Carolina State University. Dept. of Computer Science. Stallmann, M. (2016). Edge offset in drawings of layered graphs with evenly-spaced nodes on each layer. North Carolina State University. Dept. of Computer Science. Chen, W., Samatova, N. F., Stallmann, M. F., Hendrix, W., & Ying, W. (2016). On size-constrained minimum s-t cut problems and size-constrained dense subgraph problems. THEORETICAL COMPUTER SCIENCE, 609, 434–442. https://doi.org/10.1016/j.tcs.2015.10.031 Balik, S. P., Mealin, S. P., Stallmann, M. F., Rodman, R. D., Glatz, M. L., & Sigler, V. J. (2014). Including blind people in computing through access to graphs. Proceedings of the 16th international ACM SIGACCESS conference on Computers & accessibility, 91–98. Balik, S. P., Mealin, S. P., Stallmann, M. F., & Rodman, R. D. (2013). GSK: universally accessible graph sketching. Proceeding of the 44th ACM technical symposium on Computer science education, 221–226. Eberle, W., Karro, J., Lerner, N., & Stallmann, M. (2013). Integrating communication skills in data structures and algorithms courses. 2013 IEEE Frontiers in Education Conference (FIE), 1503–1509. Stallmann, M. F. (2012). A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study. Journal of Experimental Algorithmics (JEA), 17, 1–3. Stallmann, M. F., & Gupta, S. (2010). Bottleneck crossing minimization in layered graphs (No. TR-2010-13). Dept of Computer Science, North Carolina State University. Stallmann, M. F., & Brglez, F. (2010). High-contrast algorithm behavior: Observation, conjecture, and experimental design. North Carolina State University. Dept. of Computer Science. Kormilitsin, M., Chirkova, R., Fathi, Y., & Stallmann, M. (2009). Systematic Exploration of Efficient Query Plans for Automated Database Restructuring. In Advances in Databases and Information Systems (pp. 133–148). https://doi.org/10.1007/978-3-642-03973-7_11 Kormilitsin, M., Chirkova, R., Fathi, Y., & Stallmann, M. (2009). Systematic exploration of efficient query plans for automated database restructuring. East European Conference on Advances in Databases and Information Systems, 133–148. Talebi, Z. A., Chirkova, R., Fathi, Y., & Stallmann, M. (2008). Exact and inexact methods for selecting views and indexes for OLAP performance improvement. Proceedings of the 11th international conference on Extending database technology: Advances in database technology, 311–322. Watson, B. A., Brink, D., Stallmann, M., Devajaran, R., Rakow, M., Rhyne, T.-M., & Patel, H. (2008). Matrix depictions for large layered graphs (No. TR-2008-17). Dept. Computer Science, North Carolina State University. Kormilitsin, M., Chirkova, R., Fathi, Y., & Stallmann, M. (2008). View and index selection for query-performance improvement: quality-centered algorithms and heuristics. Proceedings of the 17th ACM conference on Information and knowledge management, 1329–1330. Watson, B., Brink, D., Lograsso, T. A., Devajaran, D., Rhyne, T.-M., & Patel, H. (2008). Visualizing very large layered graphs with quilts. North Carolina State University. Dept. of Computer Science. Boyer, K. E., Dwight, R. S., Miller, C. S., Raubenheimer, C. D., Stallmann, M. F., & Vouk, M. A. (2007). A case for smaller class size with integrated lab for introductory computer science. ACM SIGCSE Bulletin, 39(1), 341–345. Stallmann, M. F., & Brglez, F. (2007). High-contrast algorithm behavior. Proceedings of the 2007 workshop on Experimental computer science - ExpCS '07. Presented at the the 2007 workshop. https://doi.org/10.1145/1281700.1281712 Stallmann, M. F., & Brglez, F. (2007). High-contrast algorithm behavior: observation, hypothesis, and experimental design. Proceedings of the 2007 workshop on Experimental computer science, 12. Stallmann, M. F., Balik, S. P., Rodman, R. D., Bahram, S., Grace, M. C., & High, S. D. (2007). Proofchecker: an accessible environment for automata theory correctness proofs. ACM SIGCSE Bulletin, 39(3), 48–52. Jackson, L. E., Rouskas, G. N., & Stallmann, M. F. M. (2007). The directional p-median problem: Definition, complexity, and algorithms. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 179(3), 1097–1108. https://doi.org/10.1016/j.ejor.2005.06.080 Kormilitsin, M., Chirkova, R. Y., Fathi, Y., & Stallmann, M. F. (2007). View and index selection for query-performance improvement: Algorithms, heuristics and complexity. North Carolina State University. Dept. of Computer Science. Stallmann, M. (2006). All-Integer Dual Simplex for Binate Cover Problems (Draft). Stallmann, M. (2006). All-Integer Dual Simplex for Binate Cover Problems (Draft). Retrieved from https://people.engr.ncsu.edu/mfms/Publications/int-dual.pdf Li, X. Y., Stallmann, M. F., & Brglez, F. (2005). Effective bounding techniques for solving unate and binate covering problems. Proceedings of the 42nd annual Design Automation Conference, 385–390. Brglez, F., Li, X. Y., & Stallmann, M. F. (2005). On SAT instance classes and a method for reliable performance experiments with SAT solvers. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 43(1-4), 1–34. https://doi.org/10.1007/s10472-005-0417-5 Li, X. Y., Stallmann, M. F., & Brglez, F. (2004). A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation. In Theory and Applications of Satisfiability Testing (Vol. 2919, pp. 53–68). https://doi.org/10.1007/978-3-540-24605-3_5 Brglez, F., Li, X. Y., Stallmann, M. F., & Militzer, B. (2004). Evolutionary and alternative algorithms: reliable cost predictions for finding optimal solutions to the LABS problem. Information Sciences. Brglez, F., Li, X. Y., & Stallmann, M. F. (2004). On SAT instance classes and a method for reliable performance experiments with SAT solvers. Annals of Mathematics and Artificial Intelligence, 43(1-4), 1–34. https://doi.org/10.1007/s10472-004-9417-0 Li, X. Y., Stallmann, M. F., & Brglez, F. (2003). A local search SAT solver using an effective switching strategy and an efficient unit propagation. International Conference on Theory and Applications of Satisfiability Testing, 53–68. Hochberg, R. A., & Stallmann, M. F. (2003). Optimal one-page tree embeddings in linear time. INFORMATION PROCESSING LETTERS, 87(2), 59–66. https://doi.org/10.1016/S0020-0190(03)00261-8 Li, X. Y., Stallmann, M. F., & Brglez, F. (2003). QingTing: a fast SAT solver using local search and efficient unit propagation. Sixth International Conference on Theory and Applications of Satisfiability Testing, 1. Stallmann, M. F., Brglez, F., & Li, X. Y. (2003). SATbed User Documentation. Retrieved from https://people.engr.ncsu.edu/mfms/Publications/2003-SATbed-home-guide.pdf Brglez, F., Stallmann, M. F., & Li, X. Y. (2003). SATbed: A Configurable Environment for Reliable Performance Experiments with SAT Instance Classes and Algorithms. Proc. 6th Int. Conf. on Theory and Applications of Satisfiability Testing, 5–8. Li, X. Y., & Stallmann, M. F. (2002). New bounds on the barycenter heuristic for bipartite graph drawing. INFORMATION PROCESSING LETTERS, 82(6), 293–298. https://doi.org/10.1016/S0020-0190(01)00297-6 Brglez, F., Li, X., & Stallmann, M. (2002). The role of a skeptic agent in testing and benchmarking of SAT algorithms. Fifth International Symposium on theTheory and Applications of Satisfiability Testing. Presented at the Citeseer. Stallmann, M., Brglez, F., & Ghosh, D. (2001). Heuristics, experimental subjects, and treatment evaluation in bigraph crossing minimization. Journal of Experimental Algorithmics (JEA), 6, 8. Stallmann, M. F. (2001). Programming and Proofs, Teaching Logic in Computer Science. Retrieved from https://people.engr.ncsu.edu/mfms/ProofChecker/2001-concept.pdf Kamburowski, J., Michael, D. J., & Stallmann, M. F. M. (2000). Minimizing the complexity of an activity network. NETWORKS, 36(1), 47–52. https://doi.org/10.1002/1097-0037(200008)36:1<47::AID-NET5>3.0.CO;2-Q Stallmann, M., Brglez, F., & Ghosh, D. (1999). Evaluating iterative improvement heuristics for bigraph crossing minimization. ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No. 99CH36349), 6, 444–447. Stallmann, M., Brglez, F., & Ghosh, D. (1999). Heuristics and experimental design for bigraph crossing number minimization. In Algorithm Engineering and Experimentation: International workshop ALENEX '99, Baltimore, MD, USA, Jan. 15-16, 1999. (Vol. 1619, pp. 74–93). https://doi.org/10.1007/3-540-48518-x_5 Manyem, P., & Stallmann, M. (1996). Some approximation results in multicasting. Citeseer. Chen, W.-K., & Stallmann, M. F. M. (1995). On embedding binary trees into hypercubes. Journal of Parallel and Distributed Computing, 24(2), 132–138. Stallmann, M., Cleaveland, R., & Hebbar, P. (1994). GDR: A visualization tool for graph algorithms. In Computational Support for Discrete Mathematics (pp. 17–28). American Mathematical Society. Stallmann, M. F. M., & Hughes, T. A. (1993). Fast algorithms for one-dimensionsal compaction with jog insertion. Workshop on Algorithms and Data Structures, 589–600. Stallmann, M. F. M. (1993). On counting planar embeddings. Discrete Mathematics, 122(1-3), 385–392. Michael, D. J., Kamburowski, J., & Stallmann, M. F. (1993). On the minimum dummy-arc problem. RAIRO-Operations Research, 27, 153–168. Kamburowski, J., Michael, D. J., & Stallmann, M. F. M. (1992). Optimal construction of project activity networks. Proceedings of the 1992 Annual Meeting of the Decision Sciences Institute, San Francisco, 1424–1426. Bein, W. W., Kamburowski, J., & Stallmann, M. F. M. (1992). Optimal reduction of two-terminal directed acyclic graphs. SIAM Journal on Computing, 21(6), 1112–1129. Stallmann, M. F. M. (1991). A One-way Array Algorithm for Matroid Scheduling. Proceedings of the third annual ACM Symposium on Parallel Algorithms and Architectures, 21(24), 349–356. Bein, W. W., Brucker, P., & Stallmann, M. F. M. (1991). A characterization of network representable polymatroids. Zeitschrift Für Operations Research, 35(4), 267–272. Bein, W. W., Kamburowski, J., & Stallmann, M. F. M. (1991). Alternate characterizations of the complexity graph. Dept of Computer Science, North Carolina State University. Chen, W.-K., & Stallmann, M. F. M. (1990). Local search variants for hypercube embedding. Proceedings of the Fifth Distributed Memory Computing Conference, 1990., 2, 1375–1383. Savage, C. D., Stallmann, M., & Perry, J. E. (1990). Solving some combinatorial problems on arrays with one-way dataflow. Algorithmica, 5(1-4), 179–199. Stallmann, M., Hughes, T., & Liu, W. (1990). Unconstrained via minimization for topological multilayer routing. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 9(9), 970–980. Stallmann, M. F. (1989). Constrained planar embedding problems. Proceedings 27th Annual Allerton Conference on Communication, Control, and Computing, 58–67. Stallmann, M. (1989). Course Outline: Course Announcement (Spring 1989) CSE/OR 691 I: Surviving Intractability. SIGACT News, 20(4), 74–77. https://doi.org/10.1145/74074.74086 Chen, W.-K., Stallmann, M. F. M., & Gehringer, E. F. (1989). Hypercube embedding heuristics: An evaluation. International Journal of Parallel Programming, 18(6), 505–549. Stallmann, M. F. (1988). A one-way linear array algorithm for the median filter. North Carolina State University. Center for Communications and Signal Processing. Gabow, H. N., & Stallmann, M. (1986). An augmenting path algorithm for linear matroid parity. Combinatorica, 6(2), 123–150. Gabow, H. N., & Stallmann, M. (1985). Efficient algorithms for graphic matroid intersection and parity. International Colloquium on Automata, Languages, and Programming, 210–220. Stallmann, M. (1985). Using PQ-trees for planar embedding problems. North Carolina State University. Dept. of Computer Science. Stallmann, M., & Gabow, H. N. (1984). An augmenting path algorithm for the parity problem on linear matroids. 25th Annual Symposium on Foundations of Computer Science, 217–228. Gabow, H. N., & Stallmann, M. (1984). An augmenting path algorithm for the parity problem on linear matroids. Combinatorica, 6. Stallmann, M. F. M. (1983). AN AUGMENTING PATHS ALGORITHM FOR THE MATROID PARITY PROBLEM ON BINARY MATROIDS. University of Colorado, Boulder.