Maël Minot


Former LIRIS member since: 2018-09-30

Quality
PhD student
Team(s) M2DisCo
Institution 
Institut National des Sciences Appliquées de Lyon
ThesisSearching for a maximum common induced subgraph by decomposing the CSP's microstructure (click to view details)

Publications (IdHAL : mael-minot)

Publications LIRIS pour Maël Minot (6)

  • 2017 (1)
    • Conferences (1)
      • International conferences with peer review (1)
        •  Maël Minot, Samba Ndojh Ndiaye & Christine Solnon (2017). "Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem". International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2017), 8 juin 2017, Padova (Italy), pp. 359-375. HAL : hal-01447818. .
  • 2016 (2)
    • Conferences (2)
      • National conferences with peer review (1)
        •  Maël Minot, Samba Ndojh Ndiaye & Christine Solnon (2016). "Évaluation d'approches complètes pour le problème de somme coloration". Douzièmes Journées Francophones de Programmation par Contraintes (JFPC 2016), 17 juin 2016, Montpellier (France), pp. 1-10. HAL : hal-01309350. .
      • Other conferences (1)
        •  Maël Minot, Samba Ndojh Ndiaye & Christine Solnon (2016). "Using CP and ILP with tree decomposition to solve the sum colouring problem". Doctoral program of 22nd International Conference on Principles and Practice of Constraint Programming (CP 2016), 9 septembre 2016, Toulouse (France), pp. 1-10. HAL : hal-01366291. .
  • 2015 (2)
    • Conferences (2)
      • International conferences with peer review (1)
        •  Maël Minot, Samba Ndojh Ndiaye & Christine Solnon (2015). "A Comparison of Decomposition Methods for the Maximum Common Subgraph Problem". 27th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), 11 novembre 2015, Vierti sul Mare (Italy), pp. 461-468. HAL : hal-01191605. .
      • National conferences with peer review (1)
        •  Maël Minot, Samba Ndojh Ndiaye & Christine Solnon (2015). "Recherche d’un plus grand sous-graphe commun par décomposition du graphe de compatibilité". Onzièmes Journées Francophones de Programmation par Contraintes (JFPC), 24 juin 2015, Bordeaux (France), pp. 1-11. HAL : hal-01163322.
  • 2014 (1)
    • Conferences (1)
      • International conferences with peer review (1)
        •  Maël Minot & Samba Ndojh Ndiaye (2014). "Searching for a maximum common induced subgraph by decomposing the compatibility graph". Bridging the Gap Between Theory and Practice in Constraint Solvers, CP2014-Workshop, 8 septembre 2014, Lyon (France), pp. 1-17. HAL : hal-01301095.