Born in Saalfeld/Saale. Graduated in Computer Science at the Technische Universität Ilmenau. Since 04/2012 PhD student in DFG-funded project on approximation algorithms in topological network design (until 05/2013 at Friedrich-Schiller-Universität Jena, now at Universität Osnabrück).

My main research topic is the intersection of

• Steiner trees and related NP-hard problems,
• linear programming,
• approximation algorithms

in both theory and practice.

Stephan Beyer, Markus Chimani, Ivo Hedtke, Michal Kotrbčík. A Practical Method for the Minimum Genus of a Graph: Models and Experiments. 15th International Symposium on Experimental Algorithms (SEA 2016), accepted.

Stephan Beyer, Markus Chimani. The Influence of Preprocessing on Steiner Tree Approximations. 9th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2015), LNCS 9486: 601–616, 2015.

Tim White, Stephan Beyer, Kai Dührkop, Markus Chimani, Sebastian Böcker. Speedy Colorful Subtrees. 21st Annual International Computing and Combinatorics Conference (COCOON 2015), LNCS 9198: 310–322, 2015.

Stephan Beyer, Markus Chimani. Steiner Tree 1.39-Approximation in Practice. 9th International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2014), Revised Selected Papers, LNCS 8934: 60–72, 2014.

Stephan Beyer, Markus Chimani. Strong Steiner Tree Approximations in Practice. arXiv:1409.8318 [cs.DS], 2015.