Philippe Galinier

Publication Activity (10 Years)

Years Active: 1995-2017
Publications (10 Years): 3

Top Topics

Neighborhood Search

Simulated Annealing

Software Systems

Top Venues

Discret. Appl. Math.

Comput. Oper. Res.

Publications

Xinyun Wu, Zhipeng Lü, Philippe Galinier
Restricted swap-based neighborhood search for the minimum connected dominating set problem. Networks 69 (2) (2017)
Philippe Galinier, Segla Kpodjedo, Giulio Antoniol
A penalty-based Tabu search for constrained covering arrays. GECCO (2017)
Eunice Adjarath Lemamou, Philippe Galinier, Steven Chamberland
A Hybrid Iterated Local Search Algorithm for the Global Planning Problem of Survivable 4G Wireless Networks. IEEE/ACM Trans. Netw. 24 (1) (2016)
Benjamin Correal, Philippe Galinier
On the Complexity of Searching the Linear Ordering Problem Neighborhoods. EvoCOP (2015)
Nehme Bilal, Philippe Galinier, François Guibault
An iterated-tabu-search heuristic for a variant of the partial set covering problem. J. Heuristics 20 (2) (2014)
Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz
Automated generation of conjectures on forbidden subgraph characterization. Discret. Appl. Math. 162 (2014)
Segla Kpodjedo, Philippe Galinier, Giuliano Antoniol
Using local similarity measures to efficiently address approximate graph matching. Discret. Appl. Math. 164 (2014)
Philippe Galinier, Eunice Adjarath Lemamou, Mohamed Wassim Bouzidi
Applying local search to the feedback vertex set problem. J. Heuristics 19 (5) (2013)
Segla Kpodjedo, Filippo Ricca, Philippe Galinier, Giuliano Antoniol, Yann-Gaël Guéhéneuc
Studying software evolution of large object-oriented software systems using an ETGM algorithm. J. Softw. Evol. Process. 25 (2) (2013)
Socheat Sonn, Guillaume-Alexandre Bilodeau, Philippe Galinier
Fast and Accurate Registration of Visible and Infrared Videos. CVPR Workshops (2013)
Eunice Adjarath Lemamou, Steven Chamberland, Philippe Galinier
A reliable model for global planning of mobile networks. Comput. Oper. Res. 40 (10) (2013)
Segla Kpodjedo, Filippo Ricca, Philippe Galinier, Giuliano Antoniol, Yann-Gaël Guéhéneuc
MADMatch: Many-to-Many Approximate Diagram Matching for Design Comparison. IEEE Trans. Software Eng. 39 (8) (2013)
Latifa Guerrouj, Philippe Galinier, Yann-Gaël Guéhéneuc, Giuliano Antoniol, Massimiliano Di Penta
TRIS: A Fast and Accurate Identifiers Splitting and Expansion Algorithm. WCRE (2012)
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)
Christian Desrosiers, Philippe Galinier, Alain Hertz, Pierre Hansen
Improving constrained pattern mining with first-fail-based heuristics. Data Min. Knowl. Discov. 23 (1) (2011)
Philippe Galinier, Zied Boujbel, Michael Coutinho Fernandes
An efficient memetic algorithm for the graph partitioning problem. Ann. Oper. Res. 191 (1) (2011)
Segla Kpodjedo, Filippo Ricca, Philippe Galinier, Yann-Gaël Guéhéneuc, Giuliano Antoniol
Design evolution metrics for defect prediction in object oriented systems. Empir. Softw. Eng. 16 (1) (2011)
Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant
Using local search to speed up filtering algorithms for some NP-hard constraints. Ann. Oper. Res. 184 (1) (2011)
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)
Kamal Fadlaoui, Philippe Galinier
A tabu search algorithm for the covering design problem. J. Heuristics 17 (6) (2011)
Segla Kpodjedo, Philippe Galinier, Giuliano Antoniol
On the use of similarity metrics for approximate graph matching. Electron. Notes Discret. Math. 36 (2010)
Jun Hu, Philippe Galinier, Alexandre Caminada
On Identifying Infeasible Subsets in Constraint Satisfaction Problems. IC-AI (2010)
Segla Kpodjedo, Philippe Galinier, Giuliano Antoniol
Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures. EvoCOP (2010)
Christian Desrosiers, Philippe Galinier, Alain Hertz, Sandrine Paroz
Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems. J. Comb. Optim. 18 (2) (2009)
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)
Philippe Galinier, Alain Hertz, Sandrine Paroz, Gilles Pesant
Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints. CPAIOR (2008)
Concettina Del Grosso, Giuliano Antoniol, Ettore Merlo, Philippe Galinier
Detecting buffer overflow via automatic test input data generation. Comput. Oper. Res. 35 (10) (2008)
Jean-Marc Hyppolite, Philippe Galinier, Samuel Pierre
A tabu search heuristic for the routing and wavelength assignment problem in multigranular optical networks. Photonic Netw. Commun. 15 (2) (2008)
Christian Desrosiers, Philippe Galinier, Alain Hertz
Efficient algorithms for finding critical subgraphs. Discret. Appl. Math. 156 (2) (2008)
Philippe Galinier, Alain Hertz, Nicolas Zufferey
An adaptive memory algorithm for the k-coloring problem. Discret. Appl. Math. 156 (2) (2008)
Segla Kpodjedo, Filippo Ricca, Philippe Galinier, Giuliano Antoniol
Error Correcting Graph Matching Application to Software Evolution. WCRE (2008)
Marc-Olivier Ouellet, Steven Chamberland, Philippe Galinier
On the Planning Problem of Wireless Local Area Networks with Directional Antennas. WiMob (2008)
Segla Kpodjedo, Filippo Ricca, Philippe Galinier, Giuliano Antoniol
Not all classes are created equal: toward a recommendation system for focusing testing. RSSE@SIGSOFT FSE (2008)
Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz
Improving Frequent Subgraph Mining in the Presence of Symmetry. MLG (2007)
Philippe Galinier, Alain Hertz
Solution techniques for the Large Set Covering Problem. Discret. Appl. Math. 155 (3) (2007)
Philippe Galinier, Alain Hertz
A survey of local search methods for graph coloring. Comput. Oper. Res. 33 (2006)
Philippe Galinier, Brigitte Jaumard
A Tabu Search algorithm for difference triangle sets and Golomb rulers. Comput. Oper. Res. 33 (2006)
Christiane Dzongang, Philippe Galinier, Samuel Pierre
A tabu search heuristic for the routing and wavelength assignment problem in optical networks. IEEE Commun. Lett. 9 (5) (2005)
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)
Philippe Galinier, Michel Gendreau, Patrick Soriano, Serge Bisaillon
Solving the frequency assignment problem with polarization by local search and tabu. 4OR 3 (1) (2005)
Christiane Dzongang, Philippe Galinier, Samuel Pierre
Une heuristique taboue pour le routage et l'affectation de longueurs d'onde avec scénarios de panne. Ann. des Télécommunications 60 (9-10) (2005)
Philippe Galinier, Jin-Kao Hao
A General Approach for Constraint Solving by Local Search. J. Math. Model. Algorithms 3 (1) (2004)
Stéphane Bourdais, Philippe Galinier, Gilles Pesant
HIBISCUS: A Constraint Programming Application to Staff Scheduling in Health Care. CP (2003)
Philippe Galinier, Jin-Kao Hao
Hybrid Evolutionary Algorithms for Graph Coloring. J. Comb. Optim. 3 (4) (1999)
Jin-Kao Hao, Raphaël Dorne, Philippe Galinier
Tabu Search for Frequency Assignment in Mobile Radio Networks. J. Heuristics 4 (1) (1998)
Philippe Galinier, Jin-Kao Hao
Tabu Search for Maximal Constraint Satisfaction Problems. CP (1997)
Philippe Galinier, Michel Habib, Christophe Paul
Chordal Graphs and Their Clique Graphs. WG (1995)