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 13 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)
- Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel (Q5048303) (← links)
- A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs (Q5071096) (← links)
- Elimination Distance to Bounded Degree on Planar Graphs (Q5089238) (← links)
- Elimination Distances, Blocking Sets, and Kernels for Vertex Cover (Q5099101) (← links)
- Block elimination distance (Q5918777) (← links)
- Block elimination distance (Q5925550) (← 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)
