Antoine Castillon

According to our database, Antoine Castillon authored at least 7 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Proportionally Dense Subgraphs: Parameterized Hardness and Efficiently Solvable Cases.

Narmina Baghirova, Antoine Castillon

Proceedings of the WALCOM: Algorithms and Computation, 2025

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

PhD thesis, 2024

γ-clustering problems: Classical and parametrized complexity.

Julien Baste, Antoine Castillon, Clarisse Dhaenens, Mohammed Haddad, Hamida Seba

Theor. Comput. Sci., 2024

On the parameterized complexity of non-hereditary relaxations of clique.

Ambroise Baril, Antoine Castillon, Nacim Oijid

Theor. Comput. Sci., 2024

Proportionally dense subgraphs of maximum size in degree-constrained graphs.

Narmina Baghirova, Antoine Castillon

CoRR, 2024

2023

On the Parameterized Complexity of Relaxations of Clique.

Ambroise Baril, Antoine Castillon, Nacim Oijid

CoRR, 2023

2022

Quasi-Clique Mining for Graph Summarization.

Antoine Castillon, Julien Baste, Hamida Seba, Mohammed Haddad

Proceedings of the Database and Expert Systems Applications, 2022