Mikolaj Bojanczyk, Michal Pilipczuk. Definability equals recognizability for graphs of bounded treewidth. In Martin Grohe, Eric Koskinen, Natarajan Shankar, editors, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016. pages 407-416, ACM, 2016. [doi]
No references recorded for this publication.
No citations of this publication recorded.