scientific article; zbMATH DE number 1142315

Cited in

(only showing first 100 items - show all)

Inessential features, ineliminable features, and modal logics for model theoretic syntax
The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
The monadic second-order logic of graphs. VII: Graphs as relational structures
A partial k-arboretum of graphs with bounded treewidth
Nondeterministic operations on finite relational structures
Context-free event domains are recognizable
Combinatorial games under auction play
Monadic second-order definable graph transductions: a survey
The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
The translation power of top-down tree-to-graph transducers
Probabilistic hyperedge replacement grammars
Logical description of context-free graph languages
On the transition graphs of Turing machines.
Series-parallel languages and the bounded-width property
A comparison of tree transductions defined by monadic second order logic and by attribute grammars
\(L(A)=L(B)\)? decidability results from complete formal systems
A unified language processing methodology
Query automata over finite trees
A gentle introduction to applications of algorithmic metatheorems for space and circuit classes
Querying linguistic treebanks with monadic second-order logic in linear time
Families of automata characterizing context-sensitive languages
Parameterized complexity of length-bounded cuts and multicuts
On \textsf{NC} algorithms for problems on bounded rank-width graphs
Infinite hypergraphs. I: Basic properties
The monadic second-order logic of graphs. VIII: Orientations
On infinite transition graphs having a decidable monadic theory
Uniform and nonuniform recognizability.
Counting modulo quantifiers on finite structures
An operational and denotational approach to non-context-freeness
The complexity of first-order and monadic second-order logic revisited
Computing crossing numbers in quadratic time
Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
On the rational subsets of the free group
The complexity of approximating bounded-degree Boolean \(\#\)CSP
Proper interval vertex deletion
Model checking the full modal mu-calculus for infinite sequential processes
On the approximate compressibility of connected vertex cover
Parameterized analysis and crossing minimization problems
Reversibility of computations in graph-walking automata
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor
Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value
Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth
A multiparametric view on answer set programming
Structural tractability of enumerating CSP solutions
Handle-rewriting hypergraph grammars
A logical approach to multicut problems
Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability
Drags: a compositional algebraic framework for graph rewriting
Grad and classes with bounded expansion. I: Decompositions
Grad and classes with bounded expansion. II: Algorithmic aspects
Obtaining a planar graph by vertex deletion
Fixpoint logics over hierarchical structures
Tractable cases of the extended global cardinality constraint
Graph transformation for incremental natural language analysis
Tree decomposition and discrete optimization problems: a survey
Improved bottleneck domination algorithms
Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits
Structural tractability of counting of solutions to conjunctive queries
Tractability in constraint satisfaction problems: a survey
Strong Backdoors for Default Logic
Faster computation of path-width
A slice theoretic approach for embedding problems on digraphs
The synchronized graphs trace the context-sensitive languages
Modeling and verifying graph transformations in proof assistants
Backdoors to satisfaction
Deterministic Algorithms for the Independent Feedback Vertex Set Problem
The complexity status of problems related to sparsest cuts
On the Boolean-width of a graph: structure and applications
Proper Interval Vertex Deletion
On making a distinguished vertex minimum degree by vertex deletion
An asymptotic analysis of labeled and unlabeled k-trees
Digraphs of bounded width
Complexity of metric dimension on planar graphs
Property testing for bounded degree databases
Towards the graph minor theorems for directed graphs
Courcelle's theorem for triangulations
Obtaining a Planar Graph by Vertex Deletion
From Tree-Based Generators to Delegation Networks
Resolution-Like Theorem Proving for High-Level Conditions
Monadic Second Order Logic on Graphs with Local Cardinality Constraints
Encoding Treewidth into SAT
On the Parameterised Intractability of Monadic Second-Order Logic
The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
Complexity of finding maximum regular induced subgraphs with prescribed degree
Courcelle's theorem -- a game-theoretic approach
The complexity of two graph orientation problems
Model-checking hierarchical structures
Linkless and flat embeddings in 3-space
Recognizable sets of graphs: equivalent definitions and closure properties
The complexity of finding uniform sparsest cuts in various graph classes
Dynamic algorithms for graphs of bounded treewidth
Model checking the full modal mu-calculus for infinite sequential processes
Strategic port graph rewriting: an interactive modelling framework
On the interleaving semantics of transformation units -- a step into GRACE
Graph automata for linear graph languages
Concatenation of graphs
Polypodic codes
scientific article; zbMATH DE number 809155 (Why is no real title available?)
Monadic Second-Order Logic and Transitive Closure Logics over Trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385531)