Publications 2006-2024

• 2024
  • A. Baudin, C. Magnien, L. Tabourier : “BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs”, (2024)
  • A. Baudin, C. Magnien, L. Tabourier : “Faster maximal clique enumeration in large real-world link streams”, Journal of Graph Algorithms and Applications, vol. 28 (1), pp. 149-178, (Brown University) (2024)
• 2023
  • A. Baudin, L. Tabourier, C. Magnien : “LSCPM: communities in massive real-world Link Streams by Clique Percolation Method”, 30^th International Symposium on Temporal Representation and Reasoning (TIME 2023), vol. 278, Leibniz International Proceedings in Informatics (LIPIcs), Athens, Greece (2023)
  • F. Simard, C. Magnien, M. Latapy : “Computing Betweenness Centrality in Link Streams”, Journal of Graph Algorithms and Applications, vol. 27 (3), pp. 195-217, (Brown University) (2023)
  • F. Lécuyer, L. Jachiet, C. Magnien, L. Tabourier : “Tailored vertex ordering for faster triangle listing in large graphs”, Proceedings of the SIAM Symposium on Algorithm Engineering and Experiments (ALENEX), Florence, Italy (2023)
  • A. Baudin, C. Magnien, L. Tabourier : “Énumération efficace des cliques maximales dans les flots de liens réels massifs”, Extraction et Gestion des Connaissances (EGC 2023), vol. RNTI-E-39, Revue des Nouvelles Technologies de l'Information, Lyon, France, pp. 139-150 (2023)
• 2022
  • A. Baudin, M. Danisch, S. Kirgizov, C. Magnien, M. Ghanem : “Clique percolation method: memory efficient almost exact communities”, The 17^th International Conference on Advanced Data Mining and Applications (ADMA), Syndey, Australia (2022)
• 2021
  • A. Giovanidis, B. Baynat, C. Magnien, A. Vendeville : “Ranking Online Social Users by their Influence”, IEEE/ACM Transactions on Networking, (IEEE/ACM) (2021)
• 2020
  • P. Crescenzi, C. Magnien, A. Marino : “Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs”, Algorithms, vol. 13 (9), pp. 211, (MDPI) (2020)
  • L. Rannou, C. Magnien, M. Latapy : “Strongly Connected Components in Stream Graphs: Computation and Experimentations”, The 9^th International Conference on Complex Networks and their Applications (Complex Networks 2020), Madrid (virtual), Spain (2020)
• 2019
  • P. Crescenzi, C. Magnien, A. Marino : “Approximating the Temporal Neighbourhood Function of Large Temporal Graphs”, Algorithms, vol. 12 (10), pp. 211, (MDPI) (2019)
  • M. Latapy, C. Magnien, T. Viard : “Weighted, Bipartite, or Directed Stream Graphs for the Modeling of Temporal Networks”, chapter in Temporal Network Theory, Computational Social Sciences, pp. 49-64, (Springer) (2019)
• 2018
  • M. Latapy, T. Viard, C. Magnien : “Stream Graphs and Link Streams for the Modeling of Interactions over Time”, Social Networks Analysis and Mining, vol. 8 (1), pp. 61:1-61:29, (Springer) (2018)
  • M. Ghanem, C. Magnien, F. Tarissan : “Centrality metrics in dynamic networks: a comparison study”, IEEE Transactions on Network Science and Engineering, pp. 940-951, (IEEE) (2018)
  • M. Latapy, T. Viard, C. Magnien : “Flots de liens et stream graphs pour la modélisation des interactions temporelles”, ALGOTEL 2018 - 20^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Roscoff, France (2018)
  • T. Viard, C. Magnien, M. Latapy : “Enumerating maximal cliques in link streams with durations”, Information Processing Letters, vol. 133, pp. 44-48, (Elsevier) (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 9^th Conference on Complex Networks CompleNet 2018, Boston, United States, pp. 233-241 (2018)
  • 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 (2018)
  • 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 (2018)
• 2016
  • Ch. Huyghues‑Despointes, B.‑M. Bui‑Xuan, C. Magnien : “Forte ∆-connexité dans les flots de liens”, ALGOTEL 2016 - 18^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Bayonne, France (2016)
  • T. Viard, M. Latapy, C. Magnien : “Computing maximal cliques in link streams”, Theoretical Computer Science, vol. 609 (Part 1), pp. 245-252, (Elsevier) (2016)
  • 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) (2016)
• 2015
  • 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) (2015)
  • T. Viard, M. Latapy, C. Magnien : “Calcul de cliques maximales dans les flots de liens”, 17^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel 2015), Beaune, France (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 (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 (2015)
• 2014
  • R. Fournier, Th. Cholez, M. Latapy, I. Chrisment, C. Magnien, O. Festor, I. Daniloff : “Comparing Pedophile Activity in Different P2P Systems”, Social Sciences, vol. 3 (3), Special Issue on Contemporary Developments in Child Protection, pp. 314-325, (MDPI) (2014)
  • M. Latapy, A. Hamzaoui, C. Magnien : “Detecting Events in the Dynamics of Ego-centered Measurements of the Internet Topology”, Journal of Complex Networks, vol. 2 (1), pp. 38-59, (Oxford University Press) (2014)
• 2013
  • C. Magnien, A. Medem Kuatse, S. Kirgizov, F. Tarissan : “Towards realistic modeling of IP-level routing topology dynamics”, Networking science, vol. 3 (1-4), pp. 24-33 (2013)
  • S. Kirgizov, C. Magnien, F. Tarissan, A. Liu : “Studying the impact of measurement frequency on the IP-level routing topology dynamics”, Actes du Colloque sur le Traitement du Signal et des Images (GRETSI'13), Brest, France, pp. 1-4 (2013)
  • O. Allali, L. Tabourier, C. Magnien, M. Latapy : “Internal links and pairs as a new tool for the analysis of bipartite complex networks”, Social Network Analysis and Mining, vol. 3 (1), pp. 85-91, (Springer) (2013)
  • O. Allali, C. Magnien, M. Latapy : “Internal links prediction: a new approach for predicting links in bipartite graphs”, Intelligent Data Analysis, vol. 7 (1), pp. 5-25, (IOS Press) (2013)
  • M. Latapy, C. Magnien, R. Fournier : “Quantifying paedophile activity in a large P2P system”, Information Processing and Management, vol. 49 (1), pp. 248-263, (Elsevier) (2013)
• 2012
  • S. Heymann, M. Latapy, C. Magnien : “Outskewer: Using Skewness to Spot Outliers in Samples and Time Series”, Advances in Social Networks Analysis and Mining (ASONAM), 2012 IEEE/ACM International Conference on, Istanbul, Türkiye, pp. 527-534, (IEEE) (2012)
  • C. Magnien, A. Medem Kuatse, F. Tarissan : “Towards realistic modeling of IP-level routing topology dynamics”, 14^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), La Grande Motte, France, pp. 1-4 (2012)
  • A. Medem Kuatse, C. Magnien, F. Tarissan : “Impact of power-law topology on IP-level routing dynamics: Simulation results”, IEEE International Workshop on Network Science For Communication Networks (NetSciCom'12), Orlando, United States, pp. 220-225, (IEEE) (2012)
• 2011
  • O. Allali, C. Magnien, M. Latapy : “Link prediction in bipartite graphs using internal links and weighted projection”, third International Workshop on Network Science for Communication Networks (Netscicom 2011), In Conjuction with IEEE Infocom 2011., Shanghai, China, pp. 936-941, (IEEE) (2011)
  • C. Magnien, M. Latapy, J.‑L. GUILLAUME : “Impact of Random Failures and Attacks on Poisson and Power-Law Random Networks”, ACM Computing Surveys, vol. 43 (3), pp. 13, (Association for Computing Machinery) (2011)
  • F. Ouédraogo, C. Magnien : “Impact of Sources and Destinations on the Observed Properties of the Internet Topology”, Computer Communications, vol. 34 (5), pp. 670-679, (Elsevier) (2011)
  • M. Latapy, C. Magnien, R. Fournier : “Quantifying Paedophile Queries in a Large P2P System”, IEEE International Conference on Computer Communications INFOCOM (Mini-Conference), Shanghai, China, pp. 401-405, (IEEE) (2011)
  • L. Benamara, C. Magnien : “Removing bias due to finite measurement of dynamic systems: case study on P2P systems”, 13^es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France (2011)
  • M. Latapy, C. Magnien, F. Ouédraogo : “A Radar for the Internet”, Complex Systems, vol. 20 (1), pp. 23-30, (Complex Systems Publications, Inc.) (2011)
• 2010
  • C. Magnien : “Intégrer mesure, métrologie et analyse pour l’étude des graphes de terrain dynamiques”, habilitation à diriger des recherches, soutenance 06/07/2010 (2010)
  • L. Benamara, C. Magnien : “Estimating properties in dynamic systems: the case of churn in P2P networks”, Third International Workshop on Network Science for Communication Networks (NetSciCom 2010), In Conjuction with IEEE Infocom 2010., San Diego, CA, United States, pp. 1-6, (IEEE) (2010)
  • A. Hamzaoui, M. Latapy, C. Magnien : “Detecting Events in the Dynamics of Ego-centered Measurements of the Internet Topology”, WiOpt'10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, Avignon, France, pp. 491-498 (2010)
• 2009
  • G. Valadon, C. Magnien, R. Wakikawa : “Mobile IPv6 Deployments: Graph-based Analysis and practical Guidelines”, Computer Communications, vol. 32 (17), pp. 1871-1880, (Elsevier) (2009)
  • C. Magnien, F. Ouédraogo, G. Valadon, M. Latapy : “Fast dynamics in Internet topology: preliminary observations and explanations”, Fourth International Conference on Internet Monitoring and Protection (ICIMP 2009), Venice, Italy, pp. 137-142, (IEEE) (2009)
  • O. Allali, M. Latapy, C. Magnien : “Measurement of eDonkey Activity with Distributed Honeypots”, Sixth International Workshop on Hot Topics in Peer-to-Peer Systems (Hot-P2P 2009),, Rome, Italy, pp. 1-8, (IEEE) (2009)
  • F. Aidouni, M. Latapy, C. Magnien : “Ten weeks in the life of an eDonkey server”, Sixth International Workshop on Hot Topics in Peer-to-Peer Systems (Hot-P2P 2009), Rome, Italy, pp. 1-5, (IEEE) (2009)
  • C. Magnien, M. Latapy, M. Habib : “Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs”, ACM Journal of Experimental Algorithmics, vol. 13, pp. 10, (Association for Computing Machinery) (2009)
• 2008
  • M. Latapy, C. Magnien, F. Ouédraogo : “A Radar for the Internet”, 1^st International Workshop on Analysis of Dynamic Networks, Pisa, Italy (2008)
  • F. Aidouni, M. Latapy, C. Magnien : “Capture à grande échelle de trafic eDonkey”, 10^es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications, Saint-Malo, France (2008)
  • M. Latapy, C. Magnien : “Complex Network Measurements: Estimating the Relevance of Observed Properties”, IEEE INFOCOM, Phoenix, United States, pp. 2333-2341, (IEEE) (2008)
  • F. Viger, B. Augustin, X. Cuvellier, C. Magnien, M. Latapy, T. Friedman, R. Teixeira : “Detection, understanding, and prevention of traceroute measurement artifacts”, Computer Networks, vol. 52 (5), pp. 998-1018, (Elsevier) (2008)
  • M. Latapy, C. Magnien, N. Del Vecchio : “Basic Notions for the Analysis of Large Two-mode Networks”, Social Networks, vol. 30 (1), pp. 31-48, (Elsevier) (2008)
  • F. Ouédraogo, C. Magnien, M. Latapy : “A radar for the internet”, 10^e Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), St-Malo, France (2008)
  • P. Borgnat, E. Fleury, J.‑L. GUILLAUME, C. Magnien, C. Robardet, A. Scherrer : “Evolving networks”, chapter in Mining Massive Data Sets for Security, vol. 19, pp. 198-203, (IOS Press), (ISBN: 978-1-58603-898-4) (2008)
• 2006
  • B. Augustin, X. Cuvellier, B. Orgogozo, F. Viger, T. Friedman, M. Latapy, C. Magnien, R. Teixeira : “Avoiding traceroute anomalies with Paris traceroute”, IMC 2006 - 6^th ACM Internet Measurement Conference, Rio de Janeiro, Brazil, pp. 153-158, (ACM) (2006)