Call for papers

The World Wide Web has become part of our everyday life and information retrieval and data mining on the web is now of enormous practical interest. Some of the algorithms supporting these activities are based in whole or in part on viewing the web as a graph, induced in various ways by links among pages, links among hosts, or other similar concepts.

The aim of the first Workshop on Algorithms for the Web-Graph (WAW) is to further the understanding of these web-induced graphs, and stimulate the development of high-performance algorithms and applications that use the graph structure of the web.

This workshop is intended to foster an exchange of ideas among the diverse set of researchers already involved in this topic, but also act as an introduction for the larger theory community to the state of the art in this area.


Topics of interest include but are not limited to:


This one day workshop will be held in connection with FOCS 2002, on Saturday November 16, in Vancouver, British Columbia. See the FOCS website for logistics.

The workshop will consist of invited talks and solicited presentations plus a panel to discuss past and future directions.

There will be a special presentation by Raymie Stata (UC Santa Cruz and the Internet Archive ) regarding the Archive's plans to provide data and tools in support of Web graph studies. (Abstract )

There will be no proceedings but selected new results presented at this workshop will be invited for publication in a special forthcoming issue of Theoretical Computer Science devoted to Models and Algorithms for the Web. A hardcopy of all the presentations will be available to workshop participants.

Registration to the workshop is $25 and includes lunch and coffee breaks.

Organizing committee

The organizing committee consists of:


To participate, please submit a one-page abstract describing your intended contribution. We welcome both new and old results and surveys of relevant literature.