Search the dblp DataBase

Publications of Author

1. Reid Andersen, Fan R. K. Chung, Kevin J. Lang
   Local Graph Partitioning using PageRank Vectors. [Citation Graph (0, 0)][DBLP]
   FOCS, 2006, pp:475-486 [Conf]
   
2. Reid Andersen, Fan R. K. Chung, Lincoln Lu
   Drawing Power Law Graphs. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 2004, pp:12-17 [Conf]
   
3. Reid Andersen, Fan R. K. Chung, Arunabha Sen, Guoliang Xue
   On Disjoint Path Pairs with Wavelength Continuity Constraint in WDM Networks. [Citation Graph (0, 0)][DBLP]
   INFOCOM, 2004, pp:- [Conf]
   
4. Reid Andersen, Fan R. K. Chung, Lincoln Lu
   Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract). [Citation Graph (0, 0)][DBLP]
   WAW, 2004, pp:19-30 [Conf]
   
5. Reid Andersen, Kevin J. Lang
   Communities from seed sets. [Citation Graph (0, 0)][DBLP]
   WWW, 2006, pp:223-232 [Conf]
   
6. Reid Andersen, Fan Chung
   Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm. [Citation Graph (0, 0)][DBLP]
   TAMC, 2007, pp:1-12 [Conf]
   
7. Reid Andersen, Christian Borgs, Jennifer T. Chayes, John Hopcraft, Vahab S. Mirrokni, Shang-Hua Teng
   Local Computation of PageRank Contributions. [Citation Graph (0, 0)][DBLP]
   WAW, 2007, pp:150-165 [Conf]
   
8. Reid Andersen, Fan Chung, Kevin J. Lang
   Local Partitioning for Directed Graphs Using PageRank. [Citation Graph (0, 0)][DBLP]
   WAW, 2007, pp:166-178 [Conf]
   
9. Reid Andersen, Fan Chung, Linyuan Lu
   Drawing Power Law Graphs Using a Local/Global Decomposition. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2007, v:47, n:4, pp:397- [Journal]
   
10. Reid Andersen, Fan Chung, Linyuan Lu
    No-Three-in-Line-in-3D. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:4, pp:379-397 [Journal]
    
11. Reid Andersen
    Finding large and small dense subgraphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
    
12. Reid Andersen
    A Local Algorithm for Finding Dense Subgraphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
    
13. 
    Finding dense and isolated submarkets in a sponsored search spending graph. [Citation Graph (, )][DBLP]
    
    
14. 
    On the Stability of Web Crawling and Web Search. [Citation Graph (, )][DBLP]
    
    
15. 
    A local algorithm for finding dense subgraphs. [Citation Graph (, )][DBLP]
    
    
16. 
    An algorithm for improving graph partitions. [Citation Graph (, )][DBLP]
    
    
17. 
    Finding sparse cuts locally using evolving sets. [Citation Graph (, )][DBLP]
    
    
18. 
    Finding Dense Subgraphs with Size Bounds. [Citation Graph (, )][DBLP]
    
    
19. 
    Trust-based recommendation systems: an axiomatic approach. [Citation Graph (, )][DBLP]
    
    
20. 
    Robust PageRank and locally computable spam detection features. [Citation Graph (, )][DBLP]
    
    
21. 
    Speeding up algorithms on compressed web graphs. [Citation Graph (, )][DBLP]
    
    
22. 
    Finding Sparse Cuts Locally Using Evolving Sets [Citation Graph (, )][DBLP]
    
    
23. 
    Interchanging distance and capacity in probabilistic mappings [Citation Graph (, )][DBLP]