Isja Mannens

According to our database, Isja Mannens authored at least 8 papers between 2021 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Parameterized Graph Problems: Counting, the Tutte Polynomial and Logarithmic Space.

Isja Mannens

PhD thesis, 2024

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

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

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

Reconstructing Graphs from Connected Triples.

Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc J. van Kreveld, Isja Mannens, Jordi L. Vermeulen

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

The Parameterised Complexity Of Integer Multicommodity Flow.

Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth.

Isja Mannens, Jesper Nederlof

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth.

Carla Groenland, Isja Mannens, Jesper Nederlof, Krisztina Szilágyi

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021

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

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021