Heiko Schilling

According to our database, Heiko Schilling authored at least 8 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

2008

Optimizing the Cargo Express Service of Swiss Federal Railways.

Alberto Ceselli, Michael Gatto, Marco E. Lübbecke, Marc Nunkesser, Heiko Schilling

Transp. Sci., 2008

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

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

Fast Point-to-Point Shortest Path Computations with Arc-Flags.

Moritz Hilger, Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling

Proceedings of the Shortest Path Problem, 2006

2005

Partitioning Graphs to Speed Up Dijkstra's Algorithm.

Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, Thomas Willhalm

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Acceleration of Shortest Path and Constrained Shortest Path Computation.

Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Flows over Time: Towards a More Realistic and Computationally Tractable Model.

Alexander Hall, Heiko Schilling

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005