Enumerating Connected Dominating Sets. - Faisal N. Abu-Khzam; Henning Fernau; Benjamin Gras 002; Mathieu Liedloff; Kevin Mann (CoRR, 2022)

Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. - Faisal N. Abu-Khzam; Henning Fernau; Kevin Mann (MFCS, 2023)

Hitting the Romans. - Henning Fernau; Kevin Mann (CoRR, 2023)

Perfect Roman Domination and Unique Response Roman Domination. - Henning Fernau; Kevin Mann (CoRR, 2023)

Enumerating Defensive Alliances. - Zhidan Feng 002; Henning Fernau; Kevin Mann (CoRR, 2023)

Perfect Roman Domination: Aspects of Enumeration and Parameterization. - Kevin Mann; Henning Fernau (IWOCA, 2024)

Roman Hitting Functions. - Henning Fernau; Kevin Mann (IPEC, 2024)

Offensive Alliances in Signed Graphs. - Zhidan Feng 002; Henning Fernau; Kevin Mann; Xingqin Qi (TAMC, 2024)

Generalized Word-Representable Graphs. - Zhidan Feng 002; Henning Fernau; Pamela Fleischmann; Kevin Mann; Silas Cato Sacher (CoRR, 2024)

Recognizing well-dominated graphs is coNP-complete. - Akanksha Agrawal 001; Henning Fernau; Philipp Kindermann; Kevin Mann; Uéverton S. Souza (Inf. Process. Lett., 2024)

Minimal Roman Dominating Functions: Extensions and Enumeration. - Faisal N. Abu-Khzam; Henning Fernau; Kevin Mann (Algorithmica, 2024)

Generalized Lettericity of Graphs. - Zhidan Feng 002; Henning Fernau; Kevin Mann; Indhumathi Raman; Silas Cato Sacher (CALDAM, 2025)

Extension Perfect Roman Domination. - Kevin Mann; Henning Fernau (CALDAM, 2025)

Roman Hitting Set. - Kevin Mann; Henning Fernau (SOFSEM (2), 2025)

Defensive Alliances in Signed Networks. - Emmanuel Arrighi; Zhidan Feng 002; Henning Fernau; Kevin Mann; Xingqin Qi; Petra Wolf 002 (J. Artif. Intell. Res., 2025)

Enumerating Minimal Connected Dominating Sets. - Faisal N. Abu-Khzam; Henning Fernau; Benjamin Gras 002; Mathieu Liedloff; Kevin Mann (SIAM J. Discret. Math., 2025)

Parameterizing path partitions. - Henning Fernau; Florent Foucaud; Kevin Mann; Utkarsh Padariya; Rajath Rao K. N (Theor. Comput. Sci., 2025)

On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs. - Kazuhiro Kurita; Kevin Mann (CoRR, 2025)