Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities. - Eric Angel; Romain Campigotto; Christian Laforest (Algorithmic Oper. Res., 2011)

Algorithmes d'approximation à mémoire limitée pour le traitement de grands graphes : le problème du Vertex Cover. (Approximation Algorithms with Low Memory Capacities for Large Graphs Processing : the Vertex Cover Problem). - Romain Campigotto (2011)

Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs. - Eric Angel; Romain Campigotto; Christian Laforest (SEA, 2012)

The power of consensus: random graphs have no communities. - Romain Campigotto; Jean-Loup Guillaume; Massoud Seifi (ASONAM, 2013)

A new lower bound on the independence number of graphs. - Eric Angel; Romain Campigotto; Christian Laforest (Discret. Appl. Math., 2013)

A Generalized and Adaptive Method for Community Detection. - Romain Campigotto; Patricia Conde Céspedes; Jean-Loup Guillaume (CoRR, 2014)

The Power of Consensus: Random Graphs Still Have No Communities. - Romain Campigotto; Jean-Loup Guillaume (Social Network Analysis, 2014)