Romain Campigotto

According to our database, Romain Campigotto authored at least 7 papers between 2011 and 2014.

Collaborative distances:

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

2014

The Power of Consensus: Random Graphs Still Have No Communities.

Romain Campigotto, Jean-Loup Guillaume

Proceedings of the Social Network Analysis - Community Detection and Evolution, 2014

A Generalized and Adaptive Method for Community Detection.

Romain Campigotto, Patricia Conde Céspedes, Jean-Loup Guillaume

CoRR, 2014

2013

A new lower bound on the independence number of graphs.

Eric Angel, Romain Campigotto, Christian Laforest

Discret. Appl. Math., 2013

The power of consensus: random graphs have no communities.

Romain Campigotto, Jean-Loup Guillaume, Massoud Seifi

Proceedings of the Advances in Social Networks Analysis and Mining 2013, 2013

2012

Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs.

Eric Angel, Romain Campigotto, Christian Laforest

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

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

PhD thesis, 2011

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