Sergei Evdokimov

Algorithms & Complexity · with Ponomarenko · 1995–1998

A researcher in the Science corpus: 2 papers; trusts 6 researchers and is trusted by 2 researchers here, as inferred from the citation graph.

Subfields

Whom Sergei Evdokimov trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Jin-Yi Cai
  2. László Babai
  3. Eugene M. Luks
  4. Martin Fürer
  5. Shmuel Friedland
  6. Neil Immerman

Who trusts Sergei Evdokimov overall

  1. B. Douglas
  2. Keyulu Xu
  3. Jamie Smith
  4. Weihua Hu
  5. Jure Leskovec

Papers from Sergei Evdokimov's perspective

Ordered by how strongly the researchers Sergei Evdokimov trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Isomorphism of graphs of bounded valence can be tested in polynomial time
  2. Canonical labeling of graphs
  3. An optimal lower bound on the number of variables for graph identification
  4. Coherent algebras and the graph isomorphism problem
  5. Isomorphism of graphs with bounded eigenvalue multiplicity
  6. Random Graph Isomorphism
  7. Graph isomorphism problem
  8. On construction and identification of graphs
  9. The graph isomorphism disease
  10. A Note on the Graph Isomorphism counting Problem

Their papers