Isja Mannens

Orcid: 0000-0003-2295-0827

According to our database1, Isja Mannens authored at least 6 papers between 2021 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters.
CoRR, 2023

Reconstructing Graphs from Connected Triples.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

The Parameterised Complexity Of Integer Multicommodity Flow.
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.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth.
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.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021


  Loading...