Pages that link to "Item:Q4973874"
From MaRDI portal
The following pages link to Tight Running Time Lower Bounds for Vertex Deletion Problems (Q4973874):
Displaying 7 items.
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- Fine-grained complexity of rainbow coloring and its variants (Q2051859) (← links)
- Destroying Bicolored $P_3$s by Deleting Few Edges (Q5038193) (← links)
- (Q5075776) (← links)
- Fine-Grained Complexity of Rainbow Coloring and its Variants. (Q5111276) (← links)
- Dichotomy Results on the Hardness of $H$-free Edge Modification Problems (Q5346539) (← links)
- Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs (Q6489319) (← links)
