Erkal Selman

2015

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

Whom Erkal Selman trusts overall

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

  1. Jin-Yi Cai

Who trusts Erkal Selman overall

  1. Christopher Morris

Papers from Erkal Selman's perspective

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

  1. Random Graph Isomorphism
  2. An optimal lower bound on the number of variables for graph identification
  3. Practical graph isomorphism, II
  4. On the Power of Color Refinement
  5. An optimal lower bound on the number of variables for graph identification
  6. Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
  7. PEBBLE GAMES AND LINEAR EQUATIONS
  8. Canonical labelling of graphs in linear average time
  9. Canonical labeling of graphs
  10. A Note on the Graph Isomorphism counting Problem

Their papers