Theoretical Computer Science / Theoretische Informatik

Institut[e] f(o|ü)r Informati(cs|k), [Universität] Osnabrück [University]

User Tools

Sidebar



External Links:

Table of Contents

Stephan Beyer

Contact Details

Office hours by appointment or good luck
e-Mail firstname.lastname @ uni-osnabrueck.de
PGP 0xCC0A7C3B (or weaker 0xFCC5040F)
Phone +49 (0)541/969-3447
Fax +49 (0)541/969-2799
Room 50/507 (Wachsbleiche 27)

Me holding a baby gator. (Dec 2015, New Orleans)

Research

My main research topic is the intersection of

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

in both theory and practice.

My ORCID iD is 0000-0001-5274-0447.

Publications

Conference proceedings

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.

On arXiv

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

staff/beyer.txt · Last modified: August 02, 2018 (23:30) by beyer