On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. - Isja Mannens; Jesper Nederlof; Céline M. F. Swennenhuis; Krisztina Szilágyi (WG, 2021)

Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. - Carla Groenland; Isja Mannens; Jesper Nederlof; Krisztina Szilágyi (STACS, 2022)

A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth. - Isja Mannens; Jesper Nederlof (ESA, 2023)

The Parameterised Complexity Of Integer Multicommodity Flow. - Hans L. Bodlaender; Isja Mannens; Jelle J. Oostveen; Sukanya Pandey; Erik Jan van Leeuwen (IPEC, 2023)

Reconstructing Graphs from Connected Triples. - Paul Bastide 002; Linda Cook; Jeff Erickson 001; Carla Groenland; Marc J. van Kreveld; Isja Mannens; Jordi L. Vermeulen (WG, 2023)

Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters. - Carla Groenland; Isja Mannens; Jesper Nederlof; Marta Piecyk; Pawel Rzazewski (CoRR, 2023)

Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters. - Carla Groenland; Isja Mannens; Jesper Nederlof; Marta Piecyk; Pawel Rzazewski (ICALP, 2024)

Parameterized Graph Problems: Counting, the Tutte Polynomial and Logarithmic Space. - Isja Mannens (2024)