Pages that link to "Item:Q5928867"
From MaRDI portal
The following pages link to On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867):
Displayed 50 items.
- Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
- Courcelle's theorem for triangulations (Q346450) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
- Complexity and approximability of the cover polynomial (Q445242) (← links)
- Efficient computation of the characteristic polynomial of a tree and related tasks (Q528854) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- On the expressive power of CNF formulas of bounded tree- and clique-width (Q617890) (← links)
- Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
- The enumeration of vertex induced subgraphs with respect to the number of components (Q648958) (← links)
- Complexity of abstract argumentation under a claim-centric view (Q785236) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- Combinatorics of TCP reordering (Q857780) (← links)
- An efficient tree decomposition method for permanents and mixed discriminants (Q905704) (← links)
- Algorithmic aspects of switch cographs (Q906430) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth (Q987381) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Farrell polynomials on graphs of bounded tree width (Q1398293) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- Query efficient implementation of graphs of bounded clique-width (Q1408820) (← links)
- Clique-width of countable graphs: A compactness property. (Q1422417) (← links)
- The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings (Q1575704) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width (Q1764811) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- The monadic second-order logic of graphs. XIV: Uniformly sparse graphs and edge set quantifica\-tions. (Q1874383) (← links)
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width. (Q1874418) (← links)
- The parametrized complexity of knot polynomials (Q1877705) (← links)
- The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171) (← links)
- Spanning tree constrained determinantal point processes are hard to (approximately) evaluate (Q2060533) (← links)
- Efficient computation of permanents, with applications to boson sampling and random matrices (Q2133747) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- An extended tree-width notion for directed graphs related to the computation of permanents (Q2254501) (← links)
- Algorithms for propositional model counting (Q2266937) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- A logician's view of graph polynomials (Q2273013) (← links)
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← links)
- Solving \#SAT using vertex covers (Q2464035) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
- Parameterized counting problems (Q2576944) (← links)
- The relative clique-width of a graph (Q2642017) (← links)
- Semantic Equivalence of Graph Polynomials Definable in Second Order Logic (Q2820700) (← links)
- The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results (Q2827810) (← links)
- Integrating and Sampling Cuts in Bounded Treewidth Graphs (Q2833051) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)