Eckhard Steffen

703 total citations
51 papers, 371 citations indexed

About

Eckhard Steffen is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Eckhard Steffen has authored 51 papers receiving a total of 371 indexed citations (citations by other indexed papers that have themselves been cited), including 40 papers in Computational Theory and Mathematics, 31 papers in Discrete Mathematics and Combinatorics and 13 papers in Geometry and Topology. Recurrent topics in Eckhard Steffen's work include Advanced Graph Theory Research (38 papers), Limits and Structures in Graph Theory (26 papers) and Graph Labeling and Dimension Problems (22 papers). Eckhard Steffen is often cited by papers focused on Advanced Graph Theory Research (38 papers), Limits and Structures in Graph Theory (26 papers) and Graph Labeling and Dimension Problems (22 papers). Eckhard Steffen collaborates with scholars based in Germany, United States and Italy. Eckhard Steffen's co-authors include Gunnar Brinkmann, Stefan Grünewald, Xuding Zhu, Günter W. Maier, Michael Schubert, Gregor Engels, M.A. Fiol, Iris Gräßler, S.A. Choudum and Gregor Engels and has published in prestigious journals such as Bulletin of the London Mathematical Society, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Eckhard Steffen

46 papers receiving 361 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Eckhard Steffen Germany 12 318 179 89 70 27 51 371
Dan Pritikin United States 8 168 0.5× 106 0.6× 78 0.9× 73 1.0× 79 2.9× 24 263
Jean E. Dunbar South Africa 12 283 0.9× 92 0.5× 49 0.6× 34 0.5× 88 3.3× 26 336
Gábor Bacsó Hungary 9 263 0.8× 142 0.8× 31 0.3× 68 1.0× 41 1.5× 33 284
Izak Broere South Africa 9 289 0.9× 150 0.8× 98 1.1× 54 0.8× 30 1.1× 47 320
Peter Mihók Slovakia 8 255 0.8× 164 0.9× 97 1.1× 62 0.9× 9 0.3× 53 295
Olivier Togni France 10 276 0.9× 120 0.7× 53 0.6× 118 1.7× 25 0.9× 40 313
F. M. Jaeger France 5 196 0.6× 92 0.5× 61 0.7× 51 0.7× 60 2.2× 11 242
Keith Edwards United Kingdom 10 295 0.9× 103 0.6× 38 0.4× 86 1.2× 32 1.2× 29 307
Dorota Kuziak Spain 13 439 1.4× 30 0.2× 109 1.2× 115 1.6× 37 1.4× 40 461
Arthur M. Hobbs United States 9 193 0.6× 65 0.4× 93 1.0× 50 0.7× 65 2.4× 26 242

Countries citing papers authored by Eckhard Steffen

Since Specialization
Citations

This map shows the geographic impact of Eckhard Steffen'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 Eckhard Steffen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Eckhard Steffen more than expected).

Fields of papers citing papers by Eckhard Steffen

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Eckhard Steffen. 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 Eckhard Steffen. The network helps show where Eckhard Steffen may publish in the future.

Co-authorship network of co-authors of Eckhard Steffen

This figure shows the co-authorship network connecting the top 25 collaborators of Eckhard Steffen. A scholar is included among the top collaborators of Eckhard Steffen 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 Eckhard Steffen. Eckhard Steffen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Naserasr, Reza, et al.. (2024). Critically 3-frustrated signed graphs. Discrete Mathematics. 348(1). 114258–114258.
2.
Gräßler, Iris, et al.. (2023). The Digital Twin of Humans. 4 indexed citations
3.
Gräßler, Iris, et al.. (2021). Skill-based worker assignment in a manual assembly line. Procedia CIRP. 100. 433–438. 13 indexed citations
4.
Steffen, Eckhard, et al.. (2019). Highly edge-connected regular graphs without large factorizable subgraphs. arXiv (Cornell University). 2 indexed citations
5.
Steffen, Eckhard, et al.. (2016). The chromatic spectrum of signed graphs. Discrete Mathematics. 339(11). 2660–2663. 9 indexed citations
6.
Steffen, Eckhard, et al.. (2015). Remarks on planar edge-chromatic critical graphs. Discrete Applied Mathematics. 200. 200–202. 1 indexed citations
7.
Schubert, Michael & Eckhard Steffen. (2015). Nowhere-zero flows on signed regular graphs. European Journal of Combinatorics. 48. 34–47. 12 indexed citations
8.
Máčajová, Edita & Eckhard Steffen. (2015). The difference between the circular and the integer flow number of bidirected graphs. Discrete Mathematics. 338(6). 866–867. 3 indexed citations
9.
Steffen, Eckhard, et al.. (2015). Choosability in signed planar graphs. European Journal of Combinatorics. 52. 234–243. 9 indexed citations
10.
Steffen, Eckhard, et al.. (2011). Measures of edge-uncolorability. Discrete Mathematics. 312(2). 476–478. 1 indexed citations
11.
Steffen, Eckhard. (2010). Tutte's 5-flow conjecture for cyclically highly connected cubic graphs. Discrete Mathematics. 310. 1 indexed citations
12.
Steffen, Eckhard. (2009). Tutte’s 5-flow conjecture for highly cyclically connected cubic graphs. Discrete Mathematics. 310(3). 385–389. 7 indexed citations
13.
Steffen, Eckhard. (2007). Tutte's 5-flow conjecture for highly cyclically connected cubic graphs. Electronic Notes in Discrete Mathematics. 28. 239–242. 1 indexed citations
14.
Steffen, Eckhard. (2003). Measurements of edge-uncolorability. Discrete Mathematics. 280(1-3). 191–214. 22 indexed citations
15.
Steffen, Eckhard, et al.. (2000). Reduction of symmetric configurations n3. Discrete Applied Mathematics. 99(1-3). 401–411. 5 indexed citations
16.
Brinkmann, Gunnar & Eckhard Steffen. (1998). Snarks and Reducibility.. Ars Combinatoria. 50. 20 indexed citations
17.
Steffen, Eckhard. (1998). Classifications and characterizations of snarks. Discrete Mathematics. 188(1-3). 183–203. 42 indexed citations
18.
Brinkmann, Gunnar & Eckhard Steffen. (1998). Chromatic-Index-Critical Graphs of Orders 11 and 12. European Journal of Combinatorics. 19(8). 889–900. 18 indexed citations
19.
Brinkmann, Gunnar & Eckhard Steffen. (1997). 3- and 4-critical graphs of small even order. Discrete Mathematics. 169(1-3). 193–197. 10 indexed citations
20.
Steffen, Eckhard. (1996). Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs. Discrete Mathematics. 161(1-3). 315–315. 1 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

Breakdown of academic impact, for papers by Dan Pritikin Breakdown of academic impact, for papers by Jean E. Dunbar Breakdown of academic impact, for papers by Gábor Bacsó Breakdown of academic impact, for papers by Izak Broere Breakdown of academic impact, for papers by Peter Mihók Breakdown of academic impact, for papers by Olivier Togni Breakdown of academic impact, for papers by F. M. Jaeger Breakdown of academic impact, for papers by Keith Edwards Breakdown of academic impact, for papers by Dorota Kuziak Breakdown of academic impact, for papers by Arthur M. Hobbs
Rankless by CCL
2026