Pages that link to "Item:Q6068235"
From MaRDI portal
The following pages link to On the Parameterized Complexity of Clique Elimination Distance (Q6068235):
Displaying 7 items.
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- Block elimination distance (Q5918777) (← links)
- Block elimination distance (Q5925550) (← links)
- Backdoor DNFs (Q6564620) (← links)
- Elimination distance to bounded degree on planar graphs preprint (Q6593702) (← links)
- Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
