Current teams : | ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
Former team : | Phare |
Publications ComplexNetworks | 2017 | 2018 | 2019 | 2020 | 2021 | 2022 | 2023 | Total |
---|---|---|---|---|---|---|---|---|
Books | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 2 |
Edited books | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 |
Journal articles | 4 | 8 | 7 | 5 | 5 | 1 | 1 | 31 |
Book chapters | 3 | 0 | 1 | 0 | 0 | 0 | 1 | 5 |
Conference papers | 10 | 10 | 7 | 4 | 3 | 4 | 4 | 42 |
Habilitations | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 |
Theses | 0 | 4 | 2 | 3 | 0 | 0 | 1 | 10 |
- N. Gaumont, C. Magnien, M. Latapy : “Finding remarkably dense sequences of contacts in link streams”, Social Network Analysis and Mining, vol. 6 (1), pp. 87, (Springer) [Gaumont 2016b]
- K.‑W. Lim, S. Secci, L. Tabourier, B. Tebbani : “Characterizing and predicting mobile application usage”, Computer Communications, vol. 95, pp. 82-94, (Elsevier) [Lim 2016]
- L. Tabourier, A.‑S. Libert, R. Lambiotte : “Predicting links in ego-networks using temporal information”, EPJ Data Science, vol. 5 (1), pp. 1-16, (EDP Sciences) [Tabourier 2016]
- T. Viard, M. Latapy, C. Magnien : “Computing maximal cliques in link streams”, Theoretical Computer Science, vol. 609 (Part 1), pp. 245-252, (Elsevier) [Viard 2016]
- F. Viger, M. Latapy : “Efficient and simple generation of random simple connected graphs with prescribed degree sequence”, Journal of Complex Networks, vol. 4 (1), pp. 15-37, (Oxford University Press) [Viger 2016]