Caizergues E., Durand F., Mathieu F. (2025), Sortus Interruptus : Trier des phoques en O(n log(n)), in , Lyon, CCSD
Caizergues E., Durand F., Mathieu F. (2024), Anytime Sorting Algorithms, in Kate Larson, Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}, International Joint Conferences on Artificial Intelligence Organization (IJCAI), 7101-7108 p. 
Caizergues E., Panafieu E. (2023), Exact enumeration of graphs and bipartite graphs with degree constraints, in , European Conference on Combinatorics, Graph Theory and Applications, Prague, Masaryk University Press, 254-262 p. 