Martin Lück, Arne Meier, Irina Schindler. Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies. Electronic Colloquium on Computational Complexity (ECCC), 21:134, 2014. [doi]
@article{LuckMS14,
title = {Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies},
author = {Martin Lück and Arne Meier and Irina Schindler},
year = {2014},
url = {http://eccc.hpi-web.de/report/2014/134},
researchr = {https://researchr.org/publication/LuckMS14},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {21},
pages = {134},
}