Get started
Author

Philippe Galinier

Hybrid Evolutionary Algorithms for Graph Coloring
1999 · Philippe Galinier, Jin-Kao Hao · Journal of Combinatorial Optimization · 484
A survey of local search methods for graph coloring
2005 · Philippe Galinier, Alain Hertz · Computers & Operations Research · 231
An adaptive memory algorithm for the k-coloring problem
2007 · Philippe Galinier, Alain Hertz, et al. · Discrete Applied Mathematics · 105
Tabu Search for Frequency Assignment in Mobile Radio Networks
1998 · Jin-Kao Hao, Raphaël Dorne, et al. · Journal of Heuristics · 103
Chordal graphs and their clique graphs
1995 · Philippe Galinier, Michel Habib, et al. · Lecture notes in computer science · 79
An efficient memetic algorithm for the graph partitioning problem
2011 · Philippe Galinier, Zied Boujbel, et al. · Annals of Operations Research · 76
hibiscus: A Constraint Programming Application to Staff Scheduling in Health Care
2003 · Stéphane Bourdais, Philippe Galinier, et al. · Lecture notes in computer science · 73
Métaheuristiques pour l'optimisation combinatoire et l'affectation sous contraintes
1999 · Jin‐Kao Hao, Philippe Galinier, et al. · HAL · 58
Recent Advances in Graph Vertex Coloring
2012 · Philippe Galinier, Jean-Philippe Hamiez, et al. · Intelligent systems reference library · 53
A General Approach for Constraint Solving by Local Search
2004 · Philippe Galinier, Jin-Kao Hao · Journal of Mathematical Modelling and Algorithms · 53
Improving network applications security
2005 · Concettina Del Grosso, Giuliano Antoniol, et al. · Genetic and Evolutionary Computation Conference (GECCO) · 52
Design evolution metrics for defect prediction in object oriented systems
2010 · Segla Kpodjedo, Filippo Ricca, et al. · Empirical Software Engineering · 51
Tabu search for maximal constraint satisfaction problems
1997 · Philippe Galinier, Jin-Kao Hao · Lecture notes in computer science · 46
Applying local search to the feedback vertex set problem
2013 · Philippe Galinier, Eunice Lemamou, et al. · Journal of Heuristics · 34
A New Formulation of the Set Covering Problem for Metaheuristic Approaches
2013 · Nehme Bilal, Philippe Galinier, et al. · ISRN Operations Research · 28
An iterated-tabu-search heuristic for a variant of the partial set covering problem
2013 · Nehme Bilal, Philippe Galinier, et al. · Journal of Heuristics · 27
MADMatch: Many-to-Many Approximate Diagram Matching for Design Comparison
2013 · Segla Kpodjedo, Filippo Ricca, et al. · IEEE Transactions on Software Engineering · 27
Fast and Accurate Registration of Visible and Infrared Videos
2013 · Socheat Sonn, Guillaume-Alexandre Bilodeau, et al. · IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · 24
Solution techniques for the Large Set Covering Problem
2006 · Philippe Galinier, Alain Hertz · Discrete Applied Mathematics · 24
Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
2008 · Christian Desrosiers, Philippe Galinier, et al. · Journal of Combinatorial Optimization · 23
Recovering the Evolution Stable Part Using an ECGM Algorithm: Is There a Tunnel in Mozilla?
2009 · Segla Kpodjedo, Filippo Ricca, et al. · Euromicro Conference on Software Maintenance and Reengineering (CSMR) · 22
A penalty-based Tabu search for constrained covering arrays
2017 · Philippe Galinier, Segla Kpodjedo, et al. · Genetic and Evolutionary Computation Conference (GECCO) · 20
Not all classes are created equal
2008 · Segla Kpodjedo, Filippo Ricca, et al. · International Workshop on Recommendation Systems for Software Engineering (RSSE) · 20
TRIS: A Fast and Accurate Identifiers Splitting and Expansion Algorithm
2012 · Latifa Guerrouj, Philippe Galinier, et al. · Working Conference on Reverse Engineering (WCRE) · 17
Using local similarity measures to efficiently address approximate graph matching
2012 · Segla Kpodjedo, Philippe Galinier, et al. · Discrete Applied Mathematics · 17
Works count: 75
Citation count: 1,931
H-index: 21
I10-index: 32
Year
Topic
Type