TY - CHAP A1 - Hilger, Moritz A1 - Köhler, Ekkehard A1 - Möhring, Rolf H. A1 - Schilling, Heiko T1 - Fast Point-to-Point Shortest Path Computations with Arc-Flags Y1 - 2009 ER - TY - GEN A1 - Brandstädt, Andreas A1 - Dragan, Feodor F. A1 - Köhler, Ekkehard T1 - Linear time algorithms for Hamiltonian problems on (claw,net)-free graphs T2 - SIAM journal on computing Y1 - 2000 SN - 0097-5397 VL - 30 IS - 5 SP - 1662 EP - 1677 ER - TY - CHAP A1 - Baier, Georg A1 - Erlebach, Thomas A1 - Hall, Alexander A1 - Köhler, Ekkehard A1 - Schilling, Heiko A1 - Skutella, Martin T1 - Length-bounded cuts and flows Y1 - 2006 ER - TY - GEN A1 - Baier, Georg A1 - Köhler, Ekkehard A1 - Skutella, Martin T1 - The k-Splittable Flow Problem Y1 - 2005 ER - TY - CHAP A1 - Corneil, Derek G. A1 - Dragan, Feodor F. A1 - Köhler, Ekkehard ED - Rajsbaum, Sergio T1 - On the power of BFS to determine a graphs diameter T2 - LATIN 2002, theoretical informatics, proceedings, 5th Latin American Symposium, Cancun, Mexico, April 3 - 6, 2002 Y1 - 2002 SN - 3-540-43400-3 SP - 209 EP - 223 PB - Springer CY - Berlin [u.a.] ER - TY - CHAP A1 - Corneil, Derek G. A1 - Dragan, Feodor F. A1 - Köhler, Ekkehard A1 - Yan, Chenyu ED - Kratsch, Dieter T1 - Collective tree 1-spanners for interval graphs T2 - Graph theoretic concepts in computer science, 31st international workshop, WG 2005, Metz, France, June 23 - 25, 2005 Y1 - 2005 SN - 3-540-31000-2 SN - 978-3-540-31000-6 SP - 151 EP - 162 PB - Springer CY - Berlin [u.a.] ER - TY - CHAP A1 - Köhler, Ekkehard A1 - Möhring, Rolf H. A1 - Nökel, K. A1 - Wünsch, Gregor T1 - Optimization of signalized traffic networks Y1 - 2008 ER - TY - CHAP A1 - Köhler, Ekkehard A1 - Möhring, Rolf H. A1 - Skutella, Martin T1 - Traffic networks and flows over time Y1 - 2009 ER - TY - GEN A1 - Baumann, Nadine A1 - Köhler, Ekkehard T1 - Approximating earliest arrival flows with flow-dependent transit times Y1 - 2007 ER - TY - CHAP A1 - Baumann, Nadine A1 - Köhler, Ekkehard T1 - Approximating earliest arrival flows with flow-dependent transit times Y1 - 2004 ER - TY - CHAP A1 - Fekete, Sándor P. A1 - Hall, Alexander A1 - Köhler, Ekkehard A1 - Kröller, Alexander T1 - The Maximum Energy-Constrained Dynamic Flow Problem Y1 - 2008 ER - TY - GEN A1 - Corneil, Derek G. A1 - Köhler, Ekkehard A1 - Olariu, Stephan A1 - Stewart, Lorna T1 - Linear Orderings of Subfamilies of AT-Free Graphs Y1 - 2006 ER - TY - GEN A1 - Fekete, Sándor P. A1 - Köhler, Ekkehard A1 - Teich, Jürgen T1 - Higher-Dimensional Packing with Order Constraints Y1 - 2006 ER - TY - GEN A1 - Fekete, Sándor P. A1 - Köhler, Ekkehard A1 - Teich, Jürgen T1 - Extending Partial Suborders Y1 - 2001 ER - TY - CHAP A1 - Fekete, Sándor P. A1 - Köhler, Ekkehard A1 - Teich, Jürgen T1 - Higher-Dimensional Packing with Order Constraints Y1 - 2001 ER - TY - CHAP A1 - Gawrilow, Ewgenij A1 - Köhler, Ekkehard A1 - Möhring, Rolf H. A1 - Stenzel, Björn T1 - Dynamic Routing of Automated Guided Vehicles in Real-time Y1 - 2008 ER - TY - CHAP A1 - Köhler, Ekkehard A1 - Corneil, Derek G. A1 - Olariu, Stephan A1 - Stewart, Lorna T1 - On subfamilies of AT-free graphs Y1 - 2001 ER - TY - JOUR A1 - Köhler, Ekkehard T1 - Recognizing graphs without asteroidal triples Y1 - 2004 ER - TY - CHAP A1 - Köhler, Ekkehard A1 - Skutella, Martin T1 - Flows over Time with Load-Dependent Transit Times Y1 - 2003 ER - TY - JOUR A1 - Köhler, Ekkehard A1 - Skutella, Martin T1 - Flows over Time with Load-Dependent Transit Times Y1 - 2005 ER - TY - CHAP A1 - Köhler, Ekkehard A1 - Langkau, Katharina A1 - Skutella, Martin T1 - Time-Expanded Graphs for Flow-Dependent Transit Times Y1 - 2002 ER -