FO Model Checking on Nested Pushdown Trees. - Alexander Kartzow (MFCS, 2009)

A Pumping Lemma for Collapsible Pushdown Graphs of Level 2. - Alexander Kartzow (CSL, 2011)

Tree-Automatic Well-Founded Trees. - Alexander Kartzow; Jiamou Liu; Markus Lohrey (CiE, 2012)

First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time. - Alexander Kartzow (FoSSaCS, 2012)

Strictness of the Collapsible Pushdown Hierarchy. - Alexander Kartzow; Pawel Parys (MFCS, 2012)

First-Order Model Checking on Generalisations of Pushdown Graphs - Alexander Kartzow (CoRR, 2012)

Structures without Scattered-Automatic Presentation. - Alexander Kartzow; Philipp Schlicht (CiE, 2013)

Satisfiability of CTL* with Constraints. - Claudia Carapelle; Alexander Kartzow; Markus Lohrey (CONCUR, 2013)

Reachability in Higher-Order-Counters. - Alexander Heußner; Alexander Kartzow (MFCS, 2013)

Tree-Automatic Well-Founded Trees - Martin Huschenbett; Alexander Kartzow; Jiamou Liu; Markus Lohrey (Log. Methods Comput. Sci., 2013)

Collapsible Pushdown Graphs of Level 2 are Tree-Automatic - Alexander Kartzow (Log. Methods Comput. Sci., 2013)

First-Order Logic on Higher-Order Nested Pushdown Trees. - Alexander Kartzow (ACM Trans. Comput. Log., 2013)

Satisfiability of ECTL* with Tree Constraints. - Claudia Carapelle; Shiguang Feng; Alexander Kartzow; Markus Lohrey (CSR, 2015)

Model Checking Constraint LTL over Trees. - Alexander Kartzow; Thomas Weidner (CoRR, 2015)

The Field of the Reals and the Random Graph are not Finite-Word Ordinal-Automatic. - Alexander Kartzow (J. Autom. Lang. Comb., 2016)

Satisfiability of ECTL⁎ with constraints. - Claudia Carapelle; Alexander Kartzow; Markus Lohrey (J. Comput. Syst. Sci., 2016)

Pumping for ordinal-automatic structures. - Martin Huschenbett; Alexander Kartzow; Philipp Schlicht (Comput., 2017)

Satisfiability of ECTL∗ with Local Tree Constraints. - Claudia Carapelle; Shiguang Feng; Alexander Kartzow; Markus Lohrey (Theory Comput. Syst., 2017)