Due to the high quality and number of submitted papers, and to the length of most of them, we had to be quite selective. We finally accepted 7 out of 27 submitted papers (26 % acceptation rate):

• Exploring networks with traceroute-like probes: theory and simulations, by Luca Dall'Asta, Ignacio Alavrez-Hamelin, Alain Barrat, Alexei Vazquez and Alessandro Vespignani
• Broadcasting in unstructured peer-to-peer overlay networks, by Fred Annexstein, Kenneth Berman and Mijhalo Jovanovic
• Efficiently covering complex networks with cliques of similar vertices, by Michael Behrisch and Anusch Taraz
• Scalable percolation search on complex networks, by Nima Sarshar, Oscar Boykin and Vwani Roychowdhury
• D2B: a de Bruijn based content-addressable network, by Pierre Fraigniaud and Philippe Gauron
• Local heuristics and the emergence of spanning subgraphs in complex networks, by Alexandre O. Stauffer and Valmir C. Barbosa
• Could any graph be turned into a small-world?, by Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar and Nicolas Schabanel

Contact: Matthieu Latapy
matthieu.latapy@lip6.fr