Martin Fürer

Algorithms & Complexity · 1989–2007

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

Subfields

Whom Martin Fürer trusts overall

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

  1. Eugene M. Luks
  2. László Babai
  3. Alfred V. Aho
  4. Derek Gordon Corneil
  5. Peter J. Cameron

Who trusts Martin Fürer overall

  1. Andreas Björklund
  2. Christopher Morris
  3. Thore Husfeldt
  4. Zhengdao Chen
  5. Sandra Kiefer
  6. B. Douglas
  7. Keyulu Xu
  8. Martin Grohe
  9. Mikko Koivisto
  10. Sergei Evdokimov

Papers from Martin Fürer's perspective

Ordered by how strongly the researchers Martin Fürer trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Random Graph Isomorphism
  2. The Design and Analysis of Computer Algorithms
  3. Graph isomorphism problem
  4. The Art of Computer Programming
  5. Isomorphism of graphs of bounded valence can be tested in polynomial time
  6. On construction and identification of graphs
  7. The graph isomorphism disease
  8. A Note on the Graph Isomorphism counting Problem
  9. 6-Transitive graphs
  10. Canonical labeling of graphs

Their papers