Steffen, E., &; Wolf, I. H. (2023). Bounds for the chromatic index of signed multigraphs. Discrete Applied Mathematics, 337, 185–189.https://doi.org/10.1016/j.dam.2023.05.008 

Cappello, C., &; Steffen, E. (2022). Frustration-critical signed graphs. Discrete Applied Mathematics, 322, 183–193.https://doi.org/10.1016/j.dam.2022.08.010 

Bar-Yehuda, R., Polevoy, G., &; Rawitz, D. (2015). Bandwidth allocation in cellular networks with multiple interferences. Discrete Applied Mathematics , 194, 23–36.http://dx.doi.org/10.1016/j.dam.2015.05.013 

Faigle, U., &; Frahling, G. (2006). A combinatorial algorithm for weighted stable sets in bipartite graphs. Discrete Applied Mathematics, 1380–1391.https://doi.org/10.1016/j.dam.2005.05.037 

Kleine Büning, H., &; Lettmann, T. (1999). Resolution remains hard under equivalence. Discrete Applied Mathematics, 139–148.https://doi.org/10.1016/s0166-218x(99)00055-4