Funder
European Research Council
NWO
Reference53 articles.
1. Losing weight by gaining edges;Abboud,2014
2. Linear time algorithms for NP-hard problems restricted to partial k-trees;Arnborg;Discrete Appl. Math.,1989
3. Computational Complexity: A Modern Approach;Arora,2007
4. On the hardness of generalized domination problems parameterized by mim-width;Bakkane,2022
5. The complexity of finding uniform emulations on paths and ring networks;Bodlaender;Inf. Comput.,1990