Generating constrained random graphs using multiple edge switches. - Lionel Tabourier; Camille Roth; Jean-Philippe Cointet (ACM J. Exp. Algorithmics, 2011)

Citations among blogs in a hierarchy of communities: Method and case study. - Abdelhamid Salah Brahim; Bénédicte Le Grand; Lionel Tabourier; Matthieu Latapy (J. Comput. Sci., 2011)

How to detect causality effects on large dynamical communication networks: A case study. - Lionel Tabourier; Alina Stoica; Fernando Peruani (COMSNETS, 2012)

Intrinsically dynamic network communities. - Bivas Mitra; Lionel Tabourier; Camille Roth (Comput. Networks, 2012)

A Data-Driven Analysis to Question Epidemic Models for Citation Cascades on the Blogosphere. - Abdelhamid Salah Brahim; Lionel Tabourier; Bénédicte Le Grand (ICWSM, 2013)

Directedness of information flow in mobile phone communication networks - Fernando Peruani; Lionel Tabourier (CoRR, 2013)

Burstiness and spreading on temporal networks - Renaud Lambiotte; Lionel Tabourier; Jean-Charles Delvenne (CoRR, 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)

RankMerging: Learning to Rank in Large-scale Social Networks. - Lionel Tabourier; Anne-Sophie Libert; Renaud Lambiotte (DyNaK, 2014)

RankMerging: Learning-to-rank in large-scale social networks (extended version). - Lionel Tabourier; Anne-Sophie Libert; Renaud Lambiotte (CoRR, 2014)

RankMerging: Apprentissage supervisé de classements pour la prédiction de liens dans les grands réseaux sociaux. - Lionel Tabourier; Anne-Sophie Libert; Renaud Lambiotte (EGC, 2015)

Characterizing and predicting mobile application usage. - Keun Woo Lim; Stefano Secci; Lionel Tabourier; Badis Tebbani (Comput. Commun., 2016)

Predicting links in ego-networks using temporal information. - Lionel Tabourier; Anne-Sophie Libert; Renaud Lambiotte (EPJ Data Sci., 2016)

Combining structural and dynamic information to predict activity in link streams. - Thibaud Arnoux; Lionel Tabourier; Matthieu Latapy (ASONAM, 2017)

Ego-betweenness centrality in link streams. - Marwan Ghanem 001; Florent Coriat; Lionel Tabourier (ASONAM, 2017)

Impact of Temporal Features of Cattle Exchanges on the Size and Speed of Epidemic Outbreaks. - Aurore Payen; Lionel Tabourier; Matthieu Latapy (ICCSA (2), 2017)

From a static to a dynamic analysis of complex networks. (D'une analyse statique à une analyse dynamique des réseaux complexes). - Lionel Tabourier (2018)

Predicting interactions between individuals with structural and dynamical information. - Thibaud Arnoux; Lionel Tabourier; Matthieu Latapy (CoRR, 2018)

Role of the Website Structure in the Diversity of Browsing Behaviors. - Pedro Ramaciotti Morales; Lionel Tabourier; Sylvain Ung; Christophe Prieur 002 (HT, 2019)

RankMerging: a supervised learning-to-rank framework to predict links in large social networks. - Lionel Tabourier; Daniel Faria Bernardes; Anne-Sophie Libert; Renaud Lambiotte (Mach. Learn., 2019)

Testing the Impact of Semantics and Structure on Recommendation Accuracy and Diversity. - Pedro Ramaciotti Morales; Lionel Tabourier; Raphaël Fournier-S'niehotta (ASONAM, 2020)

Measuring diversity in heterogeneous information networks. - Pedro Ramaciotti Morales; Robin Lamarche-Perrin; Raphaël Fournier-S'niehotta; Rémy Poulain; Lionel Tabourier; Fabien Tarissan (Theor. Comput. Sci., 2021)

Compressing bipartite graphs with a dual reordering scheme. - Maximilien Danisch; Ioannis Panagiotas; Lionel Tabourier (CoRR, 2022)

Tailored vertex ordering for faster triangle listing in large graphs. - Fabrice Lécuyer; Louis Jachiet; Clémence Magnien; Lionel Tabourier (ALENEX, 2023)

Énumération efficace des cliques maximales dans les flots de liens réels massifs. - Alexis Baudin; Clémence Magnien; Lionel Tabourier (EGC, 2023)

LSCPM: Communities in Massive Real-World Link Streams by Clique Percolation Method. - Alexis Baudin; Lionel Tabourier; Clémence Magnien (TIME, 2023)

Probabilistic k-swap method for uniform graph generation beyond the configuration model. - Lionel Tabourier; Julien Karadayi (J. Complex Networks, 2023)

BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs. - Alexis Baudin; Clémence Magnien; Lionel Tabourier (CoRR, 2024)

Faster maximal clique enumeration in large real-world link streams. - Alexis Baudin; Clémence Magnien; Lionel Tabourier (J. Graph Algorithms Appl., 2024)