Pages that link to "Item:Q1186787"
From MaRDI portal
The following pages link to Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families (Q1186787):
Displaying 50 items.
- Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Optimization problems in dotted interval graphs (Q400519) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- Safe separators for treewidth (Q819825) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866) (← links)
- The complexity of power indexes with graph restricted coalitions (Q898757) (← links)
- On minimum dominating sets with minimum intersection (Q1174139) (← links)
- Algorithms for recognition of regular properties and decomposition of recursive graph families (Q1179734) (← links)
- Complexity of path-forming games (Q1210546) (← links)
- All structured programs have small tree width and good register allocation (Q1271620) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Tree polytope on 2-trees (Q1322553) (← links)
- A graph approximation heuristic for the vertex cover problem on planar graphs (Q1328583) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- A recurrence template for several parameters in series-parallel graphs (Q1336624) (← links)
- Regularity and locality in \(k\)-terminal graphs (Q1336630) (← links)
- On Halin subgraphs and supergraphs (Q1343152) (← links)
- On interval routing schemes and treewidth (Q1383155) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- On minimum cuts and the linear arrangement problem (Q1570828) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs (Q1731506) (← links)
- Explicit linear kernels for packing problems (Q1739112) (← links)
- A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
- A short cut to optimal sequences (Q1758658) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Reduction algorithms for graphs of small treewidth (Q1854433) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- A meta-theorem for distributed certification (Q2097341) (← links)
- Star colouring of bounded degree graphs and regular graphs (Q2124639) (← links)
- A general framework for path convexities (Q2156285) (← links)
- The complexity of restricted star colouring (Q2161257) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth (Q2314068) (← links)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
- Tree-edges deletion problems with bounded diameter obstruction sets (Q2370427) (← links)
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
- Branch decomposition heuristics for linear matroids (Q2445840) (← links)
- Algorithms for finding distance-edge-colorings of graphs (Q2457301) (← links)
