default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthieu Latapy
- > Home > Persons > Matthieu Latapy
Publications
- 2019
[j43]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. Comput. Networks 161: 197-209 (2019)- [i27]Audrey Wilmet, Tiphaine Viard, Matthieu Latapy, Robin Lamarche-Perrin:
Degree-based Outlier Detection within IP Traffic Modelled as a Link Stream. CoRR abs/1906.02524 (2019) - [i26]Matthieu Latapy, Clémence Magnien, Tiphaine Viard:
Weighted, Bipartite, or Directed Stream Graphs for the Modeling of Temporal Networks. CoRR abs/1906.04840 (2019) - 2018
- [j41]Tiphaine Viard, Clémence Magnien, Matthieu Latapy:
Enumerating maximal cliques in link streams with durations. Inf. Process. Lett. 133: 44-48 (2018) - [j40]Matthieu Latapy, Tiphaine Viard, Clémence Magnien:
Stream graphs and link streams for the modeling of interactions over time. Soc. Netw. Anal. Min. 8(1): 61:1-61:29 (2018) - [c37]Audrey Wilmet, Tiphaine Viard, Matthieu Latapy, Robin Lamarche-Perrin:
Degree-Based Outliers Detection Within IP Traffic Modelled as a Link Stream. TMA 2018: 1-8 - 2017
- [i22]Matthieu Latapy, Tiphaine Viard, Clémence Magnien:
Stream Graphs and Link Streams for the Modeling of Interactions over Time. CoRR abs/1710.04073 (2017) - [i21]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. CoRR abs/1710.07107 (2017) - [i19]Tiphaine Viard, Clémence Magnien, Matthieu Latapy:
Enumerating maximal cliques in link streams with durations. CoRR abs/1712.06970 (2017) - 2016
- [j36]Tiphaine Viard, Matthieu Latapy, Clémence Magnien:
Computing maximal cliques in link streams. Theor. Comput. Sci. 609: 245-252 (2016) - [c32]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. CompleNet 2016: 107-118 - 2015
- [i18]Tiphaine Viard, Matthieu Latapy, Clémence Magnien:
Computing maximal cliques in link streams. CoRR abs/1502.00993 (2015) - [i17]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. CoRR abs/1512.05002 (2015) - 2014
- [c28]Matthieu Latapy, Tiphaine Viard:
Complex Networks and Link Streams for the Empirical Analysis of Large Software. Petri Nets 2014: 40-50 - [i16]Tiphaine Viard, Matthieu Latapy:
Identifying roles in an IP network with temporal and structural density. CoRR abs/1406.4969 (2014)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-06-30 20:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
