| Current teams : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Former team : | ACASA |
| Publications ComplexNetworks | 2023 | 2024 | Total |
|---|---|---|---|
| Books | 0 | 0 | 0 |
| Edited books | 0 | 0 | 0 |
| Journal articles | 1 | 5 | 6 |
| Book chapters | 1 | 0 | 1 |
| Conference papers | 6 | 5 | 11 |
| Habilitations | 1 | 0 | 1 |
| Thesis | 2 | 0 | 2 |
- C. Bertrand, H. Klaudel, M. Latapy, F. Peschanski : “Pattern Matching in Link Streams: a Token-based Approach”, International Conference on Applications and Theory of Petri Nets and Concurrency, vol. 10877, Lecture Notes in Computer Science, Bratislava, Slovakia, pp. 227-247 [Bertrand 2018b]
- M. Danisch, N. Gaumont, J.‑L. GUILLAUME : “A Modular Overlapping Community Detection Algorithm: Investigating the ``From Local to Global'' Approach”, 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Paris, France, pp. 167-170 [Danisch 2018a]
- M. Danisch, O. Balalau, M. Sozio : “Listing k-cliques in Sparse Real-World Graphs”, WWW '18 Proceedings of the 2018 World Wide Web Conference, Lyon, France, pp. 589-598 [Danisch 2018b]
- M. Ghanem, C. Magnien, F. Tarissan : “Comparaison de mesures de centralité basées sur les plus courts chemins dans les réseaux dynamiques”, Revue des Nouvelles Technologies de l'Information, EGC 2018, Saint-Denis, France [Ghanem 2018b]
- M. Ghanem, C. Magnien, F. Tarissan : “How to exploit structural properties of dynamic networks to detect nodes with high temporal closeness”, Cologne-Twente Workshop on Graphs and Combinatorial Optimization 2018 (CTW'18), Paris, France [Ghanem 2018c]
- M. Latapy, T. Viard, C. Magnien : “Flots de liens et stream graphs pour la modélisation des interactions temporelles”, ALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Roscoff, France [Latapy 2018a]
- R. Poulain, F. Tarissan : “Quantifying the diversity in users activity: an example study on online music platforms”, SNAMS-2018 - The Fifth International Conference on Social Networks Analysis, Management and Security, Valence, Spain, pp. 3-10, (IEEE) [Poulain 2018]
- R. Tackx, F. Tarissan, J.‑L. GUILLAUME : “ComSim : A bipartite community detection algorithm using cycle and node's similarity”, Proceedings of Complex Networks 2017 (The Sixth International Conference on Complex Networks and Their Applications), vol. 689, Studies in Computational Intelligence, Lyon, France, pp. 278-289, (Springer) [Tackx 2018]
- T. Viard, R. Fournier‑S 'niehotta, C. Magnien, M. Latapy : “Discovering Patterns of Interest in IP Traffic Using Cliques in Bipartite Link Streams”, Springer Proceedings in Complexity, Complex Networks IX Proceedings of the 9th Conference on Complex Networks CompleNet 2018, Boston, United States, pp. 233-241 [Viard 2018b]
- A. Wilmet, T. Viard, M. Latapy, R. Lamarche‑Perrin : “Degree-based Outliers Detection within IP Traffic Modelled as a Link Stream”, 2018 Network Traffic Measurement and Analysis Conference (TMA), Vienna, Austria, pp. 1-8, (IEEE) [Wilmet 2018]