Trivial Graph Features and Classical Learning are Enough to Detect Random Anomalies.

Matthieu Latapy LIP6, Paris http://www-rp.lip6.fr/~latapy/ https://orcid.org/0000-0002-0975-6109 https://www.wikidata.org/entity/Q103360275

Matthieu Latapy Stephany Rajeh Trivial Graph Features and Classical Learning are Enough to Detect Random Anomalies. 2026 March abs/2603.01841 CoRR https://doi.org/10.48550/arXiv.2603.01841 db/journals/corr/corr2603.html#abs-2603-01841 streams/journals/corr

Matthieu Latapy Stephany Rajeh Trivial Graph Features and Classical Learning are Enough to Detect Random Anomalies. ICDM 2025 1330-1339 conf/icdm/2025 https://doi.org/10.1109/ICDM65498.2025.00142 db/conf/icdm/icdm2025.html#LatapyR25 streams/conf/icdm

Guillaume Moinard Matthieu Latapy Improving flocking behaviors in street networks with vision. 2025 May abs/2505.21585 CoRR https://doi.org/10.48550/arXiv.2505.21585 db/journals/corr/corr2505.html#abs-2505-21585 streams/journals/corr

Guillaume Moinard Matthieu Latapy Fast Flocking of Protesters on Street Networks. 194-203 2024 ASONAM (2) https://doi.org/10.1007/978-3-031-78538-2_17 conf/asunam/2024-2 db/conf/asunam/asonam2024-2.html#MoinardL24 streams/conf/asunam

Bastien Legay Matthieu Latapy Mapping low-resolution edges to high-resolution paths: the case of traffic measurements in cities. 2024 abs/2401.08539 CoRR https://doi.org/10.48550/arXiv.2401.08539 db/journals/corr/corr2401.html#abs-2401-08539

Guillaume Moinard Matthieu Latapy Fast and Robust Flocking of Protesters on Street Networks. 2024 abs/2406.01101 CoRR https://doi.org/10.48550/arXiv.2406.01101 db/journals/corr/corr2406.html#abs-2406-01101

Frédéric Simard Clémence Magnien Matthieu Latapy Computing Betweenness Centrality in Link Streams. 195-217 2023 27 J. Graph Algorithms Appl. 3 https://doi.org/10.7155/jgaa.00620 db/journals/jgaa/jgaa27.html#SimardML23

Esteban Bautista Matthieu Latapy Link Streams as a Generalization of Graphs and Time Series. 150-158 2023 CogMI https://doi.org/10.1109/CogMI58952.2023.00030 conf/cogmi/2023 db/conf/cogmi/cogmi2023.html#BautistaL23

Mehdi Naima Matthieu Latapy Clémence Magnien Temporal Betweenness Centrality on Shortest Paths Variants. 2023 abs/2305.01080 CoRR https://doi.org/10.48550/arXiv.2305.01080 db/journals/corr/corr2305.html#abs-2305-01080

Esteban Bautista Matthieu Latapy Link Streams as a Generalization of Graphs and Time Series. 2023 abs/2311.11187 CoRR https://doi.org/10.48550/arXiv.2311.11187 db/journals/corr/corr2311.html#abs-2311-11187

Esteban Bautista Matthieu Latapy A local updating algorithm for personalized PageRank via Chebyshev polynomials. 31 2022 12 Soc. Netw. Anal. Min. 1 https://doi.org/10.1007/s13278-022-00860-5 db/journals/snam/snam12.html#BautistaL22

Esteban Bautista Matthieu Latapy A Frequency-Structure Approach for Link Stream Analysis. 2022 abs/2212.03804 CoRR https://doi.org/10.48550/arXiv.2212.03804 db/journals/corr/corr2212.html#abs-2212-03804

Jules Azad Emery Matthieu Latapy Full Bitcoin blockchain data made easy. 240-243 2021 ASONAM https://doi.org/10.1145/3487351.3488326 https://www.wikidata.org/entity/Q130868097 conf/asunam/2021 db/conf/asunam/asonam2021.html#EmeryL21

Matthieu Latapy Partitions of an Integer into Powers. 2021 abs/2101.08312 CoRR https://arxiv.org/abs/2101.08312 db/journals/corr/corr2101.html#abs-2101-08312

Olivier Bodini Matthieu Latapy Generalized Tilings with Height Functions. 2021 abs/2101.08347 CoRR https://arxiv.org/abs/2101.08347 db/journals/corr/corr2101.html#abs-2101-08347

Frédéric Simard Clémence Magnien Matthieu Latapy Computing Betweenness Centrality in Link Streams. 2021 abs/2102.06543 CoRR https://arxiv.org/abs/2102.06543 db/journals/corr/corr2102.html#abs-2102-06543

Matthieu Latapy Thi Ha Duong Phan Christophe Crespelle Thanh Qui Nguyen Termination of Multipartite Graph Series Arising from Complex Network Modelling. 2021 abs/2103.04447 CoRR https://arxiv.org/abs/2103.04447 db/journals/corr/corr2103.html#abs-2103-04447

Christophe Crespelle Matthieu Latapy Thi Ha Duong Phan On the Termination of Some Biclique Operators on Multipartite Graphs. 2021 abs/2103.04451 CoRR https://arxiv.org/abs/2103.04451 db/journals/corr/corr2103.html#abs-2103-04451

Jules Azad Emery Matthieu Latapy Full Bitcoin Blockchain Data Made Easy. 2021 abs/2106.08072 CoRR https://arxiv.org/abs/2106.08072 db/journals/corr/corr2106.html#abs-2106-08072

Esteban Bautista Matthieu Latapy A Local Updating Algorithm for Personalized PageRank via Chebyshev Polynomials. 2021 abs/2110.02538 CoRR https://arxiv.org/abs/2110.02538 db/journals/corr/corr2110.html#abs-2110-02538

Esteban Bautista Matthieu Latapy A logical approach for temporal and multiplex networks analysis. 2021 abs/2110.02543 CoRR https://arxiv.org/abs/2110.02543 db/journals/corr/corr2110.html#abs-2110-02543

Nicolas Gensollen Matthieu Latapy Do you trade with your friends or become friends with your trading partners? A case study in the $\breve {G}1$ cryptocurrency. 25 2020 5 Appl. Netw. Sci. 1 https://doi.org/10.1007/s41109-020-00266-2 db/journals/ans/ans5.html#GensollenL20

Clara Stegehuis Matthieu Latapy Closure coefficients in scale-free complex networks. 2020 8 J. Complex Networks 3 https://doi.org/10.1093/comnet/cnaa020 db/journals/compnet/compnet8.html#StegehuisL20

Léo Rannou Clémence Magnien Matthieu Latapy Strongly Connected Components in Stream Graphs: Computation and Experimentations. 568-580 2020 COMPLEX NETWORKS (1) https://doi.org/10.1007/978-3-030-65347-7_47 conf/complexnetworks/2020-1 db/conf/complexnetworks/complexnetworks2020-1.html#RannouML20

Léo Rannou Clémence Magnien Matthieu Latapy Strongly Connected Components in Stream Graphs: Computation and Experimentations. 2020 abs/2011.08054 CoRR https://arxiv.org/abs/2011.08054 db/journals/corr/corr2011.html#abs-2011-08054

Matthieu Latapy Marco Fiore Artur Ziviani Link streams: Methods and applications. 263-265 2019 150 Comput. Networks https://doi.org/10.1016/j.comnet.2018.12.010 https://www.wikidata.org/entity/Q128731405 db/journals/cn/cn150.html#LatapyFZ19

Audrey Wilmet Tiphaine Viard Matthieu Latapy Robin Lamarche-Perrin Outlier detection in IP traffic modelled as a link stream using the stability of degree distributions over time. 197-209 2019 161 Comput. Networks https://doi.org/10.1016/j.comnet.2019.07.002 https://www.wikidata.org/entity/Q127576534 db/journals/cn/cn161.html#WilmetVLL19

Armel Jacques Nzekon Nzeko'o Maurice Tchuenté Matthieu Latapy Link Stream Graph for Temporal Recommendations. 2019 abs/1904.12576 CoRR http://arxiv.org/abs/1904.12576 db/journals/corr/corr1904.html#abs-1904-12576

Armel Jacques Nzekon Nzeko'o Maurice Tchuenté Matthieu Latapy A general graph-based framework for top-N recommendation using content, temporal and trust information. 2019 abs/1905.02681 CoRR http://arxiv.org/abs/1905.02681 db/journals/corr/corr1905.html#abs-1905-02681

Audrey Wilmet Tiphaine Viard Matthieu Latapy Robin Lamarche-Perrin Degree-based Outlier Detection within IP Traffic Modelled as a Link Stream. 2019 abs/1906.02524 CoRR http://arxiv.org/abs/1906.02524 db/journals/corr/corr1906.html#abs-1906-02524

Matthieu Latapy Clémence Magnien Tiphaine Viard Weighted, Bipartite, or Directed Stream Graphs for the Modeling of Temporal Networks. 2019 abs/1906.04840 CoRR http://arxiv.org/abs/1906.04840 db/journals/corr/corr1906.html#abs-1906-04840

Nicolas Gensollen Matthieu Latapy Do you trade with your friends or become friends with your trading partners? A case study in the G1 cryptocurrency. 2019 abs/1911.10792 CoRR http://arxiv.org/abs/1911.10792 db/journals/corr/corr1911.html#abs-1911-10792

Clément Bertrand Frédéric Peschanski Hanna Klaudel Matthieu Latapy Pattern Matching in Link Streams: Timed-Automata with Finite Memory. 161-198 2018 28 Sci. Ann. Comput. Sci. 2 http://www.info.uaic.ro/bin/Annals/Article?v=XXVIII2&a=1 db/journals/cuza/cuza28.html#BertrandPKL18

Tiphaine Viard Clémence Magnien Matthieu Latapy Enumerating maximal cliques in link streams with durations. 44-48 2018 133 Inf. Process. Lett. https://doi.org/10.1016/j.ipl.2018.01.006 db/journals/ipl/ipl133.html#ViardML18

Matthieu Latapy Tiphaine Viard Clémence Magnien Stream graphs and link streams for the modeling of interactions over time. 61:1-61:29 2018 8 Soc. Netw. Anal. Min. 1 https://doi.org/10.1007/s13278-018-0537-7 https://www.wikidata.org/entity/Q129163912 db/journals/snam/snam8.html#LatapyVM18

Clément Bertrand Hanna Klaudel Matthieu Latapy Frédéric Peschanski Pattern Matching in Link Streams: A Token-Based Approach. 227-247 2018 Petri Nets https://doi.org/10.1007/978-3-319-91268-4_12 conf/apn/2018 db/conf/apn/pn2018.html#BertrandKLP18 Audrey Wilmet Tiphaine Viard Matthieu Latapy Robin Lamarche-Perrin Degree-Based Outliers Detection Within IP Traffic Modelled as a Link Stream. 1-8 2018 TMA https://doi.org/10.23919/TMA.2018.8506575 conf/tma/2018 db/conf/tma/tma2018.html#WilmetVLL18

Thibaud Arnoux Lionel Tabourier Matthieu Latapy Predicting interactions between individuals with structural and dynamical information. 2018 abs/1804.01465 CoRR http://arxiv.org/abs/1804.01465 db/journals/corr/corr1804.html#abs-1804-01465

Jean Creusefond Matthieu Latapy Propagation of content similarity through a collaborative network for live show recommendation. 2018 abs/1804.09073 CoRR http://arxiv.org/abs/1804.09073 db/journals/corr/corr1804.html#abs-1804-09073

Matthieu Latapy Elie Rotenberg Christophe Crespelle Fabien Tarissan Rigorous Measurement of the Internet Degree Distribution. 2017 26 Complex Syst. 1 https://doi.org/10.25088/complexsystems.26.1.1 db/journals/compsys/compsys26.html#LatapyRCT17

Thibaud Arnoux Lionel Tabourier Matthieu Latapy Combining structural and dynamic information to predict activity in link streams. 935-942 2017 ASONAM https://doi.org/10.1145/3110025.3116209 conf/asunam/2017 db/conf/asunam/asonam2017.html#ArnouxTL17 Rémy Cazabet Rym Baccour Matthieu Latapy Tracking Bitcoin Users Activity Using Community Detection on a Network of Weak Signals. 166-177 2017 COMPLEX NETWORKS https://doi.org/10.1007/978-3-319-72150-7_14 conf/complexnetworks/2017 db/conf/complexnetworks/complexnetworks2017.html#RemyRM17 Aurore Payen Lionel Tabourier Matthieu Latapy Impact of Temporal Features of Cattle Exchanges on the Size and Speed of Epidemic Outbreaks. 84-97 2017 ICCSA (2) https://doi.org/10.1007/978-3-319-62395-5_7 conf/iccsa/2017-2 db/conf/iccsa/iccsa2017-2.html#PayenTL17 Armel Jacques Nzekon Nzeko'o Maurice Tchuenté Matthieu Latapy Temporal Recommendation, Long- and Short-term Preferences, Session-based Temporal Graph, Time Weight Content-based Graph, Time-averaged Hit Ratio, PageRank, Injected Preference Fusion.. 268-275 2017 WEBIST https://doi.org/10.5220/0006288202680275 conf/webist/2017 db/conf/webist/webist2017.html#NzekooTL17

Matthieu Latapy Tiphaine Viard Clémence Magnien Stream Graphs and Link Streams for the Modeling of Interactions over Time. 2017 abs/1710.04073 CoRR http://arxiv.org/abs/1710.04073 db/journals/corr/corr1710.html#abs-1710-04073

Tiphaine Viard Raphaël Fournier-S'niehotta Clémence Magnien Matthieu Latapy Discovering Patterns of Interest in IP Traffic Using Cliques in Bipartite Link Streams. 2017 abs/1710.07107 CoRR http://arxiv.org/abs/1710.07107 db/journals/corr/corr1710.html#abs-1710-07107

Rémy Cazabet Baccour Rym Matthieu Latapy Tracking bitcoin users activity using community detection on a network of weak signals. 2017 abs/1710.08158 CoRR http://arxiv.org/abs/1710.08158 db/journals/corr/corr1710.html#abs-1710-08158

Tiphaine Viard Clémence Magnien Matthieu Latapy Enumerating maximal cliques in link streams with durations. 2017 abs/1712.06970 CoRR http://arxiv.org/abs/1712.06970 db/journals/corr/corr1712.html#abs-1712-06970

Fabien Viger Matthieu Latapy Efficient and simple generation of random simple connected graphs with prescribed degree sequence. 15-37 2016 4 J. Complex Networks 1 https://doi.org/10.1093/comnet/cnv013 db/journals/compnet/compnet4.html#VigerL16

Noé Gaumont Clémence Magnien Matthieu Latapy Finding remarkably dense sequences of contacts in link streams. 87:1-87:14 2016 6 Soc. Netw. Anal. Min. 1 https://doi.org/10.1007/s13278-016-0396-z db/journals/snam/snam6.html#GaumontML16

Tiphaine Viard Matthieu Latapy Clémence Magnien Computing maximal cliques in link streams. 245-252 2016 609 Theor. Comput. Sci. https://doi.org/10.1016/j.tcs.2015.09.030 db/journals/tcs/tcs609.html#ViardLM16

Noé Gaumont Tiphaine Viard Raphaël Fournier-S'niehotta Qinna Wang Matthieu Latapy Analysis of the Temporal and Structural Features of Threads in a Mailing-List. 107-118 2016 CompleNet https://doi.org/10.1007/978-3-319-30569-1_8 conf/complenet/2016 db/conf/complenet/complenet2016.html#GaumontVFWL16

Christophe Crespelle Matthieu Latapy Thi Ha Duong Phan On the termination of some biclique operators on multipartite graphs. 59-73 2015 195 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2015.02.006 db/journals/dam/dam195.html#CrespelleLP15

Jordan Viard Matthieu Latapy Clémence Magnien Revealing contact patterns among high-school students using maximal cliques in link streams. 1517-1522 2015 ASONAM https://doi.org/10.1145/2808797.2809291 conf/asunam/2015 db/conf/asunam/asonam2015.html#ViardLM15 Armel Jacques Nzekon Nzeko'o Matthieu Latapy Maurice Tchuenté Social Network Analysis of Developers' and Users' Mailing Lists of Some Free Open Source Software. 728-732 2015 BigData Congress https://doi.org/10.1109/BigDataCongress.2015.119 https://doi.ieeecomputersociety.org/10.1109/BigDataCongress.2015.119 conf/bigdata/2015 db/conf/bigdata/bigdata2015.html#NzekooLT15 Noé Gaumont François Queyroi Clémence Magnien Matthieu Latapy Expected Nodes: A Quality Function for the Detection of Link Communities. 57-64 2015 CompleNet https://doi.org/10.1007/978-3-319-16112-9_6 conf/complenet/2015 db/conf/complenet/complenet2015.html#GaumontQML15

Tiphaine Viard Matthieu Latapy Clémence Magnien Computing maximal cliques in link streams. 2015 abs/1502.00993 CoRR http://arxiv.org/abs/1502.00993 db/journals/corr/corr1502.html#ViardLM15

Noé Gaumont Tiphaine Viard Raphaël Fournier-S'niehotta Qinna Wang Matthieu Latapy Analysis of the temporal and structural features of threads in a mailing-list. 2015 abs/1512.05002 CoRR http://arxiv.org/abs/1512.05002 db/journals/corr/corr1512.html#GaumontVFWL15

Matthieu Latapy Assia Hamzaoui Clémence Magnien Detecting events in the dynamics of ego-centred measurements of the Internet topology‡. 38-59 2014 2 J. Complex Networks 1 https://doi.org/10.1093/comnet/cnt014 db/journals/compnet/compnet2.html#LatapyHM14

Matthieu Latapy Tiphaine Viard Complex Networks and Link Streams for the Empirical Analysis of Large Software. 40-50 2014 Petri Nets https://doi.org/10.1007/978-3-319-07734-5_3 conf/apn/2014 db/conf/apn/pn2014.html#LatapyV14 Elie Rotenberg Christophe Crespelle Matthieu Latapy Measuring routing tables in the internet. 795-800 2014 INFOCOM Workshops https://doi.org/10.1109/INFCOMW.2014.6849332 conf/infocom/2014w db/conf/infocom/infocom2014w.html#RotenbergCL14 Jordan Viard Matthieu Latapy Identifying roles in an IP network with temporal and structural density. 801-806 2014 INFOCOM Workshops https://doi.org/10.1109/INFCOMW.2014.6849333 conf/infocom/2014w db/conf/infocom/infocom2014w.html#ViardL14 Fabien Tarissan Elie Rotenberg Matthieu Latapy Christophe Crespelle UDP Ping: A Dedicated Tool for Improving Measurements of the Internet Topology. 506-509 2014 MASCOTS https://doi.org/10.1109/MASCOTS.2014.74 https://doi.ieeecomputersociety.org/10.1109/MASCOTS.2014.74 conf/mascots/2014 db/conf/mascots/mascots2014.html#TarissanRLC14 Matthieu Latapy Elie Rotenberg Christophe Crespelle Fabien Tarissan Measuring the degree distribution of routers in the core internet. 1-9 2014 Networking https://doi.org/10.1109/IFIPNetworking.2014.6857096 https://doi.ieeecomputersociety.org/10.1109/IFIPNetworking.2014.6857096 conf/networking/2014 db/conf/networking/networking2014.html#LatapyRCT14

Tiphaine Viard Matthieu Latapy Identifying roles in an IP network with temporal and structural density. 2014 abs/1406.4969 CoRR http://arxiv.org/abs/1406.4969 db/journals/corr/corr1406.html#ViardL14

Fabien Tarissan Bruno Quoitin Pascal Mérindol Benoit Donnet Jean-Jacques Pansiot Matthieu Latapy Towards a bipartite graph modeling of the internet topology. 2331-2347 2013 57 Comput. Networks 11 https://doi.org/10.1016/j.comnet.2013.04.007 db/journals/cn/cn57.html#TarissanQMDPL13

Oussama Allali Clémence Magnien Matthieu Latapy Internal link prediction: A new approach for predicting links in bipartite graphs. 5-25 2013 17 Intell. Data Anal. 1 https://doi.org/10.3233/IDA-120565 https://www.wikidata.org/entity/Q129071302 db/journals/ida/ida17.html#AllaliML13

Matthieu Latapy Clémence Magnien Raphaël Fournier Quantifying paedophile activity in a large P2P system. 248-263 2013 49 Inf. Process. Manag. 1 https://doi.org/10.1016/j.ipm.2012.02.008 https://www.wikidata.org/entity/Q125313629 db/journals/ipm/ipm49.html#LatapyMF13

Oussama Allali Lionel Tabourier Clémence Magnien Matthieu Latapy Internal links and pairs as a new tool for the analysis of bipartite complex networks. 85-91 2013 3 Soc. Netw. Anal. Min. 1 https://doi.org/10.1007/s13278-012-0053-0 db/journals/snam/snam3.html#AllaliTML13

Daniel Faria Bernardes Matthieu Latapy Fabien Tarissan Inadequacy of SIR model to reproduce key properties of real-world spreading cascades: experiments on a large-scale P2P system. 1195-1208 2013 3 Soc. Netw. Anal. Min. 4 https://doi.org/10.1007/s13278-013-0121-0 db/journals/snam/snam3.html#BernardesLT13

Abdelhamid Salah Brahim Bénédicte Le Grand Matthieu Latapy Diffusion Cascades: Spreading Phenomena in Blog Network Communities. 2012 22 Parallel Process. Lett. 1 https://doi.org/10.1142/S0129626412400026 db/journals/ppl/ppl22.html#BrahimGL12

Alice Albano Bénédicte Le Grand Matthieu Latapy Visualisation de grands réseaux dynamiques. Application à la détection d'anomalies de routage dans l'Internet. 409-427 2012 26 Rev. d'Intelligence Artif. 4 https://doi.org/10.3166/ria.26.409-427 db/journals/ria/ria26.html#AlbanoGL12

Daniel Faria Bernardes Matthieu Latapy Fabien Tarissan Relevance of SIR Model for Real-world Spreading Phenomena: Experiments on a Large-scale P2P System. 327-334 2012 ASONAM https://doi.org/10.1109/ASONAM.2012.62 https://doi.ieeecomputersociety.org/10.1109/ASONAM.2012.62 conf/asunam/2012 db/conf/asunam/asonam2012.html#BernardesLT12 Sebastien Heymann Matthieu Latapy Clémence Magnien Outskewer: Using Skewness to Spot Outliers in Samples and Time Series. 527-534 2012 ASONAM https://doi.org/10.1109/ASONAM.2012.91 https://doi.ieeecomputersociety.org/10.1109/ASONAM.2012.91 conf/asunam/2012 db/conf/asunam/asonam2012.html#HeymannLM12

Matthieu Latapy Clémence Magnien Raphaël Fournier Quantifying Paedophile Activity in a Large P2P System http://arxiv.org/abs/1206.4166 2012 CoRR abs/1206.4166 db/journals/corr/corr1206.html#abs-1206-4166

Raphaël Fournier Thibault Cholez Matthieu Latapy Clémence Magnien Isabelle Chrisment Ivan Daniloff Olivier Festor Comparing paedophile activity in different P2P systems http://arxiv.org/abs/1206.4167 2012 CoRR abs/1206.4167 db/journals/corr/corr1206.html#abs-1206-4167

Matthieu Latapy Complex networks. 607-608 2011 34 Comput. Commun. 5 https://doi.org/10.1016/j.comcom.2010.10.015 db/journals/comcom/comcom34.html#Latapy11

Adrien Friggeri Jean-Philippe Cointet Matthieu Latapy A Real-World Spreading Experiment in the Blogosphere. 2011 19 Complex Syst. 3 https://doi.org/10.25088/complexsystems.19.3.235 db/journals/compsys/compsys19.html#FriggeriCL11

Matthieu Latapy Clémence Magnien Frédéric Ouédraogo A Radar for the Internet. 2011 20 Complex Syst. 1 https://doi.org/10.25088/complexsystems.20.1.23 db/journals/compsys/compsys20.html#LatapyMO11

Clémence Magnien Matthieu Latapy Jean-Loup Guillaume Impact of random failures and attacks on Poisson and power-law random networks. 13:1-13:31 2011 43 ACM Comput. Surv. 3 https://doi.org/10.1145/1922649.1922650 db/journals/csur/csur43.html#MagnienLG11

Abdelhamid Salah Brahim Bénédicte Le Grand Lionel Tabourier Matthieu Latapy Citations among blogs in a hierarchy of communities: Method and case study. 247-252 2011 2 J. Comput. Sci. 3 https://doi.org/10.1016/j.jocs.2011.05.010 db/journals/jocs/jocs2.html#BrahimGTL11

Pascal Pons Matthieu Latapy Post-processing hierarchical community structures: Quality improvements and multi-scale view. 892-900 2011 412 Theor. Comput. Sci. 8-10 https://doi.org/10.1016/j.tcs.2010.11.041 db/journals/tcs/tcs412.html#PonsL11

Matthieu Latapy Introduction. 135-136 2011 30 Tech. Sci. Informatiques 2 http://tsi.revuesonline.com/article.jsp?articleId=15838 db/journals/tsi/tsi30.html#Latapy11

Matthieu Latapy Clémence Magnien Raphaël Fournier Quantifying paedophile queries in a large P2P system. 401-405 2011 INFOCOM https://doi.org/10.1109/INFCOM.2011.5935191 conf/infocom/2011 db/conf/infocom/infocom2011.html#LatapyMF11

Oussama Allali Lionel Tabourier Clémence Magnien Matthieu Latapy Internal links and pairs as a new tool for the analysis of bipartite complex networks http://arxiv.org/abs/1104.4418 2011 CoRR abs/1104.4418 db/journals/corr/corr1104.html#abs-1104-4418

Matthieu Latapy Thi Ha Duong Phan Christophe Crespelle Thanh Qui Nguyen Termination of Multipartite Graph Series Arising from Complex Network Modelling. 1-10 2010 COCOA (1) https://doi.org/10.1007/978-3-642-17458-2_1 conf/cocoa/2010-1 db/conf/cocoa/cocoa2010-1.html#LatapyPCN10 Xiaomin Wang Matthieu Latapy Michèle Soria Deciding on the Type of a Graph from a BFS. 68-74 2010 CompleNet https://doi.org/10.1007/978-3-642-25501-4_7 conf/complenet/2010 db/conf/complenet/complenet2010.html#WangLS10 Assia Hamzaoui Matthieu Latapy Clémence Magnien Detecting events in the dynamics of ego-centered measurements of the internet topology. 505-512 2010 WiOpt https://ieeexplore.ieee.org/document/5520219/ conf/wiopt/2010 db/conf/wiopt/wiopt2010.html#HamzaouiLM10

Matthieu Latapy Thi Ha Duong Phan The lattice of integer partitions and its infinite extension. 1357-1367 2009 309 Discret. Math. 6 https://doi.org/10.1016/j.disc.2008.02.002 db/journals/dm/dm309.html#LatapyP09

Frederic Aidouni Matthieu Latapy Clémence Magnien Ten weeks in the life of an eDonkey server. 1-5 2009 IPDPS https://doi.org/10.1109/IPDPS.2009.5160948 https://doi.ieeecomputersociety.org/10.1109/IPDPS.2009.5160948 conf/ipps/2009 db/conf/ipps/ipdps2009.html#AidouniLM09 Oussama Allali Matthieu Latapy Clémence Magnien Measurement of eDonkey activity with distributed honeypots. 1-8 2009 IPDPS https://doi.org/10.1109/IPDPS.2009.5160952 https://doi.ieeecomputersociety.org/10.1109/IPDPS.2009.5160952 conf/ipps/2009 db/conf/ipps/ipdps2009.html#AllaliLM09

Clémence Magnien Frédéric Ouédraogo Guillaume Valadon Matthieu Latapy Fast dynamics in Internet topology: preliminary observations and explanations http://arxiv.org/abs/0904.2716 2009 CoRR abs/0904.2716 db/journals/corr/corr0904.html#abs-0904-2716

Clémence Magnien Matthieu Latapy Michel Habib Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs http://arxiv.org/abs/0904.2728 2009 CoRR abs/0904.2728 db/journals/corr/corr0904.html#abs-0904-2728

Fabien Viger Brice Augustin Xavier Cuvellier Clémence Magnien Matthieu Latapy Timur Friedman Renata Teixeira Detection, Understanding, and Prevention of Traceroute Measurement Artifacts http://arxiv.org/abs/0904.2733 2009 CoRR abs/0904.2733 db/journals/corr/corr0904.html#abs-0904-2733

Oussama Allali Matthieu Latapy Clémence Magnien Measurement of eDonkey Activity with Distributed Honeypots http://arxiv.org/abs/0904.3215 2009 CoRR abs/0904.3215 db/journals/corr/corr0904.html#abs-0904-3215

Fabien Tarissan Matthieu Latapy Christophe Prieur 0002 Efficient Measurement of Complex Networks Using Link Queries http://arxiv.org/abs/0904.3222 2009 CoRR abs/0904.3222 db/journals/corr/corr0904.html#abs-0904-3222

Fabien Viger Brice Augustin Xavier Cuvellier Clémence Magnien Matthieu Latapy Timur Friedman Renata Teixeira Detection, understanding, and prevention of traceroute measurement artifacts. 998-1018 2008 52 Comput. Networks 5 https://doi.org/10.1016/j.comnet.2007.11.017 db/journals/cn/cn52.html#VigerACMLFT08

Matthieu Latapy Walter Willinger Complex computer and communication networks. 2817-2818 2008 52 Comput. Networks 15 https://doi.org/10.1016/j.comnet.2008.06.001 db/journals/cn/cn52.html#LatapyW08

Clémence Magnien Matthieu Latapy Michel Habib Fast computation of empirically tight bounds for the diameter of massive graphs. 2008 13 ACM J. Exp. Algorithmics https://doi.org/10.1145/1412228.1455266 db/journals/jea/jea13.html#MagnienLH08

Matthieu Latapy Clémence Magnien Nathalie Del Vecchio Basic notions for the analysis of large two-mode networks. 31-48 2008 30 Soc. Networks 1 https://doi.org/10.1016/j.socnet.2007.04.006 https://www.wikidata.org/entity/Q56504707 db/journals/socnet/socnet30.html#LatapyMV08

Matthieu Latapy Main-memory triangle computations for very large (sparse (power-law)) graphs. 458-473 2008 407 Theor. Comput. Sci. 1-3 https://doi.org/10.1016/j.tcs.2008.07.017 db/journals/tcs/tcs407.html#Latapy08

Matthieu Latapy Analyse des grands graphes de terrain. 5-6 2008 CORIA http://asso-aria.org/coria/2008/5.pdf conf/coria/2008 db/conf/coria/coria2008.html#Latapy08 Matthieu Latapy Clémence Magnien Frédéric Ouédraogo A Radar for the Internet. 901-908 2008 ICDM Workshops https://doi.org/10.1109/ICDMW.2008.121 https://doi.ieeecomputersociety.org/10.1109/ICDMW.2008.121 conf/icdm/2008w db/conf/icdm/icdmw2008.html#LatapyMO08 Matthieu Latapy Clémence Magnien Complex Network Measurements: Estimating the Relevance of Observed Properties. 1660-1668 2008 INFOCOM https://doi.org/10.1109/INFOCOM.2008.227 conf/infocom/2008 db/conf/infocom/infocom2008.html#LatapyM08

Matthieu Latapy Clémence Magnien Frédéric Ouédraogo A Radar for the Internet http://arxiv.org/abs/0807.1603 2008 CoRR abs/0807.1603 db/journals/corr/corr0807.html#abs-0807-1603

Frederic Aidouni Matthieu Latapy Clémence Magnien Ten weeks in the life of an eDonkey server http://arxiv.org/abs/0809.3415 2008 CoRR abs/0809.3415 db/journals/corr/corr0809.html#abs-0809-3415

Rémi Dorat Matthieu Latapy Bernard Conein Nicolas Auray Multi-level analysis of an interaction network between individuals in a mailing-list. 325-349 2007 62 Ann. des Télécommunications 3-4 https://doi.org/10.1007/BF03253264 db/journals/adt/adt62.html#DoratLCA07

Jeremie Leguay Matthieu Latapy Timur Friedman Kavé Salamatian Describing and simulating internet routes. 2067-2085 2007 51 Comput. Networks 8 https://doi.org/10.1016/j.comnet.2006.10.008 db/journals/cn/cn51.html#LeguayLFS07

Jean-Loup Guillaume Matthieu Latapy Damien Magoni Relevance of massively distributed explorations of the Internet topology: Qualitative results. 3197-3224 2006 50 Comput. Networks 16 https://doi.org/10.1016/j.comnet.2005.12.010 db/journals/cn/cn50.html#GuillaumeLM06

Pascal Pons Matthieu Latapy Computing Communities in Large Networks Using Random Walks. 191-218 2006 10 J. Graph Algorithms Appl. 2 https://doi.org/10.7155/jgaa.00124 https://www.wikidata.org/entity/Q62072911 db/journals/jgaa/jgaa10.html#PonsL06

Ravi Kumar 0001 Matthieu Latapy Preface. 1-5 2006 355 Theor. Comput. Sci. 1 https://doi.org/10.1016/j.tcs.2005.12.004 db/journals/tcs/tcs355.html#KumarL06

Brice Augustin Xavier Cuvellier Benjamin Orgogozo Fabien Viger Timur Friedman Matthieu Latapy Clémence Magnien Renata Teixeira Avoiding traceroute anomalies with Paris traceroute. 153-158 2006 conf/imc/2006 Internet Measurement Conference https://doi.org/10.1145/1177080.1177100 db/conf/imc/imc2006.html#AugustinCOVFLMT06

Matthieu Latapy Clémence Magnien Measuring Fundamental Properties of Real-World Complex Networks http://arxiv.org/abs/cs/0609115 2006 CoRR abs/cs/0609115 db/journals/corr/corr0609.html#abs-cs-0609115

Matthieu Latapy Theory and Practice of Triangle Problems in Very Large (Sparse (Power-Law)) Graphs http://arxiv.org/abs/cs/0609116 2006 CoRR abs/cs/0609116 db/journals/corr/corr0609.html#abs-cs-0609116

Jean-Loup Guillaume Matthieu Latapy Complex Network Metrology. 2005 16 Complex Syst. 1 http://www.complex-systems.com/abstracts/v16_i01_a04.html db/journals/compsys/compsys16.html#GuillaumeL05

Frédéric Chavanon Matthieu Latapy Michel Morvan Eric Rémila Laurent Vuillon Graph encoding of 2<i>D</i>-gon tilings. 226-253 2005 346 Theor. Comput. Sci. 2-3 https://doi.org/10.1016/j.tcs.2005.08.018 db/journals/tcs/tcs346.html#ChavanonLMRV05

Fabien Viger Matthieu Latapy Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence. 440-449 2005 conf/cocoon/2005 COCOON https://doi.org/10.1007/11533719_45 db/conf/cocoon/cocoon2005.html#VigerL05 Pierre Fraigniaud Philippe Gauron Matthieu Latapy Combining the Use of Clustering and Scale-Free Nature of User Exchanges into a Simple and Efficient P2P System. 1163-1172 2005 conf/europar/2005 Euro-Par https://doi.org/10.1007/11549468_127 db/conf/europar/europar2005.html#FraigniaudGL05 Jean-Loup Guillaume Matthieu Latapy Relevance of massively distributed explorations of the Internet topology: simulation results. 1084-1094 2005 conf/infocom/2005 INFOCOM https://doi.org/10.1109/INFCOM.2005.1498336 db/conf/infocom/infocom2005.html#GuillaumeL05 Stevens Le Blond Jean-Loup Guillaume Matthieu Latapy Clustering in P2P Exchanges and Consequences on Performances. 193-204 2005 conf/iptps/2005 IPTPS https://doi.org/10.1007/11558989_18 db/conf/iptps/iptps2005.html#Le-BlondGL05 Pascal Pons Matthieu Latapy Computing Communities in Large Networks Using Random Walks. 284-293 2005 conf/iscis/2005 ISCIS https://doi.org/10.1007/11569596_31 db/conf/iscis/iscis2005.html#PonsL05 Jeremie Leguay Matthieu Latapy Timur Friedman Kavé Salamatian Describing and Simulating Internet Routes. 659-670 2005 conf/networking/2005 NETWORKING https://doi.org/10.1007/11422778_53 db/conf/networking/networking2005.html#LeguayLFS05

Fabien Viger Matthieu Latapy Fast generation of random connected graphs with prescribed degrees http://arxiv.org/abs/cs/0502085 2005 CoRR abs/cs/0502085 db/journals/corr/corr0502.html#abs-cs-0502085

Jean-Loup Guillaume Matthieu Latapy Bipartite structure of all complex networks. 215-221 2004 90 Inf. Process. Lett. 5 https://doi.org/10.1016/j.ipl.2004.03.007 db/journals/ipl/ipl90.html#GuillaumeL04

Eric Goles Ch. Matthieu Latapy Clémence Magnien Michel Morvan Ha Duong Phan Sandpile models and lattices: a comprehensive survey. 383-407 2004 322 Theor. Comput. Sci. 2 https://doi.org/10.1016/j.tcs.2004.03.019 db/journals/tcs/tcs322.html#GolesLMMP04

Jean-Loup Guillaume Matthieu Latapy Bipartite Graphs as Models of Complex Networks. 127-139 2004 conf/caan/2004 CAAN https://doi.org/10.1007/11527954_12 db/conf/caan/caan2004.html#GuillaumeL04 Jean-Loup Guillaume Matthieu Latapy Stevens Le Blond Statistical Analysis of a P2P Query Graph Based on Degrees and Their Time-Evolution. 126-137 https://doi.org/10.1007/978-3-540-30536-1_15 2004 conf/iwdc/2004 IWDC db/conf/iwdc/iwdc2004.html#GuillaumeLL04 Jean-Loup Guillaume Matthieu Latapy Clémence Magnien Comparison of Failures and Attacks on Random and Scale-Free Networks. 186-196 2004 conf/opodis/2004 OPODIS https://doi.org/10.1007/11516798_14 db/conf/opodis/opodis2004.html#GuillaumeLM04

Jeremie Leguay Matthieu Latapy Timur Friedman Kavé Salamatian Describing and Simulating Internet Routes http://arxiv.org/abs/cs.NI/0411051 2004 CoRR cs.NI/0411051 db/journals/corr/corr0411.html#cs-NI-0411051

Jean-Michel Autebert Matthieu Latapy Sylviane R. Schwer Le treillis des chemins de Delannoy. 225-234 2002 258 Discret. Math. 1-3 https://doi.org/10.1016/S0012-365X(02)00351-5 db/journals/dm/dm258.html#AutebertLS02

Matthieu Latapy Clémence Magnien Coding distributive lattices with Edge Firing Games. 125-128 2002 83 Inf. Process. Lett. 3 db/journals/ipl/ipl83.html#LatapyM02 https://doi.org/10.1016/S0020-0190(01)00319-2

Matthieu Latapy Integer Partitions, Tilings of <i>2D</i>-gons and Lattices. 389-399 2002 36 RAIRO Theor. Informatics Appl. 4 https://doi.org/10.1051/ita:2003004 db/journals/ita/ita36.html#Latapy02

Jean-Loup Guillaume Matthieu Latapy Laurent Viennot Efficient and Simple Encodings for the Web Graph. 328-337 2002 conf/waim/2002 WAIM https://doi.org/10.1007/3-540-45703-8_30 db/conf/waim/waim2002.html#GuillaumeLV02

Matthieu Latapy Roberto Mantaci Michel Morvan Ha Duong Phan Structure of some sand piles model. 525-556 2001 262 Theor. Comput. Sci. 1 db/journals/tcs/tcs262.html#LatapyMMP01 https://doi.org/10.1016/S0304-3975(00)00363-7

Matthieu Latapy Partitions of an Integer into Powers. 215-228 2001 conf/dmccg/2001 DM-CCG http://dmtcs.episciences.org/2279 db/conf/dmccg/dmccg2001.html#Latapy01

Matthieu Latapy Roberto Mantaci Michel Morvan Ha Duong Phan Structure of some sand pile model https://arxiv.org/abs/cs/0008002 2000 CoRR cs.DM/0008002 db/journals/corr/corr0008.html#cs-DM-0008002

Frederic Aidouni Alice Albano Oussama Allali Thibaud Arnoux Brice Augustin Nicolas Auray Jean-Michel Autebert Rym Baccour Esteban Bautista Daniel Faria Bernardes Clément Bertrand Stevens Le Blond Olivier Bodini Abdelhamid Salah Brahim Rémy Cazabet Eric Goles Ch. Frédéric Chavanon Thibault Cholez Isabelle Chrisment Jean-Philippe Cointet Bernard Conein Christophe Crespelle Jean Creusefond Xavier Cuvellier Ivan Daniloff Benoit Donnet Rémi Dorat Jules Azad Emery Olivier Festor Marco Fiore Raphaël Fournier-S'niehottaRaphaël Fournier Pierre Fraigniaud Timur Friedman Adrien Friggeri Noé Gaumont Philippe Gauron Nicolas Gensollen Bénédicte Le Grand Jean-Loup Guillaume Michel Habib Assia Hamzaoui Sebastien Heymann Hanna Klaudel Ravi Kumar 0001 Robin Lamarche-Perrin Bastien Legay Jeremie Leguay Clémence Magnien Damien Magoni Roberto Mantaci Pascal Mérindol Guillaume Moinard Michel Morvan Mehdi Naima Thanh Qui Nguyen Armel Jacques Nzekon Nzeko'o Benjamin Orgogozo Frédéric Tounwendyam OuédraogoFrédéric Ouédraogo Jean-Jacques Pansiot Aurore Payen Frédéric Peschanski Thi Ha Duong PhanHa Duong Phan Pascal Pons Christophe Prieur 0002 François Queyroi Bruno Quoitin Stephany Rajeh Léo Rannou Eric Rémila Elie Rotenberg Baccour Rym Kavé Salamatian Sylviane R. Schwer Frédéric Simard Michèle Soria Clara Stegehuis Lionel Tabourier Fabien Tarissan Maurice Tchuenté Renata Teixeira Guillaume Valadon Nathalie Del Vecchio Jordan Viard Tiphaine Viard Laurent Viennot Fabien Viger Laurent Vuillon Qinna Wang Xiaomin Wang Walter Willinger Audrey Wilmet Artur Ziviani