Publications à Polytechnique

Ces données sont extraites du Répertoire des publications de l'École Polytechnique de Montréal. La liste ci-dessous contient seulement les publications auxquelles a participé le professeur ou le chercheur depuis son entrée en fonction à l’École. De plus, certaines publications ne sont pas dans cette liste, notamment les notes de cours et les rapports techniques internes plus d'information...
1	Medini, S., Galinier, P., Di Penta, M., Gueheneuc, Y.-G., Antoniol, G. (2011). A Fast Algorithm to Locate Concepts in Execution Traces. 3rd International Symposium on Search-Based Software Engineering, SSBSE 2011, p. 252-266.
2	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, p. 121-135.
3	Belderrar, A., Kpodjedo, S., Gueheneuc, Y.-G., Antoniol, G., Galinier, P. (2011). Sub-Graph Mining: Identifying Micro-Architectures in Evolving Object-Oriented Software. 15th European Conference on Software Maintenance and Reengineering, CSMR 2011, p. 171-180.
4	Desrosiers, C., Galinier, P., Hertz, A., Hansen, P. (2011). Improving Constrained Pattern Mining With First-Fail-Based Heuristics. Data Mining and Knowledge Discovery, 23(1), p. 63-90.
5	Kpodjedo, S., Ricca, F., Galinier, P., Gueheneuc, Y.-G., Antoniol, G. (2011). Design Evolution Metrics for Defect Prediction in Object Oriented Systems. Empirical Software Engineering, 16(1), p. 141-175.
6	Fadlaoui, K., Galinier, P. (2011). A Tabu Search Algorithm for the Covering Design Problem. Journal of Heuristics, 17(6), p. 659-674.
7	Galinier, P., Boujbel, Z., Coutinho Fernandes, M. (2011). An Efficient Memetic Algorithm for the Graph Partitioning Problem. Annals of Operations Research, 191(1), p. 1-22.
8	Kpodjedo, S., Galinier, P., Antoniol, G. (2010). Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures. 10th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2010, p. 119-130.
9	Fadlaoui, K., Galinier, P. (2010). A Tabu Search Algorithm for the Covering Design Problem. Journal of Heuristics, p. 1-16.
10	Desrosiers, C., Galinier, P., Hertz, A., Hansen, P. (2010). Improving Constrained Pattern Mining With First-Fail-Based Heuristics. Data Mining and Knowledge Discovery, p. 1-28.
11	Kpodjedo, S., Ricca, F., Galinier, P., Antoniol, G., Gueheneuc, Y.-G. (2010). Studying Software Evolution of Large Object-Oriented Software Systems Using an ETGM Algorithm. Journal of Software Maintenance and Evolution: Research and Practice, p. 28.
12	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), p. 124-150.
13	Kpodjedo, S., Ricca, F., Antoniol, G., Galinier, P. (2009). Evolution and Search Based Metrics to Improve Defects Prediction. 1st International Symposium on Search Based Software Engineering, p. 23-32.
14	Kpodjedo, S., Ricca, F., Galinier, P., Antoniol, G. (2009). Recovering the Evolution Stable Part Using an ECGM Algorithm: Is There a Tunnel in Mozilla?. 13th European Conference on Software Maintenance and Reengineering, p. 179-188.
15	Ouellet, M.-O., Chamberland, S., Galinier, P. (2008). On the Planning Problem of Wireless Local Area Networks With Directional Antennas. IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, p. 655-660.
16	Kpodjedo, S., Ricca, F., Galinier, P., Antoniol, G. (2008). Error Correcting Graph Matching Application to Software Evolution. 2008 15th Working Conference on Reverse Engineering (WCRE),, p. 289-293.
17	Galinier, P., Hertz, A., Paroz, S., Pesant, G. (2008). Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints. 5th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2008, p. 298-302.
18	Del Grosso, C., Antoniol, G., Merlo, E., Galinier, P. (2008). Detecting Buffer Overflow Via Automatic Test Input Data Generation. Computers & Operations Research, 35(10), p. 3125-3143.
19	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), p. 123-130.
20	Desrosiers, C., Galinier, P., Hertz, A. (2008). Efficient Algorithms for Finding Critical Subgraphs. Discrete Applied Mathematics, 156(2), p. 244-266.
21	Galinier, P., Hertz, A., Zufferey, N. (2008). An Adaptive Memory Algorithm for the K-Coloring Problem. Discrete Applied Mathematics, 156(2), p. 267-279.
22	Kpodjedo, S., Ricca, F., Galinier, P., Antoniol. G. (2008). Not All Classes Are Created Equal: Toward a Recommendation System for Focusing Testing. International Workshop on Recommendation Systems for Software Engineering, p. 6-10.
23	Galinier, P., Hertz, A. (2007). Solution Techniques for the Large Set Covering Problem. Discrete Applied Mathematics, 155(3), p. 312-326.
24	Desrosiers, C., Galinier, P., Hansen, P., Hertz, A. (2007). Improving Frequent Subgraph Mining in the Presence of Symmetry. 5th International Workshop on Mining and Learning With Graphs.
25	Galinier, P., Jaumard, B. (2006). A Tabu Search Algorithm for Difference Triangle Sets and Golomb Rulers. Computers & Operations Research, 33(4), p. 955-970.
26	Galinier, P., Hertz, A. (2006). A Survey of Local Search Methods for Graph Coloring. Computers & Operations Research, 33(9), p. 2547-2562.
27	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. Annales des télécommunications, 60(9-10), p. 1140-1160.
28	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), p. 426-428.
29	Del Grosso, C., Antoniol, G., Di Penta, M., Galinier, P., Merlo, E. (2005). Improving Network Applications Security : a New Heuristic to Generate Stress Testing Data. GECCO 2005.
30	Galinier, P., Gendreau, M., Soriano, P., Bisaillon, S. (2005). Solving the Frequency Assignment Problem With Polarization by Local Search and Tabu. 4OR, 3(1), p. 59-78.
31	Dzongang, C., Galinier, P., Pierre, S. (2004). Tabu Approach for Routing and Wavelenght Assignment in Optical Networks. Workshop on Optimization of Optical Networks.
32	Galinier, P., Hao, J.-K. (2004). A General Approach for Constraint Solving by Local Search. Journal of Mathematical Modelling and Algorithms, 3(1), p. 73-88.
33	Bourdais, S., Galinier, P., Pesant, G. (2003). HIBISCUS: a Constraint Programming Application to Staff Scheduling in Health Care. Lecture Notes in Computer Science, 2833, p. 153-167.
34	Galinier, P., Hertz, A., Zufferey, N. (2002). Adaptative Memory Algorithms for Graph Coloring. Computational Symposium on Graph Coloring and Generalizations (COLOR02), p. 75-82.
35	Galinier, Ph., Jaumard, B., Morales, R., Pesant, G. (2001). Constraint-Based Approach to the Golomb Ruler Problem. 3rd International Workshop on the Intergration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR01).
36	Galinier, P., Hao, J.K. (2000). General Approach for Constraint Solving by Socal Search. 2nd International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'00), p. 57-69.
37	Galinier, P., Hao, J.K. (1999). Hybrid Evolutionary Algorithms for Graph Coloring. Journal of Combinatorial Optimization, 3(4), p. 379-397.
38	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), p. 283-324.