Reid Andersen

David F. Gleich

Vahab S. Mirrokni

Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

2010

A local algorithm for finding dense subgraphs.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

WebCop: Locating Neighborhoods of Malware on the Web.

[BibT_eX]

[DOI]

Proceedings of the 3rd USENIX Workshop on Large-Scale Exploits and Emergent Threats, 2010

2009

Speeding Up Algorithms on Compressed Web Graphs.

[BibT_eX]

[DOI]

Chinmay Karande

Kumar Chellapilla

Internet Math., 2009

Interchanging distance and capacity in probabilistic mappings

[BibT_eX]

[DOI]

Uriel Feige

CoRR, 2009

Finding Dense Subgraphs with Size Bounds.

[BibT_eX]

[DOI]

Kumar Chellapilla

Proceedings of the Algorithms and Models for the Web-Graph, 6th International Workshop, 2009

Finding sparse cuts locally using evolving sets.

[BibT_eX]

[DOI]

Yuval Peres

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008

Local Partitioning for Directed Graphs Using PageRank.

[BibT_eX]

[DOI]

Internet Math., 2008

Local Computation of PageRank Contributions.

[BibT_eX]

[DOI]

Internet Math., 2008

Trust-based recommendation systems: an axiomatic approach.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on World Wide Web, 2008

An algorithm for improving graph partitions.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

On the Stability of Web Crawling and Web Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Robust PageRank and locally computable spam detection features.

[BibT_eX]

[DOI]

Proceedings of the AIRWeb 2008, 2008

2007

Spectral Densest Subgraph and Independence Number of a Graph.

[BibT_eX]

[DOI]

Sebastian M. Cioaba

J. Univers. Comput. Sci., 2007

Using PageRank to Locally Partition a Graph.

[BibT_eX]

[DOI]

Internet Math., 2007

Finding large and small dense subgraphs

[BibT_eX]

[DOI]

CoRR, 2007

Drawing Power Law Graphs Using a Local/Global Decomposition.

[BibT_eX]

[DOI]

Linyuan Lu

Algorithmica, 2007

No-Three-in-Line-in-3D.

[BibT_eX]

[DOI]

Linyuan Lu

Algorithmica, 2007

Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2007

Finding dense and isolated submarkets in a sponsored search spending graph.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, 2007

2006

Communities from seed sets.

[BibT_eX]

[DOI]

Proceedings of the 15th international conference on World Wide Web, 2006

Local Graph Partitioning using PageRank Vectors.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

Modeling the Small-World Phenomenon with Local Network Flow.

[BibT_eX]

[DOI]

Linyuan Lu

Internet Math., 2005

2004

Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract).

[BibT_eX]

[DOI]

Lincoln Lu

Proceedings of the Algorithms and Models for the Web-Graph: Third International Workshop, 2004

On Disjoint Path Pairs with Wavelength Continuity Constraint in WDM Networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Drawing Power Law Graphs.

[BibT_eX]

[DOI]