Clémence Magnien

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 34

Top Topics

Strongly Connected

Bipartite Graph

Betweenness Centrality

Dynamic Networks

Top Venues

Soc. Netw. Anal. Min.

Publications

Alexis Baudin, Clémence Magnien, Lionel Tabourier
Faster maximal clique enumeration in large real-world link streams. J. Graph Algorithms Appl. 28 (1) (2024)
Alexis Baudin, Clémence Magnien, Lionel Tabourier
BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs. CoRR (2024)
Fabrice Lécuyer, Louis Jachiet, Clémence Magnien, Lionel Tabourier
Tailored vertex ordering for faster triangle listing in large graphs. ALENEX (2023)
Mehdi Naima, Matthieu Latapy, Clémence Magnien
Temporal Betweenness Centrality on Shortest Paths. CoRR (2023)
Mehdi Naima, Matthieu Latapy, Clémence Magnien
Temporal Betweenness Centrality on Shortest Paths Variants. CoRR (2023)
Alexis Baudin, Clémence Magnien, Lionel Tabourier
Faster maximal clique enumeration in large real-world link streams. CoRR (2023)
Frédéric Simard, Clémence Magnien, Matthieu Latapy
Computing Betweenness Centrality in Link Streams. J. Graph Algorithms Appl. 27 (3) (2023)
Alexis Baudin, Lionel Tabourier, Clémence Magnien
LSCPM: communities in massive real-world Link Streams by Clique Percolation Method. CoRR (2023)
Alexis Baudin, Lionel Tabourier, Clémence Magnien
LSCPM: Communities in Massive Real-World Link Streams by Clique Percolation Method. TIME (2023)
Alexis Baudin, Clémence Magnien, Lionel Tabourier
Énumération efficace des cliques maximales dans les flots de liens réels massifs. EGC (2023)
Fabrice Lécuyer, Louis Jachiet, Clémence Magnien, Lionel Tabourier
Tailored vertex ordering for faster triangle listing in large graphs. CoRR (2022)
Alexis Baudin, Maximilien Danisch, Sergey Kirgizov, Clémence Magnien, Marwan Ghanem
Clique percolation method: memory efficient almost exact communities. CoRR (2021)
Alexis Baudin, Maximilien Danisch, Sergey Kirgizov, Clémence Magnien, Marwan Ghanem
Clique Percolation Method: Memory Efficient Almost Exact Communities. ADMA (2021)
Anastasios Giovanidis, Bruno Baynat, Clémence Magnien, Antoine Vendeville
Ranking Online Social Users by their Influence. CoRR (2021)
Anastasios Giovanidis, Bruno Baynat, Clémence Magnien, Antoine Vendeville
Ranking Online Social Users by Their Influence. IEEE/ACM Trans. Netw. 29 (5) (2021)
Frédéric Simard, Clémence Magnien, Matthieu Latapy
Computing Betweenness Centrality in Link Streams. CoRR (2021)
Léo Rannou, Clémence Magnien, Matthieu Latapy
Strongly Connected Components in Stream Graphs: Computation and Experimentations. CoRR (2020)
Léo Rannou, Clémence Magnien, Matthieu Latapy
Strongly Connected Components in Stream Graphs: Computation and Experimentations. COMPLEX NETWORKS (1) (2020)
Pierluigi Crescenzi, Clémence Magnien, Andrea Marino
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs. Algorithms 13 (9) (2020)
Marwan Ghanem, Clémence Magnien, Fabien Tarissan
Centrality Metrics in Dynamic Networks: A Comparison Study. IEEE Trans. Netw. Sci. Eng. 6 (4) (2019)
Pierluigi Crescenzi, Clémence Magnien, Andrea Marino
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs. Algorithms 12 (10) (2019)
Matthieu Latapy, Clémence Magnien, Tiphaine Viard
Weighted, Bipartite, or Directed Stream Graphs for the Modeling of Temporal Networks. CoRR (2019)
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) (2018)
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)
Tiphaine Viard, Clémence Magnien, Matthieu Latapy
Enumerating maximal cliques in link streams with durations. Inf. Process. Lett. 133 (2018)
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 (2017)
Matthieu Latapy, Tiphaine Viard, Clémence Magnien
Stream Graphs and Link Streams for the Modeling of Interactions over Time. CoRR (2017)
Tiphaine Viard, Clémence Magnien, Matthieu Latapy
Enumerating maximal cliques in link streams with durations. CoRR (2017)
Tiphaine Viard, Matthieu Latapy, Clémence Magnien
Computing maximal cliques in link streams. Theor. Comput. Sci. 609 (2016)
Noé Gaumont, Clémence Magnien, Matthieu Latapy
Finding remarkably dense sequences of contacts in link streams. Soc. Netw. Anal. Min. 6 (1) (2016)
Noé Gaumont, François Queyroi, Clémence Magnien, Matthieu Latapy
Expected Nodes: A Quality Function for the Detection of Link Communities. CompleNet (2015)
Jordan Viard, Matthieu Latapy, Clémence Magnien
Revealing contact patterns among high-school students using maximal cliques in link streams. ASONAM (2015)
Clémence Magnien, Fabien Tarissan
Time Evolution of the Importance of Nodes in dynamic Networks. ASONAM (2015)
Tiphaine Viard, Matthieu Latapy, Clémence Magnien
Computing maximal cliques in link streams. CoRR (2015)
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) (2014)
Oussama Allali, Clémence Magnien, Matthieu Latapy
Internal link prediction: A new approach for predicting links in bipartite graphs. Intell. Data Anal. 17 (1) (2013)
Matthieu Latapy, Clémence Magnien, Raphaël Fournier
Quantifying paedophile activity in a large P2P system. Inf. Process. Manag. 49 (1) (2013)
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) (2013)
Amelie Medem Kuatse, Clémence Magnien, Fabien Tarissan
Impact of power-law topology on IP-level routing dynamics: Simulation results. INFOCOM Workshops (2012)
Raphaël Fournier, Thibault Cholez, Matthieu Latapy, Clémence Magnien, Isabelle Chrisment, Ivan Daniloff, Olivier Festor
Comparing paedophile activity in different P2P systems CoRR (2012)
Sebastien Heymann, Matthieu Latapy, Clémence Magnien
Outskewer: Using Skewness to Spot Outliers in Samples and Time Series. ASONAM (2012)
Matthieu Latapy, Clémence Magnien, Raphaël Fournier
Quantifying Paedophile Activity in a Large P2P System CoRR (2012)
Lamia Benamara, Clémence Magnien
Removing bias due to finite measurement of dynamic systems: case study on P2P systems CoRR (2011)
Matthieu Latapy, Clémence Magnien, Frédéric Ouédraogo
A Radar for the Internet. Complex Syst. 20 (1) (2011)
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) (2011)
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 (2011)
Clémence Magnien, Amelie Medem Kuatse, Fabien Tarissan
Towards realistic modeling of IP-level routing topology dynamics CoRR (2011)
Matthieu Latapy, Clémence Magnien, Raphaël Fournier
Quantifying paedophile queries in a large P2P system. INFOCOM (2011)
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) (2011)
Assia Hamzaoui, Matthieu Latapy, Clémence Magnien
Detecting events in the dynamics of ego-centered measurements of the internet topology. WiOpt (2010)
Oussama Allali, Matthieu Latapy, Clémence Magnien
Measurement of eDonkey activity with distributed honeypots. IPDPS (2009)
Guillaume Valadon, Clémence Magnien, Ryuji Wakikawa
Mobile IPv6 deployments: Graph-based analysis and practical guidelines. Comput. Commun. 32 (17) (2009)
Oussama Allali, Matthieu Latapy, Clémence Magnien
Measurement of eDonkey Activity with Distributed Honeypots CoRR (2009)
Frederic Aidouni, Matthieu Latapy, Clémence Magnien
Ten weeks in the life of an eDonkey server. IPDPS (2009)
Clémence Magnien, Matthieu Latapy, Michel Habib
Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs CoRR (2009)
Clémence Magnien, Frédéric Ouédraogo, Guillaume Valadon, Matthieu Latapy
Fast dynamics in Internet topology: preliminary observations and explanations CoRR (2009)
Fabien Viger, Brice Augustin, Xavier Cuvellier, Clémence Magnien, Matthieu Latapy, Timur Friedman, Renata Teixeira
Detection, Understanding, and Prevention of Traceroute Measurement Artifacts CoRR (2009)
Matthieu Latapy, Clémence Magnien, Frédéric Ouédraogo
A Radar for the Internet. ICDM Workshops (2008)
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) (2008)
Matthieu Latapy, Clémence Magnien, Frédéric Ouédraogo
A Radar for the Internet CoRR (2008)
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)
Matthieu Latapy, Clémence Magnien
Complex Network Measurements: Estimating the Relevance of Observed Properties. INFOCOM (2008)
Matthieu Latapy, Clémence Magnien, Nathalie Del Vecchio
Basic notions for the analysis of large two-mode networks. Soc. Networks 30 (1) (2008)
Frederic Aidouni, Matthieu Latapy, Clémence Magnien
Ten weeks in the life of an eDonkey server CoRR (2008)
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)
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)
Matthieu Latapy, Clémence Magnien
Measuring Fundamental Properties of Real-World Complex Networks CoRR (2006)
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) (2004)
Jean-Loup Guillaume, Matthieu Latapy, Clémence Magnien
Comparison of Failures and Attacks on Random and Scale-Free Networks. OPODIS (2004)
Arnaud Dartois, Clémence Magnien
Results and conjectures on the Sandpile Identity on a lattice. DMCS (2003)
Clémence Magnien
Classes of lattices induced by chip firing (and sandpile) dynamics. Eur. J. Comb. 24 (6) (2003)
Matthieu Latapy, Clémence Magnien
Coding distributive lattices with Edge Firing Games. Inf. Process. Lett. 83 (3) (2002)
Clémence Magnien, Ha Duong Phan, Laurent Vuillon
Characterization of Lattices Induced by (extended) Chip Firing Games. DM-CCG (2001)