| 2026 | DLT | On Languages Describing Large Graph Classes. | Henning Fernau, Pamela Fleischmann, Kevin Mann, Silas Cato Sacher |
| 2026 | MFCS | Finding Shortest Reconfiguration Sequences on Independent Set Polytopes. | Jean Cardinal, Kevin Mann, Akira Suzuki, Takahiro Suzuki, Yuma Tamura, Xiao Zhou |
| 2026 | SOFSEM | Enumeration With Nice Roman Domination Properties. | Kevin Mann |
| 2026 | WALCOM | How to Reconfigure Your Alliances. | Henning Fernau, Kevin Mann |
| 2026 | WALCOM | On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs. | Kazuhiro Kurita, Kevin Mann |
| 2025 | SOFSEM | Roman Hitting Set. | Kevin Mann, Henning Fernau |
| 2024 | IWOCA | Perfect Roman Domination: Aspects of Enumeration and Parameterization. | Kevin Mann, Henning Fernau |
| 2024 | TAMC | Offensive Alliances in Signed Graphs. | Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi |
| 2023 | CIAC | Parameterizing Path Partitions. | Henning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N |
| 2023 | MFCS | Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. | Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann |
| 2022 | ESA | Enumerating Minimal Connected Dominating Sets. | Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann |
| 2022 | WG | Minimal Roman Dominating Functions: Extensions and Enumeration. | Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann |