{"id":167,"date":"2024-06-22T12:54:15","date_gmt":"2024-06-22T10:54:15","guid":{"rendered":"https:\/\/web.umons.ac.be\/algo\/?page_id=167"},"modified":"2025-06-18T09:43:00","modified_gmt":"2025-06-18T07:43:00","slug":"hadrien-melot","status":"publish","type":"page","link":"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/","title":{"rendered":"Hadrien M\u00e9lot"},"content":{"rendered":"<p><img loading=\"lazy\" decoding=\"async\" class=\" wp-image-168 alignleft\" src=\"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/06\/photo-238x300.jpg\" alt=\"\" width=\"153\" height=\"193\" srcset=\"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/06\/photo-238x300.jpg 238w, https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/06\/photo-30x38.jpg 30w, https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/06\/photo-48x60.jpg 48w, https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/06\/photo-360x454.jpg 360w, https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/06\/photo.jpg 389w\" sizes=\"auto, (max-width: 153px) 100vw, 153px\" \/>Hadrien M\u00e9lot est professeur au <a href=\"https:\/\/web.umons.ac.be\/fs-informatique\/\">D\u00e9partement d&rsquo;Informatique<\/a> (<a href=\"https:\/\/web.umons.ac.be\/fs\/fr\/\">Facult\u00e9 des Sciences)<\/a> de l&rsquo;<a href=\"http:\/\/www.umons.ac.be\/\">Universit\u00e9 de Mons<\/a>. Il dirige le <a href=\"http:\/\/informatique.umons.ac.be\/algo\">service d&rsquo;Algorithmique<\/a> qu&rsquo;il a cr\u00e9\u00e9 en 2010. Il est le pr\u00e9sident du D\u00e9partement d&rsquo;Informatique.<\/p>\n<p>Le sujet principal de ses recherches concerne la th\u00e9orie extr\u00e9male des graphes. En particulier, Hadrien M\u00e9lot et ses collaborateurs \u00e9tudient comment les ordinateurs peuvent aider les chercheurs dans ce domaine pour trouver des conjectures, des contre-exemples ou des id\u00e9es de preuves (interactivement ou automatiquement). Plusieurs <a href=\"https:\/\/web.umons.ac.be\/algo\/recherche\/logiciels\/\">outils d&rsquo;aide \u00e0 la d\u00e9couverte<\/a> en th\u00e9orie des graphes ont \u00e9t\u00e9 (co-)d\u00e9velopp\u00e9s au sein du <a href=\"http:\/\/informatique.umons.ac.be\/algo\">service d&rsquo;Algorithmique<\/a> (e.g, GraPHedron, <a href=\"https:\/\/phoeg.umons.ac.be\">PHOEG<\/a>, <a href=\"https:\/\/houseofgraphs.org\/\">House of Graphs<\/a>). Ces outils sont reconnus et utilis\u00e9s par la communaut\u00e9 internationale.<\/p>\n<p>Au niveau de l&rsquo;enseignement, en Bachelier en Sciences Informatiques, Hadrien M\u00e9lot est titulaire des cours d&rsquo;<em>Algorithmique et Programmation imp\u00e9rative<\/em>; <em>Compl\u00e9ments d&rsquo;Algorithmique<\/em> et <em>Approches Classiques de l&rsquo;Intelligence Artificielle<\/em>. En Master en Sciences Informatiques, il donne les cours d&rsquo;<em>Intelligence Artificielle<\/em> (en horaire d\u00e9cal\u00e9 \u00e0 Charleroi) et de <em>Graphes et Intelligence Artificielle<\/em>.<\/p>\n<h5>Publications<\/h5>\n<ul>\n<li><a href=\"https:\/\/dblp.org\/pid\/m\/HadrienMelot.html\">DBLP<\/a><\/li>\n<li><a href=\"https:\/\/scholar.google.com\/citations?user=HshCjiMAAAAJ&amp;hl=en\">Google scholar<\/a><\/li>\n<li><a href=\"https:\/\/orcid.org\/0000-0003-4805-1352\">ORCID<\/a><\/li>\n<li><a href=\"https:\/\/orbi.umons.ac.be\/profile?uid=501409\">UMONS institutional repository<\/a><\/li>\n<\/ul>\n<h5>Postes occup\u00e9s<\/h5>\n<ul>\n<li>Depuis Octobre 2022 : Pr\u00e9sident du <a href=\"https:\/\/web.umons.ac.be\/fs-informatique\/\">D\u00e9partement d&rsquo;Informatique, UMONS<\/a><\/li>\n<li>Depuis Octobre 2018 : Professeur (<a href=\"https:\/\/web.umons.ac.be\/fs-informatique\/\">D\u00e9partement d&rsquo;Informatique, UMONS<\/a>)<\/li>\n<li>Janvier 2012 \u00e0 Septembre 2018 : Charg\u00e9 de cours nomm\u00e9 (<a href=\"https:\/\/web.umons.ac.be\/fs-informatique\/\">D\u00e9partement d&rsquo;Informatique, UMONS<\/a>)<\/li>\n<li>Septembre 2012 \u00e0 Ao\u00fbt 2013 : Ma\u00eetre d&rsquo;enseignement (<a href=\"http:\/\/ulb.ac.be\/di\">D\u00e9partement d&rsquo;Informatique, ULB<\/a>)<\/li>\n<li>Octobre 2010 \u00e0 D\u00e9cembre 2011 : Charg\u00e9 de cours temporaire (<a href=\"https:\/\/web.umons.ac.be\/fs-informatique\/\">D\u00e9partement d&rsquo;Informatique, UMONS<\/a>)<\/li>\n<li>Janvier 2010 \u00e0 Juin 2010 : Chercheur postdoctoral de la Fondation Francqui (<a href=\"http:\/\/www.twist.ugent.be\/index.php?page=onderzoek&amp;ogid=caagt\">CAAGT, UGent<\/a>)<\/li>\n<li>Octobre 2007 \u00e0 Septembre 2010 : Chercheur postdoctoral du F.R.S.-FNRS (<q>Charg\u00e9 de Recherches F.R.S.-FNRS<\/q>, <a href=\"https:\/\/web.umons.ac.be\/fs-informatique\/\">D\u00e9partement d&rsquo;Informatique, UMONS<\/a>)<\/li>\n<li>D\u00e9cembre 2004 \u00e0 Septembre 2007 :\u00a0 Collaborateur scientifique (<a href=\"http:\/\/www.ulb.ac.be\/di\">D\u00e9partement d&rsquo;Informatique, ULB<\/a>)<\/li>\n<li>Septembre 2001 \u00e0 Septembre 2007 : Assistant (<a href=\"https:\/\/web.umons.ac.be\/fs-informatique\/\">Institut d&rsquo;Informatique, UMH<\/a>)<\/li>\n<li>Juillet 2000 \u00e0 Ao\u00fbt 2001 : Bourse de recherche (<a href=\"http:\/\/code.ulb.ac.be\/smg.home.php\">Service de Math\u00e9matiques de la Gestion, ULB<\/a>)<\/li>\n<\/ul>\n<h5>Education<\/h5>\n<ul>\n<li>Septembre 2001 \u00e0 Avril 2006 : PhD en Sciences, sp\u00e9cialisation Informatique (<a href=\"http:\/\/www.umons.ac.be\">UMONS<\/a>). Promoteurs : <a href=\"http:\/\/www.hec.ca\/profs\/pierre.hansen.html\">Pierre Hansen<\/a> (HEC Montr\u00e9al and GERAD) and <a href=\"http:\/\/informatique.umons.ac.be\/staff\/Bruyere.Veronique\/\">V\u00e9ronique Bruy\u00e8re<\/a> (UMONS)<\/li>\n<li>Septembre 1999 \u00e0 Juin 2000 : DEA en Recherche Op\u00e9rationnelle (<a href=\"http:\/\/www.ulb.ac.be\">ULB<\/a>)<\/li>\n<li>Septembre 1994 \u00e0 Juin 1999 : Licence en Sciences Math\u00e9matiques, orientation Statistiques et Recherche Op\u00e9rationnelle (<a href=\"http:\/\/www.ulb.ac.be\">ULB<\/a>)<\/li>\n<\/ul>\n<h5>Prix et distinctions<\/h5>\n<ul>\n<li>2010 : <a href=\"http:\/\/www.francquifoundation.be\/fr\/Mandats%20Intercommunautaires%20-%20Titulaires.htm\">Mandat de collaborateur scientifique postdoctoral intercommunautaire<\/a> de la Fondation Francqui<\/li>\n<li>2007 : <a href=\"http:\/\/www.fnrs.be\/docs\/Prix\/FRS-FNRS_Liste-des-laureats-Prix_IBM_Belgium_dinformatique.pdf\">Prix IBM Belgium d&rsquo;Informatique \/ F.R.S.-FNRS 2007<\/a> (Prix annuel pour la meilleure th\u00e8se de doctorat en informatique et\/ou ses applications)<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Hadrien M\u00e9lot est professeur au D\u00e9partement d&rsquo;Informatique (Facult\u00e9 des Sciences) de l&rsquo;Universit\u00e9 de Mons. Il dirige le service d&rsquo;Algorithmique qu&rsquo;il a cr\u00e9\u00e9 en 2010. Il est le pr\u00e9sident du D\u00e9partement d&rsquo;Informatique. Le sujet principal de ses recherches concerne la th\u00e9orie extr\u00e9male des graphes. En particulier, Hadrien M\u00e9lot et ses collaborateurs \u00e9tudient comment les ordinateurs peuvent [&hellip;]<\/p>\n","protected":false},"author":130,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-167","page","type-page","status-publish","hentry"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.2 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Hadrien M\u00e9lot - Service \/ FS - Algorithmique<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/\" \/>\n<meta property=\"og:locale\" content=\"fr_FR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Hadrien M\u00e9lot - Service \/ FS - Algorithmique\" \/>\n<meta property=\"og:description\" content=\"Hadrien M\u00e9lot est professeur au D\u00e9partement d&rsquo;Informatique (Facult\u00e9 des Sciences) de l&rsquo;Universit\u00e9 de Mons. Il dirige le service d&rsquo;Algorithmique qu&rsquo;il a cr\u00e9\u00e9 en 2010. Il est le pr\u00e9sident du D\u00e9partement d&rsquo;Informatique. Le sujet principal de ses recherches concerne la th\u00e9orie extr\u00e9male des graphes. En particulier, Hadrien M\u00e9lot et ses collaborateurs \u00e9tudient comment les ordinateurs peuvent [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/\" \/>\n<meta property=\"og:site_name\" content=\"Service \/ FS - Algorithmique\" \/>\n<meta property=\"article:modified_time\" content=\"2025-06-18T07:43:00+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/06\/photo.jpg\" \/>\n\t<meta property=\"og:image:width\" content=\"389\" \/>\n\t<meta property=\"og:image:height\" content=\"491\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Dur\u00e9e de lecture estim\u00e9e\" \/>\n\t<meta name=\"twitter:data1\" content=\"3 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/\",\"url\":\"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/\",\"name\":\"Hadrien M\u00e9lot - Service \/ FS - Algorithmique\",\"isPartOf\":{\"@id\":\"https:\/\/web.umons.ac.be\/algo\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/06\/photo-238x300.jpg\",\"datePublished\":\"2024-06-22T10:54:15+00:00\",\"dateModified\":\"2025-06-18T07:43:00+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/#breadcrumb\"},\"inLanguage\":\"fr-FR\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"fr-FR\",\"@id\":\"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/#primaryimage\",\"url\":\"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/06\/photo-238x300.jpg\",\"contentUrl\":\"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/06\/photo-238x300.jpg\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/web.umons.ac.be\/algo\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Hadrien M\u00e9lot\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/web.umons.ac.be\/algo\/#website\",\"url\":\"https:\/\/web.umons.ac.be\/algo\/\",\"name\":\"Service \/ FS - Algorithmique\",\"description\":\"\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/web.umons.ac.be\/algo\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"fr-FR\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Hadrien M\u00e9lot - Service \/ FS - Algorithmique","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/","og_locale":"fr_FR","og_type":"article","og_title":"Hadrien M\u00e9lot - Service \/ FS - Algorithmique","og_description":"Hadrien M\u00e9lot est professeur au D\u00e9partement d&rsquo;Informatique (Facult\u00e9 des Sciences) de l&rsquo;Universit\u00e9 de Mons. Il dirige le service d&rsquo;Algorithmique qu&rsquo;il a cr\u00e9\u00e9 en 2010. Il est le pr\u00e9sident du D\u00e9partement d&rsquo;Informatique. Le sujet principal de ses recherches concerne la th\u00e9orie extr\u00e9male des graphes. En particulier, Hadrien M\u00e9lot et ses collaborateurs \u00e9tudient comment les ordinateurs peuvent [&hellip;]","og_url":"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/","og_site_name":"Service \/ FS - Algorithmique","article_modified_time":"2025-06-18T07:43:00+00:00","og_image":[{"width":389,"height":491,"url":"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/06\/photo.jpg","type":"image\/jpeg"}],"twitter_card":"summary_large_image","twitter_misc":{"Dur\u00e9e de lecture estim\u00e9e":"3 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/","url":"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/","name":"Hadrien M\u00e9lot - Service \/ FS - Algorithmique","isPartOf":{"@id":"https:\/\/web.umons.ac.be\/algo\/#website"},"primaryImageOfPage":{"@id":"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/#primaryimage"},"image":{"@id":"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/#primaryimage"},"thumbnailUrl":"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/06\/photo-238x300.jpg","datePublished":"2024-06-22T10:54:15+00:00","dateModified":"2025-06-18T07:43:00+00:00","breadcrumb":{"@id":"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/#breadcrumb"},"inLanguage":"fr-FR","potentialAction":[{"@type":"ReadAction","target":["https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/"]}]},{"@type":"ImageObject","inLanguage":"fr-FR","@id":"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/#primaryimage","url":"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/06\/photo-238x300.jpg","contentUrl":"https:\/\/web.umons.ac.be\/app\/uploads\/sites\/65\/2024\/06\/photo-238x300.jpg"},{"@type":"BreadcrumbList","@id":"https:\/\/web.umons.ac.be\/algo\/hadrien-melot\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/web.umons.ac.be\/algo\/"},{"@type":"ListItem","position":2,"name":"Hadrien M\u00e9lot"}]},{"@type":"WebSite","@id":"https:\/\/web.umons.ac.be\/algo\/#website","url":"https:\/\/web.umons.ac.be\/algo\/","name":"Service \/ FS - Algorithmique","description":"","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/web.umons.ac.be\/algo\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"fr-FR"}]}},"lang":"fr","translations":{"fr":167,"en":182},"pll_sync_post":[],"_links":{"self":[{"href":"https:\/\/web.umons.ac.be\/algo\/wp-json\/wp\/v2\/pages\/167","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/web.umons.ac.be\/algo\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/web.umons.ac.be\/algo\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/web.umons.ac.be\/algo\/wp-json\/wp\/v2\/users\/130"}],"replies":[{"embeddable":true,"href":"https:\/\/web.umons.ac.be\/algo\/wp-json\/wp\/v2\/comments?post=167"}],"version-history":[{"count":4,"href":"https:\/\/web.umons.ac.be\/algo\/wp-json\/wp\/v2\/pages\/167\/revisions"}],"predecessor-version":[{"id":208,"href":"https:\/\/web.umons.ac.be\/algo\/wp-json\/wp\/v2\/pages\/167\/revisions\/208"}],"wp:attachment":[{"href":"https:\/\/web.umons.ac.be\/algo\/wp-json\/wp\/v2\/media?parent=167"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}