MSO definable string transductions and two-way finite-state transducers
ACM Transactions on Computational Logic (TOCL)
Computing crossing numbers in quadratic time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The evaluation of first-order substitution is monadic second-order compatible
Theoretical Computer Science
Counting H-colorings of partial k-trees
Theoretical Computer Science
Uniform and nonuniform recognizability
Theoretical Computer Science
An operational and denotational approach to non-context-freeness
Theoretical Computer Science - Algebraic methods in language processing
Automatic Graphs and Graph D0L-Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Two-Way Finite State Transducers and Monadic Second-Order Logic
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Spatial Logic for Querying Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Approximating the Behaviour of Graph Transformation Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
Theoretical Computer Science
Tree-width and the monadic quantifier hierarchy
Theoretical Computer Science - Logic and complexity in computer science
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Automatic graphs and D0L-sequences of finite graphs
Journal of Computer and System Sciences
The parametrized complexity of knot polynomials
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Fusion in relational structures and the verification of monadic second-order properties
Mathematical Structures in Computer Science
Computing crossing numbers in quadratic time
Journal of Computer and System Sciences - STOC 2001
Signaling-pathway-based molecular computing for efficient 3-SAT problem solving
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: FEA 2002
On the logical definability of centrain graph and poset languages
Journal of Automata, Languages and Combinatorics
Algebraic recognizability of regular tree languages
Theoretical Computer Science - The art of theory
Closure properties of linear context-free tree languages with an application to optimality theory
Theoretical Computer Science - Algebraic methods in language processing
Trees, grids, and MSO decidability: from graphs to matroids
Theoretical Computer Science - Parameterized and exact computation
Recognizability, hypergraph operations, and logical types
Information and Computation
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
Approximating clique-width and branch-width
Journal of Combinatorial Theory Series B
Finite graph automata for linear and boundary graph languages
Theoretical Computer Science
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Journal of Combinatorial Theory Series B
Expressiveness and complexity of graph logic
Information and Computation
A graph grammars based framework for querying graph-like data
Data & Knowledge Engineering - Special issue: ER 2003
The equivalence problem for deterministic MSO tree transducers is decidable
Information Processing Letters
Inverse monoids: Decidability and complexity of algebraic questions
Information and Computation
Vertex-minor reductions can simulate edge contractions
Discrete Applied Mathematics
Graph rewriting for the π-calculus
Mathematical Structures in Computer Science
Finitary Compositions of Two-way Finite-State Transductions
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Graph-Based Design and Analysis of Dynamic Software Architectures
Concurrency, Graphs and Models
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
On the Recognizability of Arrow and Graph Languages
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Approximating rank-width and clique-width quickly
ACM Transactions on Algorithms (TALG)
Treewidth and logical definability of graph products
Theoretical Computer Science
Graph operations characterizing rank-width
Discrete Applied Mathematics
Separating Graph Logic from MSO
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Correctness of high-level transformation systems relative to nested conditions†
Mathematical Structures in Computer Science
Linear delay enumeration and monadic second-order logic
Discrete Applied Mathematics
Recent developments on graphs of bounded clique-width
Discrete Applied Mathematics
Hierarchical Design Rewriting with Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
A Logic Based Approach to the Static Analysis of Production Systems
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
A Service-Oriented UML Profile with Formal Support
ICSOC-ServiceWave '09 Proceedings of the 7th International Joint Conference on Service-Oriented Computing
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics
Verifying a Behavioural Logic for Graph Transformation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A Logic for Application Level QoS
Electronic Notes in Theoretical Computer Science (ENTCS)
Recognizability, hypergraph operations, and logical types
Information and Computation
A logic for analyzing abstractions of graph transformation systems
SAS'03 Proceedings of the 10th international conference on Static analysis
Existential heap abstraction entailment is undecidable
SAS'03 Proceedings of the 10th international conference on Static analysis
Computing representations of matroids of bounded branch-width
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
A temporal graph logic for verification of graph transformation systems
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
Graph operations and monadic second-order logic: a survey
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Towards model checking spatial properties with SPIN
Proceedings of the 14th international SPIN conference on Model checking software
Graphical encoding of a spatial logic for the π-calculus
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Obtaining a planar graph by vertex deletion
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
FASE'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Fundamental approaches to software engineering
Matrix Graph Grammars with Application Conditions
Fundamenta Informaticae
Towards a rewriting logic semantics for ATL
ICMT'10 Proceedings of the Third international conference on Theory and practice of model transformations
Decomposition width of matroids
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The tree width of auxiliary storage
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A dynamic logic for termgraph rewriting
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Verification of graph transformation systems with context-free specifications
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Counterpart semantics for a second-order µ-calculus
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Local confluence for rules with nested application conditions
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Recognizable graph languages for the verification of dynamic systems
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Symbolic graphs for attributed graph constraints
Journal of Symbolic Computation
Graphs of separability at most two: structural characterizations and their consequences
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Journal of Computer and System Sciences
Bidimensionality and geometric graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Second-order principles in specification languages for object-oriented programs
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The equivalence problem for deterministic MSO tree transducers is decidable
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Inverse monoids: decidability and complexity of algebraic questions
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Verification of graph grammars using a logical approach
Science of Computer Programming
Specifying and verifying UML activity diagrams via graph transformation
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
The modular decomposition of countable graphs: constructions in monadic second-order logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Graphs of separability at most 2
Discrete Applied Mathematics
Decomposition width of matroids
Discrete Applied Mathematics
Heuristic search for the analysis of graph transition systems
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Contextual hypergraph grammars – a new approach to the generation of hypergraph languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Algorithmic aspects of dominator colorings in graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
On the directed Full Degree Spanning Tree problem
Discrete Optimization
Deciding first order properties of matroids
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
FoVeOOS'11 Proceedings of the 2011 international conference on Formal Verification of Object-Oriented Software
Finitary Compositions of Two-way Finite-State Transductions
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
Counterpart Semantics for a Second-Order μ-Calculus
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
MSO decidability of multi-pushdown systems via split-width
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Specification and verification of modal properties for structured systems
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
| Hi-index | 0.01 |