Clémence Magnien

J. Graph Algorithms Appl., 2023

Temporal Betweenness Centrality on Shortest Paths Variants.

[BibT_eX]

[DOI]

Mehdi Naima

CoRR, 2023

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

[BibT_eX]

[DOI]

Alexis Baudin

Lionel Tabourier

CoRR, 2023

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

[BibT_eX]

[DOI]

Alexis Baudin

Lionel Tabourier

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.

[BibT_eX]

[DOI]

Alexis Baudin

Lionel Tabourier

Proceedings of the Extraction et Gestion des Connaissances, 2023

Tailored vertex ordering for faster triangle listing in large graphs.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2021

Ranking Online Social Users by Their Influence.

[BibT_eX]

[DOI]

Anastasios Giovanidis

Bruno Baynat

Antoine Vendeville

IEEE/ACM Trans. Netw., 2021

Clique Percolation Method: Memory Efficient Almost Exact Communities.

[BibT_eX]

[DOI]

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

2020

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

[BibT_eX]

[DOI]

Pierluigi Crescenzi

Andrea Marino

Algorithms, 2020

Strongly Connected Components in Stream Graphs: Computation and Experimentations.

[BibT_eX]

[DOI]

Léo Rannou

Proceedings of the Complex Networks & Their Applications IX, 2020

2019

Centrality Metrics in Dynamic Networks: A Comparison Study.

[BibT_eX]

[DOI]

Marwan Ghanem

IEEE Trans. Netw. Sci. Eng., 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

Approximating the Temporal Neighbourhood Function of Large Temporal Graphs.

[BibT_eX]

[DOI]

Pierluigi Crescenzi

Andrea Marino

Algorithms, 2019

2018

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

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2018

Enumerating maximal cliques in link streams with durations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

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

[BibT_eX]

[DOI]

Marwan Ghanem

Proceedings of the Extraction et Gestion des Connaissances, 2018

2017

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

[BibT_eX]

[DOI]

Raphaël Fournier-S'niehotta

CoRR, 2017

2016

Computing maximal cliques in link streams.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Finding remarkably dense sequences of contacts in link streams.

[BibT_eX]

[DOI]

Noé Gaumont

Soc. Netw. Anal. Min., 2016

2015

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

[BibT_eX]

[DOI]

Proceedings of the Complex Networks VI, 2015

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

[BibT_eX]

[DOI]

Jordan Viard

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.

[BibT_eX]

[DOI]

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‡.

[BibT_eX]

[DOI]

Assia Hamzaoui

J. Complex Networks, 2014

2013

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

[BibT_eX]

[DOI]

Soc. Netw. Anal. Min., 2013

Quantifying paedophile activity in a large P2P system.

[BibT_eX]

[DOI]

Raphaël Fournier

Inf. Process. Manag., 2013

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

[BibT_eX]

[DOI]

Oussama Allali

Intell. Data Anal., 2013

2012

Comparing paedophile activity in different P2P systems

[BibT_eX]

[DOI]

CoRR, 2012

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

[BibT_eX]

[DOI]

Amelie Medem Kuatse

Proceedings of the 2012 Proceedings IEEE INFOCOM Workshops, 2012

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

[BibT_eX]

[DOI]

Sebastien Heymann

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.

[BibT_eX]

[DOI]

Jean-Loup Guillaume

ACM Comput. Surv., 2011

Towards realistic modeling of IP-level routing topology dynamics

[BibT_eX]

[DOI]

Amelie Medem Kuatse

CoRR, 2011

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

[BibT_eX]

[DOI]

Lamia Benamara

CoRR, 2011

A Radar for the Internet.

[BibT_eX]

[DOI]

Frédéric Ouédraogo

Complex Syst., 2011

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

[BibT_eX]

[DOI]

Frédéric Ouédraogo

Comput. Commun., 2011

Quantifying paedophile queries in a large P2P system.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Assia Hamzaoui

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

[BibT_eX]

[DOI]

CoRR, 2009

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

[BibT_eX]

[DOI]

Guillaume Valadon

Ryuji Wakikawa

Comput. Commun., 2009

Measurement of eDonkey activity with distributed honeypots.

[BibT_eX]

[DOI]

Oussama Allali

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

Ten weeks in the life of an eDonkey server.

[BibT_eX]

[DOI]

Frederic Aidouni

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

2008

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

[BibT_eX]

[DOI]

Nathalie Del Vecchio

Soc. Networks, 2008

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

[BibT_eX]

[DOI]

Michel Habib

ACM J. Exp. Algorithmics, 2008

Detection, understanding, and prevention of traceroute measurement artifacts.

[BibT_eX]

[DOI]

Comput. Networks, 2008

Complex Network Measurements: Estimating the Relevance of Observed Properties.

[BibT_eX]

[DOI]

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

2007

Evolving networks.

[BibT_eX]

[DOI]

Proceedings of the Mining Massive Data Sets for Security, 2007

2006

Measuring Fundamental Properties of Real-World Complex Networks

[BibT_eX]

[DOI]

CoRR, 2006

Avoiding traceroute anomalies with Paris traceroute.

[BibT_eX]

[DOI]

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

2004

Sandpile models and lattices: a comprehensive survey.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

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

[BibT_eX]

[DOI]

Jean-Loup Guillaume

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

2003

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

[BibT_eX]

[DOI]

Eur. J. Comb., 2003

Results and conjectures on the Sandpile Identity on a lattice.

[BibT_eX]

[DOI]

Arnaud Dartois

Proceedings of the Discrete Models for Complex Systems, 2003

2002

Coding distributive lattices with Edge Firing Games.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

2001

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

[BibT_eX]

[DOI]