Kevin Mann

Scientific Assistant Theoretical computer science

Theoretical computer science
Campus II / Geozentrum
Building H, Room H 447
D-54286 Trier

E-Mail: mann@uni-trier.de

Tel.: +49 (0)651 201-2840        

Publications

Abu-Khzam, F.N., Fernau, H., & Mann, K. (2022). Minimal Roman Dominating Functions: Extensions and Enumeration. International Workshop on Graph-Theoretic Concepts in Computer Science.

Fernau, H., Foucaud, F., Mann, K., Padariya, U., & RajathRaoK., N. (2022). Parameterizing Path Partitions. International/Italian Conference on Algorithms and Complexity.

Abu-Khzam, F.N., Fernau, H., Gras, B., Liedloff, M., & Mann, K. (2022). Enumerating Minimal Connected Dominating Sets. Embedded Systems and Applications. https://doi.org/10.4230/LIPIcs.ESA.2022.1

Abu-Khzam, F.N., Fernau, H., & Mann, K. (2022). Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. ArXiv, abs/2208.05261.

Fernau, H., & Mann, K. (2023). Hitting the Romans. ArXiv, abs/2302.11417.

Agrawal, A., Fernau, H., Kindermann, P., Mann, K., & Souza, U.D. (2022). Recognizing well-dominated graphs is coNP-complete. ArXiv, abs/2208.08864.