| Publication | Date of Publication | Type |
|---|
| Undefinability of approximation of 2-to-2 games | 2026-06-09 | Paper |
Homomorphism counts to trees
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-06-04 | Paper |
| Preservation theorems on sparse classes revisited | 2026-05-12 | Paper |
Notions of width: variables, pebbles and supports
Bulletin of the European Association for Theoretical Computer Science EATCS | 2026-05-12 | Paper |
| Linear algebraic quantifiers | 2026-04-29 | Paper |
| Extension preservation in the finite and prefix classes of first-order logic | 2026-03-23 | Paper |
| Game comonads \& generalised quantifiers | 2026-03-23 | Paper |
| Symmetric arithmetic circuits | 2026-03-18 | Paper |
| Quantifiers closed under partial polymorphisms | 2026-02-19 | Paper |
Symmetric arithmetic circuits
Theory of Computing | 2026-02-10 | Paper |
| Limits of symmetric computation (invited talk) | 2026-01-14 | Paper |
Descriptive complexity of controllable graphs
Procedia Computer Science | 2025-12-11 | Paper |
| A parallel between the descriptive complexities of finite groups and Latin square graphs | 2025-08-01 | Paper |
| Monadic NIP in monotone classes of relational structures (extended abstract) | 2025-04-08 | Paper |
| 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
European Journal of Combinatorics | 2024-10-07 | Paper |
| Constraint satisfaction, graph isomorphism, and the pebbling comonad | 2024-10-01 | Paper |
Game comonads \& generalised quantifiers
Logical Methods in Computer Science | 2024-09-04 | Paper |
| First order logic, fixed point logic and linear order | 2024-06-21 | Paper |
MSO undecidability for hereditary classes of unbounded clique width
(available as arXiv preprint) | 2024-04-10 | Paper |
scientific article; zbMATH DE number 7829284 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
A restricted second order logic for finite structures
Lecture Notes in Computer Science | 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
Journal Of Logic And Computation | 2023-08-03 | Paper |
| Monadic NIP in monotone classes of relational structures | 2023-02-11 | Paper |
| scientific article; zbMATH DE number 7650815 (Why is no real title available?) | 2023-02-07 | Paper |
Symmetric Circuits for Rank Logic
ACM Transactions on Computational Logic | 2022-12-08 | Paper |
On the Power of Symmetric Linear Programs
Journal of the ACM | 2022-12-08 | Paper |
Relativization of Gurevich’s Conjectures
Fields of Logic and Computation III | 2022-11-09 | Paper |
Convergence and Nonconvergence Laws for Random Expansions of Product Structures
Fields of Logic and Computation III | 2022-11-09 | Paper |
| Descriptive complexity of the generalized spectra of graphs | 2022-10-11 | Paper |
Approximations of isomorphism and logics with linear-algebraic operators
(available as arXiv preprint) | 2022-07-21 | Paper |
Symmetric circuits for rank logic
(available as arXiv preprint) | 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 |
| The pebbling comonad in finite model theory | 2021-01-19 | Paper |
The pebbling comonad in finite model theory
(available as arXiv preprint) | 2021-01-19 | Paper |
| scientific article; zbMATH DE number 7297830 (Why is no real title available?) | 2021-01-19 | Paper |
| Definability of semidefinite programming and Lasserre lower bounds for CSPs | 2021-01-19 | Paper |
Generalizations of k-dimensional Weisfeiler-Leman stabilization
Moscow Journal of Combinatorics and Number Theory | 2020-11-10 | Paper |
| The Ackermann Award 2017 | 2020-05-26 | Paper |
Definable inapproximability: new challenges for duplicator
Journal Of Logic And Computation | 2020-02-17 | Paper |
Descriptive complexity of graph spectra
Annals of Pure and Applied Logic | 2019-09-18 | Paper |
Logical properties of random graphs from small addable classes
(available as arXiv preprint) | 2019-08-06 | Paper |
Constructing hard examples for graph isomorphism
Journal of Graph Algorithms and Applications | 2019-05-24 | Paper |
Approximations of Isomorphism and Logics with Linear-Algebraic Operators
(available as arXiv preprint) | 2019-02-18 | Paper |
Implicit definability and infinitary logic in finite model theory (extended abstract)
Automata, Languages and Programming | 2019-01-10 | Paper |
| Pebble games and cospectral graphs | 2018-01-18 | Paper |
Bounded degree and planar spectra
(available as arXiv preprint) | 2017-12-11 | Paper |
Pebble games with algebraic rules
Fundamenta Informaticae | 2017-11-10 | Paper |
Fixed-parameter tractable distances to sparse graph classes
Algorithmica | 2017-10-10 | Paper |
| scientific article; zbMATH DE number 6784973 (Why is no real title available?) | 2017-09-29 | Paper |
A definability dichotomy for finite valued CSPs
(available as arXiv preprint) | 2017-08-31 | Paper |
Decidable fragments of the simple theory of types with infinity and NF
Notre Dame Journal of Formal Logic | 2017-08-17 | Paper |
Decidable fragments of the simple theory of types with infinity and NF
Notre Dame Journal of Formal Logic | 2017-08-17 | Paper |
| The Ackermann Award 2016 | 2017-07-19 | Paper |
Inflationary fixed points in modal logic
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
| The Ackermann Award 2013 | 2017-02-02 | Paper |
Descriptive complexity of graph spectra
Lecture Notes in Computer Science | 2016-09-09 | Paper |
Graph isomorphism parameterized by elimination distance to bounded degree
Algorithmica | 2016-09-07 | Paper |
On Symmetric and Choiceless Computation
Topics in Theoretical Computer Science | 2016-04-01 | Paper |
Capturing MSO with one quantifier
Fields of Logic and Computation II | 2015-09-22 | Paper |
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
Parameterized and Exact Computation | 2015-09-15 | Paper |
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
Parameterized and Exact Computation | 2015-09-15 | Paper |
Degree lower bounds of tower-type for approximating formulas with parity quantifiers
ACM Transactions on Computational Logic | 2014-04-16 | Paper |
Definability of linear equation systems over groups and rings
Logical Methods in Computer Science | 2013-11-28 | Paper |
On tractable parameterizations of graph isomorphism
Parameterized and Exact Computation | 2013-01-07 | Paper |
Definability of linear equation systems over groups and rings
(available as arXiv preprint) | 2012-11-22 | Paper |
| The Ackermann Award 2012. | 2012-11-22 | Paper |
Degree lower bounds of tower-type for approximating formulas with parity quantifiers
Automata, Languages, and Programming | 2012-11-01 | Paper |
Pebble games with algebraic rules
Lecture Notes in Computer Science | 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
Journal of Combinatorial Theory. Series B | 2012-08-14 | Paper |
| Pebble games for logics with counting and rank | 2011-10-05 | Paper |
| How many first-order variables are needed on finite ordered structures? | 2011-06-21 | Paper |
| Computational complexity and the expressive power of logics | 2011-05-18 | Paper |
On complete problems, relativizations and logics for complexity classes
Fields of Logic and Computation | 2010-09-03 | Paper |
Homomorphism preservation on quasi-wide classes
Journal of Computer and System Sciences | 2010-07-08 | Paper |
Properties of Almost All Graphs and Generalized Quantifiers
Fundamenta Informaticae | 2010-05-25 | Paper |
The monadic theory of finite representations of infinite words
Information Processing Letters | 2010-03-24 | Paper |
Parameterized Complexity Classes under Logical Reductions
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Modal characterisation theorems over special classes of frames
Annals of Pure and Applied Logic | 2009-10-09 | Paper |
Preservation under Extensions on Well-Behaved Finite Structures
SIAM Journal on Computing | 2009-08-20 | Paper |
Affine systems of equations and counting infinitary logic
Theoretical Computer Science | 2009-04-29 | Paper |
Separating Graph Logic from MSO
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
Model-Checking First-Order Logic: Automata and Locality
Computer Science Logic | 2009-03-05 | Paper |
The Power of Counting Logics on Restricted Classes of Finite Structures
Computer Science Logic | 2009-03-05 | Paper |
On preservation under homomorphisms and unions of conjunctive queries
Journal of the ACM | 2008-12-21 | Paper |
The Descriptive Complexity of Parity Games
Computer Science Logic | 2008-11-20 | Paper |
Finite Model Theory on Tame Classes of Structures
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
On Datalog vs. LFP
Automata, Languages and Programming | 2008-08-19 | Paper |
On the Descriptive Complexity of Linear Algebra
Logic, Language, Information and Computation | 2008-07-10 | Paper |
Choiceless polynomial time, counting and the Cai-Fürer-Immerman graphs
Annals of Pure and Applied Logic | 2008-03-28 | Paper |
DAG-Width and Parity Games
STACS 2006 | 2008-03-19 | Paper |
Model Theory Makes Formulas Large
Automata, Languages and Programming | 2007-11-28 | Paper |
Affine Systems of Equations and Counting Infinitary Logic
Automata, Languages and Programming | 2007-11-28 | Paper |
Generalising automaticity to modal properties of finite structures
Theoretical Computer Science | 2007-07-16 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Expressiveness and complexity of graph logic
Information and Computation | 2007-03-12 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
| Fixed-point logics and computation | 2006-08-16 | Paper |
Backtracking games and inflationary fixed points
Theoretical Computer Science | 2006-03-20 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Fixed-point Logics with Nondeterministic Choice
Journal Of Logic And Computation | 2003-11-10 | Paper |
Fixed Point Logics
The Bulletin of Symbolic Logic | 2003-01-13 | Paper |
| scientific article; zbMATH DE number 1841826 (Why is no real title available?) | 2002-12-04 | Paper |
| scientific article; zbMATH DE number 1302669 (Why is no real title available?) | 2000-05-17 | Paper |
| scientific article; zbMATH DE number 1392293 (Why is no real title available?) | 2000-01-24 | Paper |
A restricted second order logic for finite structures
Information and Computation | 1998-11-10 | Paper |
| scientific article; zbMATH DE number 1136099 (Why is no real title available?) | 1998-11-02 | Paper |
Elementary Properties of the Finite Ranks
Mathematical Logic Quarterly | 1998-09-27 | Paper |
Capturing Relativized Complexity Classes without Order
Mathematical Logic Quarterly | 1998-03-30 | Paper |
The expressive power of finitely many generalized quantifiers
Information and Computation | 1996-11-04 | Paper |
Infinitary logic and inductive definability over finite structures
Information and Computation | 1995-08-02 | Paper |
Generalized Quantifiers and Logical Reducibilities
Journal Of Logic And Computation | 1995-04-17 | Paper |
