Edge-Dominating Trails in AT-free Graphs (Extended Abstract). - Ekkehard Köhler; Matthias Kriesell (Electron. Notes Discret. Math., 1999)

Connected Domination and Dominating Clique in Trapezoid Graphs. - Ekkehard Köhler (Discret. Appl. Math., 2000)

Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. - Andreas Brandstädt; Feodor F. Dragan; Ekkehard Köhler (SIAM J. Comput., 2000)

Optimal FPGA module placement with temporal precedence constraints. - Sándor P. Fekete; Ekkehard Köhler; Jürgen Teich (DATE, 2001)

On Subfamilies of AT-Free Graphs. - Ekkehard Köhler; Derek G. Corneil; Stephan Olariu; Lorna Stewart (WG, 2001)

Extending Partial Suborders. - Sándor P. Fekete; Ekkehard Köhler; Jürgen Teich (Electron. Notes Discret. Math., 2001)

Time-Expanded Graphs for Flow-Dependent Transit Times. - Ekkehard Köhler; Katharina Langkau; Martin Skutella (ESA, 2002)

On the Power of BFS to Determine a Graphs Diameter. - Derek G. Corneil; Feodor F. Dragan; Ekkehard Köhler (LATIN, 2002)

On the power of BFS to determine a graph's diameter. - Derek G. Corneil; Feodor F. Dragan; Ekkehard Köhler (Networks, 2003)

Minimizing Total Delay in Fixed-Time Controlled Traffic Networks. - Ekkehard Köhler; Rolf H. Möhring; Gregor Wünsch (OR, 2004)

Conflict-free Real-time AGV Routing. - Rolf H. Möhring; Ekkehard Köhler; Ewgenij Gawrilow; Björn Stenzel (OR, 2004)

Hereditary dominating pair graphs. - Natasa Przulj; Derek G. Corneil; Ekkehard Köhler (Discret. Appl. Math., 2004)

Recognizing graphs without asteroidal triples. - Ekkehard Köhler (J. Discrete Algorithms, 2004)

Acceleration of Shortest Path and Constrained Shortest Path Computation. - Ekkehard Köhler; Rolf H. Möhring; Heiko Schilling (WEA, 2005)

Collective Tree 1-Spanners for Interval Graphs. - Derek G. Corneil; Feodor F. Dragan; Ekkehard Köhler; Chenyu Yan (WG, 2005)

The k-Splittable Flow Problem. - Georg Baier; Ekkehard Köhler; Martin Skutella (Algorithmica, 2005)

Flows over Time with Load-Dependent Transit Times. - Ekkehard Köhler; Martin Skutella (SIAM J. Optim., 2005)

Fast Point-to-Point Shortest Path Computations with Arc-Flags. - Moritz Hilger; Ekkehard Köhler; Rolf H. Möhring; Heiko Schilling (The Shortest Path Problem, 2006)

Length-Bounded Cuts and Flows. - Georg Baier; Thomas Erlebach; Alexander Hall; Ekkehard Köhler; Heiko Schilling; Martin Skutella (ICALP (1), 2006)

Linear Orderings of Subfamilies of AT-Free Graphs. - Derek G. Corneil; Ekkehard Köhler; Stephan Olariu; Lorna Stewart (SIAM J. Discret. Math., 2006)

Higher-Dimensional Packing with Order Constraints. - Sándor P. Fekete; Ekkehard Köhler; Jürgen Teich (SIAM J. Discret. Math., 2006)

Benchmarks for Strictly Fundamental Cycle Bases. - Christian Liebchen; Gregor Wünsch; Ekkehard Köhler; Alexander Reich; Romeo Rizzi (WEA, 2007)

Approximating earliest arrival flows with flow-dependent transit times. - Nadine Baumann; Ekkehard Köhler (Discret. Appl. Math., 2007)

The Maximum Energy-Constrained Dynamic Flow Problem. - Sándor P. Fekete; Alexander Hall; Ekkehard Köhler; Alexander Kröller (SWAT, 2008)

Additive Spanners for Circle Graphs and Polygonal Graphs. - Feodor F. Dragan; Derek G. Corneil; Ekkehard Köhler; Yang Xiang (WG, 2008)

Traffic Networks and Flows over Time. - Ekkehard Köhler; Rolf H. Möhring; Martin Skutella (Algorithmics of Large and Complex Networks, 2009)

Lower bounds for strictly fundamental cycle bases in grid graphs. - Ekkehard Köhler; Christian Liebchen; Gregor Wünsch; Romeo Rizzi (Networks, 2009)

On end-vertices of Lexicographic Breadth First Searches. - Derek G. Corneil; Ekkehard Köhler; Jean-Marc Lanlignel (Discret. Appl. Math., 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)

Collective additive tree spanners for circle graphs and polygonal graphs. - Feodor F. Dragan; Derek G. Corneil; Ekkehard Köhler; Yang Xiang (Discret. Appl. Math., 2012)

Linear Time LexDFS on Cocomparability Graphs. - Ekkehard Köhler; Lalla Mouatadid (SWAT, 2014)

An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs. - Feodor F. Dragan; Ekkehard Köhler (Algorithmica, 2014)

Linear Structure of Graphs and the Knotting Graph. - Ekkehard Köhler (Gems of Combinatorial Optimization and Graph Algorithms, 2015)

Traffic signal optimization using cyclically expanded networks. - Ekkehard Köhler; Martin Strehler 001 (Networks, 2015)

Eccentricity Approximating Trees - Extended Abstract. - Feodor F. Dragan; Ekkehard Köhler; Hend Alrasheed (WG, 2016)

A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs. - Ekkehard Köhler; Lalla Mouatadid (Inf. Process. Lett., 2016)

On the Power of Graph Searching for Cocomparability Graphs. - Derek G. Corneil; Jérémie Dusart; Michel Habib; Ekkehard Köhler (SIAM J. Discret. Math., 2016)

A Graph Theoretic Approach for Shape from Shading. - Robert Scheffler 001; Ashkan Mansouri Yarahmadi; Michael Breuß; Ekkehard Köhler (EMMCVPR, 2017)

Line-Distortion, Bandwidth and Path-Length of a Graph. - Feodor F. Dragan; Ekkehard Köhler; Arne Leitert (Algorithmica, 2017)

Eccentricity approximating trees. - Feodor F. Dragan; Ekkehard Köhler; Hend Alrasheed (Discret. Appl. Math., 2017)

On the End-Vertex Problem of Graph Searches. - Jesse Beisegel; Carolin Denkert; Ekkehard Köhler; Matjaz Krnc; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (Discret. Math. Theor. Comput. Sci., 2019)

Recognizing Graph Search Trees. - Jesse Beisegel; Carolin Denkert; Ekkehard Köhler; Matjaz Krnc; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (LAGOS, 2019)

Traffic Signal Optimization: Combining Static and Dynamic Models. - Ekkehard Köhler; Martin Strehler 001 (Transp. Sci., 2019)

Linear Time LexDFS on Chordal Graphs. - Jesse Beisegel; Ekkehard Köhler; Robert Scheffler 001; Martin Strehler 001 (ESA, 2020)

Edge Elimination and Weighted Graph Classes. - Jesse Beisegel; Nina Chiarelli; Ekkehard Köhler; Matjaz Krnc; Martin Milanic; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (WG, 2020)

The Recognition Problem of Graph Search Trees. - Jesse Beisegel; Carolin Denkert; Ekkehard Köhler; Matjaz Krnc; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (SIAM J. Discret. Math., 2021)

Optimal Bicycle Routes with Few Signal Stops. - Ekkehard Köhler; Markus Rogge; Robert Scheffler 001; Martin Strehler 001 (ATMOS, 2023)

Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs. - Jesse Beisegel; Ekkehard Köhler; Robert Scheffler 001; Martin Strehler 001 (Algorithmica, 2023)

Graph Search Trees and the Intermezzo Problem. - Jesse Beisegel; Ekkehard Köhler; Fabienne Ratajczak; Robert Scheffler 001; Martin Strehler 001 (MFCS, 2024)

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs. - Jesse Beisegel; Nina Chiarelli; Ekkehard Köhler; Martin Milanic; Peter Mursic; Robert Scheffler 001 (SWAT, 2024)

Graph parameters that are coarsely equivalent to path-length. - Feodor F. Dragan; Ekkehard Köhler (CoRR, 2025)

Lower bounds on collective additive spanners. - Derek G. Corneil; Feodor F. Dragan; Ekkehard Köhler; Yang Xiang (CoRR, 2025)

Sandwich Monotonicity and the Recognition of Weighted Graph Classes. - Jesse Beisegel; Nina Chiarelli; Ekkehard Köhler; Matjaz Krnc; Martin Milanic; Nevena Pivac; Robert Scheffler 001; Martin Strehler 001 (CoRR, 2025)