Pages that link to "Item:Q2828210"
From MaRDI portal
The following pages link to Exploring the subexponential complexity of completion problems (Q2828210):
Displaying 15 items.
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- On the threshold of intractability (Q2051847) (← links)
- Diameter estimates for graph associahedra (Q2093260) (← links)
- (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
- Exploring subexponential parameterized complexity of completion problems (Q2965491) (← links)
- Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems (Q4575659) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- (Q5028484) (← links)
- Dichotomy Results on the Hardness of $H$-free Edge Modification Problems (Q5346539) (← links)
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)