Pages that link to "Item:Q4575659"
From MaRDI portal
The following pages link to Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems (Q4575659):
Displaying 8 items.
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
- Algorithms for automatic ranking of participants and tasks in an anonymized contest (Q2272379) (← links)
- Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel (Q2672433) (← links)
- (Q4987442) (redirect page) (← links)
- (Q5126619) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
