Cited in
(16)- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Treewidth computations. II. Lower bounds
- Encoding Treewidth into SAT
- Treewidth lower bounds with brambles
- On the maximum cardinality search lower bound for treewidth
- Finding good decompositions for dynamic programming on dense graphs
- A SAT approach to branchwidth
- Autowrite
- GeoSteiner
- ComputeTW
- Treewidth computations. I: Upper bounds
- A cubic kernel for feedback vertex set and loop cutset
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- Graph-based knowledge representation. Computational foundations of conceptual graphs
- Speeding up dynamic programming with representative sets. An experimental evaluation of algorithms for Steiner Tree on tree decompositions
This page was built for software: Treewidthlib
