Georg Baier

The k-Splittable Flow Problem

Martin Skutella, Ekkehard Köhler, Georg Baier, 2005, Algorithmica.

Length-bounded cuts and flows

Thomas Erlebach, Martin Skutella, Alexander Hall, 2006, TALG.

Length-Bounded Cuts and Flows

Thomas Erlebach, Martin Skutella, Alexander Hall, 2006, ICALP.

The k-Splittable Flow Problem

Martin Skutella, Ekkehard Köhler, Georg Baier, 2002, Algorithmica.

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

Arie M. C. A. Koster, Pietro Belotti, Sebastian Orlowski, 2010, Graphs and Algorithms in Communication Networks.