Jörg Flum

Publication Activity (10 Years)

Years Active: 1971-2024
Publications (10 Years): 15

Top Topics

Monadic Second Order Logic

Quantifier Elimination

Computational Complexity

Propositional Logic

Top Venues

Publications

Yijia Chen, Jörg Flum
Forbidden induced subgraphs and the łOś-Tarski Theorem. J. Symb. Log. 89 (2) (2024)
Yijia Chen, Jörg Flum, Moritz Müller
A Surprising Relationship Between Descriptive Complexity and Proof Complexity. Bull. EATCS 138 (2022)
Yijia Chen, Jörg Flum, Mingjun Liu, Zhiyang Xun
On Algorithms Based on Finitely Many Homomorphism Counts. MFCS (2022)
Yijia Chen, Jörg Flum, Mingjun Liu, Zhiyang Xun
On Queries Determined by a Constant Number of Homomorphism Counts. CoRR (2021)
Yijia Chen, Jörg Flum
Forbidden Induced Subgraphs and the Łoś-Tarski Theorem. LICS (2021)
Yijia Chen, Jörg Flum
Parameterized Parallel Computing and First-Order Logic. Fields of Logic and Computation III (2020)
Yijia Chen, Jörg Flum
Forbidden Induced Subgraphs and the Łoś-Tarski Theorem. CoRR (2020)
Yijia Chen, Jörg Flum
FO-Definability of Shrub-Depth. CSL (2020)
Yijia Chen, Jörg Flum
. Inf. Comput. 267 (2019)
Yijia Chen, Jörg Flum
Tree-depth, quantifier elimination, and quantifier rank. LICS (2018)
Yijia Chen, Jörg Flum, Xuangui Huang
Slicewise Definability in First-Order Logic with Bounded Quantifier Rank. CSL (2017)
Yijia Chen, Jörg Flum, Xuangui Huang
Slicewise definability in first-order logic with bounded quantifier rank. CoRR (2017)
Yijia Chen, Rodney G. Downey, Jörg Flum
Logic and Computational Complexity (NII Shonan Meeting 2017-13). NII Shonan Meet. Rep. 2017 (2017)
Yijia Chen, Jörg Flum
. CoRR (2016)
Yijia Chen, Jörg Flum
Some Lower Bounds in Parameterized AC^0. MFCS (2016)
Yijia Chen, Jörg Flum
The Ehrenfeucht-Fraïssé Method and the Planted Clique Conjecture. Fields of Logic and Computation II (2015)
Yijia Chen, Jörg Flum, Moritz Müller
Hard Instances of Algorithms and Proof Systems. ACM Trans. Comput. Theory 6 (2) (2014)
Yijia Chen, Jörg Flum
On Optimal Inverters. Bull. Symb. Log. 20 (1) (2014)
Yijia Chen, Jörg Flum
On Limitations of the Ehrenfeucht-Fraisse-method in Descriptive Complexity. Electron. Colloquium Comput. Complex. 20 (2013)
Yijia Chen, Jörg Flum, Moritz Müller
Consistency, optimality, and incompleteness. Ann. Pure Appl. Log. 164 (12) (2013)
Yijia Chen, Jörg Flum
On the Ordered Conjecture. LICS (2012)
Yijia Chen, Jörg Flum, Moritz Müller
Hard Instances of Algorithms and Proof Systems. CiE (2012)
Jörg Flum, Moritz Müller
Some Definitorial Suggestions for Parameterized Proof Complexity. IPEC (2012)
Yijia Chen, Jörg Flum
A Parameterized Halting Problem. The Multivariate Algorithmic Revolution and Beyond (2012)
Yijia Chen, Jörg Flum
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting Problem. J. ACM 59 (4) (2012)
Jörg Flum, Moritz Müller
Some definitorial suggestions for parameterized proof complexity. Electron. Colloquium Comput. Complex. 19 (2012)
Yijia Chen, Kord Eickmeyer, Jörg Flum
The Exponential Time Hypothesis and the Parameterized Clique Problem. IPEC (2012)
Sam Buss, Yijia Chen, Jörg Flum, Sy-David Friedman, Moritz Müller
Strong isomorphism reductions in complexity theory. J. Symb. Log. 76 (4) (2011)
Yijia Chen, Jörg Flum
Listings and Logics. LICS (2011)
Jörg Flum
Invariantization of Listings. MFCS (2011)
Yijia Chen, Jörg Flum, Moritz Müller
Hard instances of algorithms and proof systems. Electron. Colloquium Comput. Complex. 18 (2011)
Yijia Chen, Jörg Flum, Moritz Müller
Lower Bounds for Kernelizations and Other Preprocessing Procedures. Theory Comput. Syst. 48 (4) (2011)
Yijia Chen, Jörg Flum, Moritz Müller
Consistency and Optimality. CiE (2011)
Yijia Chen, Jörg Flum
Listings and logics. Electron. Colloquium Comput. Complex. 18 (2011)
Yijia Chen, Jörg Flum
On optimal proof systems and logics for PTIME. Electron. Colloquium Comput. Complex. 17 (2010)
Yijia Chen, Jörg Flum
A Logic for PTIME and a Parameterized Halting Problem. Fields of Logic and Computation (2010)
Yijia Chen, Jörg Flum
-Optimal Proof Systems and Logics for PTIME. ICALP (2) (2010)
Yijia Chen, Jörg Flum
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT. CSL (2010)
Yijia Chen, Jörg Flum
On the complexity of Gödel's proof predicate. J. Symb. Log. 75 (1) (2010)
Michael R. Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, Frances A. Rosamond
W-Hierarchies Defined by Symmetric Gates. Theory Comput. Syst. 46 (2) (2010)
Yijia Chen, Jörg Flum
Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping. J. Log. Comput. 19 (1) (2009)
Yijia Chen, Jörg Flum
A Logic for PTIME and a Parameterized Halting Problem. LICS (2009)
Yijia Chen, Jörg Flum, Moritz Müller
Lower Bounds for Kernelizations and Other Preprocessing Procedures. CiE (2009)
Yijia Chen, Jörg Flum
A logic for PTIME and a parameterized halting problem. Electron. Colloquium Comput. Complex. 15 (083) (2008)
Yijia Chen, Jörg Flum
The parameterized complexity of maximality and minimality problems. Ann. Pure Appl. Log. 151 (1) (2008)
Yijia Chen, Jörg Flum
On Parameterized Path and Chordless Path Problems. Computational Complexity Conference (2007)
Jörg Flum
Parameterized Complexity and Logic. CiE (2007)
Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer
Bounded fixed-parameter tractability and reducibility. Ann. Pure Appl. Log. 148 (1-3) (2007)
Yijia Chen, Jörg Flum, Martin Grohe
-hierarchy. J. Symb. Log. 72 (2) (2007)
Yijia Chen, Jörg Flum
Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping. CSL (2007)
Yijia Chen, Jörg Flum, Moritz Müller
Lower Bounds for Kernelizations. Electron. Colloquium Comput. Complex. 14 (137) (2007)
Yijia Chen, Jörg Flum
On miniaturized problems in parameterized complexity theory. Theor. Comput. Sci. 351 (3) (2006)
Jörg Flum, Martin Grohe, Mark Weyer
nondeterministic bits. J. Comput. Syst. Sci. 72 (1) (2006)
Yijia Chen, Jörg Flum
The Parameterized Complexity of Maximality and Minimality Problems. IWPEC (2006)
Jörg Flum, Martin Grohe
Model-checking problems as a basis for parameterized intractability. Log. Methods Comput. Sci. 1 (1) (2005)
Yijia Chen, Jörg Flum, Martin Grohe
Machine-based methods in parameterized complexity theory. Theor. Comput. Sci. 339 (2-3) (2005)
Jörg Flum, Martin Grohe
Model-Checking Problems as a Basis for Parameterized Intractability CoRR (2005)
Jörg Flum, Martin Grohe
The Parameterized Complexity of Counting Problems. SIAM J. Comput. 33 (4) (2004)
Yijia Chen, Jörg Flum
On Miniaturized Problems in Parameterized Complexity Theory. IWPEC (2004)
Jörg Flum, Martin Grohe, Mark Weyer
n Nondeterministic Bits. ICALP (2004)
Jörg Flum, Martin Grohe
Model-Checking Problems as a Basis for Parameterized Intractability. LICS (2004)
Jörg Flum, Martin Grohe
Parametrized Complexity and Subexponential Time (Column: Computational Complexity). Bull. EATCS 84 (2004)
Jörg Flum, Martin Grohe
Describing parameterized complexity classes. Inf. Comput. 187 (2) (2003)
Yijia Chen, Jörg Flum, Martin Grohe
Bounded Nondeterminism and Alternation in Parameterized Complexity Theory. Computational Complexity Conference (2003)
Yijia Chen, Jörg Flum
Machine Characterization of the Classes of the W-Hierarchy. CSL (2003)
Jörg Flum, Martin Grohe
Describing Parameterized Complexity Classes. STACS (2002)
Jörg Flum, Martin Grohe
The Parameterized Complexity of Counting Problems. FOCS (2002)
Jörg Flum, Markus Frick, Martin Grohe
Query evaluation via tree-decompositions. J. ACM 49 (6) (2002)
Jörg Flum
Tree-Decompositions and the Model-Checking Problem. Bull. EATCS 73 (2001)
Jörg Flum, Martin Grohe
Fixed-Parameter Tractability, Definability, and Model-Checking. SIAM J. Comput. 31 (1) (2001)
Jörg Flum, Markus Frick, Martin Grohe
Query Evaluation via Tree-Decompositions. ICDT (2001)
Jörg Flum, Martin Grohe
On Fixed-Point Logic With Counting. J. Symb. Log. 65 (2) (2000)
Jörg Flum
Games, Kernels, and Antitone Operations. Order 17 (1) (2000)
Jörg Flum, Max Kubierschky, Bertram Ludäscher
Games and total Datalog¬ queries. Theor. Comput. Sci. 239 (2) (2000)
Jörg Flum, Matthias Schiehlen, Jouko A. Väänänen
Quantifiers and Congruence Closure. Stud Logica 62 (3) (1999)
Jörg Flum, Martin Grohe
Fixed-parameter tractability, definability, and model checking CoRR (1999)
Jörg Flum, Martin Ziegler
Pseudo-Finite Homogeneity and Saturation. J. Symb. Log. 64 (4) (1999)
Jörg Flum
An Extension of the Lemma of Rasiowa and Sikorski. Math. Log. Q. 44 (1998)
Jörg Flum, Max Kubierschky, Bertram Ludäscher
Total and Partial Well-Founded Datalog Coincide. ICDT (1997)
Jörg Flum
On Bounded Theories. CSL (1991)
Jörg Flum, Juan Carlos Martínez
On Topological Spaces Equivalent to Ordinals. J. Symb. Log. 53 (3) (1988)
Jörg Flum, Juan Carlos Martínez
χ-Local Operations for Topological Structures. Math. Log. Q. 31 (21-23) (1985)
Jörg Flum
Maximale monadische Logiken. Arch. Math. Log. 25 (1) (1985)
Jörg Flum
L(Q)-Preservation Theorems. J. Symb. Log. 40 (3) (1975)
Jörg Flum
A Remark on Infinitary Languages. J. Symb. Log. 36 (3) (1971)