scientific article; zbMATH DE number 3917707
From MaRDI portal
Publication:3692864
Recommendations
Cited in
(49)- On tree-partition-width
- Grids and their minors
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- On minimum dominating sets with minimum intersection
- A regular characterization of graph languages definable in monadic second-order logic
- A partial k-arboretum of graphs with bounded treewidth
- Regularity and locality in \(k\)-terminal graphs
- Serial and parallel algorithms for \((k,2)\)-partite graphs
- A blossoming algorithm for tree volumes of composite digraphs
- Polynomial time algorithms for variants of graph matching on partial k-trees
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- On tree-partitions of graphs
- Minors in graphs of large _r-girth
- Packing and covering immersion-expansions of planar sub-cubic graphs
- Recent techniques and results on the Erdős-Pósa property
- Vertex-minor reductions can simulate edge contractions
- Packing and covering immersion models of planar subcubic graphs
- scientific article; zbMATH DE number 4174333 (Why is no real title available?)
- scientific article; zbMATH DE number 3878376 (Why is no real title available?)
- Parameterized algorithms for non-separating trees and branchings in digraphs
- The parameterised complexity of list problems on graphs of bounded treewidth
- scientific article; zbMATH DE number 3968629 (Why is no real title available?)
- On the model-checking of monadic second-order formulas with edge set quantifications
- scientific article; zbMATH DE number 640293 (Why is no real title available?)
- The complexity of short schedules for uet bipartite graphs
- Constructivity issues in graph algorithms
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- On the queue-number of graphs with bounded tree-width
- On the Parameterized Complexity for Token Jumping on Graphs
- Subtraction-free complexity, cluster transformations, and spanning trees
- Problems hard for treewidth but easy for stable gonality
- Domino treewidth
- Product structure of graph classes with bounded treewidth
- Tree-partitions with bounded degree trees
- Product structure of graph classes with bounded treewidth
- Witnessing subsystems for probabilistic systems with low tree width
- Twin-width of graphs with tree-structured decompositions
- A new width parameter of graphs based on edge cuts: -edge-crossing width
- Product structure of graph classes with strongly sublinear separators
- Twin-width of graphs with tree-structured decompositions
- The parameterised complexity of integer multicommodity flow
- On the parameterized complexity of computing tree-partitions
- List colouring trees in logarithmic space
- On the parameterized complexity of computing tree-partitions
- Logical aspects of Cayley-graphs: the group case
- An overview of universal obstructions for graph parameters
- The structure of the models of decidable monadic theories of graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3692864)
