Pages that link to "Item:Q309797"
From MaRDI portal
The following pages link to Graph isomorphism parameterized by elimination distance to bounded degree (Q309797):
Displaying 8 items.
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- Elimination Distance to Bounded Degree on Planar Graphs (Q5089238) (← links)
- On the Parameterized Complexity of Clique Elimination Distance (Q6068235) (← links)
- SAT backdoors: depth beats size (Q6152185) (← links)
- CSP beyond tractable constraint languages (Q6154179) (← links)
