Quasi-Clique Mining for Graph Summarization. - Antoine Castillon; Julien Baste; Hamida Seba; Mohammed Haddad 001 (DEXA (2), 2022)

On the Parameterized Complexity of Relaxations of Clique. - Ambroise Baril; Antoine Castillon; Nacim Oijid (CoRR, 2023)

Proportionally dense subgraphs of maximum size in degree-constrained graphs. - Narmina Baghirova; Antoine Castillon (CoRR, 2024)

On the parameterized complexity of non-hereditary relaxations of clique. - Ambroise Baril; Antoine Castillon; Nacim Oijid (Theor. Comput. Sci., 2024)

γ-clustering problems: Classical and parametrized complexity. - Julien Baste; Antoine Castillon; Clarisse Dhaenens; Mohammed Haddad 001; Hamida Seba (Theor. Comput. Sci., 2024)

Dense Subgraphs: Algorithms and complexity analysis of some search and covering problems. (Sous-graphes denses: algorithmes et analyse de complexité de certains problèmes de recherche et de couverture). - Antoine Castillon (2024)

Proportionally Dense Subgraphs: Parameterized Hardness and Efficiently Solvable Cases. - Narmina Baghirova; Antoine Castillon (WALCOM, 2025)