Definability equals recognizability for graphs of bounded treewidth

Article Details
Title:	Definability equals recognizability for graphs of bounded treewidth
Article URLs:	https://doi.org/10.1145/2933575.2934508 http://ieeexplore.ieee.org/document/8576418
Alternative Article URLs:
Authors:	Mikolaj Bojanczyk	University of Warsaw, Institute of Informatics
Authors:	Michal Pilipczuk	University of Warsaw, Institute of Informatics
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/lics/BojanczykP16
Author Comments:

ACM/IEEE Logic in Computer Science, LICS 2016