Darren Strash

Statistical and Nonlinear Physics · 2010–2011

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

Subfields

• Statistical and Nonlinear Physics — 9 citations into it
• Computational Theory and Mathematics — 5 citations into it; #4,969 of 12,182 by trust here, #9,306 by citations
• Molecular Biology — 5 citations into it

Whom Darren Strash trusts overall

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

1. Jure Leskovec
2. Etsuji Tomita
3. David Eppstein
4. Mark Newman
5. Chris Stark
6. Jon M. Kleinberg
7. Akira Tanaka

Who trusts Darren Strash overall

1. Bradley Hayes
2. Jia Wang
3. David Eppstein
4. Brian Scassellati

Papers from Darren Strash's perspective

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

1. Emergence of Scaling in Random Networks
2. Arboricity and Subgraph Listing Algorithms
3. Graph evolution: Densification and shrinking diameters
4. BioGRID: a general repository for interaction datasets
5. New Algorithms for Fast Discovery of Association Rules
6. An O(m) Algorithm for Cores Decomposition of Networks
7. The worst-case time complexity for generating all maximal cliques and computational experiments (Theoretical Computer Science)
8. Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time (Exact Complexity of NP-hard Problems)
9. Collective dynamics of ‘small-world’ networks
10. ImageNet classification with deep convolutional neural networks

Their papers

• Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time (2010) — 404 citations
• Listing All Maximal Cliques in Large Sparse Real-World Graphs (2011) — 356 citations