Author:
Blumensath Achim,Courcelle Bruno
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference26 articles.
1. A. Blumensath, T. Colcombet, and C. Löding. Logical Theories and Compatible Operations. In J. Flum, E. Grädel, and T. Wilke, editors,Logic and Automata: History and Perspectives, pages 73-106. Amsterdam University Press, 2007.
2. A. Blumensath.Structures of Bounded Partition Width. Ph.\,D. Thesis, \smaller{RWTH Aachen}, Aachen, 2003.
3. A model-theoretic characterisation of clique width
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Transducing paths in graph classes with unbounded shrubdepth;European Journal of Combinatorics;2022-12
2. Twin-width I: Tractable FO Model Checking;Journal of the ACM;2022-02-28
3. Twin-width I: tractable FO model checking;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11
4. A New Perspective on FO Model Checking of Dense Graph Classes;ACM Transactions on Computational Logic;2020-10-31
5. First-Order Interpretations of Bounded Expansion Classes;ACM Transactions on Computational Logic;2020-10-27