Ekkehard Köhler

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 21

Top Topics

Radially Symmetric

Branching Factor

Top Venues

Publications

Jesse Beisegel, Ekkehard Köhler, Fabienne Ratajczak, Robert Scheffler, Martin Strehler
Graph Search Trees and the Intermezzo Problem. MFCS (2024)
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. SWAT (2024)
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Martin Milanic, Peter Mursic, Robert Scheffler
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. CoRR (2024)
Jesse Beisegel, Ekkehard Köhler, Fabienne Ratajczak, Robert Scheffler, Martin Strehler
Graph Search Trees and the Intermezzo Problem. CoRR (2024)
Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler
Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs. Algorithmica 85 (8) (2023)
Ekkehard Köhler, Markus Rogge, Robert Scheffler, Martin Strehler
Optimal Bicycle Routes with Few Signal Stops. ATMOS (2023)
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler
The Recognition Problem of Graph Search Trees. SIAM J. Discret. Math. 35 (2) (2021)
Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler
Linear Time LexDFS on Chordal Graphs. CoRR (2020)
Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler
Linear Time LexDFS on Chordal Graphs. ESA (2020)
Jesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaz Krnc, Martin Milanic, Nevena Pivac, Robert Scheffler, Martin Strehler
Edge Elimination and Weighted Graph Classes. WG (2020)
Ekkehard Köhler, Martin Strehler
Traffic Signal Optimization: Combining Static and Dynamic Models. Transp. Sci. 53 (1) (2019)
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler
Recognizing Graph Search Trees. LAGOS (2019)
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler
On the End-Vertex Problem of Graph Searches. Discret. Math. Theor. Comput. Sci. 21 (1) (2019)
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler
Recognizing Graph Search Trees. CoRR (2018)
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler
On the End-Vertex Problem of Graph Searches. CoRR (2018)
Robert Scheffler, Ashkan Mansouri Yarahmadi, Michael Breuß, Ekkehard Köhler
A Graph Theoretic Approach for Shape from Shading. EMMCVPR (2017)
Feodor F. Dragan, Ekkehard Köhler, Hend Alrasheed
Eccentricity approximating trees. Discret. Appl. Math. 232 (2017)
Feodor F. Dragan, Ekkehard Köhler, Arne Leitert
Line-Distortion, Bandwidth and Path-Length of a Graph. Algorithmica 77 (3) (2017)
Ekkehard Köhler, Lalla Mouatadid
A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs. Inf. Process. Lett. 116 (6) (2016)
Feodor F. Dragan, Ekkehard Köhler, Hend Alrasheed
Eccentricity Approximating Trees - Extended Abstract. WG (2016)
Derek G. Corneil, Jérémie Dusart, Michel Habib, Ekkehard Köhler
On the Power of Graph Searching for Cocomparability Graphs. SIAM J. Discret. Math. 30 (1) (2016)
Ekkehard Köhler, Martin Strehler
Traffic signal optimization using cyclically expanded networks. Networks 65 (3) (2015)
Ekkehard Köhler, Martin Strehler
Traffic signal optimization: combining static and dynamic models. CoRR (2015)
Ekkehard Köhler, Lalla Mouatadid
Linear Time LexDFS on Cocomparability Graphs. CoRR (2014)
Feodor F. Dragan, Ekkehard Köhler, Arne Leitert
Line-Distortion, Bandwidth and Path-Length of a Graph. SWAT (2014)
Feodor F. Dragan, Ekkehard Köhler
An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs. Algorithmica 69 (4) (2014)
Feodor F. Dragan, Ekkehard Köhler, Arne Leitert
Line-distortion, Bandwidth and Path-length of a graph. CoRR (2014)
Ekkehard Köhler, Lalla Mouatadid
Linear Time LexDFS on Cocomparability Graphs. SWAT (2014)
Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang
Collective additive tree spanners for circle graphs and polygonal graphs. Discret. Appl. Math. 160 (12) (2012)
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)
Derek G. Corneil, Ekkehard Köhler, Jean-Marc Lanlignel
On end-vertices of Lexicographic Breadth First Searches. Discret. Appl. Math. 158 (5) (2010)
Ekkehard Köhler, Martin Strehler
Traffic Signal Optimization Using Cyclically Expanded Networks. ATMOS (2010)
Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella
Length-bounded cuts and flows. ACM Trans. Algorithms 7 (1) (2010)
Ekkehard Köhler, Rolf H. Möhring, Martin Skutella
Traffic Networks and Flows over Time. Algorithmics of Large and Complex Networks (2009)
Ekkehard Köhler, Christian Liebchen, Gregor Wünsch, Romeo Rizzi
Lower bounds for strictly fundamental cycle bases in grid graphs. Networks 53 (2) (2009)
Sándor P. Fekete, Alexander Hall, Ekkehard Köhler, Alexander Kröller
The Maximum Energy-Constrained Dynamic Flow Problem. SWAT (2008)
Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang
Additive Spanners for Circle Graphs and Polygonal Graphs. WG (2008)
Christian Liebchen, Gregor Wünsch, Ekkehard Köhler, Alexander Reich, Romeo Rizzi
Benchmarks for Strictly Fundamental Cycle Bases. WEA (2007)
Nadine Baumann, Ekkehard Köhler
Approximating earliest arrival flows with flow-dependent transit times. Discret. Appl. Math. 155 (2) (2007)
Moritz Hilger, Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling
Fast Point-to-Point Shortest Path Computations with Arc-Flags. The Shortest Path Problem (2006)
Derek G. Corneil, Ekkehard Köhler, Stephan Olariu, Lorna Stewart
Linear Orderings of Subfamilies of AT-Free Graphs. SIAM J. Discret. Math. 20 (1) (2006)
Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich
Higher-Dimensional Packing with Order Constraints. SIAM J. Discret. Math. 20 (4) (2006)
Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella
Length-Bounded Cuts and Flows. ICALP (1) (2006)
Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan
Collective Tree 1-Spanners for Interval Graphs. WG (2005)
Georg Baier, Ekkehard Köhler, Martin Skutella
The k-Splittable Flow Problem. Algorithmica 42 (3-4) (2005)
Ekkehard Köhler, Martin Skutella
Flows over Time with Load-Dependent Transit Times. SIAM J. Optim. 15 (4) (2005)
Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling
Acceleration of Shortest Path and Constrained Shortest Path Computation. WEA (2005)
Nadine Baumann, Ekkehard Köhler
Approximating Earliest Arrival Flows with Flow-Dependent Transit Times. MFCS (2004)
Rolf H. Möhring, Ekkehard Köhler, Ewgenij Gawrilow, Björn Stenzel
Conflict-free Real-time AGV Routing. OR (2004)
Ekkehard Köhler
Recognizing graphs without asteroidal triples. J. Discrete Algorithms 2 (4) (2004)
Natasa Przulj, Derek G. Corneil, Ekkehard Köhler
Hereditary dominating pair graphs. Discret. Appl. Math. 134 (1-3) (2004)
Ekkehard Köhler, Rolf H. Möhring, Gregor Wünsch
Minimizing Total Delay in Fixed-Time Controlled Traffic Networks. OR (2004)
Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich
Higher-Dimensional Packing with Order Constraints CoRR (2003)
Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler
On the power of BFS to determine a graph's diameter. Networks 42 (4) (2003)
Ekkehard Köhler, Martin Skutella
Flows over time with load-dependent transit times. SODA (2002)
Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler
On the Power of BFS to Determine a Graphs Diameter. LATIN (2002)
Georg Baier, Ekkehard Köhler, Martin Skutella
On the k-Splittable Flow Problem. ESA (2002)
Ekkehard Köhler, Katharina Langkau, Martin Skutella
Time-Expanded Graphs for Flow-Dependent Transit Times. ESA (2002)
Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich
Extending Partial Suborders. Electron. Notes Discret. Math. 8 (2001)
Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich
Higher-Dimensional Packing with Order Constraints. WADS (2001)
Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart
On Subfamilies of AT-Free Graphs. WG (2001)
Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich
Optimal FPGA module placement with temporal precedence constraints. DATE (2001)
Ekkehard Köhler
Connected Domination and Dominating Clique in Trapezoid Graphs. Discret. Appl. Math. 99 (1-3) (2000)
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) (2000)
Ekkehard Köhler
Recognizing Graphs without Asteroidal Triples. WG (2000)
Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. WG (1999)
Ekkehard Köhler, Matthias Kriesell
Edge-Dominating Trails in AT-free Graphs (Extended Abstract). Electron. Notes Discret. Math. 3 (1999)