Almost Exact Recovery in Label Spreading. - Konstantin Avrachenkov; Maximilien Dreveton (WAW, 2019)

Almost exact recovery in noisy semi-supervised learning. - Konstantin Avrachenkov; Maximilien Dreveton (CoRR, 2020)

Estimation of Static Community Memberships from Temporal Network Data. - Konstantin Avrachenkov; Maximilien Dreveton; Lasse Leskelä (CoRR, 2020)

Higher-Order Spectral Clustering for Geometric Graphs. - Konstantin Avrachenkov; Andrei Bobu; Maximilien Dreveton (CoRR, 2020)

Recovering Communities in Temporal Networks Using Persistent Edges. - Konstantin Avrachenkov; Maximilien Dreveton; Lasse Leskelä (CSoNet, 2021)

Graph clustering and semi-supervised learning of non-binary, temporal and geometric networks. (Détection de communautés et apprentissage semi-supervisé dans des réseaux non-binaires, temporels et géométriques). - Maximilien Dreveton (2022)

Exact recovery and Bregman hard clustering of node-attributed Stochastic Block Model. - Maximilien Dreveton; Felipe S. Fernandes; Daniel R. Figueiredo 001 (NeurIPS, 2023)

When Does Bottom-up Beat Top-down in Hierarchical Community Detection? - Maximilien Dreveton; Daichi Kuroda; Matthias Grossglauser; Patrick Thiran (CoRR, 2023)

Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Models. - Maximilien Dreveton; Alperen Gözeten; Matthias Grossglauser; Patrick Thiran (COLT, 2024)

Why the Metric Backbone Preserves Community Structure. - Maximilien Dreveton; Charbel Chucri; Matthias Grossglauser; Patrick Thiran (NeurIPS, 2024)

Recovering Static and Time-Varying Communities Using Persistent Edges. - Konstantin Avrachenkov; Maximilien Dreveton; Lasse Leskelä (IEEE Trans. Netw. Sci. Eng., 2024)

Reducing Sensor Requirements by Relaxing the Network Metric Dimension. - Paula Mürmann; Robin Jaccard; Maximilien Dreveton; Aryan Alavi Razavi Ravari; Patrick Thiran (Proc. ACM Meas. Anal. Comput. Syst., 2025)

Recovering Small Communities in the Planted Partition Model. - Martijn Gösgens; Maximilien Dreveton (CoRR, 2025)