Behruz Tayfeh-Rezaie
2005–2013
A researcher in the Science corpus: 3 papers; trusts 2 researchers and is trusted by 2 researchers here, as inferred from the citation graph.
Whom Behruz Tayfeh-Rezaie trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Behruz Tayfeh-Rezaie overall
Papers from Behruz Tayfeh-Rezaie's perspective
Ordered by how strongly the researchers Behruz Tayfeh-Rezaie trusts endorse each paper. Same corpus, a different order for every researcher.
- Classification Algorithms for Codes and Designs
- Shifted simplicial complexes are Laplacian integral
- A Hadamard matrix of order 428
- A lower bound for the Laplacian eigenvalues of a graph—Proof of a conjecture by Guo
- A Note on the Graph Isomorphism counting Problem
- Permutation Group Algorithms
- An optimal lower bound on the number of variables for graph identification
- On the Foundations of Combinatorial Theory
- A Solution of the Isomorphism Problem for Circulant Graphs
- Isomorphism of graphs of bounded valence can be tested in polynomial time
Their papers
- A Hadamard matrix of order 428 (2005) — 168 citations
- Hadamard Matrices of Order 32 (2013) — 53 citations
- On the sum of Laplacian eigenvalues of graphs (2010) — 85 citations