Reid Andersen Office: AP&M 6436 Email : [randerse] at math.ucsd.edu I am a graduate student in the mathematics department at UCSD. My advisor is Fan Chung Graham. My research interests include graph partitioning and community identification, local approximation algorithms, and algorithms and models for large networks. Curriculum Vitae Research Statement

Publications

1. Local graph partitioning using PageRank vectors.
   with Fan Chung and Kevin Lang. FOCS 2006. pdf
   

Full version of the paper:
Local graph partitioning using PageRank vectors.
Preprint, 2007. pdf

2. Finding large and small dense subgraphs.
   Preprint, 2007. Current version available on the ArXiv, at http://arxiv.org/abs/cs.DS/0702032.
3. A local algorithm for finding dense subgraphs.
   Preprint, 2007. Current version available on the ArXiv, at http://arxiv.org/abs/cs.DS/0702078
4. Rich isolated submarkets in sponsored search graphs.
   with Kevin Lang. Submitted to Third Workshop on Sponsored Search Auctions at WWW 2007.

5. Communities from seed sets.
   with Kevin Lang. WWW 2006. pdf

6. Modeling the small-world phenomenon with local network flow.
   with Fan Chung and Linyuan Lu. Internet Mathematics 2 (3), 2006. pdf

   Conference version:
   Analyzing the small world phenomenon using a hybrid model with local network flow
   with Fan Chung and Linyuan Lu. WAW 2004. pdf

7. Drawing power law graphs
   with Fan Chung and Linyuan Lu. 12th International Symposium on Graph Drawing 2004. pdf

Full version:
Drawing power law graphs using a local/global decomposition
with Fan Chung and Linyuan Lu. Preprint, to appear in Algorithmica special issue. pdf

8. On disjoint path pairs with wavelength continuity constraint in WDM networks
   with Fan Chung, Arunabha Sen, and Guoliang Xue. IEEE INFOCOM 2004. pdf