No. Title Author Year
1 Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371) Bläser, Markus et al. 2023
2 Number of Variables for Graph Differentiation and the Resolution of GI Formulas Torán, Jacobo et al. 2022
3 Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space Torán, Jacobo et al. 2020
4 Algebraic Methods in Computational Complexity (Dagstuhl Seminar 18391) Bläser, Markus et al. 2019
5 Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable Arvind, Vikraman et al. 2018
6 Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411) Kabanets, Valentine et al. 2017
7 Parameterized Complexity of Small Weight Automorphisms Arvind, Vikraman et al. 2017
8 The Graph Isomorphism Problem (Dagstuhl Seminar 15511) Babai, László et al. 2016
9 Graph Isomorphism is not AC^0 reducible to Group Isomorphism Chattopadhyay, Arkadev et al. 2010
10 Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs Das, Bireswar et al. 2010
11 A note on the size of Craig Interpolants Schöning, Uwe et al. 2007
Current Page :
Number of result pages: 1
Number of documents: 11

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI