Flows over Time: Towards a More Realistic and Computationally Tractable Model. - Alexander Hall; Heiko Schilling (ALENEX/ANALCO, 2005)

Acceleration of Shortest Path and Constrained Shortest Path Computation. - Ekkehard Köhler; Rolf H. Möhring; Heiko Schilling (WEA, 2005)

Partitioning Graphs to Speed Up Dijkstra's Algorithm. - Rolf H. Möhring; Heiko Schilling; Birk Schütz; Dorothea Wagner; Thomas Willhalm (WEA, 2005)

Fast Point-to-Point Shortest Path Computations with Arc-Flags. - Moritz Hilger; Ekkehard Köhler; Rolf H. Möhring; Heiko Schilling (The Shortest Path Problem, 2006)

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

Partitioning graphs to speedup Dijkstra's algorithm. - Rolf H. Möhring; Heiko Schilling; Birk Schütz; Dorothea Wagner; Thomas Willhalm (ACM J. Exp. Algorithmics, 2006)

Optimizing the Cargo Express Service of Swiss Federal Railways. - Alberto Ceselli; Michael Gatto; Marco E. Lübbecke; Marc Nunkesser; Heiko Schilling (Transp. Sci., 2008)

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)