Philippe Galinier

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