| Publication | Date of Publication | Type |
|---|
| Canonization of a random graph by two matrix-vector multiplications | 2025-01-06 | Paper |
| On isomorphism-invariant antistochastic properties of random graphs | 2024-12-18 | Paper |
| Canonization of a random circulant graph by counting walks | 2024-07-19 | Paper |
| The Complexity of Drawing Graphs on Few Lines and Few Planes | 2023-09-20 | Paper |
| On anti-stochastic properties of unlabeled graphs | 2023-05-05 | Paper |
| The Weisfeiler-Leman algorithm and recognition of graph properties | 2023-03-22 | Paper |
| Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm | 2023-02-07 | Paper |
| On the Weisfeiler-Leman dimension of fractional packing | 2022-10-13 | Paper |
| The Weisfeiler-Leman algorithm and recognition of graph properties | 2021-11-18 | Paper |
| Local WL invariance and hidden shades of regularity | 2021-10-21 | Paper |
| Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm | 2021-08-20 | Paper |
| Drawing graphs on few lines and few planes | 2020-11-12 | Paper |
| On the Weisfeiler-Leman dimension of fractional packing | 2020-07-27 | Paper |
| On Weisfeiler-Leman invariance: subgraph counts and related graph properties | 2020-06-09 | Paper |
| On the First-Order Complexity of Induced Subgraph Isomorphism | 2020-05-26 | Paper |
| The Weisfeiler-Leman Algorithm and Recognition of Graph Properties | 2020-05-18 | Paper |
| On Weisfeiler-Leman invariance: subgraph counts and related graph properties | 2020-01-30 | Paper |
| The descriptive complexity of subgraph isomorphism without numerics | 2019-07-04 | Paper |
| Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism | 2019-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3121527 | 2019-03-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4584888 | 2018-09-04 | Paper |
| Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth | 2018-04-23 | Paper |
| Graph isomorphism, color refinement, and compactness | 2017-10-18 | Paper |
| On the speed of constraint propagation and the time complexity of arc consistency testing | 2017-10-11 | Paper |
| The complexity of drawing graphs on few lines and few planes | 2017-09-22 | Paper |
| The descriptive complexity of subgraph isomorphism without numerics | 2017-08-22 | Paper |
| Circular-arc hypergraphs: rigidity via connectedness | 2017-03-15 | Paper |
| Drawing Graphs on Few Lines and Few Planes | 2017-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2958513 | 2017-02-02 | Paper |
| Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace | 2017-01-26 | Paper |
| Solving the canonical representation and star system problems for proper circular-arc graphs in logspace | 2016-12-09 | Paper |
| On the isomorphism problem for Helly circular-arc graphs | 2016-03-10 | Paper |
| On the Power of Color Refinement | 2015-09-29 | Paper |
| Bounds for the Quantifier Depth in Finite-Variable Logics | 2015-09-17 | Paper |
| On Tinhofer’s Linear Programming Approach to Isomorphism Testing | 2015-09-16 | Paper |
| REMARKS ON A QUERY-BASED VARIANT OF THE PARALLEL REPETITION THEOREM | 2015-04-30 | Paper |
| Helly Circular-Arc Graph Isomorphism Is in Logspace | 2013-09-20 | Paper |
| On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing | 2013-09-20 | Paper |
| Logical complexity of graphs: a survey | 2012-03-02 | Paper |
| Interval Graphs: Canonical Representations in Logspace | 2012-02-11 | Paper |
| On Collinear Sets in Straight-Line Drawings | 2011-12-16 | Paper |
| Untangling planar graphs from a specified vertex position-Hard cases | 2011-05-17 | Paper |
| Fermat’s Spiral and the Line Between Yin and Yang | 2010-12-14 | Paper |
| Interval Graphs: Canonical Representation in Logspace | 2010-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576654 | 2010-07-30 | Paper |
| Testing Graph Isomorphism in Parallel by Playing a Game | 2009-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3607789 | 2009-02-28 | Paper |
| From Invariants to Canonization in Parallel | 2008-06-05 | Paper |
| On the obfuscation complexity of planar graphs | 2008-05-28 | Paper |
| On the Computational Complexity of the Forcing Chromatic Number | 2008-03-28 | Paper |
| Decomposable graphs and definitions with no quantifier alternation | 2007-11-21 | Paper |
| Planar Graphs: Logical Complexity and Parallel Isomorphism Tests | 2007-09-03 | Paper |
| How Much Work Does It Take To Straighten a Plane Graph Out? | 2007-07-23 | Paper |
| First-Order Definability of Trees and Sparse Random Graphs | 2007-05-15 | Paper |
| The first order definability of graphs: Upper bounds for quantifier depth | 2007-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5487253 | 2006-09-19 | Paper |
| On the logical complexity of convex polygon dissections | 2006-07-21 | Paper |
| Succinct definitions in the first order theory of graphs | 2006-04-28 | Paper |
| Descriptive complexity of finite structures: Saving the quantifier rank | 2006-01-16 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| The first order definability of graphs with separators via the Ehrenfeucht game | 2005-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4676817 | 2005-05-20 | Paper |
| How complex are random graphs in first order logic? | 2005-04-21 | Paper |
| On the lengths of symmetry breaking-preserving games on graphs | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4455756 | 2004-03-16 | Paper |
| Error reduction by parallel repetition - a negative result | 2003-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407715 | 2002-01-01 | Paper |
| Arthur-Merlin games in Boolean decision trees | 2000-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258571 | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4500965 | 2000-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4936140 | 2000-01-25 | Paper |
| Towards the parallel repetition conjecture | 1997-02-27 | Paper |
| On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE | 1995-11-29 | Paper |
| On a Hierarchy of Spectral Invariants for Graphs | N/A | Paper |
