 | Monter d'un niveau |
Belderrar, A., Kpodjedo, S., Guéhéneuc, Y.-G., Antoniol, G., & Galinier, P. (mars 2011). Sub-graph mining: Identifying micro-architectures in evolving object-oriented software [Communication écrite]. 15th European Conference on Software Maintenance and Reengineering (CSMR 2011), Oldenburg, Germany. Lien externe
Galinier, P., Kpodjedo, S., & Antoniol, G. (juillet 2017). A penalty-based Tabu search for constrained covering arrays [Communication écrite]. 2017 annual Genetic and Evolutionary Computation Conference (GECCO 2017), Berlin, Germany. Lien externe
Kpodjedo, S., Galinier, P., & Antoniol, G. (2014). Using local similarity measures to efficiently address approximate graph matching. Discrete Applied Mathematics, 164, part, 161-171. Lien externe
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. Lien externe
Kpodjedo, S., Galinier, P., & Antoniol, G. (avril 2010). Enhancing a tabu algorithm for approximate graph matching by using similarity measures [Communication écrite]. 10th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2010), Istanbul, Turkey. Lien externe
Kpodjedo, S., Galinier, P., & Antoniol, G. (mars 2010). On the use of similarity metrics for approximate graph matching [Communication écrite]. International Symposium on Combinatorial Optimization (ISCO 2010), Hammamet, Tunisia. Publié dans Electronic Notes in Discrete Mathematics, 36. Lien externe
Kpodjedo, S., Galinier, P., & Antoniol, G. (2008). A Google-inspired error-correcting graph matching algorithm. (Rapport technique n° EPM-RT-2008-06). Disponible
