MSO definable string transductions and two-way finite-state transducers
ACM Transactions on Computational Logic (TOCL)
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The evaluation of first-order substitution is monadic second-order compatible
Theoretical Computer Science
An operational and denotational approach to non-context-freeness
Theoretical Computer Science - Algebraic methods in language processing
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Axiomatising Tree-Interpretable Structures
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Farrell polynomials on graphs of bounded tree width
Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
Normal forms for context-free node-rewriting hypergraph grammars
Mathematical Structures in Computer Science
Fusion in relational structures and the verification of monadic second-order properties
Mathematical Structures in Computer Science
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Recognizability, hypergraph operations, and logical types
Information and Computation
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Graph operations characterizing rank-width
Discrete Applied Mathematics
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Recognizability, hypergraph operations, and logical types
Information and Computation
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |