Steffen, Eckhard, and Isaak Hieronymus Wolf. “Bounds for the Chromatic Index of Signed Multigraphs.”10.1016/j.dam.2023.05.008__Discrete Applied Mathematics, vol. 337, Elsevier BV, 2023, pp. 185–89, doi:10.1016/j.dam.2023.05.008.

Cappello, Chiara, and Eckhard Steffen. “Frustration-Critical Signed Graphs.”10.1016/j.dam.2022.08.010__Discrete Applied Mathematics, vol. 322, Elsevier BV, 2022, pp. 183–93, doi:10.1016/j.dam.2022.08.010.

Bar-Yehuda, Reuven, et al. “Bandwidth Allocation in Cellular Networks with Multiple Interferences.”http://dx.doi.org/10.1016/j.dam.2015.05.013__Discrete Applied Mathematics , vol. 194, Elsevier, 2015, pp. 23–36, doi: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.”10.1016/j.dam.2005.05.037__Discrete Applied Mathematics, 2006, pp. 1380–91, doi:10.1016/j.dam.2005.05.037.

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