Dalfó, C., M. A. Fiol, and Eckhard Steffen. “On Token Signed Graphs.” ArXiv:2403.02924, 2024.
LibreCat: /record/52342
arXiv: 2403.02924

Ma, Yulai, Davide Mattiolo, Eckhard Steffen, and Isaak Hieronymus Wolf. “Edge-Connectivity and Pairwise Disjoint Perfect Matchings in Regular Graphs.”https://doi.org/10.1007/s00493-023-00078-9__Combinatorica 44 (2024): 429–40.https://doi.org/10.1007/s00493-023-00078-9 .
LibreCat: /record/49905
DOI: 10.1007/s00493-023-00078-9

Cappello, Chiara, Reza Naserasr, Eckhard Steffen, and Zhouningxin Wang. “Critically 3-Frustrated Signed Graphs.” ArXiv:2304.10243, 2023.
LibreCat: /record/44501
arXiv: 2304.10243

Silva, Helmuth O.M., Diego P. Rubert, Eloi Araujo, Eckhard Steffen, Daniel Doerr, and Fábio V. Martinez. “Algorithms for the Genome Median under a Restricted Measure of Rearrangement.”https://doi.org/10.1051/ro/2023052__RAIRO - Operations Research 57, no. 3 (2023): 1045–58.https://doi.org/10.1051/ro/2023052 .
LibreCat: /record/44857
DOI: 10.1051/ro/2023052

Ma, Yulai, Davide Mattiolo, Eckhard Steffen, and Isaak Hieronymus Wolf. “Sets of R-Graphs That Color All r-Graphs.” ArXiv:2305.08619, 2023.
LibreCat: /record/44859
arXiv: 2305.08619

Ma, Yulai, Davide Mattiolo, Eckhard Steffen, and Isaak Hieronymus Wolf. “Pairwise Disjoint Perfect Matchings in R-Edge-Connected r-Regular Graphs.”https://doi.org/10.1137/22m1500654__SIAM Journal on Discrete Mathematics 37, no. 3 (2023): 1548–65.https://doi.org/10.1137/22m1500654 .
LibreCat: /record/46256
DOI: 10.1137/22m1500654

Steffen, Eckhard, and Isaak Hieronymus Wolf. “Bounds for the Chromatic Index of Signed Multigraphs.”https://doi.org/10.1016/j.dam.2023.05.008__Discrete Applied Mathematics 337 (2023): 185–89.https://doi.org/10.1016/j.dam.2023.05.008 .
LibreCat: /record/51351
DOI: 10.1016/j.dam.2023.05.008

Cappello, Chiara, and Eckhard Steffen. “Graph-Theoretical Models for the Analysis and Design of Socio-Technical Networks.”https://doi.org/10.1007/978-3-031-26104-6_5__In The Digital Twin of Humans, 93--110. Cham: Springer International Publishing, 2023.https://doi.org/10.1007/978-3-031-26104-6_5 .
LibreCat: /record/45190
DOI: 10.1007/978-3-031-26104-6_5

Steffen, Eckhard, and Isaak Hieronymus Wolf. “Rotation R-Graphs.”https://doi.org/10.1016/j.disc.2023.113457__Discrete Mathematics, 2023.https://doi.org/10.1016/j.disc.2023.113457 .
LibreCat: /record/51357
DOI: 10.1016/j.disc.2023.113457

Gräßler, Iris, Eckhard Steffen, Günter W. Maier, and Daniel Roesmann. “Introduction—The Digital Twin of Humans.”https://doi.org/10.1007/978-3-031-26104-6_1__In The Digital Twin of Humans, edited by Iris Gräßler, Günter W. Maier, Eckhard Steffen, and Daniel Roesmann, 3–10. Cham: Springer International Publishing, 2023.https://doi.org/10.1007/978-3-031-26104-6_1 .
LibreCat: /record/45110
DOI: 10.1007/978-3-031-26104-6_1

Gräßler, Iris, Günter W. Maier, Eckhard Steffen, and Daniel Roesmann, eds. The Digital Twin of Humans. Cham: Springer International Publishing, 2023.https://doi.org/10.1007/978-3-031-26104-6 .
LibreCat: /record/45191
DOI: 10.1007/978-3-031-26104-6

Cappello, Chiara, and Eckhard Steffen. “Symmetric Set Coloring of Signed Graphs.”https://doi.org/10.1007/s00026-022-00593-4__Annals of Combinatorics, 2022.https://doi.org/10.1007/s00026-022-00593-4 .
LibreCat: /record/33741
DOI: 10.1007/s00026-022-00593-4
arXiv: 2106.05928

Steffen, Eckhard, and Isaak Hieronymus Wolf. “Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices.”https://doi.org/10.1007/s00373-022-02506-x__Graphs and Combinatorics 38, no. 3 (2022).https://doi.org/10.1007/s00373-022-02506-x .
LibreCat: /record/31543
DOI: 10.1007/s00373-022-02506-x
arXiv: 2109.11447

Cappello, Chiara, and Eckhard Steffen. “Frustration-Critical Signed Graphs.”https://doi.org/10.1016/j.dam.2022.08.010__Discrete Applied Mathematics 322 (2022): 183–93.https://doi.org/10.1016/j.dam.2022.08.010 .
LibreCat: /record/33950
DOI: 10.1016/j.dam.2022.08.010
arXiv: 2112.02664

Mattiolo, Davide, and Eckhard Steffen. “Edge Colorings and Circular Flows on Regular Graphs.”https://doi.org/10.1002/jgt.22746__Journal of Graph Theory 99, no. 3 (2022): 399–413.https://doi.org/10.1002/jgt.22746 .
LibreCat: /record/26408
DOI: 10.1002/jgt.22746
arXiv: 2001.02484

Gräßler, Iris, Daniel Roesmann, Chiara Cappello, and Eckhard Steffen. “Skill-Based Worker Assignment in a Manual Assembly Line.”https://doi.org/10.1016/j.procir.2021.05.100__In Procedia CIRP Design, edited by Eric Lutters, 433–38. Elsevier, 2021.https://doi.org/10.1016/j.procir.2021.05.100 .
LibreCat: /record/22287
DOI: 10.1016/j.procir.2021.05.100

Li, Jiaao, Yulai Ma, Zhengke Miao, Yongtang Shi, Weifan Wang, and Cun-Quan Zhang. “Nowhere-Zero 3-Flows in Toroidal Graphs.”https://doi.org/10.1016/j.jctb.2021.11.001__Journal of Combinatorial Theory, Series B 153 (2021): 61–80.https://doi.org/10.1016/j.jctb.2021.11.001 .
LibreCat: /record/34042
DOI: 10.1016/j.jctb.2021.11.001

Li, Jiaao, Yulai Ma, Yongtang Shi, Weifan Wang, and Yezhou Wu. “On 3-Flow-Critical Graphs.”https://doi.org/10.1016/j.ejc.2021.103451__European Journal of Combinatorics 100 (2021).https://doi.org/10.1016/j.ejc.2021.103451 .
LibreCat: /record/32810
DOI: 10.1016/j.ejc.2021.103451

Mattiolo, Davide, and Eckhard Steffen. “Highly Edgeconnected Regular Graphs without Large Factorizable Subgraphs.”https://doi.org/10.1002/jgt.22729__Journal of Graph Theory 99, no. 1 (2021): 107–16.https://doi.org/10.1002/jgt.22729 .
LibreCat: /record/23456
DOI: 10.1002/jgt.22729
arXiv: 1912.09704

Klopp, Antje, and Eckhard Steffen. “Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs.”https://doi.org/10.1007/s00373-020-02266-6__Graphs and Combinatorics, 2021, 559–80.https://doi.org/10.1007/s00373-020-02266-6 .
LibreCat: /record/21827
DOI: 10.1007/s00373-020-02266-6
arXiv: 1903.12385