Clémence Magnien

72 papers A* 2A 4B 5C 2Journal 50Unranked 9

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs. CoRR Alexis Baudin, Clémence Magnien, Lionel Tabourier
2024	J	`jnl`	Faster maximal clique enumeration in large real-world link streams. J. Graph Algorithms Appl. Alexis Baudin, Clémence Magnien, Lionel Tabourier
2023	J	`jnl`	Computing Betweenness Centrality in Link Streams. J. Graph Algorithms Appl. Frédéric Simard, Clémence Magnien, Matthieu Latapy
2023	J	`jnl`	Faster maximal clique enumeration in large real-world link streams. CoRR Alexis Baudin, Clémence Magnien, Lionel Tabourier
2023	C	`conf`	LSCPM: Communities in Massive Real-World Link Streams by Clique Percolation Method. TIME Alexis Baudin, Lionel Tabourier, Clémence Magnien
2023	J	`jnl`	LSCPM: communities in massive real-world Link Streams by Clique Percolation Method. CoRR Alexis Baudin, Lionel Tabourier, Clémence Magnien
2023	A	`conf`	Tailored vertex ordering for faster triangle listing in large graphs. ALENEX Fabrice Lécuyer, Louis Jachiet, Clémence Magnien, Lionel Tabourier
2023	J	`jnl`	Temporal Betweenness Centrality on Shortest Paths Variants. CoRR Mehdi Naima, Matthieu Latapy, Clémence Magnien
2023	—	`conf`	Énumération efficace des cliques maximales dans les flots de liens réels massifs. EGC Alexis Baudin, Clémence Magnien, Lionel Tabourier
2022	J	`jnl`	Tailored vertex ordering for faster triangle listing in large graphs. CoRR Fabrice Lécuyer, Louis Jachiet, Clémence Magnien, Lionel Tabourier
2021	C	`conf`	Clique Percolation Method: Memory Efficient Almost Exact Communities. ADMA Alexis Baudin, Maximilien Danisch, Sergey Kirgizov, Clémence Magnien, Marwan Ghanem
2021	J	`jnl`	Clique percolation method: memory efficient almost exact communities. CoRR Alexis Baudin, Maximilien Danisch, Sergey Kirgizov, Clémence Magnien, Marwan Ghanem
2021	J	`jnl`	Computing Betweenness Centrality in Link Streams. CoRR Frédéric Simard, Clémence Magnien, Matthieu Latapy
2021	J	`jnl`	Ranking Online Social Users by Their Influence. IEEE/ACM Trans. Netw. Anastasios Giovanidis, Bruno Baynat, Clémence Magnien, Antoine Vendeville
2021	J	`jnl`	Ranking Online Social Users by their Influence. CoRR Anastasios Giovanidis, Bruno Baynat, Clémence Magnien, Antoine Vendeville
2020	J	`jnl`	Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs. Algorithms Pierluigi Crescenzi, Clémence Magnien, Andrea Marino
2020	—	`conf`	Strongly Connected Components in Stream Graphs: Computation and Experimentations. COMPLEX NETWORKS (1) Léo Rannou, Clémence Magnien, Matthieu Latapy
2020	J	`jnl`	Strongly Connected Components in Stream Graphs: Computation and Experimentations. CoRR Léo Rannou, Clémence Magnien, Matthieu Latapy
2019	J	`jnl`	Approximating the Temporal Neighbourhood Function of Large Temporal Graphs. Algorithms Pierluigi Crescenzi, Clémence Magnien, Andrea Marino
2019	J	`jnl`	Centrality Metrics in Dynamic Networks: A Comparison Study. IEEE Trans. Netw. Sci. Eng. Marwan Ghanem, Clémence Magnien, Fabien Tarissan
2019	J	`jnl`	Weighted, Bipartite, or Directed Stream Graphs for the Modeling of Temporal Networks. CoRR Matthieu Latapy, Clémence Magnien, Tiphaine Viard
2018	—	`conf`	Comparaison de mesures de centralité basées sur les plus courts chemins dans les réseaux dynamiques. EGC Marwan Ghanem, Clémence Magnien, Fabien Tarissan
2018	J	`jnl`	Enumerating maximal cliques in link streams with durations. Inf. Process. Lett. Tiphaine Viard, Clémence Magnien, Matthieu Latapy
2018	J	`jnl`	Stream graphs and link streams for the modeling of interactions over time. Soc. Netw. Anal. Min. Matthieu Latapy, Tiphaine Viard, Clémence Magnien
2017	J	`jnl`	Discovering Patterns of Interest in IP Traffic Using Cliques in Bipartite Link Streams. CoRR Tiphaine Viard, Raphaël Fournier-S'niehotta, Clémence Magnien, Matthieu Latapy
2017	J	`jnl`	Enumerating maximal cliques in link streams with durations. CoRR Tiphaine Viard, Clémence Magnien, Matthieu Latapy
2017	J	`jnl`	Stream Graphs and Link Streams for the Modeling of Interactions over Time. CoRR Matthieu Latapy, Tiphaine Viard, Clémence Magnien
2016	J	`jnl`	Computing maximal cliques in link streams. Theor. Comput. Sci. Tiphaine Viard, Matthieu Latapy, Clémence Magnien
2016	J	`jnl`	Finding remarkably dense sequences of contacts in link streams. Soc. Netw. Anal. Min. Noé Gaumont, Clémence Magnien, Matthieu Latapy
2015	J	`jnl`	Computing maximal cliques in link streams. CoRR Tiphaine Viard, Matthieu Latapy, Clémence Magnien
2015	—	`conf`	Expected Nodes: A Quality Function for the Detection of Link Communities. CompleNet Noé Gaumont, François Queyroi, Clémence Magnien, Matthieu Latapy
2015	B	`conf`	Revealing contact patterns among high-school students using maximal cliques in link streams. ASONAM Jordan Viard, Matthieu Latapy, Clémence Magnien
2015	B	`conf`	Time Evolution of the Importance of Nodes in dynamic Networks. ASONAM Clémence Magnien, Fabien Tarissan
2014	J	`jnl`	Detecting events in the dynamics of ego-centred measurements of the Internet topology‡. J. Complex Networks Matthieu Latapy, Assia Hamzaoui, Clémence Magnien
2013	J	`jnl`	Internal link prediction: A new approach for predicting links in bipartite graphs. Intell. Data Anal. Oussama Allali, Clémence Magnien, Matthieu Latapy
2013	J	`jnl`	Internal links and pairs as a new tool for the analysis of bipartite complex networks. Soc. Netw. Anal. Min. Oussama Allali, Lionel Tabourier, Clémence Magnien, Matthieu Latapy
2013	J	`jnl`	Quantifying paedophile activity in a large P2P system. Inf. Process. Manag. Matthieu Latapy, Clémence Magnien, Raphaël Fournier
2012	J	`jnl`	Comparing paedophile activity in different P2P systems CoRR Raphaël Fournier, Thibault Cholez, Matthieu Latapy, Clémence Magnien, Isabelle Chrisment, Ivan Daniloff, Olivier Festor
2012	—	`conf`	Impact of power-law topology on IP-level routing dynamics: Simulation results. INFOCOM Workshops Amelie Medem Kuatse, Clémence Magnien, Fabien Tarissan
2012	B	`conf`	Outskewer: Using Skewness to Spot Outliers in Samples and Time Series. ASONAM Sebastien Heymann, Matthieu Latapy, Clémence Magnien
2012	J	`jnl`	Quantifying Paedophile Activity in a Large P2P System CoRR Matthieu Latapy, Clémence Magnien, Raphaël Fournier
2011	J	`jnl`	A Radar for the Internet. Complex Syst. Matthieu Latapy, Clémence Magnien, Frédéric Ouédraogo
2011	J	`jnl`	Impact of random failures and attacks on Poisson and power-law random networks. ACM Comput. Surv. Clémence Magnien, Matthieu Latapy, Jean-Loup Guillaume
2011	J	`jnl`	Impact of sources and destinations on the observed properties of the internet topology. Comput. Commun. Frédéric Ouédraogo, Clémence Magnien
2011	J	`jnl`	Internal links and pairs as a new tool for the analysis of bipartite complex networks CoRR Oussama Allali, Lionel Tabourier, Clémence Magnien, Matthieu Latapy
2011	A*	`conf`	Quantifying paedophile queries in a large P2P system. INFOCOM Matthieu Latapy, Clémence Magnien, Raphaël Fournier
2011	J	`jnl`	Removing bias due to finite measurement of dynamic systems: case study on P2P systems CoRR Lamia Benamara, Clémence Magnien
2011	J	`jnl`	Towards realistic modeling of IP-level routing topology dynamics CoRR Clémence Magnien, Amelie Medem Kuatse, Fabien Tarissan
2010	B	`conf`	Detecting events in the dynamics of ego-centered measurements of the internet topology. WiOpt Assia Hamzaoui, Matthieu Latapy, Clémence Magnien
2009	J	`jnl`	Detection, Understanding, and Prevention of Traceroute Measurement Artifacts CoRR Fabien Viger, Brice Augustin, Xavier Cuvellier, Clémence Magnien, Matthieu Latapy, Timur Friedman, Renata Teixeira
2009	J	`jnl`	Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs CoRR Clémence Magnien, Matthieu Latapy, Michel Habib
2009	J	`jnl`	Fast dynamics in Internet topology: preliminary observations and explanations CoRR Clémence Magnien, Frédéric Ouédraogo, Guillaume Valadon, Matthieu Latapy
2009	J	`jnl`	Measurement of eDonkey Activity with Distributed Honeypots CoRR Oussama Allali, Matthieu Latapy, Clémence Magnien
2009	A	`conf`	Measurement of eDonkey activity with distributed honeypots. IPDPS Oussama Allali, Matthieu Latapy, Clémence Magnien
2009	J	`jnl`	Mobile IPv6 deployments: Graph-based analysis and practical guidelines. Comput. Commun. Guillaume Valadon, Clémence Magnien, Ryuji Wakikawa
2009	A	`conf`	Ten weeks in the life of an eDonkey server. IPDPS Frederic Aidouni, Matthieu Latapy, Clémence Magnien
2008	J	`jnl`	A Radar for the Internet CoRR Matthieu Latapy, Clémence Magnien, Frédéric Ouédraogo
2008	—	`conf`	A Radar for the Internet. ICDM Workshops Matthieu Latapy, Clémence Magnien, Frédéric Ouédraogo
2008	J	`jnl`	Basic notions for the analysis of large two-mode networks. Soc. Networks Matthieu Latapy, Clémence Magnien, Nathalie Del Vecchio
2008	A*	`conf`	Complex Network Measurements: Estimating the Relevance of Observed Properties. INFOCOM Matthieu Latapy, Clémence Magnien
2008	J	`jnl`	Detection, understanding, and prevention of traceroute measurement artifacts. Comput. Networks Fabien Viger, Brice Augustin, Xavier Cuvellier, Clémence Magnien, Matthieu Latapy, Timur Friedman, Renata Teixeira
2008	J	`jnl`	Fast computation of empirically tight bounds for the diameter of massive graphs. ACM J. Exp. Algorithmics Clémence Magnien, Matthieu Latapy, Michel Habib
2008	J	`jnl`	Ten weeks in the life of an eDonkey server CoRR Frederic Aidouni, Matthieu Latapy, Clémence Magnien
2007	—	`conf`	Evolving networks. NATO ASI Mining Massive Data Sets for Security Pierre Borgnat, Eric Fleury, Jean-Loup Guillaume, Clémence Magnien, Céline Robardet, Antoine Scherrer
2006	A	`conf`	Avoiding traceroute anomalies with Paris traceroute. Internet Measurement Conference Brice Augustin, Xavier Cuvellier, Benjamin Orgogozo, Fabien Viger, Timur Friedman, Matthieu Latapy, Clémence Magnien, Renata Teixeira
2006	J	`jnl`	Measuring Fundamental Properties of Real-World Complex Networks CoRR Matthieu Latapy, Clémence Magnien
2004	B	`conf`	Comparison of Failures and Attacks on Random and Scale-Free Networks. OPODIS Jean-Loup Guillaume, Matthieu Latapy, Clémence Magnien
2004	J	`jnl`	Sandpile models and lattices: a comprehensive survey. Theor. Comput. Sci. Eric Goles Ch., Matthieu Latapy, Clémence Magnien, Michel Morvan, Ha Duong Phan
2003	J	`jnl`	Classes of lattices induced by chip firing (and sandpile) dynamics. Eur. J. Comb. Clémence Magnien
2003	—	`conf`	Results and conjectures on the Sandpile Identity on a lattice. DMCS Arnaud Dartois, Clémence Magnien
2002	J	`jnl`	Coding distributive lattices with Edge Firing Games. Inf. Process. Lett. Matthieu Latapy, Clémence Magnien
2001	—	`conf`	Characterization of Lattices Induced by (extended) Chip Firing Games. DM-CCG Clémence Magnien, Ha Duong Phan, Laurent Vuillon