| Publication | Date of Publication | Type |
|---|
| Cutting planes width and the complexity of graph isomorphism refutations | 2024-11-26 | Paper |
| Cutting planes width and the complexity of graph isomorphism refutations | 2024-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6124972 | 2024-04-10 | Paper |
| Efficient parallel algorithms for some tree layout problems | 2023-12-12 | Paper |
| Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas | 2023-07-18 | Paper |
| Pure Nash equilibria in a generalization of congestion games allowing resource failures | 2023-06-15 | Paper |
| Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space | 2023-02-07 | Paper |
| Cops-Robber Games and the Resolution of Tseitin Formulas | 2022-12-05 | Paper |
| Graph isomorphism is low for PP | 2022-08-18 | Paper |
| Pure Nash equilibria in a generalization of congestion games allowing resource failures | 2022-06-01 | Paper |
| Parameterized complexity of small weight automorphisms and isomorphisms | 2022-01-18 | Paper |
| Solution-Graphs of Boolean Formulas and Isomorphism1 | 2021-12-09 | Paper |
| Reversible pebble games and the relation between tree-like and general resolution space | 2021-06-17 | Paper |
| Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967195 | 2019-07-03 | Paper |
| Cops-robber games and the resolution of Tseitin formulas | 2018-08-10 | Paper |
| Parameterized Complexity of Small Weight Automorphisms. | 2018-04-19 | Paper |
| A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy | 2017-08-04 | Paper |
| CNF and DNF succinct graph encodings | 2017-03-16 | Paper |
| A Tutorial on Time and Space Bounds in Tree-Like Resolution | 2016-09-22 | Paper |
| Solving linear equations parameterized by Hamming weight | 2016-09-07 | Paper |
| Solution-Graphs of Boolean Formulas and Isomorphism | 2016-09-05 | Paper |
| Sparse sets, approximable sets, and parallel queries to NP | 2016-06-16 | Paper |
| Solvable Group Isomorphism Is (Almost) in NP ∩ coNP | 2015-09-24 | Paper |
| Graph Isomorphism is Not AC0-Reducible to Group Isomorphism | 2015-09-24 | Paper |
| Solving Linear Equations Parameterized by Hamming Weight | 2015-09-15 | Paper |
| Succinct Encodings of Graph Isomorphism | 2014-03-31 | Paper |
| On the Resolution Complexity of Graph Non-isomorphism | 2013-08-05 | Paper |
| Restricted space algorithms for isomorphism on bounded treewidth graphs | 2012-10-11 | Paper |
| Graph isomorphism is not \(\mathrm{AC}^0\) reducible to group isomorphism | 2012-08-29 | Paper |
| Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs | 2012-01-23 | Paper |
| Reductions to graph isomorphism | 2010-08-13 | Paper |
| Paradigms for Fast Parallel Approximability | 2009-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396558 | 2009-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396000 | 2009-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3633739 | 2009-06-23 | Paper |
| A combinatorial characterization of treelike resolution space | 2009-04-28 | Paper |
| Reductions to Graph Isomorphism | 2008-04-24 | Paper |
| The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem | 2008-04-24 | Paper |
| Corrigendum to ``Completeness results for graph isomorphism | 2006-06-30 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| On the Hardness of Graph Isomorphism | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736833 | 2004-08-11 | Paper |
| Minimally unsatisfiable \(CNF\) formulas | 2003-09-14 | Paper |
| Completeness results for graph isomorphism. | 2003-08-19 | Paper |
| Optimal proof systems imply complete sets for promise classes | 2003-07-29 | Paper |
| Space bounds for resolution | 2003-01-14 | Paper |
| A nonadaptive NC checker for permutation group intersection | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501542 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945238 | 2000-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258575 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251059 | 2000-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259996 | 1999-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251071 | 1999-06-17 | Paper |
| Paradigms for Fast Parallel Approximability | 1999-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381398 | 1998-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4359460 | 1997-10-08 | Paper |
| Parallel approximation schemes for problems on planar graphs | 1997-03-25 | Paper |
| Computing functions with parallel queries to NP | 1997-02-28 | Paper |
| The power of the middle bit of a \(\#\)P function | 1996-11-04 | Paper |
| Complexity classes defined by counting quantifiers | 1994-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281499 | 1994-04-07 | 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 |
| https://portal.mardi4nfdi.de/entity/Q3974851 | 1992-06-26 | Paper |
| Self-reducible sets of small density | 1991-01-01 | Paper |
| Classes of bounded nondeterminism | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359759 | 1990-01-01 | Paper |
| On counting and approximation | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4730785 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3800016 | 1988-01-01 | Paper |
| On the complexity of computable real sequences | 1987-01-01 | Paper |
