Parameterized Complexity of CTL: Courcelle's Theorem For Infinite Vocabularies. - Martin Lück; Arne Meier; Irina Schindler (Electron. Colloquium Comput. Complex., 2014)

Parameterized Complexity of CTL - A Generalization of Courcelle's Theorem. - Martin Lück; Arne Meier; Irina Schindler (LATA, 2015)

On the parameterized complexity of non-monotonic logics. - Arne Meier; Irina Schindler; Johannes Schmidt 001; Michael Thomas 001; Heribert Vollmer (Arch. Math. Log., 2015)

Strong Backdoors for Linear Temporal Logic. - Arne Meier; Sebastian Ordyniak; M. S. Ramanujan 001; Irena Schindler (CoRR, 2016)

Parametrised Complexity of Satisfiability in Temporal Logic. - Martin Lück; Arne Meier; Irena Schindler (ACM Trans. Comput. Log., 2017)

Parameterized complexity of decision problems in non-classical logics - Irena Schindler (2018)

Backdoors for Linear Temporal Logic. - Arne Meier; Sebastian Ordyniak; M. S. Ramanujan 001; Irena Schindler (Algorithmica, 2019)

Default logic and bounded treewidth. - Johannes Klaus Fichte; Markus Hecher; Irina Schindler (Inf. Comput., 2022)

Strong Backdoors for Default Logic. - Johannes Klaus Fichte; Arne Meier; Irena Schindler (ACM Trans. Comput. Log., 2024)