Pages that link to "Item:Q5408612"
From MaRDI portal
The following pages link to Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q5408612):
Displaying 11 items.
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- Meta-kernelization using well-structured modulators (Q2413976) (← links)
- FPT is characterized by useful obstruction sets (Q2828222) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- (Q5009475) (← links)
- Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. (Q5092404) (← links)
- The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
