| Publication | Date of Publication | Type |
|---|
Linear space data structures for finite groups with constant query-time
Algorithmica | 2024-05-30 | Paper |
The Isomorphism Problem of Power Graphs and a Question of Cameron
| 2023-05-30 | Paper |
Algorithms for the Minimum Generating Set Problem
| 2023-05-15 | Paper |
Linear Space Data Structures for Finite Groups with Constant Query-time
| 2023-03-03 | Paper |
Compact data structures for Dedekind groups and finite rings
| 2021-10-04 | Paper |
Nearly linear time isomorphism algorithms for some nonabelian group classes
Theory of Computing Systems | 2021-08-03 | Paper |
Space efficient representations of finite groups
Journal of Computer and System Sciences | 2020-09-07 | Paper |
Polynomial-time algorithm for isomorphism of graphs with clique-width at most three
Theoretical Computer Science | 2020-04-08 | Paper |
Succinct representations of finite groups
| 2020-01-30 | Paper |
Nearly linear time isomorphism algorithms for some nonabelian group classes
Computer Science – Theory and Applications | 2019-10-22 | Paper |
On structural parameterizations of firefighting
Theoretical Computer Science | 2019-06-06 | Paper |
On the parallel parameterized complexity of the graph isomorphism problem
| 2018-06-15 | Paper |
On structural parameterizations of firefighting
Lecture Notes in Computer Science | 2018-06-05 | Paper |
Zero knowledge and circuit minimization
Information and Computation | 2017-09-28 | Paper |
On structural parameterizations of graph motif and chromatic number
Algorithms and Discrete Applied Mathematics | 2017-04-07 | Paper |
CNF and DNF succinct graph encodings
Information and Computation | 2017-03-16 | Paper |
Polynomial-time algorithm for isomorphism of graphs with clique-width at most three
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Colored hypergraph isomorphism is fixed parameter tractable
Algorithmica | 2015-03-02 | Paper |
Logspace and FPT algorithms for graph isomorphism for subclasses of bounded tree-width graphs
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
Zero knowledge and circuit minimization
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Succinct Encodings of Graph Isomorphism
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Log-space algorithms for paths and matchings in \(k\)-trees
Theory of Computing Systems | 2013-12-02 | Paper |
The isomorphism problem for \(k\)-trees is complete for logspace
Information and Computation | 2012-10-11 | Paper |
Restricted space algorithms for isomorphism on bounded treewidth graphs
Information and Computation | 2012-10-11 | Paper |
Colored hypergraph isomorphism is fixed parameter tractable
| 2012-08-29 | Paper |
Log-space algorithms for paths and matchings in \(k\)-trees
| 2012-01-23 | Paper |
Restricted space algorithms for isomorphism on bounded treewidth graphs
| 2012-01-23 | Paper |
The Entropy Influence Conjecture Revisited
| 2011-10-19 | Paper |
Isomorphism and canonization of tournaments and hypertournaments
Journal of Computer and System Sciences | 2010-08-18 | Paper |
scientific article; zbMATH DE number 5604081 (Why is no real title available?)
| 2009-09-15 | Paper |
Aspects of Molecular Computing
Lecture Notes in Computer Science | 2009-05-14 | Paper |
SZK proofs for black-box group problems
Theory of Computing Systems | 2008-06-17 | Paper |
A Logspace Algorithm for Partial 2-Tree Canonization
Computer Science – Theory and Applications | 2008-06-05 | Paper |
The Space Complexity of k-Tree Isomorphism
Algorithms and Computation | 2008-05-27 | Paper |
On Isomorphism and Canonization of Tournaments and Hypertournaments
Algorithms and Computation | 2008-04-24 | Paper |
The Complexity of Black-Box Ring Problems
Lecture Notes in Computer Science | 2007-09-10 | Paper |
SZK Proofs for Black-Box Group Problems
Computer Science – Theory and Applications | 2007-05-02 | Paper |
