A recent adventure:
the seven bridges of Koenigsberg
are now the five bridges of Kaliningrad.
Research
My primary research interests are in combinational optimization
with emphasis on dealing with
intractability (NP-completeness), either by looking for polynomial
special cases or developing heuristics that work well in practice.
Current projects include
- experimental evaluation of algorithms for satisfiability and NP-hard
combinatorial optimization problems,
- the theory and practical implications of NP-completeness,
- tools and testbeds for reliable and repeatable computational
experiments,
- minimizing edge crossings in embeddings of graphs,
- interactive tools for visualization of algorithms and proof techniques.
Software for download (or browsing)
Selected Publications.
GRADUATE STUDENTS:
I do not have any research assistantships available right now.
If you are interested in my research and would like to do an MS
thesis or research project without financial support, please take
CSC
505 and CSC
565 (unless you already have the
equivalent) and make an appointment at your convenience. A strong
mathematical background is required.
Teaching
Some of my views on academic integrity.
Actually this is an FAQ for a programming course, but many of my
answers apply more generally and illustrate my philosophy of teaching
computer science.
Useful tips for taking tests.
Other Information: Courses taught, curriculum ideas, etc.
Service
[Needs to be updated]
Matthias
Stallmann (
matt_stallmann AT ncsu.edu)
Last modified: Thu Jul 6 12:10:01 EDT 2006
