Pages that link to "Item:Q2408199"
From MaRDI portal
The following pages link to Fixed-parameter tractable distances to sparse graph classes (Q2408199):
Displaying 19 items.
- Obstructions for partitioning into forests and outerplanar graphs (Q831856) (← links)
- Graph extensions, edit number and regular graphs (Q1732121) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Discrete density comonads and graph parameters (Q2104475) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- Approximating the distance to properties in bounded-degree and general sparse graphs (Q4962788) (← links)
- Recovering sparse graphs (Q5005129) (← links)
- A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs (Q5071096) (← links)
- Parameterized Complexity of Elimination Distance to First-Order Logic Properties (Q5072610) (← links)
- Elimination Distance to Bounded Degree on Planar Graphs (Q5089238) (← links)
- (Q5363778) (← links)
- Block elimination distance (Q5918777) (← links)
- Block elimination distance (Q5925550) (← links)
- On the Parameterized Complexity of Clique Elimination Distance (Q6068235) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← 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)
