Recommendations
- scientific article; zbMATH DE number 4081531
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- scientific article; zbMATH DE number 4060712
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- A Practical Approach to Courcelle's Theorem
Cited in
(only showing first 100 items - show all)- Two strikes against perfect phylogeny
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
- Kernel bounds for path and cycle problems
- Complexity of the Packing Coloring Problem for Trees
- Grouped domination parameterized by vertex cover, twin cover, and beyond
- Polynomial kernels for hitting forbidden minors under structural parameterizations
- Trees, grids, and MSO decidability: from graphs to matroids
- Compactors for parameterized counting problems
- Minimum eccentricity shortest path problem with respect to structural parameters
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- The monadic second-order logic of graphs. VII: Graphs as relational structures
- Counting kernels in directed graphs with arbitrary orientations
- A polynomial-time algorithm for finding total colorings of partial \(k\)-trees
- FPT approximation using treewidth: capacitated vertex cover, target set selection and vector dominating set
- How to use the minimal separators of a graph for its chordal triangulation
- Efficient sets in partial k-trees
- Guard games on graphs: keep the intruder out!
- Upper bounds on the size of obstructions and intertwines
- An algorithmic metatheorem for directed treewidth
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability
- Contraction bidimensionality of geometric intersection graphs
- A Retrospective on (Meta) Kernelization
- scientific article; zbMATH DE number 219229 (Why is no real title available?)
- I/O-efficient algorithms for graphs of bounded treewidth
- Are there any good digraph width measures?
- Optimization and Recognition for K 5-minor Free Graphs in Linear Time
- Decomposability helps for deciding logics of knowledge and belief
- On graphs coverable by \({k}\) shortest paths
- Tree decomposition and discrete optimization problems: a survey
- Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs
- The complexity of two graph orientation problems
- Bisimplicial separators
- Affine optimal k-proper connected edge colorings
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- Minimum dominating set of queens: a trivial programming exercise?
- Combinatorial and computational aspects of graph packing and graph decomposition
- Model checking disjoint-paths logic on topological-minor-free graph classes
- Rank-decreasing transductions
- Orientable burning number of graphs
- scientific article; zbMATH DE number 4081531 (Why is no real title available?)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- scientific article; zbMATH DE number 7204413 (Why is no real title available?)
- A parallel algorithm for edge-coloring partial k-trees
- Treewidth versus clique number. II: Tree-independence number
- Algorithmic uses of the Feferman-Vaught theorem
- The monadic second-order logic of graphs. XII: Planar graphs and planar maps
- Courcelle's theorem -- a game-theoretic approach
- \(k\)-NLC graphs and polynomial algorithms
- Complexity of path-forming games
- Parameterized Complexity of Firefighting Revisited
- Decomposition width of matroids
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
- Linkless and flat embeddings in 3-space
- Shelah-Stupp's and Muchnik's iterations revisited
- Orientable burning number of graphs
- A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs
- Approximability of partitioning graphs with supply and demand
- Parameterized Complexity of $$(A,\ell )$$-Path Packing
- A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs
- Monadic second-order model-checking on decomposable matroids
- Safe separators for treewidth
- Finite automata as characterizations of minor closed tree families (extended abstract)
- scientific article; zbMATH DE number 5917571 (Why is no real title available?)
- On the feedback vertex set polytope of a series-parallel graph
- A sufficiently fast algorithm for finding close to optimal clique trees
- Characterizations and algorithmic applications of chordal graph embeddings
- Are there any good digraph width measures?
- Basic notions of universal algebra for language theory and graph grammars
- Graph minors and parameterized algorithm design
- Tree-width and the monadic quantifier hierarchy.
- Compound logics for modification problems
- A combinatorial optimization algorithm for solving the branchwidth problem
- A survey of selected recent results on total domination in graphs
- Complexity of the multilevel critical node problem
- Computing Hamiltonian paths with partial order restrictions
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
- The complexity of finding small separators in temporal graphs
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth
- Algorithms for finding distance-edge-colorings of graphs
- Fast FPT-approximation of branchwidth
- A coloring problem for weighted graphs
- Approximation algorithms for treewidth
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
- Safe sets in graphs: graph classes and structural parameters
- Algorithms for recognition of regular properties and decomposition of recursive graph families
- Branch decomposition heuristics for linear matroids
- Counting problems in parameterized complexity
- Algorithm to find a maximum 2-packing set in a cactus
- Safe sets in graphs: graph classes and structural parameters
- The edge-disjoint paths problem is NP-complete for series-parallel graphs
- Data-compression for parametrized counting problems on sparse graphs
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs
- A branch-and-price-and-cut method for computing an optimal bramble
- Complexity of minimum irreducible infeasible subsystem covers for flow networks
- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks
This page was built for publication: Easy problems for tree-decomposable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3361904)
