| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147412 | 2024-01-15 | Paper |
| A Faster Isomorphism Test for Graphs of Small Degree | 2023-12-19 | Paper |
| A Deep Dive into the Weisfeiler-Leman Algorithm (Invited Talk) | 2023-08-08 | Paper |
| Independence in Infinite Probabilistic Databases | 2023-04-27 | Paper |
| Simulating Logspace-Recursion with Logarithmic Quantifier Depth | 2023-04-25 | Paper |
| Isomorphism Testing for Graphs Excluding Small Minors | 2023-04-04 | Paper |
| Weisfeiler and Leman's Unlikely Journey from Graph Isomorphism to Neural Networks (Invited Talk). | 2023-02-07 | Paper |
| Infinite Probabilistic Databases | 2023-02-07 | Paper |
| Canonisation and Definability for Graphs of Bounded Rank Width | 2023-02-07 | Paper |
| Recent Advances on the Graph Isomorphism Problem | 2022-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5094118 | 2022-08-02 | Paper |
| Symmetry and Similarity (Invited Talk) | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091279 | 2022-07-21 | Paper |
| The Complexity of Homomorphism Indistinguishability | 2022-07-21 | Paper |
| Graph Similarity Based on Matrix Norms | 2022-06-30 | Paper |
| Graph Similarity and Approximate Isomorphism | 2021-08-04 | Paper |
| Lov\'asz Meets Weisfeiler and Leman | 2021-07-28 | Paper |
| An improved isomorphism test for bounded-tree-width graphs | 2021-07-28 | Paper |
| Logarithmic Weisfeiler-Leman Identifies All Planar Graphs | 2021-06-30 | Paper |
| An Improved Isomorphism Test for Bounded-tree-width Graphs | 2021-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5856407 | 2021-03-26 | Paper |
| Counting Bounded Tree Depth Homomorphisms | 2021-01-21 | Paper |
| Definable decompositions for graphs of bounded linear cliquewidth | 2021-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144626 | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5144627 | 2021-01-19 | Paper |
| Automorphism groups of graphs of bounded Hadwiger number | 2020-12-28 | Paper |
| A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory– | 2019-05-15 | Paper |
| A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus | 2019-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4625692 | 2019-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4645660 | 2019-01-10 | Paper |
| Coloring and Covering Nowhere Dense Graphs | 2018-10-31 | Paper |
| Constraint solving via fractional edge covers | 2018-10-30 | Paper |
| Bounds and algorithms for joins via fractional edge covers | 2018-10-18 | Paper |
| Linear Diophantine Equations, Group CSPs, and Graph Isomorphism | 2018-07-16 | Paper |
| Deciding First-Order Properties of Nowhere Dense Graphs | 2018-05-17 | Paper |
| Order Invariance on Decomposable Structures | 2018-04-23 | Paper |
| The hardness of embedding grids and walls | 2018-01-04 | Paper |
| Quasi-4-Connected Components | 2017-12-19 | Paper |
| Tight lower and upper bounds for the complexity of canonical colour refinement | 2017-08-15 | Paper |
| Where First-Order and Monadic Second-Order Logic Coincide | 2017-07-13 | Paper |
| Locality of order-invariant first-order formulas | 2017-06-13 | Paper |
| On first-order topological queries | 2017-06-13 | Paper |
| Descriptive Complexity, Canonisation, and Definable Graph Structure Theory | 2017-05-22 | Paper |
| Where First-Order and Monadic Second-Order Logic Coincide | 2017-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2963895 | 2017-02-21 | Paper |
| Colouring and Covering Nowhere Dense Graphs | 2016-10-21 | Paper |
| Computing with Tangles | 2016-06-23 | Paper |
| Tangled up in Blue (A Survey on Connectivity, Decompositions, and Tangles) | 2016-05-21 | Paper |
| Tangles and Connectivity in Graphs | 2016-04-13 | Paper |
| Query evaluation via tree-decompositions | 2015-12-07 | Paper |
| Lower bounds for processing data with few random accesses to external memory | 2015-11-11 | Paper |
| PEBBLE GAMES AND LINEAR EQUATIONS | 2015-11-09 | Paper |
| Deciding first-order properties of locally tree-decomposable structures | 2015-10-30 | Paper |
| Limitations of Algebraic Approaches to Graph Isomorphism Testing | 2015-10-27 | Paper |
| Is Polynomial Time Choiceless? | 2015-09-22 | Paper |
| Computing with Tangles | 2015-08-21 | Paper |
| Deciding First-Order Properties of Nowhere Dense Graphs | 2015-06-26 | Paper |
| Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs | 2015-06-02 | Paper |
| Isomorphism Testing for Graphs of Bounded Rank Width | 2015-05-14 | Paper |
| Computing crossing numbers in quadratic time | 2015-02-27 | Paper |
| When is the evaluation of conjunctive queries tractable? | 2015-02-27 | Paper |
| Choiceless Polynomial Time on Structures with Small Abelian Colour Classes | 2014-10-14 | Paper |
| Dimension Reduction via Colour Refinement | 2014-10-08 | Paper |
| Isomorphism testing for embeddable graphs through definability | 2014-09-26 | Paper |
| Algorithmic Meta Theorems for Sparse Graph Classes | 2014-06-24 | Paper |
| Finding topological subgraphs is fixed-parameter tractable | 2014-06-05 | Paper |
| Structure theorem and isomorphism test for graphs with excluded topological subgraphs | 2014-05-13 | Paper |
| Fixed-point definability and polynomial time on graphs with excluded minors | 2014-02-17 | Paper |
| Size Bounds and Query Plans for Relational Joins | 2013-11-14 | Paper |
| Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement | 2013-09-17 | Paper |
| L-Recursion and a new Logic for Logarithmic Space | 2013-04-09 | Paper |
| Pebble Games and Linear Equations | 2012-11-22 | Paper |
| L-Recursion and a new Logic for Logarithmic Space | 2012-09-18 | Paper |
| Enumerating homomorphisms | 2012-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389980 | 2012-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5390002 | 2012-04-24 | Paper |
| Randomisation and Derandomisation in Descriptive Complexity Theory | 2012-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3118384 | 2012-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3118386 | 2012-03-02 | Paper |
| A Complexity Dichotomy for Partition Functions with Mixed Signs | 2011-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3086928 | 2011-03-30 | Paper |
| Constraint satisfaction with succinctly specified relations | 2010-10-07 | Paper |
| Randomisation and Derandomisation in Descriptive Complexity Theory | 2010-09-03 | Paper |
| Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs | 2010-09-03 | Paper |
| Constraint solving via fractional edge covers | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579375 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576650 | 2010-07-30 | Paper |
| Fixed-Point Definability and Polynomial Time | 2009-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396009 | 2009-09-15 | Paper |
| Preservation under Extensions on Well-Behaved Finite Structures | 2009-08-20 | Paper |
| Database query processing using finite cursor machines | 2009-08-06 | Paper |
| The Complexity of Datalog on Linear Orders | 2009-04-29 | Paper |
| Testing Graph Isomorphism in Parallel by Playing a Game | 2009-03-12 | Paper |
| The Ackermann Award 2007 | 2009-03-05 | Paper |
| On tree width, bramble size, and expansion | 2009-01-21 | Paper |
| The complexity of homomorphism and constraint satisfaction problems seen from the other side | 2008-12-21 | Paper |
| Non-dichotomies in Constraint Satisfaction Complexity | 2008-08-19 | Paper |
| An Isomorphism Between Subexponential and Parameterized Complexity Theory | 2008-08-14 | Paper |
| On Parameterized Approximability | 2008-06-03 | Paper |
| Parameterized Approximability of the Disjoint Cycle Problem | 2007-11-28 | Paper |
| Model Theory Makes Formulas Large | 2007-11-28 | Paper |
| Hypertree width and related hypergraph invariants | 2007-11-21 | Paper |
| Model-Checking Problems as a Basis for Parameterized Intractability | 2007-10-11 | Paper |
| The succinctness of first-order logic on linear orders | 2007-10-11 | Paper |
| Bounded fixed-parameter tractability and reducibility | 2007-09-28 | Paper |
| The Structure of Tractable Constraint Satisfaction Problems | 2007-09-05 | Paper |
| Tight lower bounds for query processing on streaming and external memory data | 2007-07-16 | Paper |
| An analysis of the W*-hierarchy | 2007-07-09 | Paper |
| Computer Science Logic | 2007-06-21 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Large finite structures with few \(L^k\)-types | 2006-10-10 | Paper |
| Local tree-width, excluded minors, and approximation algorithms | 2006-06-27 | Paper |
| Parametrized complexity theory. | 2006-05-24 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits | 2006-01-10 | Paper |
| The complexity of partition functions | 2006-01-09 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Machine-based methods in parameterized complexity theory | 2005-06-30 | Paper |
| Comparing the succinctness of monadic query languages over finite trees | 2005-03-21 | Paper |
| The Parameterized Complexity of Counting Problems | 2005-02-21 | Paper |
| Learnability and definability in trees and similar structures | 2005-01-25 | Paper |
| An existential locality theorem | 2004-11-22 | Paper |
| Computing crossing numbers in quadratic time | 2004-11-22 | Paper |
| The complexity of first-order and monadic second-order logic revisited | 2004-11-18 | Paper |
| Describing parameterized complexity classes | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736854 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736878 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473259 | 2004-08-04 | Paper |
| Reachability and connectivity queries in constraint databases | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783304 | 2002-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762493 | 2002-01-09 | Paper |
| Fixed-Parameter Tractability, Definability, and Model-Checking | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525283 | 2001-01-22 | Paper |
| On fixed-point logic with counting | 2001-01-14 | Paper |
| Equivalence in finite-variable logics is complete for polynomial time | 2000-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945215 | 2000-03-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938635 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936131 | 2000-01-24 | Paper |
| Finite Variable Logics in Descriptive Complexity Theory | 1999-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218934 | 1999-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218118 | 1998-11-11 | Paper |
| Existential least fixed-point logic and its relatives | 1997-06-10 | Paper |
| Arity hierarchies | 1997-04-21 | Paper |
| Some Remarks on Finite Löwenheim‐Skolem Theorems | 1997-03-19 | Paper |
| A double arity hierarchy theorem for transitive closure logic | 1996-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4866342 | 1996-03-04 | Paper |
| Complete problems for fixed-point logics | 1995-11-28 | Paper |
