B. Douglas

Algorithms & Complexity · 2007–2011

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

Subfields

• Algorithms & Complexity — 29 citations into it
• Graph Learning — 10 citations into it; #222 of 693 by trust here, #606 by citations
• Computational Theory and Mathematics — 8 citations into it; #2,692 of 12,182 by trust here, #7,142 by citations
• Artificial Intelligence — 6 citations into it; #9,778 of 35,345 by trust here, #25,809 by citations

Whom B. Douglas trusts overall

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

1. László Babai
2. Peter J. Cameron
3. Shmuel Friedland
4. Jamie Smith
5. Gary L. Miller
6. Sergei Evdokimov
7. Ilia N. Ponomarenko
8. Amir Rahnamai Barghi
9. Oleg Pikhurko
10. Eugene M. Luks

Who trusts B. Douglas overall

1. Aditya Grover
2. Mathias Niepert
3. Keyulu Xu
4. Weihua Hu
5. Aaron Zweig
6. Mohamed Ahmed
7. Stefano Ermon
8. Jure Leskovec
9. Konstantin Kutzkov
10. Haggai Maron

Papers from B. Douglas's perspective

Ordered by how strongly the researchers B. Douglas 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. Symmetric squares of graphs
4. Canonical labeling of graphs
5. Coherent algebras and the graph isomorphism problem
6. Isomorphism of graphs with bounded eigenvalue multiplicity
7. Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements
8. The graph isomorphism disease
9. 6-Transitive graphs
10. Coherent configurations

Their papers

• The Weisfeiler-Lehman Method and Graph Isomorphism Testing (2011) — 67 citations
• A classical approach to the graph isomorphism problem using quantum walks (2007) — 117 citations