 | 2011 |
|---|
| 37 |       | Feodor F. Dragan,
Ekkehard Köhler:
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs.
APPROX-RANDOM 2011: 171-183 |
| 2010 |
|---|
| 36 | | Ekkehard Köhler,
Martin Strehler:
Traffic Signal Optimization Using Cyclically Expanded Networks.
ATMOS 2010: 114-129 |
| 35 | | Georg Baier,
Thomas Erlebach,
Alexander Hall,
Ekkehard Köhler,
Petr Kolman,
Ondrej Pangrác,
Heiko Schilling,
Martin Skutella:
Length-bounded cuts and flows.
ACM Transactions on Algorithms 7(1): 4 (2010) |
| 34 | | Derek G. Corneil,
Ekkehard Köhler,
Jean-Marc Lanlignel:
On end-vertices of Lexicographic Breadth First Searches.
Discrete Applied Mathematics 158(5): 434-443 (2010) |
| 2009 |
|---|
| 33 | | Ekkehard Köhler,
Rolf H. Möhring,
Martin Skutella:
Traffic Networks and Flows over Time.
Algorithmics of Large and Complex Networks 2009: 166-196 |
| 32 | | Ekkehard Köhler,
Christian Liebchen,
Gregor Wünsch,
Romeo Rizzi:
Lower bounds for strictly fundamental cycle bases in grid graphs.
Networks 53(2): 191-205 (2009) |
| 2008 |
|---|
| 31 | | Sándor P. Fekete,
Alexander Hall,
Ekkehard Köhler,
Alexander Kröller:
The Maximum Energy-Constrained Dynamic Flow Problem.
SWAT 2008: 114-126 |
| 30 | | Feodor F. Dragan,
Derek G. Corneil,
Ekkehard Köhler,
Yang Xiang:
Additive Spanners for Circle Graphs and Polygonal Graphs.
WG 2008: 110-121 |
| 2007 |
|---|
| 29 | | Christian Liebchen,
Gregor Wünsch,
Ekkehard Köhler,
Alexander Reich,
Romeo Rizzi:
Benchmarks for Strictly Fundamental Cycle Bases.
WEA 2007: 365-378 |
| 28 | | Nadine Baumann,
Ekkehard Köhler:
Approximating earliest arrival flows with flow-dependent transit times.
Discrete Applied Mathematics 155(2): 161-171 (2007) |
| 2006 |
|---|
| 27 | | Georg Baier,
Thomas Erlebach,
Alexander Hall,
Ekkehard Köhler,
Heiko Schilling,
Martin Skutella:
Length-Bounded Cuts and Flows.
ICALP (1) 2006: 679-690 |
| 26 | | Derek G. Corneil,
Ekkehard Köhler:
Linear Orderings of Subfamilies of AT-Free Graphs.
SIAM J. Discrete Math. 20(1): 105-118 (2006) |
| 25 | | Sándor P. Fekete,
Ekkehard Köhler,
Jürgen Teich:
Higher-Dimensional Packing with Order Constraints.
SIAM J. Discrete Math. 20(4): 1056-1078 (2006) |
| 2005 |
|---|
| 24 | | Ekkehard Köhler,
Rolf H. Möhring,
Heiko Schilling:
Acceleration of Shortest Path and Constrained Shortest Path Computation.
WEA 2005: 126-138 |
| 23 | | Derek G. Corneil,
Feodor F. Dragan,
Ekkehard Köhler,
Chenyu Yan:
Collective Tree 1-Spanners for Interval Graphs.
WG 2005: 151-162 |
| 22 | | Georg Baier,
Ekkehard Köhler,
Martin Skutella:
The k-Splittable Flow Problem.
Algorithmica 42(3-4): 231-248 (2005) |
| 21 | | Ekkehard Köhler,
Martin Skutella:
Flows over Time with Load-Dependent Transit Times.
SIAM Journal on Optimization 15(4): 1185-1202 (2005) |
| 2004 |
|---|
| 20 | | Nadine Baumann,
Ekkehard Köhler:
Approximating Earliest Arrival Flows with Flow-Dependent Transit Times.
MFCS 2004: 599-610 |
| 19 | | Rolf H. Möhring,
Ekkehard Köhler,
Ewgenij Gawrilow,
Björn Stenzel:
Conflict-free Real-time AGV Routing.
OR 2004: 18-24 |
| 18 | | Ekkehard Köhler,
Rolf H. Möhring,
Gregor Wünsch:
Minimizing Total Delay in Fixed-Time Controlled Traffic Networks.
OR 2004: 192-199 |
| 17 | | Natasa Przulj,
Derek G. Corneil,
Ekkehard Köhler:
Hereditary dominating pair graphs.
Discrete Applied Mathematics 134(1-3): 239-261 (2004) |
| 16 | | Ekkehard Köhler:
Recognizing graphs without asteroidal triples.
J. Discrete Algorithms 2(4): 439-452 (2004) |
| 2003 |
|---|
| 15 | | Sándor P. Fekete,
Ekkehard Köhler,
Jürgen Teich:
Higher-Dimensional Packing with Order Constraints
CoRR cs.DS/0308006: (2003) |
| 14 | | Derek G. Corneil,
Feodor F. Dragan,
Ekkehard Köhler:
On the power of BFS to determine a graph's diameter.
Networks 42(4): 209-222 (2003) |
| 2002 |
|---|
| 13 | | Georg Baier,
Ekkehard Köhler,
Martin Skutella:
On the k-Splittable Flow Problem.
ESA 2002: 101-113 |
| 12 | | Ekkehard Köhler,
Katharina Langkau,
Martin Skutella:
Time-Expanded Graphs for Flow-Dependent Transit Times.
ESA 2002: 599-611 |
| 11 | | Derek G. Corneil,
Feodor F. Dragan,
Ekkehard Köhler:
On the Power of BFS to Determine a Graphs Diameter.
LATIN 2002: 209-223 |
| 10 | | Ekkehard Köhler,
Martin Skutella:
Flows over time with load-dependent transit times.
SODA 2002: 174-183 |
| 2001 |
|---|
| 9 | | Sándor P. Fekete,
Ekkehard Köhler,
Jürgen Teich:
Optimal FPGA module placement with temporal precedence constraints.
DATE 2001: 658-667 |
| 8 | | Sándor P. Fekete,
Ekkehard Köhler,
Jürgen Teich:
Higher-Dimensional Packing with Order Constraints.
WADS 2001: 300-312 |
| 7 | | Ekkehard Köhler,
Derek G. Corneil,
Stephan Olariu,
Lorna Stewart:
On Subfamilies of AT-Free Graphs.
WG 2001: 241-253 |
| 6 | | Sándor P. Fekete,
Ekkehard Köhler,
Jürgen Teich:
Extending Partial Suborders.
Electronic Notes in Discrete Mathematics 8: 34-37 (2001) |
| 2000 |
|---|
| 5 | | Ekkehard Köhler:
Recognizing Graphs without Asteroidal Triples.
WG 2000: 255-266 |
| 4 | | Ekkehard Köhler:
Connected Domination and Dominating Clique in Trapezoid Graphs.
Discrete Applied Mathematics 99(1-3): 91-110 (2000) |
| 3 | | Andreas Brandstädt,
Feodor F. Dragan,
Ekkehard Köhler:
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs.
SIAM J. Comput. 30(5): 1662-1677 (2000) |
| 1999 |
|---|
| 2 | | Andreas Brandstädt,
Feodor F. Dragan,
Ekkehard Köhler:
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs.
WG 1999: 364-376 |
| 1 | | Ekkehard Köhler,
Matthias Kriesell:
Edge-Dominating Trails in AT-free Graphs (Extended Abstract).
Electronic Notes in Discrete Mathematics 3: 95-101 (1999) |
Data released under the ODC-BY 1.0 license — See also our legal information page