C. Dalfó, M. A. Fiol, and E. Steffen, “On token signed graphs,” arXiv:2403.02924. 2024.

Y. Ma, D. Mattiolo, E. Steffen, and I. H. Wolf, “Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs,”10.1007/s00493-023-00078-9__Combinatorica, vol. 44, pp. 429–440, 2024, doi:10.1007/s00493-023-00078-9 .

C. Cappello, R. Naserasr, E. Steffen, and Z. Wang, “Critically 3-frustrated signed graphs,” arXiv:2304.10243. 2023.

H. O. M. Silva, D. P. Rubert, E. Araujo, E. Steffen, D. Doerr, and F. V. Martinez, “Algorithms for the genome median under a restricted measure of rearrangement,”10.1051/ro/2023052__RAIRO - Operations Research, vol. 57, no. 3, pp. 1045–1058, 2023, doi:10.1051/ro/2023052 .

Y. Ma, D. Mattiolo, E. Steffen, and I. H. Wolf, “Sets of r-graphs that color all r-graphs,” arXiv:2305.08619. 2023.

Y. Ma, D. Mattiolo, E. Steffen, and I. H. Wolf, “Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs,”10.1137/22m1500654__SIAM Journal on Discrete Mathematics, vol. 37, no. 3, pp. 1548–1565, 2023, doi:10.1137/22m1500654 .

E. Steffen and I. H. Wolf, “Bounds for the chromatic index of signed multigraphs,”10.1016/j.dam.2023.05.008__Discrete Applied Mathematics, vol. 337, pp. 185–189, 2023, doi:10.1016/j.dam.2023.05.008 .

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

E. Steffen and I. H. Wolf, “Rotation r-graphs,”10.1016/j.disc.2023.113457__Discrete Mathematics, Art. no. 113457, 2023, doi:10.1016/j.disc.2023.113457 .

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

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

C. Cappello and E. Steffen, “Symmetric Set Coloring of Signed Graphs,”10.1007/s00026-022-00593-4__Annals of Combinatorics, 2022, doi:10.1007/s00026-022-00593-4 .

E. Steffen and I. H. Wolf, “Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices,”10.1007/s00373-022-02506-x__Graphs and Combinatorics, vol. 38, no. 3, Art. no. 104, 2022, doi:10.1007/s00373-022-02506-x .

C. Cappello and E. Steffen, “Frustration-critical signed graphs,”10.1016/j.dam.2022.08.010__Discrete Applied Mathematics, vol. 322, pp. 183–193, 2022, doi:10.1016/j.dam.2022.08.010 .

D. Mattiolo and E. Steffen, “Edge colorings and circular flows on regular graphs,”10.1002/jgt.22746__Journal of Graph Theory, vol. 99, no. 3, pp. 399–413, 2022, doi:10.1002/jgt.22746 .

I. Gräßler, D. Roesmann, C. Cappello, and E. Steffen, “Skill-based worker assignment in a manual assembly line,”10.1016/j.procir.2021.05.100__in Procedia CIRP Design, Enschede, 2021, pp. 433–438, doi:10.1016/j.procir.2021.05.100 .

D. Mattiolo and E. Steffen, “Highly edgeconnected regular graphs without large factorizable subgraphs,”10.1002/jgt.22729__Journal of Graph Theory, vol. 99, no. 1, pp. 107–116, 2021, doi:10.1002/jgt.22729 .

A. Klopp and E. Steffen, “Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs,”10.1007/s00373-020-02266-6__Graphs and Combinatorics, pp. 559–580, 2021, doi:10.1007/s00373-020-02266-6 .

E. Steffen and A. Vogel, “Concepts of signed graph coloring,” European J. Combinatorics, vol. 91, 2021.

Y. Lu, R. Luo, M. Schubert, E. Steffen, and C.-Q. Zhang, “Flows on signed graphs without long barbells,”10.1137/18M1222818__SIAM J. Discrete Math, vol. 34 (4), pp. 2166–2187, 2020, doi:10.1137/18M1222818 .