| Publication | Date of Publication | Type |
|---|
| On the power of symmetric linear programs | 2024-12-19 | Paper |
| Separating LREC from LFP | 2024-12-06 | Paper |
| Monadic NIP in monotone classes of relational structures | 2024-11-14 | Paper |
| MSO undecidability for hereditary classes of unbounded clique-width | 2024-10-07 | Paper |
| Constraint satisfaction, graph isomorphism, and the pebbling comonad | 2024-10-01 | Paper |
| Game comonads \& generalised quantifiers | 2024-09-04 | Paper |
| First order logic, fixed point logic and linear order | 2024-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6124948 | 2024-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126284 | 2024-04-09 | Paper |
| A restricted second order logic for finite structures | 2023-12-12 | Paper |
| Descriptive complexity of controllable graphs | 2023-09-09 | Paper |
| On the Relative Power of Linear Algebraic Approximations of Graph Isomorphism | 2023-08-08 | Paper |
| Limitations of the invertible-map equivalences | 2023-08-03 | Paper |
| Monadic NIP in monotone classes of relational structures | 2023-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874187 | 2023-02-07 | Paper |
| Symmetric Circuits for Rank Logic | 2022-12-08 | Paper |
| On the Power of Symmetric Linear Programs | 2022-12-08 | Paper |
| Relativization of Gurevich’s Conjectures | 2022-11-09 | Paper |
| Convergence and Nonconvergence Laws for Random Expansions of Product Structures | 2022-11-09 | Paper |
| Descriptive complexity of the generalized spectra of graphs | 2022-10-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091274 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5079744 | 2022-05-28 | Paper |
| Definable Inapproximability: New Challenges for Duplicator | 2022-05-28 | Paper |
| Lov\'asz-Type Theorems and Game Comonads | 2021-05-07 | Paper |
| On the relative power of algebraic approximations of graph isomorphism | 2021-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144676 | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144628 | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144655 | 2021-01-19 | Paper |
| Generalizations of \(k\)-dimensional Weisfeiler-Leman stabilization | 2020-11-10 | Paper |
| The Ackermann Award 2017. | 2020-05-26 | Paper |
| Definable inapproximability: new challenges for duplicator | 2020-02-17 | Paper |
| Descriptive complexity of graph spectra | 2019-09-18 | Paper |
| Logical properties of random graphs from small addable classes | 2019-08-06 | Paper |
| Constructing Hard Examples for Graph Isomorphism | 2019-05-24 | Paper |
| Approximations of Isomorphism and Logics with Linear-Algebraic Operators | 2019-02-18 | Paper |
| Implicit definability and infinitary logic in finite model theory | 2019-01-10 | Paper |
| Pebble games and cospectral graphs | 2018-01-18 | Paper |
| Bounded degree and planar spectra | 2017-12-11 | Paper |
| Pebble Games with Algebraic Rules | 2017-11-10 | Paper |
| Fixed-parameter tractable distances to sparse graph classes | 2017-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363778 | 2017-09-29 | Paper |
| A Definability Dichotomy for Finite Valued CSPs | 2017-08-31 | Paper |
| Decidable fragments of the simple theory of types with infinity and NF | 2017-08-17 | Paper |
| The Ackermann Award 2016 | 2017-07-19 | Paper |
| Inflationary fixed points in modal logic | 2017-07-12 | Paper |
| The Ackermann Award 2013 | 2017-02-02 | Paper |
| Descriptive complexity of graph spectra | 2016-09-09 | Paper |
| Graph isomorphism parameterized by elimination distance to bounded degree | 2016-09-07 | Paper |
| On Symmetric and Choiceless Computation | 2016-04-01 | Paper |
| Capturing MSO with One Quantifier | 2015-09-22 | Paper |
| Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree | 2015-09-15 | Paper |
| Degree lower bounds of tower-type for approximating formulas with parity quantifiers | 2014-04-16 | Paper |
| Definability of linear equation systems over groups and rings | 2013-11-28 | Paper |
| On Tractable Parameterizations of Graph Isomorphism | 2013-01-07 | Paper |
| Definability of linear equation systems over groups and rings | 2012-11-22 | Paper |
| The Ackermann Award 2012. | 2012-11-22 | Paper |
| Pebble Games with Algebraic Rules | 2012-11-01 | Paper |
| Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers | 2012-11-01 | Paper |
| Domination problems in nowhere-dense classes of graphs | 2012-10-24 | Paper |
| Structure and specification as sources of complexity | 2012-10-24 | Paper |
| The dag-width of directed graphs | 2012-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3172124 | 2011-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3007256 | 2011-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3000099 | 2011-05-18 | Paper |
| On Complete Problems, Relativizations and Logics for Complexity Classes | 2010-09-03 | Paper |
| Homomorphism preservation on quasi-wide classes | 2010-07-08 | Paper |
| Properties of Almost All Graphs and Generalized Quantifiers | 2010-05-25 | Paper |
| The monadic theory of finite representations of infinite words | 2010-03-24 | Paper |
| Parameterized Complexity Classes under Logical Reductions | 2009-10-16 | Paper |
| Modal characterisation theorems over special classes of frames | 2009-10-09 | Paper |
| Preservation under Extensions on Well-Behaved Finite Structures | 2009-08-20 | Paper |
| Affine systems of equations and counting infinitary logic | 2009-04-29 | Paper |
| Separating Graph Logic from MSO | 2009-03-31 | Paper |
| Model-Checking First-Order Logic: Automata and Locality | 2009-03-05 | Paper |
| The Power of Counting Logics on Restricted Classes of Finite Structures | 2009-03-05 | Paper |
| On preservation under homomorphisms and unions of conjunctive queries | 2008-12-21 | Paper |
| The Descriptive Complexity of Parity Games | 2008-11-20 | Paper |
| Finite Model Theory on Tame Classes of Structures | 2008-09-17 | Paper |
| On Datalog vs. LFP | 2008-08-19 | Paper |
| On the Descriptive Complexity of Linear Algebra | 2008-07-10 | Paper |
| Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs | 2008-03-28 | Paper |
| DAG-Width and Parity Games | 2008-03-19 | Paper |
| Model Theory Makes Formulas Large | 2007-11-28 | Paper |
| Affine Systems of Equations and Counting Infinitary Logic | 2007-11-28 | Paper |
| Generalising automaticity to modal properties of finite structures | 2007-07-16 | Paper |
| Computer Science Logic | 2007-06-21 | Paper |
| Expressiveness and complexity of graph logic | 2007-03-12 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5483318 | 2006-08-16 | Paper |
| Backtracking games and inflationary fixed points | 2006-03-20 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| Fixed-point Logics with Nondeterministic Choice | 2003-11-10 | Paper |
| Fixed Point Logics | 2003-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783314 | 2002-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249221 | 2000-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936132 | 2000-01-24 | Paper |
| A restricted second order logic for finite structures | 1998-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381409 | 1998-11-02 | Paper |
| Elementary Properties of the Finite Ranks | 1998-09-27 | Paper |
| Capturing Relativized Complexity Classes without Order | 1998-03-30 | Paper |
| The expressive power of finitely many generalized quantifiers | 1996-11-04 | Paper |
| Infinitary logic and inductive definability over finite structures | 1995-08-02 | Paper |
| Generalized Quantifiers and Logical Reducibilities | 1995-04-17 | Paper |
