 | 2011 |
| 32 |  | Ahmed Belderrar,
Segla Kpodjedo,
Yann-Gaël Guéhéneuc,
Giuliano Antoniol,
Philippe Galinier:
Sub-graph Mining: Identifying Micro-architectures in Evolving Object-Oriented Software.
CSMR 2011: 171-180 |
| 31 |  | Soumaya Medini,
Philippe Galinier,
Massimiliano Di Penta,
Yann-Gaël Guéhéneuc,
Giuliano Antoniol:
A Fast Algorithm to Locate Concepts in Execution Traces.
SSBSE 2011: 252-266 |
| 30 |  | Philippe Galinier,
Alain Hertz,
Sandrine Paroz,
Gilles Pesant:
Using local search to speed up filtering algorithms for some NP-hard constraints.
Annals OR 184(1): 121-135 (2011) |
| 29 |  | Philippe Galinier,
Zied Boujbel,
Michael Coutinho Fernandes:
An efficient memetic algorithm for the graph partitioning problem.
Annals OR 191(1): 1-22 (2011) |
| 28 |  | Christian Desrosiers,
Philippe Galinier,
Alain Hertz,
Pierre Hansen:
Improving constrained pattern mining with first-fail-based heuristics.
Data Min. Knowl. Discov. 23(1): 63-90 (2011) |
| 27 |  | Segla Kpodjedo,
Filippo Ricca,
Philippe Galinier,
Yann-Gaël Guéhéneuc,
Giuliano Antoniol:
Design evolution metrics for defect prediction in object oriented systems.
Empirical Software Engineering 16(1): 141-175 (2011) |
| 26 |  | Kamal Fadlaoui,
Philippe Galinier:
A tabu search algorithm for the covering design problem.
J. Heuristics 17(6): 659-674 (2011) |
| 2010 |
| 25 |  | Segla Kpodjedo,
Philippe Galinier,
Giuliano Antoniol:
Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures.
EvoCOP 2010: 119-130 |
| 24 |  | Jun Hu,
Philippe Galinier,
Alexandre Caminada:
On Identifying Infeasible Subsets in Constraint Satisfaction Problems.
IC-AI 2010: 615-619 |
| 23 |  | Segla Kpodjedo,
Philippe Galinier,
Giuliano Antoniol:
On the use of similarity metrics for approximate graph matching.
Electronic Notes in Discrete Mathematics 36: 687-694 (2010) |
| 2009 |
| 22 |  | Segla Kpodjedo,
Filippo Ricca,
Philippe Galinier,
Giuliano Antoniol:
Recovering the Evolution Stable Part Using an ECGM Algorithm: Is There a Tunnel in Mozilla?
CSMR 2009: 179-188 |
| 21 |  | Christian Desrosiers,
Philippe Galinier,
Alain Hertz,
Sandrine Paroz:
Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems.
J. Comb. Optim. 18(2): 124-150 (2009) |
| 2008 |
| 20 |  | Philippe Galinier,
Alain Hertz,
Sandrine Paroz,
Gilles Pesant:
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints.
CPAIOR 2008: 298-302 |
| 19 |  | Segla Kpodjedo,
Filippo Ricca,
Philippe Galinier,
Giuliano Antoniol:
Error Correcting Graph Matching Application to Software Evolution.
WCRE 2008: 289-293 |
| 18 |  | Marc-Olivier Ouellet,
Steven Chamberland,
Philippe Galinier:
On the Planning Problem of Wireless Local Area Networks with Directional Antennas.
WiMob 2008: 655-660 |
| 17 |  | Concettina Del Grosso,
Giuliano Antoniol,
Ettore Merlo,
Philippe Galinier:
Detecting buffer overflow via automatic test input data generation.
Computers & OR 35(10): 3125-3143 (2008) |
| 16 |  | Christian Desrosiers,
Philippe Galinier,
Alain Hertz:
Efficient algorithms for finding critical subgraphs.
Discrete Applied Mathematics 156(2): 244-266 (2008) |
| 15 |  | Philippe Galinier,
Alain Hertz,
Nicolas Zufferey:
An adaptive memory algorithm for the k-coloring problem.
Discrete Applied Mathematics 156(2): 267-279 (2008) |
| 2007 |
| 14 |  | Christian Desrosiers,
Philippe Galinier,
Pierre Hansen,
Alain Hertz:
Improving Frequent Subgraph Mining in the Presence of Symmetry.
MLG 2007 |
| 13 |  | Philippe Galinier,
Alain Hertz:
Solution techniques for the Large Set Covering Problem.
Discrete Applied Mathematics 155(3): 312-326 (2007) |
| 2006 |
| 12 |  | Philippe Galinier,
Alain Hertz:
A survey of local search methods for graph coloring.
Computers & OR 33: 2547-2562 (2006) |
| 11 |  | Philippe Galinier,
Brigitte Jaumard:
A Tabu Search algorithm for difference triangle sets and Golomb rulers.
Computers & OR 33: 955-970 (2006) |
| 2005 |
| 10 |  | Concettina Del Grosso,
Giuliano Antoniol,
Massimiliano Di Penta,
Philippe Galinier,
Ettore Merlo:
Improving network applications security: a new heuristic to generate stress testing data.
GECCO 2005: 1037-1043 |
| 9 |  | Philippe Galinier,
Michel Gendreau,
Patrick Soriano,
Serge Bisaillon:
Solving the frequency assignment problem with polarization by local search and tabu.
4OR 3(1): 59-78 (2005) |
| 8 |  | Christiane Dzongang,
Philippe Galinier,
Samuel Pierre:
Une heuristique taboue pour le routage et l'affectation de longueurs d'onde avec scénarios de panne.
Annales des Télécommunications 60(9-10): 1140-1160 (2005) |
| 7 |  | Christiane Dzongang,
Philippe Galinier,
Samuel Pierre:
A tabu search heuristic for the routing and wavelength assignment problem in optical networks.
IEEE Communications Letters 9(5): 426-428 (2005) |
| 2004 |
| 6 |  | Philippe Galinier,
Jin-Kao Hao:
A General Approach for Constraint Solving by Local Search.
J. Math. Model. Algorithms 3(1): 73-88 (2004) |
| 2003 |
| 5 |  | Stéphane Bourdais,
Philippe Galinier,
Gilles Pesant:
HIBISCUS: A Constraint Programming Application to Staff Scheduling in Health Care.
CP 2003: 153-167 |
| 1999 |
| 4 |  | Philippe Galinier,
Jin-Kao Hao:
Hybrid Evolutionary Algorithms for Graph Coloring.
J. Comb. Optim. 3(4): 379-397 (1999) |
| 1998 |
| 3 |  | Jin-Kao Hao,
Raphaël Dorne,
Philippe Galinier:
Tabu Search for Frequency Assignment in Mobile Radio Networks.
J. Heuristics 4(1): 47-62 (1998) |
| 1997 |
| 2 |  | Philippe Galinier,
Jin-Kao Hao:
Tabu Search for Maximal Constraint Satisfaction Problems.
CP 1997: 196-208 |
| 1995 |
| 1 |  | Philippe Galinier,
Michel Habib,
Christophe Paul:
Chordal Graphs and Their Clique Graphs.
WG 1995: 358-371 |