A Remark on Infinitary Languages. - Jörg Flum (J. Symb. Log., 1971)

L(Q)-Preservation Theorems. - Jörg Flum (J. Symb. Log., 1975)

Mathematical logic. - Heinz-Dieter Ebbinghaus; Jörg Flum; Wolfgang Thomas (Springer, 1984)

Maximale monadische Logiken. - Jörg Flum (Arch. Math. Log., 1985)

χ-Local Operations for Topological Structures. - Jörg Flum; Juan Carlos Martínez (Math. Log. Q., 1985)

On Topological Spaces Equivalent to Ordinals. - Jörg Flum; Juan Carlos Martínez (J. Symb. Log., 1988)

On Bounded Theories. - Jörg Flum (CSL, 1991)

Einführung in die mathematische Logik (3. Aufl.). - Heinz-Dieter Ebbinghaus; Jörg Flum; Wolfgang Thomas (BI-Wissenschaftsverlag, 1992)

Mathematical logic (2. ed.). - Heinz-Dieter Ebbinghaus; Jörg Flum; Wolfgang Thomas (Springer, 1994)

Finite model theory. - Heinz-Dieter Ebbinghaus; Jörg Flum (Springer, 1995)

Einführung in die mathematische Logik (4. Aufl.). - Heinz-Dieter Ebbinghaus; Jörg Flum; Wolfgang Thomas (Spektrum Akadem. Verl., 1996)

Total and Partial Well-Founded Datalog Coincide. - Jörg Flum; Max Kubierschky; Bertram Ludäscher (ICDT, 1997)

An Extension of the Lemma of Rasiowa and Sikorski. - Jörg Flum (Math. Log. Q., 1998)

Pseudo-Finite Homogeneity and Saturation. - Jörg Flum; Martin Ziegler 002 (J. Symb. Log., 1999)

Quantifiers and Congruence Closure. - Jörg Flum; Matthias Schiehlen; Jouko A. Väänänen (Stud Logica, 1999)

On Fixed-Point Logic With Counting. - Jörg Flum; Martin Grohe (J. Symb. Log., 2000)

Games, Kernels, and Antitone Operations. - Jörg Flum (Order, 2000)

Games and total Datalog¬ queries. - Jörg Flum; Max Kubierschky; Bertram Ludäscher (Theor. Comput. Sci., 2000)

Tree-Decompositions and the Model-Checking Problem. - Jörg Flum (Bull. EATCS, 2001)

Fixed-Parameter Tractability, Definability, and Model-Checking. - Jörg Flum; Martin Grohe (SIAM J. Comput., 2001)

Query evaluation via tree-decompositions. - Jörg Flum; Markus Frick; Martin Grohe (J. ACM, 2002)

Bounded Nondeterminism and Alternation in Parameterized Complexity Theory. - Yijia Chen 001; Jörg Flum; Martin Grohe (CCC, 2003)

Machine Characterization of the Classes of the W-Hierarchy. - Yijia Chen 001; Jörg Flum (CSL, 2003)

Describing parameterized complexity classes. - Jörg Flum; Martin Grohe (Inf. Comput., 2003)

Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits. - Jörg Flum; Martin Grohe; Mark Weyer (ICALP, 2004)

Parametrized Complexity and Subexponential Time (Column: Computational Complexity). - Jörg Flum; Martin Grohe (Bull. EATCS, 2004)

The Parameterized Complexity of Counting Problems. - Jörg Flum; Martin Grohe (SIAM J. Comput., 2004)

Model-checking problems as a basis for parameterized intractability. - Jörg Flum; Martin Grohe (Log. Methods Comput. Sci., 2005)

Machine-based methods in parameterized complexity theory. - Yijia Chen 001; Jörg Flum; Martin Grohe (Theor. Comput. Sci., 2005)

Bounded fixed-parameter tractability and log2n nondeterministic bits. - Jörg Flum; Martin Grohe; Mark Weyer (J. Comput. Syst. Sci., 2006)

On miniaturized problems in parameterized complexity theory. - Yijia Chen 001; Jörg Flum (Theor. Comput. Sci., 2006)

Parameterized Complexity Theory - Jörg Flum; Martin Grohe (Springer, 2006)

Einführung in die mathematische Logik (5. Aufl.). - Heinz-Dieter Ebbinghaus; Jörg Flum; Wolfgang Thomas (Spektrum Akademischer Verlag, 2007)

Parameterized Complexity and Logic. - Jörg Flum (CiE, 2007)

On Parameterized Path and Chordless Path Problems. - Yijia Chen 001; Jörg Flum (CCC, 2007)

Bounded fixed-parameter tractability and reducibility. - Rod Downey; Jörg Flum; Martin Grohe; Mark Weyer (Ann. Pure Appl. Log., 2007)

Lower Bounds for Kernelizations. - Yijia Chen 001; Jörg Flum; Moritz Müller (Electron. Colloquium Comput. Complex., 2007)

An analysis of the W*-hierarchy. - Yijia Chen 001; Jörg Flum; Martin Grohe (J. Symb. Log., 2007)

The parameterized complexity of maximality and minimality problems. - Yijia Chen 001; Jörg Flum (Ann. Pure Appl. Log., 2008)

A logic for PTIME and a parameterized halting problem. - Yijia Chen 001; Jörg Flum (Electron. Colloquium Comput. Complex., 2008)

Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping. - Yijia Chen 001; Jörg Flum (J. Log. Comput., 2009)

On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT. - Yijia Chen 001; Jörg Flum (CSL, 2010)

On p-Optimal Proof Systems and Logics for PTIME. - Yijia Chen 001; Jörg Flum (ICALP (2), 2010)

On optimal proof systems and logics for PTIME. - Yijia Chen 001; Jörg Flum (Electron. Colloquium Comput. Complex., 2010)

On the complexity of Gödel's proof predicate. - Yijia Chen 001; Jörg Flum (J. Symb. Log., 2010)

W-Hierarchies Defined by Symmetric Gates. - Michael R. Fellows; Jörg Flum; Danny Hermelin; Moritz Müller; Frances A. Rosamond (Theory Comput. Syst., 2010)

Consistency and Optimality. - Yijia Chen 001; Jörg Flum; Moritz Müller (CiE, 2011)

Invariantization of Listings. - Jörg Flum (MFCS, 2011)

Listings and logics. - Yijia Chen 001; Jörg Flum (Electron. Colloquium Comput. Complex., 2011)

Hard instances of algorithms and proof systems. - Yijia Chen 001; Jörg Flum; Moritz Müller (Electron. Colloquium Comput. Complex., 2011)

Strong isomorphism reductions in complexity theory. - Sam Buss; Yijia Chen 001; Jörg Flum; Sy-David Friedman; Moritz Müller (J. Symb. Log., 2011)

Lower Bounds for Kernelizations and Other Preprocessing Procedures. - Yijia Chen 001; Jörg Flum; Moritz Müller (Theory Comput. Syst., 2011)

A Parameterized Halting Problem. - Yijia Chen 001; Jörg Flum (The Multivariate Algorithmic Revolution and Beyond, 2012)

The Exponential Time Hypothesis and the Parameterized Clique Problem. - Yijia Chen 001; Kord Eickmeyer; Jörg Flum (IPEC, 2012)

On the Ordered Conjecture. - Yijia Chen 001; Jörg Flum (LICS, 2012)

Some definitorial suggestions for parameterized proof complexity. - Jörg Flum; Moritz Müller (Electron. Colloquium Comput. Complex., 2012)

From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem. - Yijia Chen 001; Jörg Flum (J. ACM, 2012)

Consistency, optimality, and incompleteness. - Yijia Chen 001; Jörg Flum; Moritz Müller (Ann. Pure Appl. Log., 2013)

On Limitations of the Ehrenfeucht-Fraisse-method in Descriptive Complexity. - Yijia Chen 001; Jörg Flum (Electron. Colloquium Comput. Complex., 2013)

On Optimal Inverters. - Yijia Chen 001; Jörg Flum (Bull. Symb. Log., 2014)

The Ehrenfeucht-Fraïssé Method and the Planted Clique Conjecture. - Yijia Chen 001; Jörg Flum (Fields of Logic and Computation II, 2015)

Some Lower Bounds in Parameterized AC^0. - Yijia Chen 001; Jörg Flum (MFCS, 2016)

Slicewise Definability in First-Order Logic with Bounded Quantifier Rank. - Yijia Chen 001; Jörg Flum; Xuangui Huang (CSL, 2017)

Logic and Computational Complexity (NII Shonan Meeting 2017-13). - Yijia Chen 001; Rodney G. Downey; Jörg Flum (NII Shonan Meet. Rep., 2017)

Tree-depth, quantifier elimination, and quantifier rank. - Yijia Chen 001; Jörg Flum (LICS, 2018)

Some lower bounds in parameterized AC0. - Yijia Chen 001; Jörg Flum (Inf. Comput., 2019)

Parameterized Parallel Computing and First-Order Logic. - Yijia Chen 001; Jörg Flum (Fields of Logic and Computation III, 2020)

FO-Definability of Shrub-Depth. - Yijia Chen 001; Jörg Flum (CSL, 2020)

On Queries Determined by a Constant Number of Homomorphism Counts. - Yijia Chen 001; Jörg Flum; Mingjun Liu; Zhiyang Xun (CoRR, 2021)

A Surprising Relationship Between Descriptive Complexity and Proof Complexity. - Yijia Chen 001; Jörg Flum; Moritz Müller (Bull. EATCS, 2022)

Forbidden induced subgraphs and the łOś-Tarski Theorem. - Yijia Chen 001; Jörg Flum (J. Symb. Log., 2024)

On algorithms based on finitely many homomorphism counts. - Yijia Chen 001; Jörg Flum; Mingjun Liu; Zhiyang Xun (Inf. Comput., 2025)

Some remarks on the uncolored versions of the original CFI-graphs. - Yijia Chen 001; Jörg Flum; Mingjun Liu (CoRR, 2025)