Cited in
(79)- Chordal networks of polynomial ideals
- Learning tractable Bayesian networks in the space of elimination orders
- Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
- Turbocharging treewidth heuristics
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Customizable contraction hierarchies
- On the vertex cover \(P_3\) problem parameterized by treewidth
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Treewidth computations. II. Lower bounds
- Courcelle's theorem -- a game-theoretic approach
- A local search algorithm for branchwidth
- Branch decomposition heuristics for linear matroids
- On the Boolean-width of a graph: structure and applications
- Finding good decompositions for dynamic programming on dense graphs
- Treewidth distance on phylogenetic trees
- Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness
- Reduction rules for the maximum parsimony distance on phylogenetic trees
- Boolean-width of graphs
- Complexity of secure sets
- Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth
- Computing treewidth on the GPU
- GeoSteiner
- ToulBar2
- Dhrystone
- Treewidthlib
- D-FLAT
- SPRSupertrees
- BGL
- ToTo
- mplp2
- Dungine
- Rudy
- INDDGO
- NetDiversity
- BZTreewidth
- Datalog LITE
- LibTW
- PhaseCut
- YIELDS
- GPGPU-Treewidth
- tcp_package
- SMHasher
- tw-heuristic
- ChordalGraph
- SparseJSR
- Treewidth computations. I: Upper bounds
- tutte_bhkk
- Adiabatic quantum programming: minor embedding with hard faults
- From tree-decompositions to clique-width terms
- Systematic and deterministic graph minor embedding for Cartesian products of graphs
- A combinatorial Li-Yau inequality and rational points on curves
- The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing
- On quasi-planar graphs: clique-width and logical description
- The tree-width of C
- Exploiting sparsity for the min \(k\)-partition problem
- Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs
- Variable neighborhood search for graphical model energy minimization
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- Treewidth of display graphs: bounds, brambles and applications
- On low treewidth graphs and supertrees
- Treewidth versus clique number. I: Graph classes with a forbidden structure
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
- QRATPre+
- Exploiting term sparsity in noncommutative polynomial optimization
- Exploiting sparsity in complex polynomial optimization
- Evaluating Datalog via tree automata and cycluits
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- Tree decompositions and social graphs
- Graphs of gonality three
- Recognizing hyperelliptic graphs in polynomial time
- Minimum size tree-decompositions
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions
- A sequential reduction method for inference in generalized linear mixed models
- Phylogenetic incongruence through the lens of monadic second order logic
- Algorithms and complexity for Turaev-Viro invariants
- Algorithms and complexity for Turaev-Viro invariants
- Fixed-parameter tractability of treewidth and pathwidth
- Methods for solving reasoning problems in abstract argumentation -- a survey
- On making a distinguished vertex of minimum degree by vertex deletion
This page was built for software: ComputeTW
