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)

LTL Fragments are Hard for Standard Parameterisations. - Martin Lück; Arne Meier (TIME, 2015)

Axiomatizations for Propositional and Modal Team Logic. - Martin Lück (CSL, 2016)

On Quantified Propositional Logics and the Exponential Time Hierarchy. - Miika Hannula; Juha Kontinen; Martin Lück; Jonni Virtema (GandALF, 2016)

Complete Problems of Propositional Logic for the Exponential Hierarchy. - Martin Lück (CoRR, 2016)

The Power of the Filtration Technique for Modal Logics with Team Semantics. - Martin Lück (CSL, 2017)

On the Complexity of Modal Team Logic and Two-Variable Team Logic. - Martin Lück (CoRR, 2017)

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

On the Complexity of Team Logic and Its Two-Variable Fragment. - Martin Lück (MFCS, 2018)

Axiomatizations of team logics. - Martin Lück (Ann. Pure Appl. Log., 2018)

Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic. - Martin Lück (Int. J. Found. Comput. Sci., 2018)

Canonical Models and the Complexity of Modal Team Logic. - Martin Lück (Log. Methods Comput. Sci., 2019)

On the Succinctness of Atoms of Dependency. - Martin Lück; Miikka Vilander (Log. Methods Comput. Sci., 2019)

On the complexity of linear temporal logic with team semantics. - Martin Lück (Theor. Comput. Sci., 2020)

Team logic: axioms, expressiveness, complexity. - Martin Lück (2020)

On the Complexity of Horn and Krom Fragments of Second-Order Boolean Logic. - Miika Hannula; Juha Kontinen; Martin Lück; Jonni Virtema (CSL, 2021)