default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEkkehard Köhler
Person information
- affiliation: Brandenburg University of Technology, Cottbus, Germany
- affiliation: Technical University of Berlin, Department of Mathematics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c32]Jesse Beisegel, Ekkehard Köhler, Fabienne Ratajczak, Robert Scheffler
, Martin Strehler:
Graph Search Trees and the Intermezzo Problem. MFCS 2024: 22:1-22:18- [c31]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: 7:1-7:20 - [i9]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 abs/2404.10670 (2024) - [i8]Jesse Beisegel, Ekkehard Köhler, Fabienne Ratajczak, Robert Scheffler, Martin Strehler:
Graph Search Trees and the Intermezzo Problem. CoRR abs/2404.18645 (2024) - 2023
- [j26]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): 2454-2481 (2023) - [c30]Ekkehard Köhler, Markus Rogge, Robert Scheffler, Martin Strehler:
Optimal Bicycle Routes with Few Signal Stops. ATMOS 2023: 1:1-1:14 - 2021
- [j25]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): 1418-1446 (2021) - 2020
- [c29]Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler:
Linear Time LexDFS on Chordal Graphs. ESA 2020: 13:1-13:13 - [c28]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: 134-147 - [i7]Jesse Beisegel, Ekkehard Köhler, Robert Scheffler, Martin Strehler:
Linear Time LexDFS on Chordal Graphs. CoRR abs/2005.03523 (2020)
2010 – 2019
- 2019
- [j24]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) - [j23]Ekkehard Köhler, Martin Strehler:
Traffic Signal Optimization: Combining Static and Dynamic Models. Transp. Sci. 53(1): 21-41 (2019) - [c27]Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
Recognizing Graph Search Trees. LAGOS 2019: 99-110 - 2018
- [e1]Andreas Brandstädt, Ekkehard Köhler, Klaus Meer:
Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings. Lecture Notes in Computer Science 11159, Springer 2018, ISBN 978-3-030-00255-8 [contents] - [i6]Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
On the End-Vertex Problem of Graph Searches. CoRR abs/1810.12253 (2018) - [i5]Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler, Martin Strehler:
Recognizing Graph Search Trees. CoRR abs/1811.09249 (2018) - 2017
- [j22]Feodor F. Dragan, Ekkehard Köhler, Arne Leitert:
Line-Distortion, Bandwidth and Path-Length of a Graph. Algorithmica 77(3): 686-713 (2017) - [j21]Feodor F. Dragan, Ekkehard Köhler, Hend Alrasheed:
Eccentricity approximating trees. Discret. Appl. Math. 232: 142-156 (2017) - [c26]Robert Scheffler, Ashkan Mansouri Yarahmadi, Michael Breuß, Ekkehard Köhler:
A Graph Theoretic Approach for Shape from Shading. EMMCVPR 2017: 328-341 - 2016
- [j20]Ekkehard Köhler, Lalla Mouatadid:
A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs. Inf. Process. Lett. 116(6): 391-395 (2016) - [j19]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): 569-591 (2016) - [c25]Feodor F. Dragan, Ekkehard Köhler, Hend Alrasheed:
Eccentricity Approximating Trees - Extended Abstract. WG 2016: 145-157 - 2015
- [j18]Ekkehard Köhler, Martin Strehler:
Traffic signal optimization using cyclically expanded networks. Networks 65(3): 244-261 (2015) - [p1]Ekkehard Köhler:
Linear Structure of Graphs and the Knotting Graph. Gems of Combinatorial Optimization and Graph Algorithms 2015: 13-27 - [i4]Ekkehard Köhler, Martin Strehler:
Traffic signal optimization: combining static and dynamic models. CoRR abs/1509.08709 (2015) - 2014
- [j17]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): 884-905 (2014) - [c24]Feodor F. Dragan, Ekkehard Köhler, Arne Leitert:
Line-Distortion, Bandwidth and Path-Length of a Graph. SWAT 2014: 158-169 - [c23]Ekkehard Köhler, Lalla Mouatadid:
Linear Time LexDFS on Cocomparability Graphs. SWAT 2014: 319-330 - [i3]Ekkehard Köhler, Lalla Mouatadid:
Linear Time LexDFS on Cocomparability Graphs. CoRR abs/1404.5996 (2014) - [i2]Feodor F. Dragan, Ekkehard Köhler, Arne Leitert:
Line-distortion, Bandwidth and Path-length of a graph. CoRR abs/1409.8389 (2014) - 2012
- [j16]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): 1717-1729 (2012) - 2011
- [c22]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
- [j15]Derek G. Corneil, Ekkehard Köhler, Jean-Marc Lanlignel:
On end-vertices of Lexicographic Breadth First Searches. Discret. Appl. Math. 158(5): 434-443 (2010) - [j14]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): 4:1-4:27 (2010) - [c21]Ekkehard Köhler, Martin Strehler:
Traffic Signal Optimization Using Cyclically Expanded Networks. ATMOS 2010: 114-129
2000 – 2009
- 2009
- [j13]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) - [c20]Ekkehard Köhler, Rolf H. Möhring, Martin Skutella:
Traffic Networks and Flows over Time. Algorithmics of Large and Complex Networks 2009: 166-196 - 2008
- [c19]Sándor P. Fekete, Alexander Hall, Ekkehard Köhler, Alexander Kröller:
The Maximum Energy-Constrained Dynamic Flow Problem. SWAT 2008: 114-126 - [c18]Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang:
Additive Spanners for Circle Graphs and Polygonal Graphs. WG 2008: 110-121 - 2007
- [j12]Nadine Baumann, Ekkehard Köhler:
Approximating earliest arrival flows with flow-dependent transit times. Discret. Appl. Math. 155(2): 161-171 (2007) - [c17]Christian Liebchen, Gregor Wünsch, Ekkehard Köhler, Alexander Reich, Romeo Rizzi:
Benchmarks for Strictly Fundamental Cycle Bases. WEA 2007: 365-378 - 2006
- [j11]Derek G. Corneil, Ekkehard Köhler, Stephan Olariu, Lorna Stewart:
Linear Orderings of Subfamilies of AT-Free Graphs. SIAM J. Discret. Math. 20(1): 105-118 (2006) - [j10]Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich:
Higher-Dimensional Packing with Order Constraints. SIAM J. Discret. Math. 20(4): 1056-1078 (2006) - [c16]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: 41-72 - [c15]Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Heiko Schilling, Martin Skutella:
Length-Bounded Cuts and Flows. ICALP (1) 2006: 679-690 - 2005
- [j9]Georg Baier, Ekkehard Köhler, Martin Skutella:
The k-Splittable Flow Problem. Algorithmica 42(3-4): 231-248 (2005) - [j8]Ekkehard Köhler, Martin Skutella:
Flows over Time with Load-Dependent Transit Times. SIAM J. Optim. 15(4): 1185-1202 (2005) - [c14]Ekkehard Köhler, Rolf H. Möhring, Heiko Schilling:
Acceleration of Shortest Path and Constrained Shortest Path Computation. WEA 2005: 126-138 - [c13]Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan:
Collective Tree 1-Spanners for Interval Graphs. WG 2005: 151-162 - 2004
- [j7]Natasa Przulj, Derek G. Corneil, Ekkehard Köhler:
Hereditary dominating pair graphs. Discret. Appl. Math. 134(1-3): 239-261 (2004) - [j6]Ekkehard Köhler:
Recognizing graphs without asteroidal triples. J. Discrete Algorithms 2(4): 439-452 (2004) - [c12]Nadine Baumann, Ekkehard Köhler:
Approximating Earliest Arrival Flows with Flow-Dependent Transit Times. MFCS 2004: 599-610 - [c11]Rolf H. Möhring, Ekkehard Köhler, Ewgenij Gawrilow, Björn Stenzel:
Conflict-free Real-time AGV Routing. OR 2004: 18-24 - [c10]Ekkehard Köhler, Rolf H. Möhring, Gregor Wünsch:
Minimizing Total Delay in Fixed-Time Controlled Traffic Networks. OR 2004: 192-199 - 2003
- [j5]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) - [i1]Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich:
Higher-Dimensional Packing with Order Constraints. CoRR cs.DS/0308006 (2003) - 2002
- [c9]Georg Baier, Ekkehard Köhler, Martin Skutella:
On the k-Splittable Flow Problem. ESA 2002: 101-113 - [c8]Ekkehard Köhler, Katharina Langkau, Martin Skutella:
Time-Expanded Graphs for Flow-Dependent Transit Times. ESA 2002: 599-611 - [c7]Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler:
On the Power of BFS to Determine a Graphs Diameter. LATIN 2002: 209-223 - [c6]Ekkehard Köhler, Martin Skutella:
Flows over time with load-dependent transit times. SODA 2002: 174-183 - 2001
- [j4]Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich:
Extending Partial Suborders. Electron. Notes Discret. Math. 8: 34-37 (2001) - [c5]Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich:
Optimal FPGA module placement with temporal precedence constraints. DATE 2001: 658-667 - [c4]Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich:
Higher-Dimensional Packing with Order Constraints. WADS 2001: 300-312 - [c3]Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart:
On Subfamilies of AT-Free Graphs. WG 2001: 241-253 - 2000
- [j3]Ekkehard Köhler:
Connected Domination and Dominating Clique in Trapezoid Graphs. Discret. Appl. Math. 99(1-3): 91-110 (2000) - [j2]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) - [c2]Ekkehard Köhler:
Recognizing Graphs without Asteroidal Triples. WG 2000: 255-266
1990 – 1999
- 1999
- [j1]Ekkehard Köhler, Matthias Kriesell:
Edge-Dominating Trails in AT-free Graphs (Extended Abstract). Electron. Notes Discret. Math. 3: 95-101 (1999) - [c1]Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler:
Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. WG 1999: 364-376
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
