Pages that link to "Item:Q3361904"
From MaRDI portal
The following pages link to Easy problems for tree-decomposable graphs (Q3361904):
Displaying 50 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs (Q284833) (← links)
- A coloring problem for weighted graphs (Q286971) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- Reduction rules for the maximum parsimony distance on phylogenetic trees (Q306268) (← links)
- Courcelle's theorem for triangulations (Q346450) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- Decomposition width of matroids (Q415290) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- A combinatorial optimization algorithm for solving the branchwidth problem (Q429498) (← links)
- Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
- On the directed full degree spanning tree problem (Q456701) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Cycle-maximal triangle-free graphs (Q472981) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- Algorithms for decision problems in argument systems under preferred semantics (Q490457) (← links)
- Parameterized complexity of critical node cuts (Q517024) (← links)
- Monadic second-order model-checking on decomposable matroids (Q548278) (← links)
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Splitting trees at vertices (Q616363) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- Efficient sets in partial \(k\)-trees (Q686252) (← links)
- A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs (Q705040) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
- Complexity of abstract argumentation under a claim-centric view (Q785236) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Safe separators for treewidth (Q819825) (← links)
- Compatibility of unrooted phylogenetic trees is FPT (Q820142) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- Compactors for parameterized counting problems (Q826317) (← links)
- Contraction bidimensionality of geometric intersection graphs (Q832527) (← links)
- On the feedback vertex set polytope of a series-parallel graph (Q834183) (← links)
