| Publication | Date of Publication | Type |
|---|
On a hierarchy of spectral isomorphism invariants
Computational Complexity | 2025-11-28 | Paper |
| On a hierarchy of spectral invariants for graphs | 2025-11-10 | Paper |
The Weisfeiler-Leman algorithm and recognition of graph properties
Lecture Notes in Computer Science | 2023-03-22 | Paper |
The complexity of generating test instances
Lecture Notes in Computer Science | 2022-11-09 | Paper |
On the Weisfeiler-Leman dimension of fractional packing
Information and Computation | 2022-10-13 | Paper |
Graph isomorphism is low for PP
STACS 92 | 2022-08-18 | Paper |
Parameterized complexity of small weight automorphisms and isomorphisms
Algorithmica | 2022-01-18 | Paper |
The Weisfeiler-Leman algorithm and recognition of graph properties
Theoretical Computer Science | 2021-11-18 | Paper |
Local WL invariance and hidden shades of regularity
Discrete Applied Mathematics | 2021-10-21 | Paper |
Identifiability of graphs with small color classes by the Weisfeiler-Leman algorithm
SIAM Journal on Discrete Mathematics | 2021-08-20 | Paper |
On the Weisfeiler-Leman dimension of fractional packing
Language and Automata Theory and Applications | 2020-07-27 | Paper |
On Weisfeiler-Leman invariance: subgraph counts and related graph properties
Journal of Computer and System Sciences | 2020-06-09 | Paper |
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable
(available as arXiv preprint) | 2020-05-27 | Paper |
The Weisfeiler-Leman Algorithm and Recognition of Graph Properties
(available as arXiv preprint) | 2020-05-18 | Paper |
On Weisfeiler-Leman invariance: subgraph counts and related graph properties
Fundamentals of Computation Theory | 2020-01-30 | Paper |
Reductions to sets of low information content (extended abstract)
Automata, Languages and Programming | 2019-12-04 | Paper |
| Lowness results: the next generation | 2019-07-03 | Paper |
New collapse consequences of NP having small circuits
Automata, Languages and Programming | 2019-01-10 | Paper |
| Around and beyond the isomorphism problem for interval graphs | 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
(available as arXiv preprint) | 2018-03-21 | Paper |
Graph isomorphism, color refinement, and compactness
Computational Complexity | 2017-10-18 | Paper |
Circular-arc hypergraphs: rigidity via connectedness
Discrete Applied Mathematics | 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
Journal of Discrete Algorithms | 2016-12-09 | Paper |
Solving the canonical representation and star system problems for proper circular-arc graphs in logspace
Journal of Discrete Algorithms | 2016-12-09 | Paper |
Solving linear equations parameterized by Hamming weight
Algorithmica | 2016-09-07 | Paper |
On the isomorphism problem for Helly circular-arc graphs
Information and Computation | 2016-03-10 | Paper |
On the power of color refinement
Fundamentals of Computation Theory | 2015-09-29 | Paper |
On Tinhofer's linear programming approach to isomorphism testing
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Solving linear equations parameterized by Hamming weight
Parameterized and Exact Computation | 2015-09-15 | Paper |
Interval graph representation with given interval and intersection lengths
Journal of Discrete Algorithms | 2015-08-24 | Paper |
On the isomorphism problem for decision trees and decision lists
Theoretical Computer Science | 2015-06-10 | Paper |
Colored hypergraph isomorphism is fixed parameter tractable
Algorithmica | 2015-03-02 | Paper |
The parallel complexity of graph canonization under abelian group action
Algorithmica | 2013-11-11 | Paper |
Helly circular-arc graph isomorphism is in logspace
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
On the isomorphism problem for decision trees and decision lists
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Interval graph representation with given interval and intersection lengths
Algorithms and Computation | 2013-03-21 | Paper |
The isomorphism problem for \(k\)-trees is complete for logspace
Information and Computation | 2012-10-11 | Paper |
Approximate graph isomorphism
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
| Colored hypergraph isomorphism is fixed parameter tractable | 2012-08-29 | Paper |
Interval graphs: canonical representations in logspace
SIAM Journal on Computing | 2012-02-11 | Paper |
Canonizing hypergraphs under abelian group action
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Proof systems that take advice
Information and Computation | 2011-07-27 | Paper |
Interval graphs: canonical representation in logspace
Automata, Languages and Programming | 2010-09-07 | Paper |
Parameterized learnability of juntas
Theoretical Computer Science | 2009-11-06 | Paper |
The Isomorphism Problem for k-Trees Is Complete for Logspace
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
| scientific article; zbMATH DE number 5605087 (Why is no real title available?) | 2009-09-19 | Paper |
Nondeterministic functions and the existence of optimal proof systems
Theoretical Computer Science | 2009-09-10 | Paper |
Nondeterministic Instance Complexity and Proof Systems with Advice
Language and Automata Theory and Applications | 2009-04-02 | Paper |
Parameterized Learnability of k-Juntas and Related Problems
Lecture Notes in Computer Science | 2008-08-19 | Paper |
A Logspace Algorithm for Partial 2-Tree Canonization
Computer Science – Theory and Applications | 2008-06-05 | Paper |
From Invariants to Canonization in Parallel
Computer Science – Theory and Applications | 2008-06-05 | Paper |
The Space Complexity of k-Tree Isomorphism
Algorithms and Computation | 2008-05-27 | Paper |
On Hypergraph and Graph Isomorphism with Bounded Color Classes
STACS 2006 | 2008-03-19 | Paper |
A general dimension for query learning
Journal of Computer and System Sciences | 2007-08-23 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Corrigendum to ``Completeness results for graph isomorphism
Journal of Computer and System Sciences | 2006-06-30 | Paper |
The complexity of learning concept classes with polynomial general dimension
Theoretical Computer Science | 2006-03-20 | Paper |
| scientific article; zbMATH DE number 2086379 (Why is no real title available?) | 2004-08-11 | Paper |
Average-case intractability vs. worst-case intractability
Information and Computation | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2080216 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080214 (Why is no real title available?) | 2004-08-04 | Paper |
Completeness results for graph isomorphism.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1966612 (Why is no real title available?) | 2003-08-18 | Paper |
| scientific article; zbMATH DE number 1966613 (Why is no real title available?) | 2003-08-18 | Paper |
Optimal proof systems imply complete sets for promise classes
Information and Computation | 2003-07-29 | Paper |
New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
| scientific article; zbMATH DE number 1563912 (Why is no real title available?) | 2001-10-07 | Paper |
On pseudorandomness and resource-bounded measure
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1500534 (Why is no real title available?) | 2001-06-13 | Paper |
| scientific article; zbMATH DE number 1555928 (Why is no real title available?) | 2001-01-24 | Paper |
| scientific article; zbMATH DE number 1500525 (Why is no real title available?) | 2000-09-04 | Paper |
| scientific article; zbMATH DE number 1335888 (Why is no real title available?) | 2000-05-04 | Paper |
| scientific article; zbMATH DE number 1333601 (Why is no real title available?) | 1999-09-19 | Paper |
| scientific article; zbMATH DE number 1335892 (Why is no real title available?) | 1999-09-13 | Paper |
| scientific article; zbMATH DE number 1332677 (Why is no real title available?) | 1999-09-08 | Paper |
| scientific article; zbMATH DE number 1318517 (Why is no real title available?) | 1999-08-08 | Paper |
| scientific article; zbMATH DE number 1301107 (Why is no real title available?) | 1999-06-15 | Paper |
| scientific article; zbMATH DE number 1222584 (Why is no real title available?) | 1998-11-11 | Paper |
New Collapse Consequences of NP Having Small Circuits
SIAM Journal on Computing | 1998-09-21 | Paper |
| scientific article; zbMATH DE number 1104167 (Why is no real title available?) | 1998-05-25 | Paper |
| scientific article; zbMATH DE number 1008510 (Why is no real title available?) | 1997-05-12 | Paper |
Monotonous and randomized reductions to sparse sets
RAIRO - Theoretical Informatics and Applications | 1997-04-29 | Paper |
If NP has polynomial-size circuits, then MA=AM
Theoretical Computer Science | 1997-02-28 | Paper |
The power of the middle bit of a \(\#\)P function
Journal of Computer and System Sciences | 1996-11-04 | Paper |
On the power of generalized Mod-classes
Mathematical Systems Theory | 1996-07-01 | Paper |
Locating \(P\)/poly optimally in the extended low hierarchy
Theoretical Computer Science | 1996-03-18 | Paper |
Upper bounds for the complexity of sparse and tally descriptions
Mathematical Systems Theory | 1996-02-20 | Paper |
ON HELPING AND INTERACTIVE PROOF SYSTEMS
International Journal of Foundations of Computer Science | 1995-10-29 | Paper |
Complexity-Restricted Advice Functions
SIAM Journal on Computing | 1994-05-10 | Paper |
| scientific article; zbMATH DE number 512798 (Why is no real title available?) | 1994-03-10 | Paper |
| scientific article; zbMATH DE number 512812 (Why is no real title available?) | 1994-03-10 | Paper |
| scientific article; zbMATH DE number 477971 (Why is no real title available?) | 1993-12-08 | Paper |
Graph isomorphism is low for PP
Computational Complexity | 1993-09-16 | Paper |
Turing machines with few accepting computations and low sets for PP
Journal of Computer and System Sciences | 1992-09-27 | Paper |
On counting and approximation
Acta Informatica | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4066859 (Why is no real title available?) | 1988-01-01 | Paper |
The difference and truth-table hierarchies for NP
RAIRO - Theoretical Informatics and Applications | 1987-01-01 | Paper |
On a Hierarchy of Spectral Invariants for Graphs
(available as arXiv preprint) | N/A | Paper |
