2009 |
23 | EE | Reid Andersen,
Kumar Chellapilla:
Finding Dense Subgraphs with Size Bounds.
WAW 2009: 25-37 |
22 | EE | Chinmay Karande,
Kumar Chellapilla,
Reid Andersen:
Speeding up algorithms on compressed web graphs.
WSDM 2009: 272-281 |
2008 |
21 | EE | 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 | EE | 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 | EE | Reid Andersen:
A local algorithm for finding dense subgraphs.
SODA 2008: 1003-1009 |
18 | EE | Reid Andersen,
Kevin J. Lang:
An algorithm for improving graph partitions.
SODA 2008: 651-660 |
17 | EE | 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 | EE | Reid Andersen,
Yuval Peres:
Finding Sparse Cuts Locally Using Evolving Sets
CoRR abs/0811.3779: (2008) |
2007 |
15 | EE | Kevin J. Lang,
Reid Andersen:
Finding dense and isolated submarkets in a sponsored search spending graph.
CIKM 2007: 613-622 |
14 | EE | Reid Andersen,
Fan R. K. Chung:
Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm.
TAMC 2007: 1-12 |
13 | EE | 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 | EE | Reid Andersen,
Fan R. K. Chung,
Kevin J. Lang:
Local Partitioning for Directed Graphs Using PageRank.
WAW 2007: 166-178 |
11 | EE | Reid Andersen,
Fan R. K. Chung,
Linyuan Lu:
No-Three-in-Line-in-3D.
Algorithmica 47(4): 379-397 (2007) |
10 | EE | Reid Andersen,
Fan R. K. Chung,
Linyuan Lu:
Drawing Power Law Graphs Using a Local/Global Decomposition.
Algorithmica 47(4): 397 (2007) |
9 | EE | Reid Andersen:
Finding large and small dense subgraphs
CoRR abs/cs/0702032: (2007) |
8 | EE | Reid Andersen:
A Local Algorithm for Finding Dense Subgraphs
CoRR abs/cs/0702078: (2007) |
7 | EE | Reid Andersen,
Sebastian M. Cioaba:
Spectral Densest Subgraph and Independence Number of a Graph.
J. UCS 13(11): 1501-1513 (2007) |
2006 |
6 | EE | Reid Andersen,
Fan R. K. Chung,
Kevin J. Lang:
Local Graph Partitioning using PageRank Vectors.
FOCS 2006: 475-486 |
5 | EE | 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 | EE | Reid Andersen,
Fan R. K. Chung,
Lincoln Lu:
Drawing Power Law Graphs.
Graph Drawing 2004: 12-17 |
2 | EE | Reid Andersen,
Fan R. K. Chung,
Arunabha Sen,
Guoliang Xue:
On Disjoint Path Pairs with Wavelength Continuity Constraint in WDM Networks.
INFOCOM 2004 |
1 | EE | 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 |