Kevin Mann

Scientific Assistant Theoretical computer science

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

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

E-Mail: mann@uni-trier.de

Sprechstunde: Tue 1 pm - 2 pm in H 407 (For other times please send me an E-Mail)

Journal:

Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann. Minimal Roman Dominating Functions: Extensions and Enumeration. Algorithmica. DOI: https://doi.org/10.1007/s00453-024-01211-w
Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza. Recognizing well-dominated graphs is coNP-complete. Information Processing Letters 183. DOI: https://doi.org/10.1016/j.ipl.2023.106419

Conferences

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. DOI: https://doi.org/10.1007/978-3-031-15914-5_1
Abu-Khzam, F.N., Fernau, H., Gras, B., Liedloff, M., & Mann, K. (2022). Enumerating Minimal Connected Dominating Sets. Embedded Systems and Applications. Doi: https://doi.org/10.4230/LIPIcs.ESA.2022.1
Fernau, H., Foucaud, F., Mann, K., Padariya, U., & RajathRaoK., N. (2023). Parameterizing Path Partitions. International/Italian Conference on Algorithms and Complexity. Doi: https://doi.org/10.1007/978-3-031-30448-4_14
Faisal Abu-Khzam, Henning Fernau, Kevin Mann. Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. MFCS 2023. DOI: https://doi.org/10.4230/LIPIcs.MFCS.2023.6
Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi. Offensive Alliances in Signed Graphs. TAMC 2024. DOI: 10.1007/978-981-97-2340-9_20
Kevin Mann, Henning Fernau. Perfect Roman Domination: Aspects of Enumeration and Parameterization. IWOCA 2024

Arxiv: