Georg Baier

According to our database, Georg Baier authored at least 5 papers between 2005 and 2010.

Collaborative distances:

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

2010

Length-bounded cuts and flows.

Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella

ACM Trans. Algorithms, 2010

Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems.

Sebastian Orlowski, Christian Raack, Arie M. C. A. Koster, Georg Baier, Thomas Engel, Pietro Belotti

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2007

Evaluation of survivable ethernet over WDM network architectures in metro ring networks.

Georg Baier, Thomas Engel, Achim Autenrieth

Proceedings of the 6th International Workshop on Design and Reliable Communication Networks, 2007

2006

Length-Bounded Cuts and Flows.

Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

The k-Splittable Flow Problem.

Georg Baier, Ekkehard Köhler, Martin Skutella

Algorithmica, 2005