Pages that link to "Item:Q2304536"
From MaRDI portal
The following pages link to Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536):
Displaying 4 items.
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- On subgraph complementation to \(H\)-free Graphs (Q2088585) (← links)
- Sums of Squares and Sparse Semidefinite Programming (Q5157588) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
