People > NCSU Research & Education Team > Stallmann

Dr. Matt Stallmann Associate Professor North Carolina State University Department of Computer Science 165B/184 Venture III, Centennial Campus 900 Main Campus Drive Box 8207 NCSU Raleigh, N.C. 27695 Phone: 919.515.7978 Fax: 919.513.1895 Email: matt_stallmann@ncsu.edu Web: http://www.csc.ncsu.edu/faculty/stallmann/

Education

Research Interests

Algorithm design and analysis for both serial and parallel models of computation, combinatorial optimization, graph and matroid algorithms, algorithms for VLSI routing.

Selected Publications

• F. Brglez, X.Y. Li, M. F. Stallmann, and B Militzer. "Reliable Cost Predictions for Finding Optimal Solutions to LABS Problem: Evolutionary and Alternative Algorithms". Information Sciences, 2004, accepted for publication.
  
  
• F. Brglez, X.Y. Li, M. F. Stallmann. "On SAT Instance Classes and a Method for Reliable Performance Evaluation with SAT Solverss", Annals of Mathematics and Artificial Intelligence, 2004, in press.
  
  
• R.A. Hochberg and M.F. Stallmann,"Optimal one-page tree embeddings in linear time". Information Processing Letters, 87 (2003) pp. 59-66.
  
  
• X.Y. Li and M.F. Stallmann. "New Bounds on the Barycenter Heuristic for Bipartite Graph Drawing". Information Processing Letters, 82 (2002) pp. 293-298.
  
  
• J. Kamburowski, D. Michael, and M. Stallmann, "Minimizing the Complexity of an Activity Network". Networks, 26 (2000) pp. 47-52.