A linear-time algorithm for the identifying code problem on block graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2017)

Polyhedra associated with identifying codes in graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Katrin Wagler (Discret. Appl. Math., 2018)

The Identifying Code, the Locating-dominating, the Open Locating-dominating and the Locating Total-dominating Problems Under Some Graph Operations. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Wagler (LAGOS, 2019)

Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Wagler (ISCO, 2020)

Linear-time algorithms for three domination-based separation problems in block graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Katrin Wagler (Discret. Appl. Math., 2020)

Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs. - Gabriela R. Argiroffo; Silvia M. Bianchi; Yanina Lucarini; Annegret Wagler (Discret. Appl. Math., 2022)

Location-Domination Type Problems Under the Mycielski Construction. - Silvia M. Bianchi; Dipayan Chakraborty; Yanina Lucarini; Annegret Katrin Wagler (CALDAM, 2024)