Pages that link to "Item:Q3521920"
From MaRDI portal
The following pages link to Treewidth Computation and Extremal Combinatorics (Q3521920):
Displaying 9 items.
- Computing hypergraph width measures exactly (Q437685) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- On the complexity of computing treelength (Q972342) (← links)
- Treewidth computation and extremal combinatorics (Q2392037) (← links)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)
- (Q5743514) (← links)
