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 .

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 .

Bar-Yehuda, Reuven, Gleb Polevoy, and Dror Rawitz. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.”http://dx.doi.org/10.1016/j.dam.2015.05.013__Discrete Applied Mathematics  194 (2015): 23–36.http://dx.doi.org/10.1016/j.dam.2015.05.013 .

Faigle, Ulrich, and Gereon Frahling. “A Combinatorial Algorithm for Weighted Stable Sets in Bipartite Graphs.”https://doi.org/10.1016/j.dam.2005.05.037__Discrete Applied Mathematics, 2006, 1380–91.https://doi.org/10.1016/j.dam.2005.05.037 .

Kleine Büning, Hans, and Theodor Lettmann. “Resolution Remains Hard under Equivalence.”https://doi.org/10.1016/s0166-218x(99)00055-4__Discrete Applied Mathematics, 1999, 139–48.https://doi.org/10.1016/s0166-218x(99)00055-4 .