Reid Andersen

	2009
25		Reid Andersen, Yuval Peres: Finding sparse cuts locally using evolving sets. STOC 2009: 235-244
24		Reid Andersen, Kumar Chellapilla: Finding Dense Subgraphs with Size Bounds. WAW 2009: 25-37
23		Chinmay Karande, Kumar Chellapilla, Reid Andersen: Speeding up algorithms on compressed web graphs. WSDM 2009: 272-281
22		Reid Andersen, Uriel Feige: Interchanging distance and capacity in probabilistic mappings CoRR abs/0907.3631: (2009)
	2008
21		Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Kamal Jain, Vahab S. Mirrokni, Shang-Hua Teng: Robust PageRank and locally computable spam detection features. AIRWeb 2008: 69-76
20		Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng: On the Stability of Web Crawling and Web Search. ISAAC 2008: 680-691
19		Reid Andersen: A local algorithm for finding dense subgraphs. SODA 2008: 1003-1009
18		Reid Andersen, Kevin J. Lang: An algorithm for improving graph partitions. SODA 2008: 651-660
17		Reid Andersen, Christian Borgs, Jennifer T. Chayes, Uriel Feige, Abraham D. Flaxman, Adam Kalai, Vahab S. Mirrokni, Moshe Tennenholtz: Trust-based recommendation systems: an axiomatic approach. WWW 2008: 199-208
16		Reid Andersen, Yuval Peres: Finding Sparse Cuts Locally Using Evolving Sets CoRR abs/0811.3779: (2008)
	2007
15		Kevin J. Lang, Reid Andersen: Finding dense and isolated submarkets in a sponsored search spending graph. CIKM 2007: 613-622
14		Reid Andersen, Fan R. K. Chung: Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm. TAMC 2007: 1-12
13		Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng: Local Computation of PageRank Contributions. WAW 2007: 150-165
12		Reid Andersen, Fan R. K. Chung, Kevin J. Lang: Local Partitioning for Directed Graphs Using PageRank. WAW 2007: 166-178
11		Reid Andersen, Fan R. K. Chung, Linyuan Lu: No-Three-in-Line-in-3D. Algorithmica 47(4): 379-397 (2007)
10		Reid Andersen, Fan R. K. Chung, Linyuan Lu: Drawing Power Law Graphs Using a Local/Global Decomposition. Algorithmica 47(4): 397 (2007)
9		Reid Andersen: Finding large and small dense subgraphs CoRR abs/cs/0702032: (2007)
8		Reid Andersen: A Local Algorithm for Finding Dense Subgraphs CoRR abs/cs/0702078: (2007)
7		Reid Andersen, Sebastian M. Cioaba: Spectral Densest Subgraph and Independence Number of a Graph. J. UCS 13(11): 1501-1513 (2007)
	2006
6		Reid Andersen, Fan R. K. Chung, Kevin J. Lang: Local Graph Partitioning using PageRank Vectors. FOCS 2006: 475-486
5		Reid Andersen, Kevin J. Lang: Communities from seed sets. WWW 2006: 223-232
	2005
4		Reid Andersen, Fan R. K. Chung, Linyuan Lu: Modeling the Small-World Phenomenon with Local Network Flow. Internet Mathematics 2(3): (2005)
	2004
3		Reid Andersen, Fan R. K. Chung, Lincoln Lu: Drawing Power Law Graphs. Graph Drawing 2004: 12-17
2		Reid Andersen, Fan R. K. Chung, Arunabha Sen, Guoliang Xue: On Disjoint Path Pairs with Wavelength Continuity Constraint in WDM Networks. INFOCOM 2004
1		Reid Andersen, Fan R. K. Chung, Lincoln Lu: Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract). WAW 2004: 19-30

Coauthor Index

1	Christian Borgs	[13] [17] [20] [21]
2	Jennifer T. Chayes	[13] [17] [20] [21]
3	Kumar Chellapilla	[23] [24]
4	Fan R. K. Chung (Fan Chung Graham)	[1] [2] [3] [4] [6] [10] [11] [12] [14]
5	Sebastian M. Cioaba	[7]
6	Uriel Feige	[17] [22]
7	Abraham D. Flaxman (Abraham Flaxman)	[17]
8	John E. Hopcroft	[13] [20] [21]
9	Kamal Jain	[21]
10	Adam Tauman Kalai (Adam Kalai)	[17]
11	Chinmay Karande	[23]
12	Kevin J. Lang	[5] [6] [12] [15] [18]
13	Lincoln Lu	[1] [3]
14	Linyuan Lu	[4] [10] [11]
15	Vahab S. Mirrokni (Seyed Vahab Mirrokni)	[13] [17] [20] [21]
16	Yuval Peres	[16] [25]
17	Arunabha Sen	[2]
18	Shang-Hua Teng	[13] [20] [21]
19	Moshe Tennenholtz	[17]
20	Guoliang Xue	[2]

Colors in the list of coauthors