Isja Mannens

Publication Activity (10 Years)

Years Active: 2021-2024
Publications (10 Years): 12

Top Topics

Parameterized Complexity

Jacobian Matrix

Top Venues

Publications

Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters. ICALP (2024)
Isja Mannens, Jesper Nederlof
A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth. CoRR (2023)
Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc J. van Kreveld, Isja Mannens, Jordi L. Vermeulen
Reconstructing Graphs from Connected Triples. CoRR (2023)
Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen
The Parameterised Complexity Of Integer Multicommodity Flow. IPEC (2023)
Isja Mannens, Jesper Nederlof
A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth. ESA (2023)
Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters. CoRR (2023)
Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen
The Parameterised Complexity of Integer Multicommodity Flow. CoRR (2023)
Paul Bastide, Linda Cook, Jeff Erickson, Carla Groenland, Marc J. van Kreveld, Isja Mannens, Jordi L. Vermeulen
Reconstructing Graphs from Connected Triples. WG (2023)
Carla Groenland, Isja Mannens, Jesper Nederlof, Krisztina Szilágyi
Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. STACS (2022)
Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis, Krisztina Szilágyi
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. CoRR (2021)
Carla Groenland, Jesper Nederlof, Isja Mannens, Krisztina Szilágyi
Tight bounds for counting colorings and connected edge sets parameterized by cutwidth. CoRR (2021)
Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis, Krisztina Szilágyi
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. WG (2021)