default search action
Philippe Galinier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j29]Xinyun Wu
, Zhipeng Lü, Philippe Galinier:
Restricted swap-based neighborhood search for the minimum connected dominating set problem. Networks 69(2): 222-236 (2017) - [c18]Philippe Galinier, Segla Kpodjedo, Giulio Antoniol:
A penalty-based Tabu search for constrained covering arrays. GECCO 2017: 1288-1294 - 2016
- [j28]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): 137-148 (2016) - 2015
- [c17]Benjamin Correal, Philippe Galinier:
On the Complexity of Searching the Linear Ordering Problem Neighborhoods. EvoCOP 2015: 150-159 - 2014
- [j27]Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz:
Automated generation of conjectures on forbidden subgraph characterization. Discret. Appl. Math. 162: 177-194 (2014) - [j26]Segla Kpodjedo, Philippe Galinier, Giuliano Antoniol:
Using local similarity measures to efficiently address approximate graph matching. Discret. Appl. Math. 164: 161-177 (2014) - [j25]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): 143-164 (2014) - 2013
- [j24]Eunice Adjarath Lemamou, Steven Chamberland, Philippe Galinier:
A reliable model for global planning of mobile networks. Comput. Oper. Res. 40(10): 2270-2282 (2013) - [j23]Philippe Galinier, Eunice Adjarath Lemamou, Mohamed Wassim Bouzidi:
Applying local search to the feedback vertex set problem. J. Heuristics 19(5): 797-818 (2013) - [j22]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): 139-163 (2013) - [j21]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): 1090-1111 (2013) - [c16]Socheat Sonn, Guillaume-Alexandre Bilodeau
Fast and Accurate Registration of Visible and Infrared Videos. CVPR Workshops 2013: 308-313 - [p1]Philippe Galinier, Jean-Philippe Hamiez, Jin-Kao Hao, Daniel Cosmin Porumbel:
Recent Advances in Graph Vertex Coloring. Handbook of Optimization 2013: 505-528 - 2012
- [c15]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: 103-112 - 2011
- [j20]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): 121-135 (2011) - [j19]Philippe Galinier, Zied Boujbel, Michael Coutinho Fernandes:
An efficient memetic algorithm for the graph partitioning problem. Ann. Oper. Res. 191(1): 1-22 (2011) - [j18]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) - [j17]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): 141-175 (2011) - [j16]Kamal Fadlaoui, Philippe Galinier:
A tabu search algorithm for the covering design problem. J. Heuristics 17(6): 659-674 (2011) - [c14]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 - [c13]Soumaya Medini, Philippe Galinier, Massimiliano Di Penta
A Fast Algorithm to Locate Concepts in Execution Traces. SSBSE 2011: 252-266 - 2010
- [j15]Segla Kpodjedo, Philippe Galinier, Giuliano Antoniol:
On the use of similarity metrics for approximate graph matching. Electron. Notes Discret. Math. 36: 687-694 (2010) - [c12]Segla Kpodjedo, Philippe Galinier, Giuliano Antoniol:
Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures. EvoCOP 2010: 119-130 - [c11]Jun Hu, Philippe Galinier, Alexandre Caminada:
On Identifying Infeasible Subsets in Constraint Satisfaction Problems. IC-AI 2010: 615-619
2000 – 2009
- 2009
- [j14]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) - [c10]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 - 2008
- [j13]Concettina Del Grosso, Giuliano Antoniol, Ettore Merlo, Philippe Galinier:
Detecting buffer overflow via automatic test input data generation. Comput. Oper. Res. 35(10): 3125-3143 (2008) - [j12]Christian Desrosiers, Philippe Galinier, Alain Hertz:
Efficient algorithms for finding critical subgraphs. Discret. Appl. Math. 156(2): 244-266 (2008) - [j11]Philippe Galinier, Alain Hertz, Nicolas Zufferey:
An adaptive memory algorithm for the k-coloring problem. Discret. Appl. Math. 156(2): 267-279 (2008) - [j10]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): 123-130 (2008) - [c9]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 - [c8]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: 6-10 - [c7]Segla Kpodjedo, Filippo Ricca, Philippe Galinier, Giuliano Antoniol:
Error Correcting Graph Matching Application to Software Evolution. WCRE 2008: 289-293 - [c6]Marc-Olivier Ouellet, Steven Chamberland, Philippe Galinier:
On the Planning Problem of Wireless Local Area Networks with Directional Antennas. WiMob 2008: 655-660 - 2007
- [j9]Philippe Galinier, Alain Hertz:
Solution techniques for the Large Set Covering Problem. Discret. Appl. Math. 155(3): 312-326 (2007) - [c5]Christian Desrosiers, Philippe Galinier, Pierre Hansen, Alain Hertz:
Improving Frequent Subgraph Mining in the Presence of Symmetry. MLG 2007 - 2006
- [j8]Philippe Galinier, Brigitte Jaumard:
A Tabu Search algorithm for difference triangle sets and Golomb rulers. Comput. Oper. Res. 33: 955-970 (2006) - [j7]Philippe Galinier, Alain Hertz:
A survey of local search methods for graph coloring. Comput. Oper. Res. 33: 2547-2562 (2006) - 2005
- [j6]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) - [j5]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): 1140-1160 (2005) - [j4]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): 426-428 (2005) - [c4]Concettina Del Grosso, Giuliano Antoniol, Massimiliano Di Penta
Improving network applications security: a new heuristic to generate stress testing data. GECCO 2005: 1037-1043 - 2004
- [j3]Philippe Galinier, Jin-Kao Hao
A General Approach for Constraint Solving by Local Search. J. Math. Model. Algorithms 3(1): 73-88 (2004) - 2003
- [c3]Stéphane Bourdais, Philippe Galinier, Gilles Pesant:
HIBISCUS: A Constraint Programming Application to Staff Scheduling in Health Care. CP 2003: 153-167
1990 – 1999
- 1999
- [j2]Philippe Galinier, Jin-Kao Hao
Hybrid Evolutionary Algorithms for Graph Coloring. J. Comb. Optim. 3(4): 379-397 (1999) - 1998
- [j1]Jin-Kao Hao
Tabu Search for Frequency Assignment in Mobile Radio Networks. J. Heuristics 4(1): 47-62 (1998) - 1997
- [c2]Philippe Galinier, Jin-Kao Hao:
Tabu Search for Maximal Constraint Satisfaction Problems. CP 1997: 196-208 - 1995
- [c1]Philippe Galinier, Michel Habib, Christophe Paul:
Chordal Graphs and Their Clique Graphs. WG 1995: 358-371
Coauthor Index
aka: Giulio Antoniol
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: