Search the dblp DataBase

Publications of Author

1. Stéphane Bourdais, Philippe Galinier, Gilles Pesant
   HIBISCUS: A Constraint Programming Application to Staff Scheduling in Health Care. [Citation Graph (0, 0)][DBLP]
   CP, 2003, pp:153-167 [Conf]
   
2. Philippe Galinier, Jin-Kao Hao
   Tabu Search for Maximal Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
   CP, 1997, pp:196-208 [Conf]
   
3. Concettina Del Grosso, Giuliano Antoniol, Massimiliano Di Penta, Philippe Galinier, Ettore Merlo
   Improving network applications security: a new heuristic to generate stress testing data. [Citation Graph (0, 0)][DBLP]
   GECCO, 2005, pp:1037-1043 [Conf]
   
4. Philippe Galinier, Michel Habib, Christophe Paul
   Chordal Graphs and Their Clique Graphs. [Citation Graph (0, 0)][DBLP]
   WG, 1995, pp:358-371 [Conf]
   
5. Philippe Galinier, Michel Gendreau, Patrick Soriano, Serge Bisaillon
   Solving the frequency assignment problem with polarization by local search and tabu. [Citation Graph (0, 0)][DBLP]
   4OR, 2005, v:3, n:1, pp:59-78 [Journal]
   
6. Christiane Dzongang, Philippe Galinier, Samuel Pierre
   Une heuristique taboue pour le routage et l'affectation de longueurs d'onde avec scénarios de panne. [Citation Graph (0, 0)][DBLP]
   Annales des Télécommunications, 2005, v:60, n:9-10, pp:1140-1160 [Journal]
   
7. Philippe Galinier, Alain Hertz
   A survey of local search methods for graph coloring. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2006, v:33, n:, pp:2547-2562 [Journal]
   
8. Philippe Galinier, Brigitte Jaumard
   A Tabu Search algorithm for difference triangle sets and Golomb rulers. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2006, v:33, n:, pp:955-970 [Journal]
   
9. Philippe Galinier, Alain Hertz
   Solution techniques for the Large Set Covering Problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:3, pp:312-326 [Journal]
   
10. Jin-Kao Hao, Raphaël Dorne, Philippe Galinier
    Tabu Search for Frequency Assignment in Mobile Radio Networks. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 1998, v:4, n:1, pp:47-62 [Journal]
    
11. Philippe Galinier, Jin-Kao Hao
    Hybrid Evolutionary Algorithms for Graph Coloring. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1999, v:3, n:4, pp:379-397 [Journal]
    
12. 
    Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints. [Citation Graph (, )][DBLP]
    
    
13. 
    Recovering the Evolution Stable Part Using an ECGM Algorithm: Is There a Tunnel in Mozilla? [Citation Graph (, )][DBLP]
    
    
14. 
    Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures. [Citation Graph (, )][DBLP]
    
    
15. 
    Error Correcting Graph Matching Application to Software Evolution. [Citation Graph (, )][DBLP]
    
    
16. 
    Improving Frequent Subgraph Mining in the Presence of Symmetry. [Citation Graph (, )][DBLP]
    
    
17. 
    On the Planning Problem of Wireless Local Area Networks with Directional Antennas. [Citation Graph (, )][DBLP]
    
    
18. 
    Detecting buffer overflow via automatic test input data generation. [Citation Graph (, )][DBLP]
    
    
19. 
    An adaptive memory algorithm for the k-coloring problem. [Citation Graph (, )][DBLP]
    
    
20. 
    Efficient algorithms for finding critical subgraphs. [Citation Graph (, )][DBLP]