#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1998

2017

- This year (2)
- Last 5 years (13)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Gilles Caporossi, Pierre Hansen
- Discrete Mathematics
- 2000

- Gilles Caporossi, Pierre Hansen
- Discrete Mathematics
- 2004

- Mustapha Aouchiche, Gilles Caporossi, Pierre Hansen, M. Laffay
- Electronic Notes in Discrete Mathematics
- 2005

- Daniel Aloise, Sonia Cafieri, Gilles Caporossi, Pierre Hansen, Sylvain Perron, Leo Liberti
- Physical review. E, Statistical, nonlinear, and…
- 2010

Finding modules, or clusters, in networks currently attracts much attention in several domains. The most studied criterion for doing so, due to Newman and Girvan [Phys. Rev. E 69, 026113 (2004)], is modularity maximization. Many heuristics have been proposed for maximizing modularity and yield rapidly near optimal solution or sometimes optimal ones but… (More)

- Gilles Caporossi, Drago Cvetkovi, Ivan Gutman, Pierre Hansen
- Journal of Chemical Information and Computer…
- 1999

The recently developed Variable Neighborhood Search (VNS) metaheuristic for combinatorial and global optimization is outlined together with its specialization to the problem of finding extremal graphs with respect to one or more invariants and the corresponding program (AGX). We illustrate the potential of the VNS algorithm on the example of energy E, a… (More)

- Gilles Caporossi, Ivan Gutman, Pierre Hansen, Ljiljana Pavlovic
- Computational Biology and Chemistry
- 2003

- Gilles Caporossi, Pierre Hansen
- IJCAI
- 1999

Given a set of m observations on n variables, an 0(mn 2) algorithm is proposed to find a basis of all affine relations between these variables satisfied by the observations. On a 25 variables example, this new algorithm is 130 000 times faster than the "all subsets" option for linear regression of the SAS package which is a non polynomial alternative.… (More)

- Sivan Altinakar, Gilles Caporossi, Alain Hertz
- Computers & OR
- 2016

An edge-coloring of a graph G1⁄4 ðV ; EÞ is a function c that assigns an integer c(e) (called color) in f 0;1;2;...g to every edge eAE so that adjacent edges are assigned different colors. An edge-coloring is compact if the colors of the edges incident to every vertex form a set of consecutive integers. The deficiency problem is to determine the minimum… (More)

- Dragan Stevanovic, Gilles Caporossi
- Graphs and Discovery
- 2001

- Réal André Carbonneau, Gilles Caporossi, Pierre Hansen
- European Journal of Operational Research
- 2011