Author:
de Oliveira Oliveira Mateus
Publisher
Springer International Publishing
Reference28 articles.
1. Adler, I., Grohe, M., Kreutzer, S.: Computing excluded minors. In: Proceedings of SODA 2008, pp. 641–650. SIAM (2008)
2. Bojańczyk, M., Pilipczuk, M.: Definability equals recognizability for graphs of bounded treewidth. In Procedings of LICS 2016, pp. 407–416. ACM (2016)
3. Comon, H., et al.: Tree Automata Techniques and Applications (2007)
4. Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12–75 (1990)
5. Courcelle, B.: The monadic second-order logic of graphs xii: planar graphs and planar maps. Theor. Comput. Sci. 237(1), 1–32 (2000)