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 14 items.
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- 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)
- Exploring the subexponential complexity of completion problems (Q2828210) (← 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)
- Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds (Q4575794) (← links)
- (Q4987442) (redirect page) (← links)
- On the minimum chordal completion polytope (Q5126619) (← links)
- Subexponential Parameterized Algorithm for Minimum Fill-In (Q5408764) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
