| Publication | Date of Publication | Type |
|---|
| The Weisfeiler-Leman algorithm and recognition of graph properties | 2023-03-22 | Paper |
| The complexity of generating test instances | 2022-11-09 | Paper |
| On the Weisfeiler-Leman dimension of fractional packing | 2022-10-13 | Paper |
| Graph isomorphism is low for PP | 2022-08-18 | Paper |
| Parameterized complexity of small weight automorphisms and isomorphisms | 2022-01-18 | 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 |
| 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 |
| Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable | 2020-05-27 | 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 |
| Reductions to sets of low information content | 2019-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967195 | 2019-07-03 | Paper |
| New collapse consequences of NP having small circuits | 2019-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4584888 | 2018-09-04 | Paper |
| Parameterized Complexity of Small Weight Automorphisms. | 2018-04-19 | Paper |
| The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs | 2018-03-21 | Paper |
| Graph isomorphism, color refinement, and compactness | 2017-10-18 | Paper |
| Circular-arc hypergraphs: rigidity via connectedness | 2017-03-15 | 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 |
| Solving linear equations parameterized by Hamming weight | 2016-09-07 | Paper |
| On the isomorphism problem for Helly circular-arc graphs | 2016-03-10 | Paper |
| On the Power of Color Refinement | 2015-09-29 | Paper |
| On Tinhofer’s Linear Programming Approach to Isomorphism Testing | 2015-09-16 | Paper |
| Solving Linear Equations Parameterized by Hamming Weight | 2015-09-15 | Paper |
| Interval graph representation with given interval and intersection lengths | 2015-08-24 | Paper |
| On the isomorphism problem for decision trees and decision lists | 2015-06-10 | Paper |
| Colored hypergraph isomorphism is fixed parameter tractable | 2015-03-02 | Paper |
| The parallel complexity of graph canonization under abelian group action | 2013-11-11 | Paper |
| Helly Circular-Arc Graph Isomorphism Is in Logspace | 2013-09-20 | Paper |
| On the Isomorphism Problem for Decision Trees and Decision Lists | 2013-08-16 | Paper |
| Interval Graph Representation with Given Interval and Intersection Lengths | 2013-03-21 | Paper |
| The isomorphism problem for \(k\)-trees is complete for logspace | 2012-10-11 | Paper |
| Approximate Graph Isomorphism | 2012-09-25 | Paper |
| COLORED HYPERGRAPH ISOMORPHISM is fixed parameter tractable | 2012-08-29 | Paper |
| Interval Graphs: Canonical Representations in Logspace | 2012-02-11 | Paper |
| Canonizing Hypergraphs under Abelian Group Action | 2011-08-17 | Paper |
| Proof systems that take advice | 2011-07-27 | Paper |
| Interval Graphs: Canonical Representation in Logspace | 2010-09-07 | Paper |
| Parameterized learnability of juntas | 2009-11-06 | Paper |
| The Isomorphism Problem for k-Trees Is Complete for Logspace | 2009-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396584 | 2009-09-19 | Paper |
| Nondeterministic functions and the existence of optimal proof systems | 2009-09-10 | Paper |
| Nondeterministic Instance Complexity and Proof Systems with Advice | 2009-04-02 | Paper |
| Parameterized Learnability of k-Juntas and Related Problems | 2008-08-19 | Paper |
| A Logspace Algorithm for Partial 2-Tree Canonization | 2008-06-05 | Paper |
| From Invariants to Canonization in Parallel | 2008-06-05 | Paper |
| The Space Complexity of k-Tree Isomorphism | 2008-05-27 | Paper |
| On Hypergraph and Graph Isomorphism with Bounded Color Classes | 2008-03-19 | Paper |
| A general dimension for query learning | 2007-08-23 | Paper |
| Logical Approaches to Computational Barriers | 2007-04-30 | Paper |
| Corrigendum to ``Completeness results for graph isomorphism | 2006-06-30 | Paper |
| The complexity of learning concept classes with polynomial general dimension | 2006-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736833 | 2004-08-11 | Paper |
| Average-case intractability vs. worst-case intractability | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472457 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472459 | 2004-08-04 | Paper |
| Completeness results for graph isomorphism. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420746 | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420747 | 2003-08-18 | Paper |
| Optimal proof systems imply complete sets for promise classes | 2003-07-29 | Paper |
| New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4528766 | 2001-10-07 | Paper |
| On pseudorandomness and resource-bounded measure | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501553 | 2001-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525694 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501542 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258579 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4260374 | 1999-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258583 | 1999-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259999 | 1999-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4256649 | 1999-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246757 | 1999-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218123 | 1998-11-11 | Paper |
| New Collapse Consequences of NP Having Small Circuits | 1998-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370034 | 1998-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336270 | 1997-05-12 | Paper |
| Monotonous and randomized reductions to sparse sets | 1997-04-29 | Paper |
| If NP has polynomial-size circuits, then MA=AM | 1997-02-28 | Paper |
| The power of the middle bit of a \(\#\)P function | 1996-11-04 | Paper |
| On the power of generalized Mod-classes | 1996-07-01 | Paper |
| Locating \(P\)/poly optimally in the extended low hierarchy | 1996-03-18 | Paper |
| Upper bounds for the complexity of sparse and tally descriptions | 1996-02-20 | Paper |
| ON HELPING AND INTERACTIVE PROOF SYSTEMS | 1995-10-29 | Paper |
| Complexity-Restricted Advice Functions | 1994-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281491 | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281505 | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273947 | 1993-12-08 | Paper |
| Graph isomorphism is low for PP | 1993-09-16 | Paper |
| Turing machines with few accepting computations and low sets for PP | 1992-09-27 | Paper |
| On counting and approximation | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3800016 | 1988-01-01 | Paper |
| The difference and truth-table hierarchies for NP | 1987-01-01 | Paper |
