Pages that link to "Item:Q2816059"
From MaRDI portal
The following pages link to The algorithmic theory of treewidth (Q2816059):
Displaying 11 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- Special issue: Treewidth (Q1578399) (← links)
- Structurally parameterized \(d\)-scattered set (Q2064293) (← links)
- Parameterized orientable deletion (Q2182093) (← links)
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center (Q2422740) (← links)
- On treewidth approximations (Q2816043) (← links)
- On exact algorithms for treewidth (Q2933641) (← links)
- (Q4407447) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- A note on trees, tables, and algorithms (Q5191139) (← links)
- Treewidth: Structure and Algorithms (Q5425956) (← links)