I.M.E. (Isja) Mannens MSc

PhD Candidate
Algorithms and Complexity

Publications

2022

Scholarly publications

Groenland, C., Mannens, I., Nederlof, J., & Szilágyi, K. (2022). Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. In 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) (pp. 36:1--36:20). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 219). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPICS.STACS.2022.36

2021

Scholarly publications

Mannens, I., Nederlof, J., Swennenhuis, C., & Szilágyi, K. (2021). On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. In L. Kowalik, M. Pilipczuk, & P. Rzazewski (Eds.), Graph-Theoretic Concepts in Computer Science: 47th International Workshop, WG 2021 Warsaw, Poland, June 23–25, 2021 Revised Selected Papers (pp. 52-79). (Lecture Notes in Computer Science; Vol. 12911). Springer Cham. https://doi.org/10.1007/978-3-030-86838-3_5
https://dspace.library.uu.nl/bitstream/handle/1874/415076/2106.11689v2.pdf?sequence=1

https://orcid.org/0000-0003-2295-0827