Clémence Magnien

According to our database, Clémence Magnien authored at least 54 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Faster maximal clique enumeration in large real-world link streams.

Alexis Baudin, Clémence Magnien, Lionel Tabourier

J. Graph Algorithms Appl., 2024

BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs.

Alexis Baudin, Clémence Magnien, Lionel Tabourier

CoRR, 2024

2023

Computing Betweenness Centrality in Link Streams.

Frédéric Simard, Clémence Magnien, Matthieu Latapy

J. Graph Algorithms Appl., 2023

Temporal Betweenness Centrality on Shortest Paths Variants.

Mehdi Naima, Matthieu Latapy, Clémence Magnien

CoRR, 2023

LSCPM: Communities in Massive Real-World Link Streams by Clique Percolation Method.

Alexis Baudin, Lionel Tabourier, Clémence Magnien

Proceedings of the 30th International Symposium on Temporal Representation and Reasoning, 2023

Énumération efficace des cliques maximales dans les flots de liens réels massifs.

Alexis Baudin, Clémence Magnien, Lionel Tabourier

Proceedings of the Extraction et Gestion des Connaissances, 2023

Tailored vertex ordering for faster triangle listing in large graphs.

Fabrice Lécuyer, Louis Jachiet, Clémence Magnien, Lionel Tabourier

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2021

Ranking Online Social Users by Their Influence.

Anastasios Giovanidis, Bruno Baynat, Clémence Magnien, Antoine Vendeville

IEEE/ACM Trans. Netw., 2021

Clique Percolation Method: Memory Efficient Almost Exact Communities.

Alexis Baudin, Maximilien Danisch, Sergey Kirgizov, Clémence Magnien, Marwan Ghanem

Proceedings of the Advanced Data Mining and Applications - 17th International Conference, 2021

2020

Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs.

Pierluigi Crescenzi, Clémence Magnien, Andrea Marino

Algorithms, 2020

Strongly Connected Components in Stream Graphs: Computation and Experimentations.

Léo Rannou, Clémence Magnien, Matthieu Latapy

Proceedings of the Complex Networks & Their Applications IX, 2020

2019

Centrality Metrics in Dynamic Networks: A Comparison Study.

Marwan Ghanem, Clémence Magnien, Fabien Tarissan

IEEE Trans. Netw. Sci. Eng., 2019

Weighted, Bipartite, or Directed Stream Graphs for the Modeling of Temporal Networks.

Matthieu Latapy, Clémence Magnien, Tiphaine Viard

CoRR, 2019

Approximating the Temporal Neighbourhood Function of Large Temporal Graphs.

Pierluigi Crescenzi, Clémence Magnien, Andrea Marino

Algorithms, 2019

2018

Stream graphs and link streams for the modeling of interactions over time.

Matthieu Latapy, Tiphaine Viard, Clémence Magnien

Soc. Netw. Anal. Min., 2018

Enumerating maximal cliques in link streams with durations.

Tiphaine Viard, Clémence Magnien, Matthieu Latapy

Inf. Process. Lett., 2018

Comparaison de mesures de centralité basées sur les plus courts chemins dans les réseaux dynamiques.

Marwan Ghanem, Clémence Magnien, Fabien Tarissan

Proceedings of the Extraction et Gestion des Connaissances, 2018

2017

Discovering Patterns of Interest in IP Traffic Using Cliques in Bipartite Link Streams.

Tiphaine Viard, Raphaël Fournier-S'niehotta, Clémence Magnien, Matthieu Latapy

CoRR, 2017

2016

Computing maximal cliques in link streams.

Tiphaine Viard, Matthieu Latapy, Clémence Magnien

Theor. Comput. Sci., 2016

Finding remarkably dense sequences of contacts in link streams.

Noé Gaumont, Clémence Magnien, Matthieu Latapy

Soc. Netw. Anal. Min., 2016

2015

Expected Nodes: A Quality Function for the Detection of Link Communities.

Noé Gaumont, François Queyroi, Clémence Magnien, Matthieu Latapy

Proceedings of the Complex Networks VI, 2015

Revealing contact patterns among high-school students using maximal cliques in link streams.

Jordan Viard, Matthieu Latapy, Clémence Magnien

Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

Time Evolution of the Importance of Nodes in dynamic Networks.

Clémence Magnien, Fabien Tarissan

Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

2014

Detecting events in the dynamics of ego-centred measurements of the Internet topology‡.

Matthieu Latapy, Assia Hamzaoui, Clémence Magnien

J. Complex Networks, 2014

2013

Internal links and pairs as a new tool for the analysis of bipartite complex networks.

Oussama Allali, Lionel Tabourier, Clémence Magnien, Matthieu Latapy

Soc. Netw. Anal. Min., 2013

Quantifying paedophile activity in a large P2P system.

Matthieu Latapy, Clémence Magnien, Raphaël Fournier

Inf. Process. Manag., 2013

Internal link prediction: A new approach for predicting links in bipartite graphs.

Oussama Allali, Clémence Magnien, Matthieu Latapy

Intell. Data Anal., 2013

2012

Comparing paedophile activity in different P2P systems

Raphaël Fournier, Thibault Cholez, Matthieu Latapy, Clémence Magnien, Isabelle Chrisment, Ivan Daniloff, Olivier Festor

CoRR, 2012

Impact of power-law topology on IP-level routing dynamics: Simulation results.

Amelie Medem Kuatse, Clémence Magnien, Fabien Tarissan

Proceedings of the 2012 Proceedings IEEE INFOCOM Workshops, 2012

Outskewer: Using Skewness to Spot Outliers in Samples and Time Series.

Sebastien Heymann, Matthieu Latapy, Clémence Magnien

Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

2011

Impact of random failures and attacks on Poisson and power-law random networks.

Clémence Magnien, Matthieu Latapy, Jean-Loup Guillaume

ACM Comput. Surv., 2011

Towards realistic modeling of IP-level routing topology dynamics

Clémence Magnien, Amelie Medem Kuatse, Fabien Tarissan

CoRR, 2011

Removing bias due to finite measurement of dynamic systems: case study on P2P systems

Lamia Benamara, Clémence Magnien

CoRR, 2011

A Radar for the Internet.

Matthieu Latapy, Clémence Magnien, Frédéric Ouédraogo

Complex Syst., 2011

Impact of sources and destinations on the observed properties of the internet topology.

Frédéric Ouédraogo, Clémence Magnien

Comput. Commun., 2011

Quantifying paedophile queries in a large P2P system.

Matthieu Latapy, Clémence Magnien, Raphaël Fournier

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010

Detecting events in the dynamics of ego-centered measurements of the internet topology.

Assia Hamzaoui, Matthieu Latapy, Clémence Magnien

Proceedings of the 8th International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt 2010), May 31, 2010

2009

Fast dynamics in Internet topology: preliminary observations and explanations

Clémence Magnien, Frédéric Ouédraogo, Guillaume Valadon, Matthieu Latapy

CoRR, 2009

Mobile IPv6 deployments: Graph-based analysis and practical guidelines.

Guillaume Valadon, Clémence Magnien, Ryuji Wakikawa

Comput. Commun., 2009

Measurement of eDonkey activity with distributed honeypots.

Oussama Allali, Matthieu Latapy, Clémence Magnien

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Ten weeks in the life of an eDonkey server.

Frederic Aidouni, Matthieu Latapy, Clémence Magnien

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008

Basic notions for the analysis of large two-mode networks.

Matthieu Latapy, Clémence Magnien, Nathalie Del Vecchio

Soc. Networks, 2008

Fast computation of empirically tight bounds for the diameter of massive graphs.

Clémence Magnien, Matthieu Latapy, Michel Habib

ACM J. Exp. Algorithmics, 2008

Detection, understanding, and prevention of traceroute measurement artifacts.

Fabien Viger, Brice Augustin, Xavier Cuvellier, Clémence Magnien, Matthieu Latapy, Timur Friedman, Renata Teixeira

Comput. Networks, 2008

Complex Network Measurements: Estimating the Relevance of Observed Properties.

Matthieu Latapy, Clémence Magnien

Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007

Evolving networks.

Pierre Borgnat, Eric Fleury, Jean-Loup Guillaume, Clémence Magnien, Céline Robardet, Antoine Scherrer

Proceedings of the Mining Massive Data Sets for Security, 2007

2006

Measuring Fundamental Properties of Real-World Complex Networks

Matthieu Latapy, Clémence Magnien

CoRR, 2006

Avoiding traceroute anomalies with Paris traceroute.

Brice Augustin, Xavier Cuvellier, Benjamin Orgogozo, Fabien Viger, Timur Friedman, Matthieu Latapy, Clémence Magnien, Renata Teixeira

Proceedings of the 6th ACM SIGCOMM Internet Measurement Conference, 2006

2004

Sandpile models and lattices: a comprehensive survey.

Eric Goles Ch., Matthieu Latapy, Clémence Magnien, Michel Morvan, Ha Duong Phan

Theor. Comput. Sci., 2004

Comparison of Failures and Attacks on Random and Scale-Free Networks.

Jean-Loup Guillaume, Matthieu Latapy, Clémence Magnien

Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

2003

Classes of lattices induced by chip firing (and sandpile) dynamics.

Clémence Magnien

Eur. J. Comb., 2003

Results and conjectures on the Sandpile Identity on a lattice.

Arnaud Dartois, Clémence Magnien

Proceedings of the Discrete Models for Complex Systems, 2003

2002

Coding distributive lattices with Edge Firing Games.

Matthieu Latapy, Clémence Magnien

Inf. Process. Lett., 2002

2001

Characterization of Lattices Induced by (extended) Chip Firing Games.

Clémence Magnien, Ha Duong Phan, Laurent Vuillon

Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001