Kevin Mann

According to our database, Kevin Mann authored at least 11 papers between 2022 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Recognizing well-dominated graphs is coNP-complete.

Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza

Inf. Process. Lett., January, 2024

2023

Enumerating Defensive Alliances.

Zhidan Feng, Henning Fernau, Kevin Mann

CoRR, 2023

Offensive Alliances in Signed Graphs.

Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi

CoRR, 2023

Perfect Roman Domination and Unique Response Roman Domination.

Henning Fernau, Kevin Mann

CoRR, 2023

Defensive Alliances in Signed Networks.

Emmanuel Arrighi, Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi, Petra Wolf

CoRR, 2023

Hitting the Romans.

Henning Fernau, Kevin Mann

CoRR, 2023

Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes.

Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Parameterizing Path Partitions.

Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N

Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

2022

Enumerating Connected Dominating Sets.

Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann

CoRR, 2022

Minimal Roman Dominating Functions: Extensions and Enumeration.

Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Enumerating Minimal Connected Dominating Sets.

Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann

Proceedings of the 30th Annual European Symposium on Algorithms, 2022