David Eppstein

Statistical and Nonlinear Physics · 2000–2011

A researcher in the Science corpus: 3 papers; trusts 9 researchers and is trusted by 13 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; #2,909 of 12,182 by trust here, #6,798 by citations
• Molecular Biology — 5 citations into it

Whom David Eppstein trusts overall

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

1. Jure Leskovec
2. Etsuji Tomita
3. Chris Stark
4. David S. Johnson
5. Mark Newman
6. Jon M. Kleinberg
7. Akira Tanaka
8. Maarten Löffler
9. Mohammed J. Zaki
10. Kazuhisa Makino

Who trusts David Eppstein overall

1. Eiman Mohammed Alotaibi
2. Bradley Hayes
3. Jia Wang
4. Biswanath Mukherjee
5. Heng Yang
6. Brian Scassellati
7. James Cheng
8. Darren Strash
9. Leland Wilkinson
10. Jingnan Shi

Papers from David Eppstein's perspective

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

1. Arboricity and Subgraph Listing Algorithms
2. Emergence of Scaling in Random Networks
3. Graph evolution: Densification and shrinking diameters
4. The NP-Completeness Column: An Ongoing Guide
5. BioGRID: a general repository for interaction datasets
6. AND T
7. New Algorithms for Fast Discovery of Association Rules
8. An O(m) Algorithm for Cores Decomposition of Networks
9. Long Short-Term Memory
10. The worst-case time complexity for generating all maximal cliques and computational experiments (Theoretical Computer Science)

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
• Spanning Trees and Spanners (2000) — 347 citations