Pages that link to "Item:Q6158862"
From MaRDI portal
The following pages link to A survey of parameterized algorithms and the complexity of edge modification (Q6158862):
Displaying 10 items.
- On the Wimer method for designing edge-based algorithms (Q1011875) (← links)
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy (Q2071824) (← links)
- Building large \(k\)-cores from sparse graphs (Q2678255) (← links)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
- Parameterized Complexity of Edge Interdiction Problems (Q2920456) (← links)
- On the \(d\)-claw vertex deletion problem (Q6182678) (← links)
- A quasi-quadratic vertex-kernel for cograph edge editing (Q6611028) (← links)
- Modification problems toward proper (Helly) circular-arc graphs (Q6647753) (← links)
- Trimming forests is hard (unless they are made of stars) (Q6654119) (← links)
- Algorithms for subgraph complementation to some classes of graphs (Q6663515) (← links)