Paul S. Bonsma

2013

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

Whom Paul S. Bonsma trusts overall

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

  1. Tommi A. Junttila
  2. Brendan D. McKay

Who trusts Paul S. Bonsma overall

  1. Muhan Zhang
  2. Kristian Kersting
  3. Sandra Kiefer

Papers from Paul S. Bonsma's perspective

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

  1. Canonical labeling of graphs
  2. An optimal lower bound on the number of variables for graph identification
  3. Random Graph Isomorphism
  4. Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs (Workshop on Algorithm Engineering and Experimentation)
  5. Practical graph isomorphism, II
  6. Permutation Group Algorithms
  7. Isomorphism of graphs of bounded valence can be tested in polynomial time
  8. On construction and identification of graphs
  9. The graph isomorphism disease
  10. A Note on the Graph Isomorphism counting Problem

Their papers