Tommi A. Junttila

Algorithms & Complexity · 2007

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

Subfields

Whom Tommi A. Junttila trusts overall

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

  1. Takunari Miyazaki
  2. László Babai
  3. Jin-Yi Cai
  4. Eugene M. Luks
  5. Á. Seress
  6. Mikhail E. Muzychuk
  7. Martin Fürer
  8. Petteri Kaski
  9. Neil Immerman

Who trusts Tommi A. Junttila overall

  1. Paul Tonelli
  2. Christoph Berkholz
  3. Jean-Baptiste Mouret
  4. Paul S. Bonsma
  5. Martin Grohe

Papers from Tommi A. Junttila's perspective

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

  1. Canonical labeling of graphs
  2. Isomorphism of graphs of bounded valence can be tested in polynomial time
  3. On construction and identification of graphs
  4. The graph isomorphism disease
  5. A Note on the Graph Isomorphism counting Problem
  6. Chaff: engineering an efficient SAT solver (Proceedings - Design Automation Conference)
  7. Permutation Group Algorithms
  8. An optimal lower bound on the number of variables for graph identification
  9. Classification Algorithms for Codes and Designs
  10. A Solution of the Isomorphism Problem for Circulant Graphs

Their papers