Treewidth computation and extremal combinatorics

This publication has 33 references indexed in Scilit:

• Trimmed Moebius Inversion and Graphs of Bounded Degree
  Theory of Computing Systems, 2009
• The Travelling Salesman Problem in Bounded Degree Graphs
  2008
• Combinatorial Optimization on Graphs of Bounded Treewidth
  The Computer Journal, 2007
• Treewidth and Minimum Fill-in: Grouping the Minimal Separators
  SIAM Journal on Computing, 2001
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
  International Journal of Foundations of Computer Science, 2000
• A partial k-arboretum of graphs with bounded treewidth
  Theoretical Computer Science, 1998
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
  SIAM Journal on Computing, 1996
• Complexity of Finding Embeddings in a k-Tree
  SIAM Journal on Algebraic Discrete Methods, 1987
• On the Desirability of Acyclic Database Schemes
  Journal of the ACM, 1983
• On generalized graphs
  Acta Mathematica Hungarica, 1965