Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi. - David Sabel; Manfred Schmidt-Schauß; Frederik Harwath (GI Jahrestagung, 2009)

Regular tree languages, cardinality predicates, and addition-invariant FO. - Frederik Harwath; Nicole Schweikardt (STACS, 2012)

On the locality of arb-invariant first-order logic with modulo counting quantifiers. - Frederik Harwath; Nicole Schweikardt (CSL, 2013)

Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures. - Kord Eickmeyer; Michael Elberfeld; Frederik Harwath (MFCS (1), 2014)

Preservation and decomposition theorems for bounded degree structures. - Frederik Harwath; Lucas Heimberg; Nicole Schweikardt (Log. Methods Comput. Sci., 2015)

Order-Invariance of Two-Variable Logic is Decidable. - Thomas Zeume; Frederik Harwath (LICS, 2016)

On the locality of arb-invariant first-order formulas with modulo counting quantifiers. - Frederik Harwath; Nicole Schweikardt (Log. Methods Comput. Sci., 2016)

A note on the size of prenex normal forms. - Frederik Harwath (Inf. Process. Lett., 2016)

Succinctness of Order-Invariant Logics on Depth-Bounded Structures. - Kord Eickmeyer; Michael Elberfeld; Frederik Harwath (ACM Trans. Comput. Log., 2017)

Property Testing for Bounded Degree Databases. - Isolde Adler; Frederik Harwath (STACS, 2018)

On Invariant Formulae of First-Order Logic with Numerical Predicates - Frederik Harwath (2018)