Stefano Leonardi - Böcker

This book constitutes the refereed proceedings of the Third International Workshop on Algorithms and Models for the Web-Graph, WAW 2004, held in Rome, Italy in October 2004.The 14 revised full papers presented together with an invited paper were carefully reviewed and selected from 31 submissions. The papers address a variety of topics related to the study of the Web-graph including random graphs, local network flow, network models, traffic driven Web-graph modeling, embedded communities, Web data mining, personalization, page tank computation, hierarchical information networks, Web crawling, community detection, and network communities.

Information systems can be complex due to numerous factors including scale, decentralization, heterogeneity, mobility, dynamism, bugs and failures. Depl- ing, operating and maintaining such systems can be not only very di?cult, but also very costly. A ?urry of recent activity has been directed at this pr- lem, and future information systems are envisioned as self-con?guring, se- organizing,self-managingandself-repairing.Collectively,wecalltheseproperties self- properties. This book is a "spin-o?" of a by-invitation-only Bertinoro workshop on se- propertiesincomplexsystemswhichwasheldinsummer2004inBertinoro,Italy. The Self-star workshop brought together researchers and practitioners from d- ferent disciplines and with di?erent backgrounds to discuss complex information systems.Thethemeoftheworkshopwastoidentifytheconceptualandpractical foundationsformodeling,analyzingandachievingself- propertiesindistributed and networked systems. Partly based on these discussions, we solicited papers from the workshop participants and a set of invitees for this book.We sought original contributions in which authors explicitly take a position concerningrequirements,usefulness,potentialandlimitations oftechnologies for self- properties of complex systems. This position needed to be founded on - search results that were put clearly in context with respect to the position sta- ment. We strongly encouraged visionary statements, thought-provoking ideas, and exploratory results that will help the reader form her or his own opinions on the importance of self- properties in current and future complex information systems.

This volume contains the 75 contributed papers and the abstracts of the three invited lectures presented at the 13th Annual European Symposium on Al- rithms (ESA 2005), held in Palma de Mallorca, Spain, October 3-6, 2005. The threedistinguishedinvitedspeakerswereGiuseppeF.Italiano,CristopherMoore and Joseph (Se?) Naor. Since 2002,ESA has consisted of two tracks, with separate programcomm- tees, which dealt respectively with - the designandmathematicalanalysis ofalgorithms(the "DesignandAna- sis" track); - real-worldapplications, engineering and experimental analysis of algorithms (the "Engineering and Applications" track). Previous ESAs in the current two track format were held in Rome, Italy (2002);Budapest,Hungary(2003);andBergen,Norway(2004).Theproceedings of these symposia were published as Springer's LNCS volumes 2461, 2832, and 3221 respectively. Papers were solicited in all areas of algorithmic research, including but not limited to algorithmic aspects of networks, approximation and on-line al- rithms, computational biology, computational geometry, computational ?nance and algorithmic game theory, data structures, database and information - trieval, external memory algorithms, graph algorithms, graph drawing, machine learning, mobile computing, pattern matching and data compression, quantum computing, and randomized algorithms.The algorithms could be sequential, distributed, or parallel. Submissions were especially encouraged in the area of mathematical programming and operations research, including combinatorial optimization, integer programming, polyhedral combinatorics, and semide?nite programming.

The Workshop on Approximation Algorithms for Combinatorial Optimization Problems APPROX 2002 focused on algorithmic and complexity aspects ar- ing in the development of e?cient approximate solutions to computationally d- ?cult problems. It aimed, in particular, to foster cooperation among algorithmic and complexity researchers in the ?eld. The workshop, held at the University of Rome La Sapienza, Rome, Italy, was part of the ALGO 2002 event, in conju- tion with ESA 2002 and WABI 2002. We would like to thank the local organizers at the University of Rome La Sapienza for this opportunity. APPROX is an - nual meeting, with previous workshops in Aalborg, Berkeley, Saarbruc .. ken, and Berkeley. Previous proceedings appeared as LNCS 1444, 1671, 1913, and 2129. Topics of interest for APPROX 2002 were: design and analysis of approxi- tion algorithms, inapproximability results, on-line problems, randomization te- niques, average-case analysis, approximation classes, scheduling problems, ro- ing and ?ow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, applications to game theory, and other applications.The number of submitted papers to APPROX 2002 was 54 from which 20 papers were selected. This volume contains the selected papers together with abstracts of invited lectures by Yuval Rabani (Technion) and R.

This book constitutes the refereed proceedings of the 5th International Workshop on Internet and Network Economics, WINE 2009, held in Rome, Italy, in December 2009.The 34 regular and 29 short revised full papers presented together with 3 invited talks were carefully reviewed and selected from 142 submissions. The papers address various topics in theoretical computer science, networking and security, economics, mathematics, sociology, and management sciences devoted to the analysis of problems arising in the internet and the worldwide Web, such as auction algorithms, computational advertising, general and majority equilibrium, coalitions, collective action, economics aspects of security and privacy in distributed and network computing, algorithmic design and game theory, information economics, network games, price dynamics, and social networks.