( en | de | ru )

 

Disambiguation of "Galinier, Philippe"

Author of the publication

copydeleteadd this publication to your clipboard
MADMatch: Many-to-Many Approximate Diagram Matching for Design Comparison.

, , , , and . IEEE Trans. Software Eng., 39 (8): 1090-1111 (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Philippe Kersting

Philippe Bopp

Philippe Dreuw

Philippe Zysset

Philippe Moisan

 

Other publications of authors with the same name

A Hybrid Iterated Local Search Algorithm for the Global Planning Problem of Survivable 4G Wireless Networks., , and . IEEE/ACM Trans. Netw., 24 (1): 137-148 (2016)Restricted swap-based neighborhood search for the minimum connected dominating set problem., , and . Networks, 69 (2): 222-236 (2017)Tabu Search for Maximal Constraint Satisfaction Problems., and . CP, volume 1330 of Lecture Notes in Computer Science, page 196-208. Springer, (1997)On Identifying Infeasible Subsets in Constraint Satisfaction Problems., , and . IC-AI, page 615-619. CSREA Press, (2010)Design evolution metrics for defect prediction in object oriented systems., , , , and . Empirical Software Engineering, 16 (1): 141-175 (2011)Hybrid Evolutionary Algorithms for Graph Coloring., and . J. Comb. Optim., 3 (4): 379-397 (1999)A tabu search algorithm for the covering design problem., and . J. Heuristics, 17 (6): 659-674 (2011)On the use of similarity metrics for approximate graph matching., , and . Electron. Notes Discret. Math., (2010)A reliable model for global planning of mobile networks., , and . Comput. Oper. Res., 40 (10): 2270-2282 (2013)Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures., , and . EvoCOP, volume 6022 of Lecture Notes in Computer Science, page 119-130. Springer, (2010)