Monday
19
|
|
|
| 09.15 |
|
Welcome |
| 09.30-10.15 |
|
C. Cattuto, Networks of tag co-occurrence in collaborative tagging systems |
| 10.15-10.45 |
|
A. Capocci, Clustering and semantics of tagging networks |
| 10.45-11.15 |
|
coffee break |
| 11.15-12.00 |
|
F. Menczer, The Web Click Network |
| 12.00-12.30 |
|
A. Baldassarri, Emergent Community Structure in Social Tagging Systems |
| 12.30-14.30 |
|
Lunch |
| 14.30-15.15
|
|
MA. Serrano, Structural efficiency of percolation
landscapes in flow networks |
| 15.15-15.45
|
|
M. Weigt, Inference of gene-regulatory networks: A
statistical-physics approach |
| 15.45-16.15 |
|
coffee break |
|
16.15-16.45 |
|
D. Medini,
A simple
tool from a complex system: high-throughput,unsupervised generation of
Protein Families from the Protein Homology Network |
| 16.45-17.15
|
|
B. Kozma, Social models on adaptive networks |
| |
|
|
Tuesday 20
|
|
|
| 09.30-10.15 |
|
E. Kolaczyk, Network Filtering: Finding `Needles' in
Haystacks |
| 10.15-10.45
|
|
D. Bilò, Discovery of
Network Properties
with All-Shortest-Paths Queries |
| 10.45-11.15 |
|
coffee break |
| 11.15- 12.00
|
|
A. Clauset, The hierarchical decomposition of complex
networks |
| 12.00-12.30 |
|
L. Dall'Asta, Dynamic Exploration of Networks by traceroute: modelisation and biases |
| 12.30-14.30 |
|
Lunch |
| 14.30-15.15
|
|
S. Fortunato, A new fast algorithm to detect community
structure in networks |
| 15.15-16.00
|
|
Y. Shavitt, Building an Internet Distance Map at the PoP level |
| 16.00-16.30 |
|
O. P. Vyas, Data Mining in network settings |
| 16.30-17.00
|
|
coffee break |
| |
|
|
Wednesday 21
|
|
|
| 09.30-10.00
|
|
T. Stratiotis, An Energy-Fair Probabilistic Distributed
Communication Protocol on Sensor
Networks |
| 10.00-10.30
|
|
D. Volchenkov, Markov Processes and Spectral Analysis: A Way of Looking at Complex Urban Networks |
| 10.30-11.00 |
|
coffee break |
| 11.00-11.30
|
|
B. Markines, Bookmark Hierarchies and Collaborative Recommendation |
| 11.30 12.00
|
|
J. Cichon, How to improve the reliability of Chord? |