إصدارات 2005-2025

• 2025
  • G. Moinard, M. Latapy : “Improving flocking behaviors in street networks with vision”, (2025)
  • G. Moinard, M. Latapy : “Fast and Robust Flocking of Protesters on Street Networks”, (2025)
  • G. Moinard, M. Latapy : “Fast Flocking of Protesters on Street Networks”, Social Networks Analysis and Mining, vol. 15212, Lecture Notes in Computer Science, Rende (CS), Calabria, Italy, pp. 194-203, (Springer Nature Switzerland) (2025)
• 2024
  • B. Legay, M. Latapy : “Mapping Low-Resolution Edges to High-Resolution Paths: The Case of Traffic Measurements in Cities”, Complex Networks XV: Proceedings of the 15^th Conference on Complex Networks, CompleNet 2024, vol. XV, Springer Proceedings in Complexity, Exeter (England), United Kingdom, pp. 1-13, (Springer Nature Switzerland) (2024)
• 2023
  • E. Bautista, M. Latapy : “Link Streams as a Generalization of Graphs and Time Series”, 2023 IEEE 5^th International Conference on Cognitive Machine Intelligence (CogMI), Atlanta, GA, United States, pp. 150-158, (IEEE), (ISBN: 979-8-3503-2383-2) (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)
  • E. Bautista, M. Latapy : “A Frequency-Structure Approach for Link Stream Analysis”, chapter in Temporal Network Theory, 2^nd Edition. (2023)
• 2022
  • E. Bautista, M. Latapy : “A Frequency-Structure Decomposition for Link Streams”, GRETSI, Nancy, France (2022)
  • E. Bautista, M. Latapy : “A Local Updating Algorithm for Personalized PageRank via Chebyshev Polynomials”, Social Network Analysis and Mining, vol. 12 (1), (Springer) (2022)
• 2021
  • E. Bautista, M. Latapy : “A logical approach for temporal and multiplex networks analysis”, The 10^th International Conference on Complex Networks and their Applications, 2021, Madrid, Spain (2021)
  • J. Azad Emery, M. Latapy : “Full Bitcoin Blockchain Data Made Easy”, 2021 IEEE/ACM International Conference on Advances in Social Network Analysis and Mining ( ASONAM 2021), The Hague (virtual), Netherlands (2021)
• 2020
  • N. Gensollen, M. Latapy : “Do you trade with your friends or become friends with your trading partners? A case study in the $\breve {G}1$ cryptocurrency”, Applied Network Science, vol. 5 (1), pp. 25, (Springer) (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
  • A. Wilmet, T. Viard, M. Latapy, R. Lamarche‑Perrin : “Degree-based Outlier Detection within IP Traffic Modelled as a Link Stream”, Computer Networks, vol. 161, pp. 197-209, (Elsevier) (2019)
  • Th. Arnoux, L. Tabourier, M. Latapy : “Predicting interactions between individuals with structural and dynamical information”, Journal of Interdisciplinary Methodologies and Issues in Science, vol. Analysis of networks and graphs, Graph and network analysis, pp. 3, (Éditions universitaires d’Avignon) (2019)
  • A. Nzekon Nzeko'O, M. Tchuente, M. Latapy : “Link stream graph for temporal recommendations”, (2019)
  • A. Nzekon Nzeko'O, M. Tchuente, M. Latapy : “A general graph-based framework for top-N recommendation using content, temporal and trust information”, Journal of Interdisciplinary Methodologies and Issues in Science, vol. Analysis of networks and graphs, Graph and network analysis, (Éditions universitaires d’Avignon) (2019)
  • Th. Arnoux, L. Tabourier, M. Latapy : “Interaction Prediction Problems in Link Streams”, Dynamics On and Of Complex Networks III, Springer Proceedings in Complexity, Indianapolis, United States, pp. 135-150, (Springer) (2019)
  • A. Payen, L. Tabourier, M. Latapy : “Spreading dynamics in a cattle trade network: Size, speed, typical profile and consequences on epidemic control strategies”, PLoS ONE, vol. 14 (6), pp. e0217972, (Public Library of Science) (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)
  • C. Bertrand, F. Peschanski, H. Klaudel, M. Latapy : “Pattern Matching in Link Streams: Timed-Automata with Finite Memory”, Scientific Annals of Computer Science, vol. 28 (36), pp. 161-198, (Alexandru Ioan Cuza University Publishing House) (2018)
  • 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 (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)
  • 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) (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)
• 2017
  • R. Cazabet, R. Baccour, M. Latapy : “Tracking bitcoin users activity using community detection on a network of weak signals”, The 6^th International Conference on Complex Networks and Their Applications, Lyon, France (2017)
  • A. Nzekon Nzeko'O, M. Tchuente, M. Latapy : “Time Weight Content-Based Extensions of Temporal Graphs for Personalized Recommendation”, WEBIST 2017, Porto, Portugal (2017)
  • M. Latapy, D. Chavalarias : “L’analyse à grande échelle de nos traces numériques”, chapter in Les Big Data à Découvert, Les Big Data à Découvert, (ISBN: 978-2-271-11464-8) (2017)
  • Th. Arnoux, L. Tabourier, M. Latapy : “Combining structural and dynamic information to predict activity in link streams”, FAB 2017 Conference Proceedings, Sydney, Australia (2017)
  • A. Payen, L. Tabourier, M. Latapy : “Impact of Temporal Features of Cattle Exchanges on the Size and Speed of Epidemic Outbreaks”, Conference Publishing Services (CPS)., Trieste, Italy (2017)
  • M. Latapy, E. Rotenberg, Ch. Crespelle, F. Tarissan : “Rigorous Measurement of the Internet Degree Distribution”, Complex Systems, vol. 26 (1), (Complex Systems Publications, Inc.) (2017)
• 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) (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, T. Viard, R. Fournier‑S'niehotta, Q. Wang, M. Latapy : “Analysis of the Temporal and Structural Features of Threads in a Mailing-List”, Complex Networks VIIProceedings of the 7^th Workshop on Complex Networks CompleNet 2016, vol. 644, Studies in Computational Intelligence, Dijon, France, pp. 107-118, (Springer) (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
  • M. Latapy : “Modéliser les interactions au fil du temps”, Interstices, (INRIA) (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)
  • 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) (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)
  • Ch. Crespelle, M. Latapy, Th. Phan : “On the termination of some biclique operators on multipartite graphs”, Discrete Applied Mathematics, vol. 195, pp. 59–73, (Elsevier) (2015)
  • R. Fournier, M. Latapy : “Temporal Patterns of Pedophile Activity in a P2P Network: First Insights about User Profiles from Big Data”, International Journal of Internet Science, vol. 10 (1), pp. 8-19 (2015)
• 2014
  • F. Tarissan, E. Rotenberg, M. Latapy, Ch. Crespelle : “UDP PING: a dedicated tool for improving measurements of the Internet topology”, MASCOTS'14 : IEEE 22^nd International Symposium on Modeling Analysis and Simulation of Computer and Telecomunication Systems, Paris, France, pp. 506-509 (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)
  • M. Latapy, E. Rotenberg, Ch. Crespelle, F. Tarissan : “Measuring the degree distribution of routers in the core internet”, Proceedings of the 13^th IFIP International Conference on Networking, Trondheim, Norway, pp. 1-9, (IEEE) (2014)
  • T. Viard, M. Latapy : “Identifying roles in an IP network with temporal and structural density”, Sixth IEEE International Workshop on Network Science for Communication Networks (NetSciCom 2014), Toronto, Canada, pp. 801-806, (IEEE) (2014)
  • E. Rotenberg, Ch. Crespelle, M. Latapy : “Measuring routing tables in the internet”, Proceedings of NetSciCom 2014, Toronto, Canada, pp. 795-800 (2014)
• 2013
  • D. Bernardes, M. Latapy, F. Tarissan : “Inadequacy of SIR Model to Reproduce Key Properties of Real-world Spreading Phenomena: Experiments on a Large-scale P2P System”, Social Network Analysis and Mining, vol. 3 (4), pp. 1195-1208, (Springer) (2013)
  • F. Tarissan, B. Quoitin, P. Mérindol, B. Donnet, J.‑J. Pansiot, M. Latapy : “Towards a Bipartite Graph Modeling of the Internet Topology”, Computer Networks, vol. 57 (11), pp. 2331-2347, (Elsevier) (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)
  • A. Albano, B. Le Grand, M. Latapy : “Visualisation de grands réseaux dynamiques: Application à la détection d’anomalies de routage dans l’Internet.”, Revue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle, vol. 26 (4), pp. 409-427, (Lavoisier) (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)
  • D. Bernardes, M. Latapy, F. Tarissan : “Examining Key Properties of Diffusion Models for Large-Scale Real-World Networks”, Quatorzièmes Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (Algotel’12), La Grande Motte, France, pp. 1-4 (2012)
  • X. Wang, M. Latapy, M. Soria : “Deciding on the type of the degree distribution of a graph from traceroute-like measurements”, International Journal of Computer Networks & Communications, vol. 4 (3), pp. 151-167, (AIRCC Publishing Corporation) (2012)
  • A. Salah Brahim, B. Le Grand, M. Latapy : “Diffusion Cascades: Spreading Phenomena in Blog Network Communities”, Parallel Processing Letters, vol. 22 (1), pp. 1-16, (World Scientific Publishing) (2012)
  • D. Bernardes, M. Latapy, F. Tarissan : “Relevance of SIR Model for Real-world Spreading Phenomena: Experiments on a Large-scale P2P System”, IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, Istanbul, Türkiye, pp. 327-334, (IEEE) (2012)
• 2011
  • E. Fleury, B. Jouve, M. Latapy : “Complex Networks Emerging From Large Dynamic Databases: New Mathematical and Computational Tools”, ERA-NET CHIST-ERA: From Data to New Knowledge, Cork, Ireland (2011)
  • A. Salah Brahim, B. Le Grand, L. Tabourier, M. Latapy : “Citations among blogs in a hierarchy of communities: method and case study”, Journal of computational science, vol. 2 (3), pp. 247-252, (Elsevier) (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)
  • P. Pons, M. Latapy : “Post-processing hierarchical community structures: Quality improvements and multi-scale view”, Theoretical Computer Science, vol. 412 (8-10), pp. 892-900, (Elsevier) (2011)
  • B. Le Grand, M. Latapy : “Détection visuelle d’événements dans des grands réseaux d’interaction dynamiques. Application à l’Internet”, Atelier Visualisation et Extraction de Connaissances de la conférence EGC 2011, Brest, France (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)
  • 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)
  • A. Friggeri, J.‑Ph. Cointet, M. Latapy : “A Real-World Spreading Experiment in the Blogosphere”, Complex Systems, vol. 19 (3), (Complex Systems Publications, Inc.) (2011)
• 2010
  • X. Wang, M. Latapy, M. Soria : “Deciding on the type of a graph from a BFS”, Workshop on Complex Networks CompleNet 2010, vol. 116, Communications in Computer and Information Science, Rio de Janeiro, Brazil, pp. 68-74, (Springer) (2010)
  • A. Salah Brahim, B. Le Grand, M. Latapy : “Some Insight on Dynamics of Posts and Citations in Different Blog Communities”, IEEE ICC 2010 workshop SocNets, Capetown, South Africa, pp. 1-6, (IEEE) (2010)
  • M. Seifi, J.‑L. GUILLAUME, M. Latapy, B. Le Grand : “Interactive multiscale visualization of huge graphs: application to a network of weblogs”, 8^th Workshop on Visualization and Knowledge Extraction (EGC 2010), Hammamet, Tunisia (2010)
  • M. Latapy, Th. Phan, Ch. Crespelle, Th. Nguyen : “Termination of Multipartite Graph Series Arising from Complex Network Modelling”, 4^th Annual International Conference on Combinatorial Optimization and Applications - COCOA'10, vol. 6508, Lecture Notes in Computer science, Hawaii, Big Island, United States, pp. 1-10 (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)
  • Ch. Crespelle, M. Latapy, E. Rotenberg : “Rigorous Measurement of IP-Level Neighborhood of Internet Core Routers”, Second International Workshop on Network Scienece for Communication Networks (NetSciCom 2010), San Diego, CA, United States, pp. 499-504 (2010)
• 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)
  • F. Tarissan, M. Latapy, Ch. Prieur : “Efficient Measurement of Complex Networks Using Link Queries”, IEEE International Workshop on Network Science For Communication Networks (NetSciCom'09), Rio de Janeiro, Brazil, pp. 1-6, (IEEE) (2009)
  • M. Latapy, Th. Phan : “The lattice of integer partitions and its infinite extension”, Discrete Mathematics, vol. 309 (6), pp. 1357-1367, (Elsevier) (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)
  • M. Latapy : “Main-memory Triangle Computations for Very Large (Sparse (Power-Law)) Graphs”, Theoretical Computer Science, vol. 407 (1-3), pp. 458-473, (Elsevier) (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)
• 2007
  • M. Latapy : “Grands Graphes de Terrain - Mesure et Metrologie, Analyse, Modelisation, Algorithmique”, رخصة بإدارة البحوث, مناقـشـة مـذكـرة 30/11/2007 (2007)
  • J. Leguay, M. Latapy, T. Friedman, K. Salamatian : “Describing and Simulating Internet Routes”, Computer Networks, vol. 51 (8), pp. 2067-2085, (Elsevier) (2007)
• 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)
• 2005
  • J. Leguay, M. Latapy, T. Friedman, K. Salamatian : “Describing and Simulating Internet Routes”, NETWORKING 2005 - 4^th International IFIP-TC6 Networking Conference, vol. 3462, Lecture Notes in Computer Science, Waterloo, Canada, pp. 659-670, (Springer) (2005)
  • F. Viger, M. Latapy : “Fast generation of random connected graphs with prescribed degrees”, (2005)