Modularity-Driven Clustering of Dynamic Graphs. - Robert Görke; Pascal Maillard; Christian Staudt; Dorothea Wagner (SEA, 2010)

Performance of the Metropolis algorithm on a disordered tree: the Einstein relation - Pascal Maillard; Ofer Zeitouni (CoRR, 2013)

Dynamic graph clustering combining modularity and smoothness. - Robert Görke; Pascal Maillard; Andrea Schumm; Christian Staudt; Dorothea Wagner (ACM J. Exp. Algorithmics, 2013)

The algorithmic hardness threshold for continuous random energy models. - Louigi Addario-Berry; Pascal Maillard (CoRR, 2018)

(Almost) complete characterization of the stability of a discrete-time Hawkes process with inhibition and memory of length two. - Manon Costa; Pascal Maillard; Anthony Muraro (J. Appl. Probab., 2024)