Volume 1 (2003–2004)
All Volumes
Volume 1, Issue 1
Robustness and Vulnerability of Scale-Free Random Graphs
by Béla Bollobás and Oliver Riordan
Detecting a Network Failure
by Jon Kleinberg
Crawling on Simple Models of Web Graphs
by Colin Cooper and Alan Frieze
The Average Distance in a Random Graph with Given Expected Degrees
by Fan Chung and Linyuan Lu
Algorithmic Challenges in Web Search Engines
by Monika R. Henzinger
Volume 1, Issue 2
An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents
by Aaron Archer, Christos Papadimitriou, Kunal Talwar, and Eva Tardos
Smaller Explicit Superconcentrators
by Noga Alon and Michael Capabo
Admission Control to Minimize Rejections
by Avrim Blum, Adam Kalai, and Jon Kleinberg
Guessing Secrets with Inner Product Questions
by Fan Chung, Ronald Graham, and Linyuan Lu
Infinite Limits of Copying Models of the Web Graph
by Anthony Bonato and Jeanette Janssen
Coupling Scale-Free and Classical Random Graphs
by Béla Bollobás and Oliver Riordan
A Brief History of Generative Models for Power Law and Lognormal Distributions
by Michael Mitzenmacher
Volume 1, Issue 3
The Spectra of Random Graphs with Given Expected Degrees
by Fan Chung, Linyuan Lu, and Van Vu
Link Evolution: Analysis and Algorithms
by Steve Chien, Cynthia Dwork, Ravi Kumar, Daniel R. Simon, and D. Sivakumar
Dynamic Models for File Sizes and Double Pareto Distributions
by Michael Mitzenmacher
Surveys:
Deeper Inside PageRank
by Amy N. Langville and Carl D. Meyer
Volume 1, Issue 4
Graph Clustering and Minimum Cut Trees
by Gary William Flake, Robert E. Tarjan, and Kostas Tsioutsiouliklis
Coupling Online and Offline Analyses for Random Power Law Graphs
by Fan Chung and Linyuan Lu
Random Deletion in a Scale-Free Random Graph Process
by Colin Cooper, Alan Frieze, and Juan Vera
Surveys:
Network Applications of Bloom Filters: A Survey
by Andrei Broder and Michael Mitzenmacher
