Identifying codes in line digraphs. - Camino Balbuena; Cristina Dalfó; Berenice Martínez-Barona (Appl. Math. Comput., 2020)

Sufficient conditions for a digraph to admit a (1, le l)-identifying code. - Camino Balbuena; Cristina Dalfó; Berenice Martínez-Barona (Discuss. Math. Graph Theory, 2021)

Strong cliques in diamond-free graphs. - Nina Chiarelli; Berenice Martínez-Barona; Martin Milanic; Jérôme Monnot; Peter Mursic (Theor. Comput. Sci., 2021)