On the logical definability of centrain graph and poset languages
Journal of Automata, Languages and Combinatorics
Trees, grids, and MSO decidability: from graphs to matroids
Theoretical Computer Science - Parameterized and exact computation
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Journal of Combinatorial Theory Series B
Effective characterizations of tree logics
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Pomset Languages of Finite Step Transition Systems
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Towards a characterization of order-invariant queries over tame structures
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
The modular decomposition of countable graphs: constructions in monadic second-order logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
First-Order and Monadic Second-Order Model-Checking on Ordered Structures
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Hi-index | 5.23 |