Does co-NP have short interactive proofs?
Information Processing Letters
Graph isomorphism is in the low hierarchy
Journal of Computer and System Sciences
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
Journal of Algorithms
Embedding graphs in an arbitrary surface in linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On a New High Dimensional Weisfeiler-Lehman Algorithm
Journal of Algebraic Combinatorics: An International Journal
Moderately Exponential Bound for Graph Isomorphism
FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
Fixed-Point Logics on Planar Graphs
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Isomorphism of graphs with bounded eigenvalue multiplicity
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Isomorphism for graphs embeddable on the projective plane
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Isomorphism testing for graphs of bounded genus
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The first order definability of graphs with separators via the Ehrenfeucht game
Theoretical Computer Science - Game theory meets theoretical computer science
The first order definability of graphs: upper bounds for quantifier depth
Discrete Applied Mathematics
Graph and map isomorphism and all polyhedral embeddings in linear time
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Homology flows, cohomology cuts
Proceedings of the forty-first annual ACM symposium on Theory of computing
Minimum cuts and shortest homologous cycles
Proceedings of the twenty-fifth annual symposium on Computational geometry
Permutation group approach to association schemes
European Journal of Combinatorics
CFI Construction and Balanced Graphs
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Motorcycle graphs: canonical quad mesh partitioning
SGP '08 Proceedings of the Symposium on Geometry Processing
Hashing and canonicalizing Notation 3 graphs
Journal of Computer and System Sciences
From invariants to canonization in parallel
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements
Journal of Combinatorial Theory Series B
Sherali-Adams relaxations and indistinguishability in counting logics
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Global minimum cuts in surface embedded graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On graph isomorphism for restricted graph classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Testing graph isomorphism in parallel by playing a game
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Fixed-point definability and polynomial time on graphs with excluded minors
Journal of the ACM (JACM)
Finite model theory on tame classes of structures
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
The power of counting logics on restricted classes of finite structures
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Counting and sampling minimum cuts in genus g graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.01 |