Author of the publication

Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms.

, and . MCO, volume 14 of Communications in Computer and Information Science, page 358-368. Springer, (2008)

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.

 

Other publications of authors with the same name

Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms., and . MCO, volume 14 of Communications in Computer and Information Science, page 358-368. Springer, (2008)Constrained Wine Blending., , and . CP, volume 8124 of Lecture Notes in Computer Science, page 864-879. Springer, (2013)A Constraint-Based Approach to the Differential Harvest Problem., , and . CP, volume 9255 of Lecture Notes in Computer Science, page 541-556. Springer, (2015)Breaking Variable Symmetry in Almost Injective Problems., and . CP, volume 7514 of Lecture Notes in Computer Science, page 664-671. Springer, (2012)Union of all the Minimum Cycle Bases of a Graph.. Electron. J. Comb., (1997)Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms., and . MCO, volume 14 of Communications in Computer and Information Science, page 358-368. Springer, (2008)Maximum Symmetrical Split of Molecular Graphs. Application to Organic Synthesis Design., , and . Journal of Chemical Information and Modeling, 45 (3): 685-695 (2005)Supporting Sustainable Agroecological Initiatives for Small Farmers through Constraint Programming., , , and . IJCAI, page 5924-5931. ijcai.org, (2023)Systematic Conservation Planning for Sustainable Land-use Policies: A Constrained Partitioning Approach to Reserve Selection and Design.., , , and . IJCAI, page 5902-5908. ijcai.org, (2019)Appariements dirigés pour le raisonnement par classification sur des hiérarchies de graphes.. LMO, page 201-214. Ecole Polytechnique Fédérale de Lausanne, CH, (1996)