The following pages link to (Q4385531):
Displaying 50 items.
- Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- An asymptotic analysis of labeled and unlabeled \(k\)-trees (Q308942) (← links)
- Complexity of metric dimension on planar graphs (Q314819) (← links)
- Courcelle's theorem for triangulations (Q346450) (← links)
- Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- The complexity of finding uniform sparsest cuts in various graph classes (Q450559) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- Monadic second-order model-checking on decomposable matroids (Q548278) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Equivariant unification (Q616849) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- Complexity of semi-stable and stage semantics in argumentation frameworks (Q656597) (← links)
- Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
- Automorphism groups of context-free graphs (Q671518) (← links)
- Modularity in noncopying term rewriting (Q673186) (← links)
- Recognising \(k\)-connected hypergraphs in cubic time (Q685463) (← links)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- The parameterized complexity of \(k\)-edge induced subgraphs (Q729817) (← links)
- Recursive queries and context-free graph grammars (Q753477) (← links)
- Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
- Complexity of abstract argumentation under a claim-centric view (Q785236) (← links)
- The monadic second-order logic of graphs. IV: Definability properties of equational graphs (Q807611) (← links)
- Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs (Q831858) (← links)
- Quickly deciding minor-closed parameters in general graphs (Q854832) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- On the fixed-parameter tractability of parameterized model-checking problems (Q963328) (← links)
- Chordal deletion is fixed-parameter tractable (Q973007) (← links)
- Inessential features, ineliminable features, and modal logics for model theoretic syntax (Q1006492) (← links)
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
- The monadic second-order logic of graphs. VII: Graphs as relational structures (Q1193407) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Nondeterministic operations on finite relational structures (Q1276248) (← links)
- Context-free event domains are recognizable (Q1286370) (← links)
- Combinatorial games under auction play (Q1294037) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
- The translation power of top-down tree-to-graph transducers (Q1337465) (← links)
- Probabilistic hyperedge replacement grammars (Q1351216) (← links)
- Logical description of context-free graph languages (Q1384534) (← links)
- On the transition graphs of Turing machines. (Q1401268) (← links)
- Series-parallel languages and the bounded-width property (Q1566734) (← links)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars (Q1582010) (← links)
