ComputeTW

swMATH11360MaRDI QIDQ23306FDOQ23306

Author name not available (Why is that?)

Cited In (53)

• Learning tractable Bayesian networks in the space of elimination orders
• Turbocharging treewidth heuristics
• Towards fixed-parameter tractable algorithms for abstract argumentation
• 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
• Algorithms and Complexity for Turaev-Viro Invariants
• Courcelle's theorem -- a game-theoretic approach
• Fixed-Parameter Tractability of Treewidth and Pathwidth
• Branch decomposition heuristics for linear matroids
• Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure
• Treewidth distance on phylogenetic trees
• Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth
• 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
• A Local Search Algorithm for Branchwidth
• Treewidth computations. I: Upper bounds
• Adiabatic quantum programming: minor embedding with hard faults
• From tree-decompositions to clique-width terms
• Finding Good Decompositions for Dynamic Programming on Dense Graphs
• On the Boolean-Width of a Graph: Structure and Applications
• Systematic and deterministic graph minor embedding for Cartesian products of graphs
• Chordal Networks of Polynomial Ideals
• A combinatorial Li-Yau inequality and rational points on curves
• Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs
• 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
• Variable neighborhood search for graphical model energy minimization
• Treewidth of display graphs: bounds, brambles and applications
• Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization
• Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
• Customizable Contraction Hierarchies
• Exploiting term sparsity in noncommutative polynomial optimization
• As Time Goes By: Reflections on Treewidth for Temporal Graphs
• Exploiting sparsity in complex polynomial optimization
• Evaluating Datalog via tree automata and cycluits
• Tree decompositions and social graphs
• Graphs of gonality three
• Recognizing hyperelliptic graphs in polynomial time
• Minimum size tree-decompositions
• Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness
• \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
• Methods for solving reasoning problems in abstract argumentation -- a survey
• On Low Treewidth Graphs and Supertrees
• On making a distinguished vertex of minimum degree by vertex deletion

This page was built for software: ComputeTW