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 |
- M. Danisch, J.‑L. GUILLAUME, B. Le Grand : “DĂ©plier la structure communautaire d’un rĂ©seau en mesurant la proximitĂ© aux reprĂ©sentants de communautĂ©”, Actes de MARAMI 2015, NĂ®mes, France [Danisch 2015]
- N. DuguĂ©, A. Perez, M. Danisch, F. Bridoux, A. Daviau, T. Kolubako, S. Munier, H. Durbano : “A reliable and evolutive web application to detect social capitalists”, ASONAM 2015, Paris, France [DuguĂ© 2015]
- N. Gaumont, F. Queyroi, C. Magnien, M. Latapy : “Expected Nodes: A Quality Function for the Detection of Link Communities”, Complex Networks VI, vol. 597, Studies in Computational Intelligence, New-York, United States, pp. 57-64 [Gaumont 2015]
- C. Magnien, F. Tarissan : “Time Evolution of the Importance of Nodes in dynamic Networks”, Proceedings of the International Symposium on Foundations and Applications of Big Data Analytics (FAB), in conjunction with ASONAM, Paris, France [Magnien 2015]
- A. Malatras, E. Freyssinet, L. Beslay : “Mobile botnets taxonomy and challenges”, European Intelligence and Security Informatics Conference (EISIC), Manchester, United Kingdom, pp. 149-152, (IEEE) [Malatras 2015]
- A. Nzekon Nzeko'O, M. Latapy, M. Tchuente : “Social Network Analysis of Developers' and Users' Mailing Lists of Some Free Open Source Software”, 2015 IEEE International Congress on Big Data (BigData Congress), New York City, United States, pp. 728-732, (IEEE) [Nzekon Nzeko'O 2015]
- E. Orsini : “DĂ©tection de communautĂ©s dans les flots de liens par optimisation de la modularitĂ©”, Actes de MARAMI 2015, NĂ®mes, France [Orsini 2015]
- S. Pramanik, M. Danisch, Q. Wang, B. Mitra : “An empirical approach towards an efficient “whom to mention?” Twitter app”, Twitter for Research, 1st International & Interdisciplinary Conference, Lyon, France [Pramanik 2015a]
- S. Pramanik, Q. Wang, M. Danisch, M. Sharma, S. Bandi, J.‑L. GUILLAUME, S. Raux, B. Mitra : “Augmenter les retweets sur Twitter : comment tirer parti des mentions ?”, Actes de MARAMI 2015, NĂ®mes, France [Pramanik 2015b]
- L. Tabourier, A.‑S. Libert, R. Lambiotte : “RankMerging: Apprentissage supervisĂ© de classements pour la prĂ©diction de liens dans les grands rĂ©seaux sociaux”, Actes d'EGC 2015, Luxembourg, Luxembourg [Tabourier 2015]
- R. Tackx, J.‑L. GUILLAUME, F. Tarissan : “Revealing intricate properties of communities in the bipartite structure of online social networks”, Proceedings of the IEEE 9th International Conference on Research Challenges in Information Science (RCIS), Athènes, Greece, pp. 321-326, (IEEE) [Tackx 2015]
- F. Tarissan : “Comparing Overlapping Properties of Real Bipartite Networks”, Proceedings of ISCS 2014: Interdisciplinary Symposium on Complex Systems, vol. 14, Emergence, Complexity and Computation, Florence, Italy, pp. 309-318 [Tarissan 2015a]
- F. Tarissan, R. Nollez‑Goldbach : “Temporal properties of legal decision networks: a case study from the International Criminal Court”, Frontiers in Artificial Intelligence and Applications, Braga, Portugal [Tarissan 2015b]
- T. Viard, M. Latapy, C. Magnien : “Calcul de cliques maximales dans les flots de liens”, 17èmes Rencontres Francophones sur les Aspects Algorithmiques des TĂ©lĂ©communications (AlgoTel 2015), Beaune, France [Viard 2015a]
- T. Viard, M. Latapy, C. Magnien : “Revealing contact patterns among high-school students using maximal cliques in link streams”, 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), Paris, France, pp. 1517-1522, (IEEE) [Viard 2015b]