Ekkehard Köhler

1.4k total citations
29 papers, 376 citations indexed

About

Ekkehard Köhler is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Transportation. According to data from OpenAlex, Ekkehard Köhler has authored 29 papers receiving a total of 376 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Computational Theory and Mathematics, 12 papers in Computer Networks and Communications and 6 papers in Transportation. Recurrent topics in Ekkehard Köhler's work include Advanced Graph Theory Research (17 papers), Complexity and Algorithms in Graphs (10 papers) and Transportation Planning and Optimization (6 papers). Ekkehard Köhler is often cited by papers focused on Advanced Graph Theory Research (17 papers), Complexity and Algorithms in Graphs (10 papers) and Transportation Planning and Optimization (6 papers). Ekkehard Köhler collaborates with scholars based in Germany, United States and Canada. Ekkehard Köhler's co-authors include Sándor P. Fekete, Martin Skutella, Feodor F. Dragan, Derek G. Corneil, Andreas Brandstädt, Thomas Erlebach, Heiko Schilling, Petr Kolman, Alexander Hall and Jürgen Teich and has published in prestigious journals such as SIAM Journal on Computing, SIAM Journal on Optimization and Lecture notes in computer science.

In The Last Decade

Ekkehard Köhler

29 papers receiving 350 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Ekkehard Köhler Germany	10	189	122	121	94	48	29	376
Francesco Pupo Italy	10	127 0.7×	61 0.5×	70 0.6×	44 0.5×	19 0.4×	51	318
Giuseppe Iazeolla Italy	12	152 0.8×	34 0.3×	43 0.4×	43 0.5×	23 0.5×	54	354
Daniel E. Steffy United States	8	113 0.6×	26 0.2×	183 1.5×	66 0.7×	100 2.1×	16	388
Irith Ben‐Arroyo Hartman Israel	9	45 0.2×	7 0.1×	128 1.1×	46 0.5×	38 0.8×	23	265
Alain Sutter France	11	116 0.6×	25 0.2×	101 0.8×	63 0.7×	177 3.7×	13	360
Yuqi Chen Taiwan	4	145 0.8×	11 0.1×	59 0.5×	54 0.6×	73 1.5×	10	369
Zachary Friggstad Canada	9	96 0.5×	12 0.1×	63 0.5×	16 0.2×	67 1.4×	30	247
Mohand Mezmaz France	9	297 1.6×	80 0.7×	46 0.4×	20 0.2×	149 3.1×	21	469
Yuanrui Zhang United States	12	232 1.2×	251 2.1×	34 0.3×	69 0.7×	7 0.1×	43	362
David Shallcross United States	11	213 1.1×	5 0.0×	112 0.9×	129 1.4×	140 2.9×	33	433

Countries citing papers authored by Ekkehard Köhler

Since Specialization

Citations

This map shows the geographic impact of Ekkehard Köhler's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ekkehard Köhler with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ekkehard Köhler more than expected).

Fields of papers citing papers by Ekkehard Köhler

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ekkehard Köhler. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ekkehard Köhler. The network helps show where Ekkehard Köhler may publish in the future.

Co-authorship network of co-authors of Ekkehard Köhler

This figure shows the co-authorship network connecting the top 25 collaborators of Ekkehard Köhler. A scholar is included among the top collaborators of Ekkehard Köhler based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ekkehard Köhler. Ekkehard Köhler is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Köhler, Ekkehard, et al.. (2023). Certifying Fully Dynamic Algorithms for Recognition and Hamiltonicity of Threshold and Chain Graphs. Algorithmica. 85(8). 2454–2481. 1 indexed citations

Köhler, Ekkehard, et al.. (2019). On the End-Vertex Problem of Graph Searches. Discrete Mathematics & Theoretical Computer Science. vol. 21 no. 1, ICGT 2018. 5 indexed citations

Brandstädt, Andreas, et al.. (2018). Graph-Theoretic Concepts in Computer Science. Lecture notes in computer science. 1 indexed citations

Dragan, Feodor F., et al.. (2017). Eccentricity approximating trees. Discrete Applied Mathematics. 232. 142–156. 8 indexed citations

Köhler, Ekkehard, et al.. (2015). Traffic signal optimization using cyclically expanded networks. Networks. 65(3). 244–261. 15 indexed citations

Dragan, Feodor F., et al.. (2015). Line-Distortion, Bandwidth and Path-Length of a Graph. Algorithmica. 77(3). 686–713. 2 indexed citations

Köhler, Ekkehard, et al.. (2015). A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs. Information Processing Letters. 116(6). 391–395. 6 indexed citations

Dragan, Feodor F. & Ekkehard Köhler. (2013). An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs. Algorithmica. 69(4). 884–905. 14 indexed citations

Dragan, Feodor F., Derek G. Corneil, Ekkehard Köhler, & Yang Xiang. (2012). Collective additive tree spanners for circle graphs and polygonal graphs. Discrete Applied Mathematics. 160(12). 1717–1729. 1 indexed citations

10.

Köhler, Ekkehard, et al.. (2012). Combining Static and Dynamic Models for Traffic Signal Optimization Inherent Load-dependent Travel Times in a Cyclically Time-expanded Network Model. Procedia - Social and Behavioral Sciences. 54. 1125–1134. 7 indexed citations

11.

Köhler, Ekkehard, et al.. (2010). Traffic Signal Optimization Using Cyclically Expanded Networks. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations

12.

Erlebach, Thomas, Alexander Hall, Ekkehard Köhler, et al.. (2010). Length-bounded cuts and flows. ACM Transactions on Algorithms. 7(1). 1–27. 28 indexed citations

13.

Corneil, Derek G., et al.. (2009). On end-vertices of Lexicographic Breadth First Searches. Discrete Applied Mathematics. 158(5). 434–443. 12 indexed citations

14.

Fekete, Sándor P., Ekkehard Köhler, & Jürgen Teich. (2006). Higher‐Dimensional Packing with Order Constraints. SIAM Journal on Discrete Mathematics. 20(4). 1056–1078. 5 indexed citations

15.

Köhler, Ekkehard & Martin Skutella. (2005). Flows over Time with Load-Dependent Transit Times. SIAM Journal on Optimization. 15(4). 1185–1202. 24 indexed citations

16.

Pržulj, Nataša, Derek G. Corneil, & Ekkehard Köhler. (2003). Hereditary dominating pair graphs. Discrete Applied Mathematics. 134(1-3). 239–261. 1 indexed citations

17.

Köhler, Ekkehard & Martin Skutella. (2002). Flows over time with load-dependent transit times. Symposium on Discrete Algorithms. 174–183. 13 indexed citations

18.

Fekete, Sándor P., et al.. (2002). Optimal FPGA module placement with temporal precedence constraints. 658–665. 57 indexed citations

19.

Fekete, Sándor P., et al.. (2001). Optimal FPGA module placement with temporal precedence constraints. Design, Automation, and Test in Europe. 658–667. 79 indexed citations

20.

Köhler, Ekkehard. (2000). Connected domination and dominating clique in trapezoid graphs. Discrete Applied Mathematics. 99(1-3). 91–110. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact