On token signed graphs
C. Dalfó, M.A. Fiol, E. Steffen, ArXiv:2403.02924 (2024).

Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs
Y. Ma, D. Mattiolo, E. Steffen, I.H. Wolf, Combinatorica 44 (2024) 429–440.

Critically 3-frustrated signed graphs
C. Cappello, R. Naserasr, E. Steffen, Z. Wang, ArXiv:2304.10243 (2023).

Algorithms for the genome median under a restricted measure of rearrangement
H.O.M. Silva, D.P. Rubert, E. Araujo, E. Steffen, D. Doerr, F.V. Martinez, RAIRO - Operations Research 57 (2023) 1045–1058.

Sets of r-graphs that color all r-graphs
Y. Ma, D. Mattiolo, E. Steffen, I.H. Wolf, ArXiv:2305.08619 (2023).

Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
Y. Ma, D. Mattiolo, E. Steffen, I.H. Wolf, SIAM Journal on Discrete Mathematics 37 (2023) 1548–1565.

Bounds for the chromatic index of signed multigraphs
E. Steffen, I.H. Wolf, Discrete Applied Mathematics 337 (2023) 185–189.

Graph-Theoretical Models for the Analysis and Design of Socio-Technical Networks
C. Cappello, E. Steffen, in: The Digital Twin of Humans, Springer International Publishing, Cham, 2023, pp. 93--110.

Rotation r-graphs
E. Steffen, I.H. Wolf, Discrete Mathematics (2023).

Introduction—The Digital Twin of Humans
I. Gräßler, E. Steffen, G.W. Maier, D. Roesmann, in: I. Gräßler, G.W. Maier, E. Steffen, D. Roesmann (Eds.), The Digital Twin of Humans, Springer International Publishing, Cham, 2023, pp. 3–10.

The Digital Twin of Humans
I. Gräßler, G.W. Maier, E. Steffen, D. Roesmann, eds., The Digital Twin of Humans, Springer International Publishing, Cham, 2023.

Symmetric Set Coloring of Signed Graphs
C. Cappello, E. Steffen, Annals of Combinatorics (2022).

Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices
E. Steffen, I.H. Wolf, Graphs and Combinatorics 38 (2022).

Frustration-critical signed graphs
C. Cappello, E. Steffen, Discrete Applied Mathematics 322 (2022) 183–193.

Edge colorings and circular flows on regular graphs
D. Mattiolo, E. Steffen, Journal of Graph Theory 99 (2022) 399–413.

Skill-based worker assignment in a manual assembly line
I. Gräßler, D. Roesmann, C. Cappello, E. Steffen, in: E. Lutters (Ed.), Procedia CIRP Design, Elsevier, 2021, pp. 433–438.

Nowhere-zero 3-flows in toroidal graphs
J. Li, Y. Ma, Z. Miao, Y. Shi, W. Wang, C.-Q. Zhang, Journal of Combinatorial Theory, Series B 153 (2021) 61–80.

On 3-flow-critical graphs
J. Li, Y. Ma, Y. Shi, W. Wang, Y. Wu, European Journal of Combinatorics 100 (2021).

Highly edgeconnected regular graphs without large factorizable subgraphs
D. Mattiolo, E. Steffen, Journal of Graph Theory 99 (2021) 107–116.

Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs
A. Klopp, E. Steffen, Graphs and Combinatorics (2021) 559–580.

Concepts of signed graph coloring
E. Steffen, A. Vogel, European J. Combinatorics 91 (2021).

Flows on signed graphs without long barbells
Y. Lu, R. Luo, M. Schubert, E. Steffen, C.-Q. Zhang, SIAM J. Discrete Math 34 (4) (2020) 2166–2187.

Unions of 1-factors in r-graphs and overfull graphs
L. Jin, E. Steffen, J. of Combinatorics 11 (2020) 457–473.

Gerechtigkeit in flexiblen Arbeits- und Managementprozessen
G. Engels, G.W. Maier, S.K. Ötting, E. Steffen, A. Teetz, in: S. Wischmann, E.A. Hartmann (Eds.), Zukunft Der Arbeit – Eine Praxisnahe Betrachtung, Springer Verlag, Berlin, Heidelberg, 2018, pp. 221–231.

Measures of Edge-Uncolorability of Cubic Graphs
M.A. Fiol, G. Mazzuoccolo, E. Steffen, The Electronic Journal of Combinatorics 25 (2018).

Flows in Signed Graphs with Two Negative Edges 
E. Rollová, M. Schubert, E. Steffen, The Electronic Journal of Combinatorics 25 (2018).

Cores, joins  and the Fano-flow conjectures
L. Jin, G. Mazzuoccolo, E. Steffen, Discussiones Mathematicae Graph Theory 38 (2018) 165–175.

Approximating Vizing’s independence number conjecture
E. Steffen, Australasian Journal of Combinatorics 71 (2018) 153–160.

Handbuch Gestaltung digitaler und vernetzter Arbeitswelten
G.W. Maier, G. Engels, E. Steffen, eds., Handbuch Gestaltung digitaler und vernetzter Arbeitswelten, 1st ed., Springer Berlin Heidelberg, 2017.

Digitale Zukunft: ein inter- und transdisziplinäres Thema
D. Simon, E. Steffen, in: G.W. Maier, G. Engels, E. Steffen (Eds.), Handbuch Gestaltung digitaler und vernetzter Arbeitswelten, 1st ed., Springer Berlin Heidelberg, 2017, pp. 1–12.

Nowhere-zero 5-flows on cubic graphs with oddness 4
G. Mazzuoccolo, E. Steffen, J. Graph Theory 85 (2017) 363 – 371.

Factors of edge-chromatic critical graphs: a brief survey and some equivalences
S. Bej, E. Steffen, Lecture Notes of Seminario Interdisciplinare Di Matematica 14 (2017) 37–48.

Petersen cores and the oddness of cubic graphs
L. Jin, E. Steffen, J. Graph Theory 84 (2017) 109–120.

Face-degree bounds for planar critical graphs
L. Jin, Y. Kang, E. Steffen, Electronic Journal of Combinatorics 23 (2016).

The chromatic spectrum of signed graphs
Y. Kang, E. Steffen, Discrete Mathematics  339 (2016) 234–243.

Remarks on planar critical graphs
L. Jin, Y. Kang, E. Steffen, Discrete Applied Mathematics 200 (2016) 200–202.

Choosability in signed planar graphs
L. Jin, Y. Kang, E. Steffen, European J. Combinatorics 52 (2016) 234–243.

Intersecting 1-factors and nowhere-zero 5-flows
E. Steffen, Combinatorica 35 (2015) 633–640.

Edge-colorings and circular flow numbers of regular graphs
E. Steffen, J. Graph Theory 79 (2015) 1–7.

The difference between the circular and the integer flow number of bidirected graphs
E. Mádajová, E. Steffen, Discrete Mathematics 338 (2015) 866–867.

1-factor-and cycle covers of cubic graphs
E. Steffen, J. Graph Theory 78 (2015) 195 – 206.

Nowhere-zero flows on signed regular graphs
M. Schubert, E. Steffen, European J. Combinatorics 48 (2015) 34–47.

The set of circular flow numbers of regular graphs
M. Schubert, E. Steffen, J. Graph Theory 76 (2014) 297–308.

Petersen colorings and some families of snarks
J. Hägglund, E. Steffen, Ars Mathematica Contemporanea 312 (2014) 476–478.

;1-labelings and the structure of trees with nonzero ;1-deficit 
G. Brinkmann,  Simon Crevals, H. Melot,  Leanne J. Rylands, E. Steffen, Discrete Mathematics. and Theoretical Computer Science 14.1 (2012) 159–174.

Nearly nowhere-zero r-flow graphs
E. Steffen, Discrete Mathematics 312 (2012) 2757–2759.

Maximum -edge-colorable subgraphs of class II graphs
V. Mkrtchyan, E. Steffen, J. Graph Theory 70 (2012) 473–482.

Measures of edge-uncolorability
V. Mkrtchyan, E. Steffen, Discrete Mathematics 312 (2012) 476–478.

Tutte's 5-flow conjecture for cyclically highly connected cubic graphs
E. Steffen, Discrete Mathematics 310 (2010) 385–389.

Bricks and conjectures of Berge, Fulkerson and Seymour
V. Mkrtchyan, E. Steffen, ArXiv:1003.5782 (2010).

Relating embedding and coloring properties of snarks
B. Mohar, E. Steffen, A. Vodopivec, Ars Mathematica Contemporanea 1 (2008) 169–184.

Erratum to eReductions of Symmetry configurations n3
M. Boben, T. Pisanski, N. Ravnik, E. Steffen, Discrete Applied Mathematics 154 (2006) 1645–1646.

Measurements of edge-uncolorability
E. Steffen, Discrete Mathematics 280 (2004) 191–214.

Independent Sets and 2-factors in edge-chromatic critical graphs
S. Grünewald, E. Steffen, J. Graph Theory 45 (2004) 113–118.

Circular flow numbers of regular multigraphs
E. Steffen, J. Graph Theory 36 (2001) 24–34.

On bicritical snarks
E. Steffen, Math. Slovaca 51 (2001) 141–150.

Bounds for the independence number of critical graphs
G. Brinkmann, S.A. Choudum, S. Grünewald, E. Steffen, Bull. London Math. Soc. 32 (2000) 137–140.

A refinement of Vizing's theorem
E. Steffen, Discrete Mathematics 218 (2000) 289–291.

Reductions of Symmetry configurations n3
H.G. Carstens, T. Dinski, E. Steffen, Discrete Applied Mathematics 99 (2000) 401–411.

Counterexamples to a conjecture about Petersen-minors in supersnarks
E. Steffen, Discrete Mathematics 207 (1999) 291–292.

Non-bicritical critical snarks
E. Steffen, Graphs Comb. 15 (1999) 473–480.

Cyclically 5-edge connected non-bicritical critical snarks
S. Grünewald, E. Steffen, Discuss. Math. Graph Theory 19 (1999) 5–11.

Chromatic-index-critical graphs of even order
S. Grünewald, E. Steffen, J. Graph Theory 30 (1999) 27–36.

Snarks and reducibility
G. Brinkmann, E. Steffen, Ars Combinatoria 50 (1998) 292–296.

Chromatic-index-critical graphs of Orders 11 and 12
G. Brinkmann, E. Steffen, European J. Combinatorics 19 (1998) 889–900.

Classification and characterizations of snarkse
E. Steffen, Discrete Mathematics 188 (1998) 183-203 (.

3- and 4-critical graphs of small even order
G. Brinkmann, E. Steffen, Discrete Mathematics 188 (1997) 193–197.

Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs
E. Steffen, Discrete Mathematics 161 (1996) 315.

Star chromatic numbers of graphs
E. Steffen, X. Zhu, Combinatorica 16 (1996) 439–448.

Tutte's 5-flow conjecture for graphs of non-orientable genus 5
E. Steffen, J. Graph Theory 22 (1996) 309–319.

Complexity results for the default- and autoepistemic logic
E. Steffen, in: E. Börger (Ed.), Computer Science Logic , Springer Berlin Heidelberg, 1992, pp. 339–352.