 | Up a level |
Collaboration networkThis graph maps the connections between all the collaborators of {}'s publications listed on this page.
Each link represents a collaboration on the same publication. The thickness of the link represents the number of collaborations.
Use the mouse wheel or scroll gestures to zoom into the graph.
You can click on the nodes and links to highlight them and move the nodes by dragging them.
Hold down the "Ctrl" key or the "⌘" key while clicking on the nodes to open the list of this person's publications.
Word cloudA word cloud is a visual representation of the most frequently used words in a text or a set of texts. The words appear in different sizes, with the size of each word being proportional to its frequency of occurrence in the text. The more frequently a word is used, the larger it appears in the word cloud. This technique allows for a quick visualization of the most important themes and concepts in a text.
In the context of this page, the word cloud was generated from the publications of the author {}. The words in this cloud come from the titles, abstracts, and keywords of the author's articles and research papers. By analyzing this word cloud, you can get an overview of the most recurring and significant topics and research areas in the author's work.
The word cloud is a useful tool for identifying trends and main themes in a corpus of texts, thus facilitating the understanding and analysis of content in a visual and intuitive way.
Bilal, N., Galinier, P., & Guibault, F. (2014). An iterated-tabu-search heuristic for a variant of the partial set covering problem. Journal of Heuristics, 20(2), 143-164. External link
Bilal, N., Galinier, P., & Guibault, F. (2013). A new formulation of the set covering problem for metaheuristic approaches. ISRN Operations Research, 2013, 10-10. External link
Belderrar, A., Kpodjedo, S., Guéhéneuc, Y.-G., Antoniol, G., & Galinier, P. (2011, March). Sub-graph mining: Identifying micro-architectures in evolving object-oriented software [Paper]. 15th European Conference on Software Maintenance and Reengineering (CSMR 2011), Oldenburg, Germany. External link
Bourdais, S., Galinier, P., & Pesant, G. (2003, September). HIBISCUS: a constraint programming application to staff scheduling in health care [Paper]. 9th International Conference on Principles and Practice of Constraint Programming (CP 2003), Kinsale, Ireland. External link
Correal, B., & Galinier, P. (2015). On the complexity of searching the linear ordering problem neighborhoods. In Evolutionary Computation in Combinatorial Optimization : 15th European Conference (EvoCOP 2015), 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings (Vol. 9026, pp. 150-159). External link
Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (2014). Automated generation of conjectures on forbidden subgraph characterization. Discrete Applied Mathematics, 162, 177-194. External link
Desrosiers, C., Galinier, P., Hertz, A., & Hansen, P. (2010). Improving constrained pattern mining with first-fail-based heuristics. Data Mining and Knowledge Discovery, 23(1), 1-28. External link
Desrosiers, C., Galinier, P., Hertz, A., & Paroz, S. (2009). Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems. Journal of Combinatorial Optimization, 18(2), 124-150. External link
Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (2008). SyGMA: Reducing Symmetry in Graph Mining. (Technical Report n° G-2007-12). External link
Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (2008). Using Heuristics to Speed Up Frequent Pattern Mining. (Technical Report n° G-2008-13). External link
Del Grosso, C., Antoniol, G., Merlo, E., & Galinier, P. (2008). Detecting Buffer Overflow Via Automatic Test Input Data Generation. Computers & Operations Research, 35(10), 3125-3143. External link
Desrosiers, C., Galinier, P., & Hertz, A. (2008). Efficient Algorithms for Finding Critical Subgraphs. Discrete Applied Mathematics, 156(2), 244-266. External link
Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (2007). Automated Generation of Conjectures on Forbidden Subgraph Characterization. (Technical Report n° G-2007-48). External link
Desrosiers, C., Galinier, P., Hertz, A., & Paroz, S. (2007). Using Meta-Heuristics to Find Minimal Unsatisfiable Subformulas in Satisfiability Problems. (Technical Report n° G-2007-08). External link
Desrosiers, C., Galinier, P., Hansen, P., & Hertz, A. (2007, August). Improving frequent subgraph mining in the presence of symmetry [Paper]. 5th International Workshop on Mining and Learning with Graphs, Firenze, Italia. External link
Del Grosso, C., Antoniol, G., Di Penta, M., Galinier, P., & Merlo, E. (2005, June). Improving network applications security : a new heuristic to generate stress testing data [Paper]. 2005 Annual Genetic and Evolutionary Computation Conference (GECCO 2005), Washington, D.C.. External link
Dzongang, C., Galinier, P., & Pierre, S. (2005). A tabu search heuristic for the routing and wavelength assignment problem in optical networks. IEEE Communications Letters, 9(5), 426-428. External link
Dzongang, C., Galinier, P., & Pierre, S. (2005). Une heuristique taboue pour le routage et l'affectation de longueurs d'onde avec scénarios de panne. [A tabu heuristic for routing and wavelength assignment with failure scenarios]. Annales des télécommunications, 60(9-10), 1140-1160. External link
Desrosiers, C., Galinier, P., & Hertz, A. (2004). Efficient Algorithms for Finding Critical Subgraphs. (Technical Report n° G-2004-31). External link
Dzongang, C. F., Galinier, P., & Pierre, S. (2004, March). A tabu search approach for routing and wavelength assignment in optical networks [Paper]. Workshop on Optimization of Optical Networks, Montréal, Québec. Unavailable
Fadlaoui, K., & Galinier, P. (2011). A tabu search algorithm for the covering design problem. Journal of Heuristics, 17(6), 659-674. External link
Fadlaoui, K., & Galinier, P. (2010). Covering design problem constructed by using the TS-CD algorithm. (Technical Report n° EPM-RT-2010-01). Available
Galinier, P., Kpodjedo, S., & Antoniol, G. (2017, July). A penalty-based Tabu search for constrained covering arrays [Paper]. 2017 annual Genetic and Evolutionary Computation Conference (GECCO 2017), Berlin, Germany. External link
Galinier, P., Hamiez, J.-P., Hao, J.-K., & Porumbel, D. C. (2013). Recent Advances in Graph Vertex Coloring. In Zelinka, I., Snášel, V., & Abraham, A. (eds.), Handbook of Optimization: From Classical to Modern Approach (pp. 505-528). External link
Galinier, P., Lemamou, E., & Bouzidi, M. W. (2013). Applying Local Search to the Feedback Vertex Set Problem. Journal of Heuristics, 19(5), 797-818. External link
Guerrouj, L., Galinier, P., Guéhéneuc, Y.-G., Antoniol, G., & Di Penta, M. (2012, October). TRIS: A fast and accurate identifiers splitting and expansion algorithm [Paper]. 19th Working Conference on Reverse Engineering (WCRE 2012), Kingston, ON, Canada. External link
Galinier, P., Boujbel, Z., & Coutinho Fernandes, M. (2011). An efficient memetic algorithm for the graph partitioning problem. Annals of Operations Research, 191(1), 1-22. External link
Galinier, P., Hertz, A., Paroz, S., & Pesant, G. (2011). Using local search to speed up filtering algorithms for some NP-hard constraints. Annals of Operations Research, 184(1), 121-135. External link
Galinier, P., Hertz, A., Paroz, S., & Pesant, G. (2008). Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints. (Technical Report n° G-2008-02). External link
Galinier, P., Hertz, A., & Zufferey, N. (2008). An Adaptive Memory Algorithm for the K-Coloring Problem. Discrete Applied Mathematics, 156(2), 267-279. External link
Galinier, P., Hertz, A., Paroz, S., & Pesant, G. (2008, May). Using local search to speed up filtering algorithms for some NP-hard constraints [Paper]. 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2008), Paris, France. External link
Galinier, P., & Hertz, A. (2007). Solution Techniques for the Large Set Covering Problem. Discrete Applied Mathematics, 155(3), 312-326. External link
Galinier, P., & Hertz, A. (2006). A survey of local search methods for graph coloring. Computers & Operations Research, 33(9), 2547-2562. External link
Galinier, P., & Jaumard, B. (2006). A tabu search algorithm for difference triangle sets and golomb rulers. Computers & Operations Research, 33(4), 955-970. External link
Galinier, P., Gendreau, M., Soriano, P., & Bisaillon, S. (2005). Solving the frequency assignment problem with polarization by local search and tabu. 4OR, 3(1), 59-78. External link
Galinier, P., Hertz, A., & Zufferey, N. (2004). An Adaptive Memory Algorithm for the k-Colouring Problem. (Technical Report n° G-2003-35). External link
Galinier, P., & Hertz, A. (2004). A Survey of Local Search Methods for Graph Coloring. (Technical Report n° G-2004-37). External link
Galinier, P., & Hao, J.-K. (2004). A general approach for constraint solving by local search. Journal of Mathematical Modelling and Algorithms, 3(1), 73-88. External link
Galinier, P., & Hertz, A. (2003). Solution Techniques for the Large Set Covering Problem. (Technical Report n° G-2003-44). External link
Galinier, P., Hertz, A., & Zufferey, N. (2002, January). Adaptative memory algorithms for graph coloring [Paper]. Computational Symposium on Graph Coloring and Generalizations (COLOR 2002), Ithaca,US. Unavailable
Galinier, P., Jaumard, B., Morales, R., & Pesant, G. (2001, January). Constraint-based approach to the Golomb ruler problem [Paper]. 3rd International Workshop on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2001), Ashford, UK. Unavailable
Galinier, P., & Hao, J. K. (2000, January). General approach for constraint solving by socal search [Paper]. 2nd International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2000), Paderborn, Germany. Unavailable
Galinier, P., & Hao, J. K. (1999). Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization, 3(4), 379-397. External link
Hyppolite, J.-M., Galinier, P., & Pierre, S. (2008). A Tabu Search Heuristic for the Routing and Wavelength Assignment Problem in Multigranular Optical Networks. Photonic Network Communications, 15(2), 123-130. External link
Hao, J. K., Galinier, P., & Habib, M. (1999). Métaheuristiques pour l'optimisation combinatoire et l'affectation sous contraintes. Revue d'intelligence artificielle, 13(2), 283-324. Unavailable
Kpodjedo, S., Galinier, P., & Antoniol, G. (2014). Using local similarity measures to efficiently address approximate graph matching. Discrete Applied Mathematics, 164, part, 161-171. External link
Kpodjedo, S., Ricca, F., Galinier, P., Antoniol, G., & Guéhéneuc, Y.-G. (2013). MADMatch: Many-to-many approximate diagram matching for design comparison. IEEE Transactions on Software Engineering, 39(8), 1090-1111. External link
Kpodjedo, S., Ricca, F., Galinier, P., Antoniol, G., & Guéhéneuc, Y.-G. (2013). Studying Software Evolution of Large Object-Oriented Software Systems Using an ETGM Algorithm. Journal of Software: Evolution and Process, 25(2), 139-163. External link
Kpodjedo, S., Ricca, F., Galinier, P., Guéhéneuc, Y.-G., & Antoniol, G. (2011). Design evolution metrics for defect prediction in object oriented systems. Empirical Software Engineering, 16(1), 141-175. External link
Kpodjedo, S., Galinier, P., & Antoniol, G. (2010, April). Enhancing a tabu algorithm for approximate graph matching by using similarity measures [Paper]. 10th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2010), Istanbul, Turkey. External link
Kpodjedo, S., Galinier, P., & Antoniol, G. (2010, March). On the use of similarity metrics for approximate graph matching [Paper]. International Symposium on Combinatorial Optimization (ISCO 2010), Hammamet, Tunisia. Published in Electronic Notes in Discrete Mathematics, 36. External link
Kpodjedo, S., Ricca, F., Antoniol, G., & Galinier, P. (2009, May). Evolution and search based metrics to improve defects prediction [Paper]. 1st International Symposium on Search Based Software Engineering (SSBSE 2009), Windsor, Berkshire, United Kingdom. External link
Kpodjedo, S., Ricca, F., Galinier, P., & Antoniol, G. (2009, March). Recovering the evolution stable part using an ECGM algorithm: Is there a tunnel in Mozilla? [Paper]. 13th European Conference on Software Maintenance and Reengineering (CSMR 2009), Kaiserslautern, Germany. External link
Kpodjedo, S., Galinier, P., & Antoniol, G. (2008). A Google-inspired error-correcting graph matching algorithm. (Technical Report n° EPM-RT-2008-06). Available
Kpodjedo, S., Ricca, F., Galinier, P., & Antoniol, G. (2008, October). Error correcting graph matching application to software evolution [Paper]. 15th Working Conference on Reverse Engineering (WCRE 2008). External link
Kpodjedo, S., Ricca, F., Galinier, P., & Antoniol, G. (2008, November). Not all classes are created equal: toward a recommendation system for focusing testing [Paper]. International Workshop on Recommendation Systems for Software Engineering (RSSE 2008), Atlanta, Georgia. External link
Lemamou, E. A., Galinier, P., & Chamberland, S. (2016). A Hybrid Iterated Local Search Algorithm for the Global Planning Problem of Survivable 4G Wireless Networks. IEEE/ACM Transactions on Networking, 24(1), 137-148. External link
Lemamou, E. A., Chamberland, S., & Galinier, P. (2013). A reliable model for global planning of mobile networks. Computers & Operations Research, 40(10), 2270-2282. External link
Lapointe, M., Blondin Massé, A., Galinier, P., Lord, M., & Marcotte, O. (2012, November). Enumerating minimum feedback vertex sets in directed graphs [Paper]. Bordeaux Graph Workshop, Bordeaux, France. External link
Lemamou, E. A., Chamberland, S., & Galinier, P. (2012, October). A global planning model for survivable mobile networks [Paper]. IEEE Conference Networks, Rome Italie. External link
Medini, S., Galinier, P., Di Penta, M., Guéhéneuc, Y.-G., & Antoniol, G. (2011, September). A fast algorithm to locate concepts in execution traces [Paper]. 3rd International Symposium on Search Based Software Engineering (SSBSE 2011), Szeged, Hungary. External link
Ouellet, M.-O., Chamberland, S., & Galinier, P. (2008, October). On the planning problem of wireless local area networks with directional antennas [Paper]. IEEE International Conference on Wireless and Mobile Computing, Networking and Communications. External link
Sonn, S., Bilodeau, G.-A., & Galinier, P. (2013, June). Fast and accurate registration of visible and infrared videos [Paper]. IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW 2013), Portland, OR, United states. External link
Wu, X., Lü, Z., & Galinier, P. (2017). Restricted swap-based neighborhood search for the minimum connected dominating set problem. Networks, 69(2), 222-236. External link
