Ekkehard Köhler

According to our database1, Ekkehard Köhler authored at least 45 papers between 1999 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 



On csauthors.net:


Edge Elimination and Weighted Graph Classes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

Linear Time LexDFS on Chordal Graphs.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Traffic Signal Optimization: Combining Static and Dynamic Models.
Transp. Sci., 2019

Recognizing Graph Search Trees.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On the End-Vertex Problem of Graph Searches.
Discret. Math. Theor. Comput. Sci., 2019

Eccentricity approximating trees.
Discret. Appl. Math., 2017

Line-Distortion, Bandwidth and Path-Length of a Graph.
Algorithmica, 2017

A Graph Theoretic Approach for Shape from Shading.
Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition, 2017

On the Power of Graph Searching for Cocomparability Graphs.
SIAM J. Discret. Math., 2016

A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs.
Inf. Process. Lett., 2016

Eccentricity Approximating Trees - Extended Abstract.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

Traffic signal optimization using cyclically expanded networks.
Networks, 2015

Linear Structure of Graphs and the Knotting Graph.
Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs.
Algorithmica, 2014

Linear Time LexDFS on Cocomparability Graphs.
Proceedings of the Algorithm Theory - SWAT 2014, 2014

Collective additive tree spanners for circle graphs and polygonal graphs.
Discret. Appl. Math., 2012

Length-bounded cuts and flows.
ACM Trans. Algorithms, 2010

On end-vertices of Lexicographic Breadth First Searches.
Discret. Appl. Math., 2010

Lower bounds for strictly fundamental cycle bases in grid graphs.
Networks, 2009

Traffic Networks and Flows over Time.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

Additive Spanners for Circle Graphs and Polygonal Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

The Maximum Energy-Constrained Dynamic Flow Problem.
Proceedings of the Algorithm Theory, 2008

Approximating earliest arrival flows with flow-dependent transit times.
Discret. Appl. Math., 2007

Benchmarks for Strictly Fundamental Cycle Bases.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Higher-Dimensional Packing with Order Constraints.
SIAM J. Discret. Math., 2006

Linear Orderings of Subfamilies of AT-Free Graphs.
SIAM J. Discret. Math., 2006

Length-Bounded Cuts and Flows.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Fast Point-to-Point Shortest Path Computations with Arc-Flags.
Proceedings of the Shortest Path Problem, 2006

Flows over Time with Load-Dependent Transit Times.
SIAM J. Optim., 2005

The k-Splittable Flow Problem.
Algorithmica, 2005

Collective Tree 1-Spanners for Interval Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Acceleration of Shortest Path and Constrained Shortest Path Computation.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Recognizing graphs without asteroidal triples.
J. Discrete Algorithms, 2004

Hereditary dominating pair graphs.
Discret. Appl. Math., 2004

Conflict-free Real-time AGV Routing.
Proceedings of the Operations Research, 2004

Minimizing Total Delay in Fixed-Time Controlled Traffic Networks.
Proceedings of the Operations Research, 2004

On the power of BFS to determine a graph's diameter.
Networks, 2003

On the Power of BFS to Determine a Graphs Diameter.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Time-Expanded Graphs for Flow-Dependent Transit Times.
Proceedings of the Algorithms, 2002

Extending Partial Suborders.
Electron. Notes Discret. Math., 2001

On Subfamilies of AT-Free Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Optimal FPGA module placement with temporal precedence constraints.
Proceedings of the Conference on Design, Automation and Test in Europe, 2001

Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs.
SIAM J. Comput., 2000

Connected Domination and Dominating Clique in Trapezoid Graphs.
Discret. Appl. Math., 2000

Edge-Dominating Trails in AT-free Graphs (Extended Abstract).
Electron. Notes Discret. Math., 1999