Pages that link to "Item:Q5072610"
From MaRDI portal
The following pages link to Parameterized Complexity of Elimination Distance to First-Order Logic Properties (Q5072610):
Displaying 6 items.
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- On the parameterized complexity of graph modification to first-order logic properties (Q2300624) (← links)
- Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
- CSP beyond tractable constraint languages (Q6154179) (← links)
- Elimination distance to bounded degree on planar graphs preprint (Q6593702) (← links)
- Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)