The closure of Monadic NP (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
MonadicNLIN and Quantifier-Free Reductions
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Decidable Theories of Cayley-Graphs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
Theoretical Computer Science
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
Oriented vertex and arc colorings of outerplanar graphs
Information Processing Letters
MSOL partitioning problems on graphs of bounded treewidth and clique-width
Theoretical Computer Science
Oriented colorings of partial 2-trees
Information Processing Letters
New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Recognizability, hypergraph operations, and logical types
Information and Computation
Bounded-degree forbidden patterns problems are constraint satisfaction problems
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Universal structures and the logic of forbidden patterns
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Automata and logics for unranked and unordered trees
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Automata on directed graphs: edge versus vertex marking
ICGT'06 Proceedings of the Third international conference on Graph Transformations
EXPANDING GRAPH RELABELING SYSTEMS HAVE THE POWER OF RECURSIVE ENUMERABILITY
Fundamenta Informaticae
Page Number and Graph Treewidth
International Journal of Applied Metaheuristic Computing
Obstructions to locally injective oriented improper colourings
European Journal of Combinatorics
| Hi-index | 0.01 |