Ekkehard Köhler

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