default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClémence Magnien
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j24]Alexis Baudin, Clémence Magnien, Lionel Tabourier:
Faster maximal clique enumeration in large real-world link streams. J. Graph Algorithms Appl. 28(1): 149-178 (2024)- [i26]Alexis Baudin, Clémence Magnien, Lionel Tabourier:
BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs. CoRR abs/2405.04428 (2024) - 2023
- [j23]Frédéric Simard, Clémence Magnien, Matthieu Latapy:
Computing Betweenness Centrality in Link Streams. J. Graph Algorithms Appl. 27(3): 195-217 (2023) - [c22]Fabrice Lécuyer, Louis Jachiet, Clémence Magnien, Lionel Tabourier:
Tailored vertex ordering for faster triangle listing in large graphs. ALENEX 2023: 77-85 - [c21]Alexis Baudin, Clémence Magnien, Lionel Tabourier:
Énumération efficace des cliques maximales dans les flots de liens réels massifs. EGC 2023: 139-150 - [c20]Alexis Baudin, Lionel Tabourier, Clémence Magnien:
LSCPM: Communities in Massive Real-World Link Streams by Clique Percolation Method. TIME 2023: 3:1-3:18 - [i25]Alexis Baudin, Clémence Magnien, Lionel Tabourier:
Faster maximal clique enumeration in large real-world link streams. CoRR abs/2302.00360 (2023) - [i24]Mehdi Naima, Matthieu Latapy, Clémence Magnien:
Temporal Betweenness Centrality on Shortest Paths Variants. CoRR abs/2305.01080 (2023) - [i23]Alexis Baudin, Lionel Tabourier, Clémence Magnien:
LSCPM: communities in massive real-world Link Streams by Clique Percolation Method. CoRR abs/2308.10801 (2023) - 2022
- [i22]Fabrice Lécuyer
, Louis Jachiet, Clémence Magnien, Lionel Tabourier:
Tailored vertex ordering for faster triangle listing in large graphs. CoRR abs/2203.04774 (2022) - 2021
- [j22]Anastasios Giovanidis, Bruno Baynat, Clémence Magnien, Antoine Vendeville:
Ranking Online Social Users by Their Influence. IEEE/ACM Trans. Netw. 29(5): 2198-2214 (2021) - [c19]Alexis Baudin, Maximilien Danisch, Sergey Kirgizov, Clémence Magnien, Marwan Ghanem:
Clique Percolation Method: Memory Efficient Almost Exact Communities. ADMA 2021: 113-127 - [i21]Frédéric Simard, Clémence Magnien, Matthieu Latapy:
Computing Betweenness Centrality in Link Streams. CoRR abs/2102.06543 (2021) - [i20]Anastasios Giovanidis, Bruno Baynat, Clémence Magnien, Antoine Vendeville:
Ranking Online Social Users by their Influence. CoRR abs/2107.01914 (2021) - [i19]Alexis Baudin, Maximilien Danisch, Sergey Kirgizov, Clémence Magnien, Marwan Ghanem:
Clique percolation method: memory efficient almost exact communities. CoRR abs/2110.01213 (2021) - 2020
- [j21]Pierluigi Crescenzi, Clémence Magnien, Andrea Marino:
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs. Algorithms 13(9): 211 (2020) - [c18]Léo Rannou, Clémence Magnien, Matthieu Latapy:
Strongly Connected Components in Stream Graphs: Computation and Experimentations. COMPLEX NETWORKS (1) 2020: 568-580 - [i18]Léo Rannou, Clémence Magnien, Matthieu Latapy:
Strongly Connected Components in Stream Graphs: Computation and Experimentations. CoRR abs/2011.08054 (2020)
2010 – 2019
- 2019
- [j20]Pierluigi Crescenzi, Clémence Magnien, Andrea Marino:
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs. Algorithms 12(10): 211 (2019) - [j19]Marwan Ghanem, Clémence Magnien, Fabien Tarissan:
Centrality Metrics in Dynamic Networks: A Comparison Study. IEEE Trans. Netw. Sci. Eng. 6(4): 940-951 (2019) - [i17]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
- [j18]Tiphaine Viard, Clémence Magnien, Matthieu Latapy:
Enumerating maximal cliques in link streams with durations. Inf. Process. Lett. 133: 44-48 (2018) - [j17]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) - [c17]Marwan Ghanem, Clémence Magnien, Fabien Tarissan:
Comparaison de mesures de centralité basées sur les plus courts chemins dans les réseaux dynamiques. EGC 2018: 391-396 - 2017
- [i16]Matthieu Latapy, Tiphaine Viard, Clémence Magnien:
Stream Graphs and Link Streams for the Modeling of Interactions over Time. CoRR abs/1710.04073 (2017) - [i15]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) - [i14]Tiphaine Viard, Clémence Magnien, Matthieu Latapy:
Enumerating maximal cliques in link streams with durations. CoRR abs/1712.06970 (2017) - 2016
- [j16]Noé Gaumont, Clémence Magnien, Matthieu Latapy:
Finding remarkably dense sequences of contacts in link streams. Soc. Netw. Anal. Min. 6(1): 87:1-87:14 (2016) - [j15]Tiphaine Viard, Matthieu Latapy, Clémence Magnien:
Computing maximal cliques in link streams. Theor. Comput. Sci. 609: 245-252 (2016) - 2015
- [c16]Clémence Magnien, Fabien Tarissan:
Time Evolution of the Importance of Nodes in dynamic Networks. ASONAM 2015: 1200-1207 - [c15]Jordan Viard, Matthieu Latapy, Clémence Magnien:
Revealing contact patterns among high-school students using maximal cliques in link streams. ASONAM 2015: 1517-1522 - [c14]Noé Gaumont, François Queyroi, Clémence Magnien, Matthieu Latapy:
Expected Nodes: A Quality Function for the Detection of Link Communities. CompleNet 2015: 57-64 - [i13]Tiphaine Viard, Matthieu Latapy, Clémence Magnien:
Computing maximal cliques in link streams. CoRR abs/1502.00993 (2015) - 2014
- [j14]Matthieu Latapy, Assia Hamzaoui, Clémence Magnien:
Detecting events in the dynamics of ego-centred measurements of the Internet topology‡. J. Complex Networks 2(1): 38-59 (2014) - 2013
- [j13]Oussama Allali, Clémence Magnien, Matthieu Latapy:
Internal link prediction: A new approach for predicting links in bipartite graphs. Intell. Data Anal. 17(1): 5-25 (2013) - [j12]Matthieu Latapy, Clémence Magnien, Raphaël Fournier:
Quantifying paedophile activity in a large P2P system. Inf. Process. Manag. 49(1): 248-263 (2013) - [j11]Oussama Allali, Lionel Tabourier, Clémence Magnien, Matthieu Latapy:
Internal links and pairs as a new tool for the analysis of bipartite complex networks. Soc. Netw. Anal. Min. 3(1): 85-91 (2013) - 2012
- [c13]Sebastien Heymann, Matthieu Latapy, Clémence Magnien:
Outskewer: Using Skewness to Spot Outliers in Samples and Time Series. ASONAM 2012: 527-534 - [c12]Amelie Medem Kuatse, Clémence Magnien, Fabien Tarissan:
Impact of power-law topology on IP-level routing dynamics: Simulation results. INFOCOM Workshops 2012: 220-225 - [i12]Matthieu Latapy, Clémence Magnien, Raphaël Fournier:
Quantifying Paedophile Activity in a Large P2P System. CoRR abs/1206.4166 (2012) - [i11]Raphaël Fournier, Thibault Cholez, Matthieu Latapy, Clémence Magnien, Isabelle Chrisment, Ivan Daniloff, Olivier Festor:
Comparing paedophile activity in different P2P systems. CoRR abs/1206.4167 (2012) - 2011
- [j10]Frédéric Ouédraogo, Clémence Magnien:
Impact of sources and destinations on the observed properties of the internet topology. Comput. Commun. 34(5): 670-679 (2011) - [j9]Matthieu Latapy, Clémence Magnien, Frédéric Ouédraogo:
A Radar for the Internet. Complex Syst. 20(1) (2011) - [j8]Clémence Magnien, Matthieu Latapy, Jean-Loup Guillaume:
Impact of random failures and attacks on Poisson and power-law random networks. ACM Comput. Surv. 43(3): 13:1-13:31 (2011) - [c11]Matthieu Latapy, Clémence Magnien, Raphaël Fournier:
Quantifying paedophile queries in a large P2P system. INFOCOM 2011: 401-405 - [i10]Lamia Benamara, Clémence Magnien:
Removing bias due to finite measurement of dynamic systems: case study on P2P systems. CoRR abs/1104.3694 (2011) - [i9]Oussama Allali, Lionel Tabourier, Clémence Magnien, Matthieu Latapy:
Internal links and pairs as a new tool for the analysis of bipartite complex networks. CoRR abs/1104.4418 (2011) - [i8]Clémence Magnien, Amelie Medem Kuatse, Fabien Tarissan:
Towards realistic modeling of IP-level routing topology dynamics. CoRR abs/1112.4645 (2011) - 2010
- [c10]Assia Hamzaoui, Matthieu Latapy, Clémence Magnien:
Detecting events in the dynamics of ego-centered measurements of the internet topology. WiOpt 2010: 505-512
2000 – 2009
- 2009
- [j7]Guillaume Valadon, Clémence Magnien, Ryuji Wakikawa:
Mobile IPv6 deployments: Graph-based analysis and practical guidelines. Comput. Commun. 32(17): 1871-1880 (2009) - [c9]Frederic Aidouni, Matthieu Latapy, Clémence Magnien:
Ten weeks in the life of an eDonkey server. IPDPS 2009: 1-5 - [c8]Oussama Allali, Matthieu Latapy, Clémence Magnien:
Measurement of eDonkey activity with distributed honeypots. IPDPS 2009: 1-8 - [i7]Clémence Magnien, Frédéric Ouédraogo, Guillaume Valadon, Matthieu Latapy:
Fast dynamics in Internet topology: preliminary observations and explanations. CoRR abs/0904.2716 (2009) - [i6]Clémence Magnien, Matthieu Latapy, Michel Habib:
Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs. CoRR abs/0904.2728 (2009) - [i5]Fabien Viger, Brice Augustin, Xavier Cuvellier, Clémence Magnien, Matthieu Latapy, Timur Friedman, Renata Teixeira:
Detection, Understanding, and Prevention of Traceroute Measurement Artifacts. CoRR abs/0904.2733 (2009) - [i4]Oussama Allali, Matthieu Latapy, Clémence Magnien:
Measurement of eDonkey Activity with Distributed Honeypots. CoRR abs/0904.3215 (2009) - 2008
- [j6]Fabien Viger, Brice Augustin, Xavier Cuvellier, Clémence Magnien, Matthieu Latapy, Timur Friedman, Renata Teixeira:
Detection, understanding, and prevention of traceroute measurement artifacts. Comput. Networks 52(5): 998-1018 (2008) - [j5]Clémence Magnien, Matthieu Latapy, Michel Habib:
Fast computation of empirically tight bounds for the diameter of massive graphs. ACM J. Exp. Algorithmics 13 (2008) - [j4]Matthieu Latapy, Clémence Magnien, Nathalie Del Vecchio:
Basic notions for the analysis of large two-mode networks. Soc. Networks 30(1): 31-48 (2008) - [c7]Matthieu Latapy, Clémence Magnien, Frédéric Ouédraogo:
A Radar for the Internet. ICDM Workshops 2008: 901-908 - [c6]Matthieu Latapy, Clémence Magnien:
Complex Network Measurements: Estimating the Relevance of Observed Properties. INFOCOM 2008: 1660-1668 - [i3]Matthieu Latapy, Clémence Magnien, Frédéric Ouédraogo:
A Radar for the Internet. CoRR abs/0807.1603 (2008) - [i2]Frederic Aidouni, Matthieu Latapy, Clémence Magnien:
Ten weeks in the life of an eDonkey server. CoRR abs/0809.3415 (2008) - 2007
- [c5]Pierre Borgnat, Eric Fleury, Jean-Loup Guillaume, Clémence Magnien, Céline Robardet, Antoine Scherrer:
Evolving networks. NATO ASI Mining Massive Data Sets for Security 2007: 198-203 - 2006
- [c4]Brice Augustin, Xavier Cuvellier, Benjamin Orgogozo, Fabien Viger, Timur Friedman, Matthieu Latapy, Clémence Magnien, Renata Teixeira:
Avoiding traceroute anomalies with Paris traceroute. Internet Measurement Conference 2006: 153-158 - [i1]Matthieu Latapy, Clémence Magnien:
Measuring Fundamental Properties of Real-World Complex Networks. CoRR abs/cs/0609115 (2006) - 2004
- [j3]Eric Goles Ch., Matthieu Latapy, Clémence Magnien, Michel Morvan, Ha Duong Phan:
Sandpile models and lattices: a comprehensive survey. Theor. Comput. Sci. 322(2): 383-407 (2004) - [c3]Jean-Loup Guillaume, Matthieu Latapy, Clémence Magnien:
Comparison of Failures and Attacks on Random and Scale-Free Networks. OPODIS 2004: 186-196 - 2003
- [j2]Clémence Magnien:
Classes of lattices induced by chip firing (and sandpile) dynamics. Eur. J. Comb. 24(6): 665-683 (2003) - [c2]Arnaud Dartois, Clémence Magnien:
Results and conjectures on the Sandpile Identity on a lattice. DMCS 2003: 89-102 - 2002
- [j1]Matthieu Latapy, Clémence Magnien:
Coding distributive lattices with Edge Firing Games. Inf. Process. Lett. 83(3): 125-128 (2002) - 2001
- [c1]Clémence Magnien, Ha Duong Phan, Laurent Vuillon:
Characterization of Lattices Induced by (extended) Chip Firing Games. DM-CCG 2001: 229-244
Coauthor Index
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.
Reference lists
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.
Citation data
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.
OpenAlex data
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 2024-11-07 20:35 CET 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:
