Stephan Beyer

According to our database, Stephan Beyer authored at least 6 papers between 2014 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs.

Stephan Beyer, Markus Chimani, Joachim Spoerhase

Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

2019

Strong Steiner Tree Approximations in Practice.

Stephan Beyer, Markus Chimani

ACM J. Exp. Algorithmics, 2019

2016

A Practical Method for the Minimum Genus of a Graph: Models and Experiments.

Stephan Beyer, Markus Chimani, Ivo Hedtke, Michal Kotrbcík

Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

2015

Speedy Colorful Subtrees.

W. Timothy J. White, Stephan Beyer, Kai Dührkop, Markus Chimani, Sebastian Böcker

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

The Influence of Preprocessing on Steiner Tree Approximations.

Stephan Beyer, Markus Chimani

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Steiner Tree 1.39-Approximation in Practice.

Stephan Beyer, Markus Chimani

Proceedings of the Mathematical and Engineering Methods in Computer Science, 2014