Clémence Magnien

Orcid: 0000-0003-0320-4378

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Faster maximal clique enumeration in large real-world link streams.
J. Graph Algorithms Appl., 2024

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

2023
Computing Betweenness Centrality in Link Streams.
J. Graph Algorithms Appl., 2023

Temporal Betweenness Centrality on Shortest Paths Variants.
CoRR, 2023

LSCPM: Communities in Massive Real-World Link Streams by Clique Percolation Method.
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.
Proceedings of the Extraction et Gestion des Connaissances, 2023

Tailored vertex ordering for faster triangle listing in large graphs.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2021
Ranking Online Social Users by Their Influence.
IEEE/ACM Trans. Netw., 2021

Clique Percolation Method: Memory Efficient Almost Exact Communities.
Proceedings of the Advanced Data Mining and Applications - 17th International Conference, 2021

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

Strongly Connected Components in Stream Graphs: Computation and Experimentations.
Proceedings of the Complex Networks & Their Applications IX, 2020

2019
Centrality Metrics in Dynamic Networks: A Comparison Study.
IEEE Trans. Netw. Sci. Eng., 2019

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

Approximating the Temporal Neighbourhood Function of Large Temporal Graphs.
Algorithms, 2019

2018
Stream graphs and link streams for the modeling of interactions over time.
Soc. Netw. Anal. Min., 2018

Enumerating maximal cliques in link streams with durations.
Inf. Process. Lett., 2018

Comparaison de mesures de centralité basées sur les plus courts chemins dans les réseaux dynamiques.
Proceedings of the Extraction et Gestion des Connaissances, 2018

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

2016
Computing maximal cliques in link streams.
Theor. Comput. Sci., 2016

Finding remarkably dense sequences of contacts in link streams.
Soc. Netw. Anal. Min., 2016

2015
Expected Nodes: A Quality Function for the Detection of Link Communities.
Proceedings of the Complex Networks VI, 2015

Revealing contact patterns among high-school students using maximal cliques in link streams.
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.
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‡.
J. Complex Networks, 2014

2013
Internal links and pairs as a new tool for the analysis of bipartite complex networks.
Soc. Netw. Anal. Min., 2013

Quantifying paedophile activity in a large P2P system.
Inf. Process. Manag., 2013

Internal link prediction: A new approach for predicting links in bipartite graphs.
Intell. Data Anal., 2013

2012
Comparing paedophile activity in different P2P systems
CoRR, 2012

Impact of power-law topology on IP-level routing dynamics: Simulation results.
Proceedings of the 2012 Proceedings IEEE INFOCOM Workshops, 2012

Outskewer: Using Skewness to Spot Outliers in Samples and Time Series.
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.
ACM Comput. Surv., 2011

Towards realistic modeling of IP-level routing topology dynamics
CoRR, 2011

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

A Radar for the Internet.
Complex Syst., 2011

Impact of sources and destinations on the observed properties of the internet topology.
Comput. Commun., 2011

Quantifying paedophile queries in a large P2P system.
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.
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
CoRR, 2009

Mobile IPv6 deployments: Graph-based analysis and practical guidelines.
Comput. Commun., 2009

Measurement of eDonkey activity with distributed honeypots.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Ten weeks in the life of an eDonkey server.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008
Basic notions for the analysis of large two-mode networks.
Soc. Networks, 2008

Fast computation of empirically tight bounds for the diameter of massive graphs.
ACM J. Exp. Algorithmics, 2008

Detection, understanding, and prevention of traceroute measurement artifacts.
Comput. Networks, 2008

Complex Network Measurements: Estimating the Relevance of Observed Properties.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2007
Evolving networks.
Proceedings of the Mining Massive Data Sets for Security, 2007

2006
Measuring Fundamental Properties of Real-World Complex Networks
CoRR, 2006

Avoiding traceroute anomalies with Paris traceroute.
Proceedings of the 6th ACM SIGCOMM Internet Measurement Conference, 2006

2004
Sandpile models and lattices: a comprehensive survey.
Theor. Comput. Sci., 2004

Comparison of Failures and Attacks on Random and Scale-Free Networks.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

2003
Classes of lattices induced by chip firing (and sandpile) dynamics.
Eur. J. Comb., 2003

Results and conjectures on the Sandpile Identity on a lattice.
Proceedings of the Discrete Models for Complex Systems, 2003

2002
Coding distributive lattices with Edge Firing Games.
Inf. Process. Lett., 2002

2001
Characterization of Lattices Induced by (extended) Chip Firing Games.
Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001


  Loading...