The k-Splittable Flow Problem. - Georg Baier; Ekkehard Köhler; Martin Skutella (Algorithmica, 2005)

Length-Bounded Cuts and Flows. - Georg Baier; Thomas Erlebach; Alexander Hall; Ekkehard Köhler; Heiko Schilling; Martin Skutella (ICALP (1), 2006)

Evaluation of survivable ethernet over WDM network architectures in metro ring networks. - Georg Baier; Thomas Engel 006; Achim Autenrieth (DRCN, 2007)

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 006; Pietro Belotti (Graphs and Algorithms in Communication Networks, 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)