

{"id":73,"date":"2017-12-14T16:48:59","date_gmt":"2017-12-14T15:48:59","guid":{"rendered":"https:\/\/project.inria.fr\/multimod\/?page_id=73"},"modified":"2021-06-23T17:15:39","modified_gmt":"2021-06-23T15:15:39","slug":"publications","status":"publish","type":"page","link":"https:\/\/project.inria.fr\/multimod\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"<p>   <!DOCTYPE html PUBLIC \"-\/\/W3C\/\/DTD XHTML 1.0 Transitional\/\/EN\" \"http:\/\/www.w3.org\/TR\/xhtml1\/DTD\/xhtml1-transitional.dtd\"> <html xmlns='http:\/\/www.w3.org\/1999\/xhtml' xml:lang='fr' lang='fr'> <head> <meta name=\"robots\" content=\"noindex, nofollow\" \/> <meta http-equiv=\"content-type\" content= \"text\/html;charset=UTF-8\" \/> <meta http-equiv=\"Content-Language\" content=\"fr\" \/> <link rel=\"stylesheet\" type=\"text\/css\" href=\"..\/css\/VisuGen.css\" \/> <link rel=\"stylesheet\" type=\"text\/css\" href=\"https:\/\/files.inria.fr\/coati\/wordpress\/coati_hal.css\" \/> <!-- Piwik haltools.inria.fr--> <script type=\"text\/javascript\">   var _paq = _paq || [];   _paq.push(['trackPageView']);   _paq.push(['enableLinkTracking']);   (function() {     var u=\"\/\/piwik.inria.fr\/\";     _paq.push(['setTrackerUrl', u+'piwik.php']);     _paq.push(['setSiteId', 25]);     var d=document, g=d.createElement('script'), s=d.getElementsByTagName('script')[0];     g.type='text\/javascript'; g.async=true; g.defer=true; g.src=u+'piwik.js'; s.parentNode.insertBefore(g,s);   })(); <\/script> <noscript><\/p>\n<p><img decoding=\"async\" src=\"\/\/piwik.inria.fr\/piwik.php?idsite=25\" style=\"border:0;\" alt=\"\" \/><\/p>\n<p><\/noscript> <!-- End Piwik Code -->  <title>Publications HAL du projet ANR.  17-CE22-0016<\/title> <\/head> <body> <\/p>\n<div id=\"res_script\">\n<p class='Rubrique'>2023<\/p>\n<p class='SousRubrique'>Journal articles<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Ali Al Zoobi, David Coudert, Nicolas Nisse<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-03196830v2\" target=\"_blank\" >Finding the k Shortest Simple Paths: Time and Space trade-offs<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>ACM Journal of Experimental Algorithmics<\/i>, 2023, 28, pp.23. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3626567\">&#x27E8;10.1145\/3626567&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1145\/3626567\" target=\"_blank\" >10.1145\/3626567<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.science\/hal-03196830\/file\/JEA-HAL.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-03196830\/file\/JEA-HAL.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-03196830\/file\/JEA-HAL.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-03196830v2\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, Simon Nivelle<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-04268050v1\" target=\"_blank\" >Treelength of series\u2013parallel graphs<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Discrete Applied Mathematics<\/i>, 2023, 341, pp.16-30. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.dam.2023.07.022\">&#x27E8;10.1016\/j.dam.2023.07.022&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1016\/j.dam.2023.07.022\" target=\"_blank\" >10.1016\/j.dam.2023.07.022<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.science\/hal-04268050\/file\/Series_parallel_graphs_of_treelength_2-4.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-04268050\/file\/Series_parallel_graphs_of_treelength_2-4.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-04268050\/file\/Series_parallel_graphs_of_treelength_2-4.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-04268050v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Julien Bensmail, Victor Campos, Ana Karolinna Maia, Nicolas Nisse, Ana Silva<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-04084227v1\" target=\"_blank\" >Deciding the Erd\u0151s-P\u00f3sa property in 3-connected digraphs<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>WG 2023 &#8211; 49th International Workshop on Graph-Theoretic Concepts in Computer Science<\/i>, Jun 2023, Fribourg (CH), Switzerland. pp.59-71, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-43380-1_5\">&#x27E8;10.1007\/978-3-031-43380-1_5&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/978-3-031-43380-1_5\" target=\"_blank\" >10.1007\/978-3-031-43380-1_5<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-04084227\/file\/Directed_Cylindrical_Grid_and_Models___New_version-6.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-04084227\/file\/Directed_Cylindrical_Grid_and_Models___New_version-6.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-04084227\/file\/Directed_Cylindrical_Grid_and_Models___New_version-6.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-04084227v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Jean-Claude Bermond, Michel Cosnard, David Coudert, Fr\u00e9d\u00e9ric Havet<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-04076999v2\" target=\"_blank\" >Groupage sur le chemin pour borner la largeur de coupe<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>AlgoTel 2023 &#8211; 25\u00e8mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9l\u00e9communications<\/i>, May 2023, Cargese, France. pp.4<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-04076999\/file\/cutwidth-Algotel.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-04076999\/file\/cutwidth-Algotel.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-04076999\/file\/cutwidth-Algotel.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-04076999v2\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Cinzia Di Giusto, Davide Ferr\u00e9, Etienne Lozes, Nicolas Nisse<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-04273451v1\" target=\"_blank\" >Weakly Synchronous Systems with\u00a0Three Machines Are Turing Powerful<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>RP 2023 &#8211; 17th International Conference on Reachability Problems<\/i>, 2023, Nice, France. pp.28-41, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-031-45286-4_3\">&#x27E8;10.1007\/978-3-031-45286-4_3&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/978-3-031-45286-4_3\" target=\"_blank\" >10.1007\/978-3-031-45286-4_3<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.science\/hal-04273451\/file\/conference.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-04273451\/file\/conference.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-04273451\/file\/conference.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-04273451v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Preprints, Working Papers, &#8230;<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Alkida Balliu, Filippo Brunelli, Pierluigi Crescenzi, Dennis Olivetti, Laurent Viennot<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-04054527v1\" target=\"_blank\" >A Note on the Complexity of Maximizing Temporal Reachability via Edge Temporalisation of Directed Graphs<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">2023<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-04054527\/file\/main.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-04054527\/file\/main.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-04054527\/file\/main.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-04054527v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Filippo Brunelli, Laurent Viennot<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-03864725v2\" target=\"_blank\" >Minimum-Cost Temporal Walks under Waiting-Time Constraints in Linear Time<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">2023<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-03864725\/file\/main-long.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-03864725\/file\/main-long.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-03864725\/file\/main-long.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-03864725v2\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2022<\/p>\n<p class='SousRubrique'>Journal articles<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-03430099v2\" target=\"_blank\" >On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Networks<\/i>, 2022, 81 (2), pp.27. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1002\/net.22123\">&#x27E8;10.1002\/net.22123&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1002\/net.22123\" target=\"_blank\" >10.1002\/net.22123<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-03430099\/file\/main-all.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-03430099\/file\/main-all.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-03430099\/file\/main-all.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-03430099v2\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">David Coudert, Andr\u00e9 Nusser, Laurent Viennot<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-03837023v1\" target=\"_blank\" >Enumeration of far-apart pairs by decreasing distance for faster hyperbolicity computation<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>ACM Journal of Experimental Algorithmics<\/i>, 2022, 27 (1.15), pp.29. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3569169\">&#x27E8;10.1145\/3569169&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1145\/3569169\" target=\"_blank\" >10.1145\/3569169<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-03837023\/file\/CNV-JEA.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-03837023\/file\/CNV-JEA.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-03837023\/file\/CNV-JEA.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-03837023v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Guillaume Ducoffe, Michel Habib, Laurent Viennot<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-03841015v1\" target=\"_blank\" >Diameter, eccentricities and distance oracle computations on H-minor free graphs and graphs of bounded (distance) VC-dimension<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>SIAM Journal on Computing<\/i>, 2022, 51 (5), pp.1506-1534. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1137\/20M136551X\">&#x27E8;10.1137\/20M136551X&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1137\/20M136551X\" target=\"_blank\" >10.1137\/20M136551X<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.science\/hal-03841015\/file\/vc-diameter.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-03841015\/file\/vc-diameter.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-03841015\/file\/vc-diameter.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-03841015v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Ali Al-Zoobi, David Coudert, Arthur Finkelstein, Jean-Charles R\u00e9gin<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-03559992v1\" target=\"_blank\" >On Finding k Earliest Arrival Time Journeys in Public Transit Networks<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>ICORES 2022 &#8211; 11th International Conference on Operations Research and Enterprise Systems<\/i>, Feb 2022, Virtual event, France. pp.314-325, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.5220\/0010977200003117\">&#x27E8;10.5220\/0010977200003117&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.5220\/0010977200003117\" target=\"_blank\" >10.5220\/0010977200003117<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-03559992\/file\/ptkssp.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-03559992\/file\/ptkssp.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-03559992\/file\/ptkssp.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-03559992v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">David Coudert, Andr\u00e9 Nusser, Laurent Viennot<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-03431155v2\" target=\"_blank\" >Hyperbolicity Computation through Dominating Sets<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>ALENEX 2022 &#8211; SIAM Symposium on Algorithm Engineering and Experiments<\/i>, Jan 2022, Alexandria, VA, United States. pp.78-90, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1137\/1.9781611977042.7\">&#x27E8;10.1137\/1.9781611977042.7&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1137\/1.9781611977042.7\" target=\"_blank\" >10.1137\/1.9781611977042.7<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-03431155\/file\/domset-main-arxiv.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-03431155\/file\/domset-main-arxiv.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-03431155\/file\/domset-main-arxiv.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-03431155v2\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">David Coudert, Andr\u00e9 Nusser, Laurent Viennot<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-03648264v2\" target=\"_blank\" >Dominer pour calculer l&#8217;hyperbolicit\u00e9 des graphes<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>AlgoTel 2022 &#8211; 24\u00e8mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9l\u00e9communications<\/i>, May 2022, Saint-R\u00e9my-L\u00e8s-Chevreuse, France<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.science\/hal-03648264\/file\/algotel2022final.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-03648264\/file\/algotel2022final.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-03648264\/file\/algotel2022final.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-03648264v2\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2021<\/p>\n<p class='SousRubrique'>Journal articles<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-03095828v1\" target=\"_blank\" >On Computing Pareto Optimal Paths in Weighted Time-Dependent Networks<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Information Processing Letters<\/i>, In press, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.ipl.2020.106086\">&#x27E8;10.1016\/j.ipl.2020.106086&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1016\/j.ipl.2020.106086\" target=\"_blank\" >10.1016\/j.ipl.2020.106086<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-03095828\/file\/main.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-03095828\/file\/main.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-03095828\/file\/main.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-03095828v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Guillaume Ducoffe, Michel Habib, Laurent Viennot<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-02307397v4\" target=\"_blank\" >Fast Diameter Computation within Split Graphs<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Discrete Mathematics and Theoretical Computer Science<\/i>, 2021, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.46298\/dmtcs.6422\">&#x27E8;10.46298\/dmtcs.6422&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.46298\/dmtcs.6422\" target=\"_blank\" >10.46298\/dmtcs.6422<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-02307397\/file\/DHV-dmtcs.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-02307397\/file\/DHV-dmtcs.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-02307397\/file\/DHV-dmtcs.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-02307397v4\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Ali Al Zoobi, David Coudert, Nicolas Nisse<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-03219987v2\" target=\"_blank\" >De la difficult\u00e9 de trouver des chemins dissimilaires<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>ALGOTEL 2021 &#8211; 23\u00e8mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9l\u00e9communications<\/i>, Sep 2021, La Rochelle, France<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.science\/hal-03219987\/file\/On_the_k_top_shortest_paths_with_diversity_constraints_c.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-03219987\/file\/On_the_k_top_shortest_paths_with_diversity_constraints_c.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-03219987\/file\/On_the_k_top_shortest_paths_with_diversity_constraints_c.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-03219987v2\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, Simon Nivelle<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-03175837v1\" target=\"_blank\" >Treelength of Series-parallel graphs<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>LAGOS 2021 &#8211; XI Latin and American Algorithms, Graphs and Optimization Symposium<\/i>, May 2021, S\u00e3o Paulo \/ Virtual, Brazil. <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1016\/j.procs.2021.11.008\">&#x27E8;10.1016\/j.procs.2021.11.008&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1016\/j.procs.2021.11.008\" target=\"_blank\" >10.1016\/j.procs.2021.11.008<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-03175837\/file\/Lagos_2021%289%29.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-03175837\/file\/Lagos_2021%289%29.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-03175837\/file\/Lagos_2021%289%29.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-03175837v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Book sections<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Nicolas Isoart, Jean-Charles R\u00e9gin<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-03333967v1\" target=\"_blank\" >A k-opt based constraint for the TSP<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>the 27th International Conference on Principles and Practice of Constraint Programming<\/i>, In press<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\"> <a href=\"https:\/\/hal.science\/hal-03333967v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Nicolas Isoart, Jean-Charles R\u00e9gin<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-03333969v1\" target=\"_blank\" >A linear time algorithm for the k-cutset constraint<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>the 27th International Conference on Principles and Practice of Constraint Programming<\/i>, In press<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\"> <a href=\"https:\/\/hal.science\/hal-03333969v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/dd>\n<\/dl>\n<p class='SousRubrique'>Reports<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Ali Al Zoobi, David Coudert, Nicolas Nisse<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-03187276v2\" target=\"_blank\" >On the complexity of finding $k$ shortest dissimilar paths in a graph<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">[Research Report] Inria; CNRS; I3S; Universit\u00e9 C\u00f4te d\u2019Azur. 2021, pp.9<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.science\/hal-03187276\/file\/On_the_k_top_shortest_paths_with_dissimilarity_constraints-v2.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-03187276\/file\/On_the_k_top_shortest_paths_with_dissimilarity_constraints-v2.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-03187276\/file\/On_the_k_top_shortest_paths_with_dissimilarity_constraints-v2.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-03187276v2\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">David Coudert, Ali Al Zoobi, Arthur Finkelstein<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-03264788v1\" target=\"_blank\" >On finding $k$ earliest arrival time journeys in public transit networks<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">[Research Report] Inria. 2021<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.science\/hal-03264788\/file\/Multimod_kssp_Hal.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-03264788\/file\/Multimod_kssp_Hal.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-03264788\/file\/Multimod_kssp_Hal.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-03264788v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Software<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Ali Al Zoobi, David Coudert, Nicolas Nisse<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-03438331v1\" target=\"_blank\" >k shortest simple paths<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">2021, <a target=\"_blank\" style=\"word-break: break-all;\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:4dc5b3b01ddcd9091dd5a628916638a1cefd8e0c;origin=https:\/\/gitlab.inria.fr\/dcoudert\/k-shortest-simple-paths\/;visit=swh:1:snp:f0cc7e5f3ec6200d39061db55146a7ab340fee95;anchor=swh:1:rev:124c172d617e485a6b3cd5dc6db7768d86a3a5af\">&#x27E8;swh:1:dir:4dc5b3b01ddcd9091dd5a628916638a1cefd8e0c;origin=https:\/\/gitlab.inria.fr\/dcoudert\/k-shortest-simple-paths\/;visit=swh:1:snp:f0cc7e5f3ec6200d39061db55146a7ab340fee95;anchor=swh:1:rev:124c172d617e485a6b3cd5dc6db7768d86a3a5af&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\"> <a href=\"https:\/\/inria.hal.science\/hal-03438331v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">David Coudert, Andr\u00e9 Nusser, Laurent Viennot<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-03438325v1\" target=\"_blank\" >Hyperbolicity<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">2021, <a target=\"_blank\" style=\"word-break: break-all;\" href=\"https:\/\/archive.softwareheritage.org\/browse\/swh:1:dir:719d653945a6c7958028c8b5aab00960fb52d551;origin=https:\/\/gitlab.inria.fr\/dcoudert\/hyperbolicity\/;visit=swh:1:snp:0d13e52e2c1d0b4e50153af070155c216f148d3e;anchor=swh:1:rev:4f9c8ce6eed890ed5bad1f56ff550577b4819bad\">&#x27E8;swh:1:dir:719d653945a6c7958028c8b5aab00960fb52d551;origin=https:\/\/gitlab.inria.fr\/dcoudert\/hyperbolicity\/;visit=swh:1:snp:0d13e52e2c1d0b4e50153af070155c216f148d3e;anchor=swh:1:rev:4f9c8ce6eed890ed5bad1f56ff550577b4819bad&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\"> <a href=\"https:\/\/inria.hal.science\/hal-03438325v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/dd>\n<\/dl>\n<p class='Rubrique'>2020<\/p>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Ali Al Zoobi, David Coudert, Nicolas Nisse<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-02835953v1\" target=\"_blank\" >Compromis espace-temps pour le probl\u00e8me de k plus courts chemins simples<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>ALGOTEL 2020 \u2013 22\u00e8mes Rencontres Francophones sur les Aspects Algorithmiques des T\u00e9l\u00e9communications<\/i>, Sep 2020, Lyon, France. pp.4<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-02835953\/file\/algotel-FinalVersion.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-02835953\/file\/algotel-FinalVersion.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-02835953\/file\/algotel-FinalVersion.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-02835953v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Ali Al Zoobi, David Coudert, Nicolas Nisse<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-02865918v1\" target=\"_blank\" >Space and Time Trade-Off for the k Shortest Simple Paths Problem<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>SEA 2020 &#8211; 18th International Symposium on Experimental Algorithms<\/i>, Jun 2020, Catania, Italy. pp.13, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.4230\/LIPIcs.SEA.2020.18\">&#x27E8;10.4230\/LIPIcs.SEA.2020.18&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.4230\/LIPIcs.SEA.2020.18\" target=\"_blank\" >10.4230\/LIPIcs.SEA.2020.18<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-02865918\/file\/LIPIcs-SEA-2020-18.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-02865918\/file\/LIPIcs-SEA-2020-18.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-02865918\/file\/LIPIcs-SEA-2020-18.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-02865918v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Guillaume Ducoffe, Michel Habib, Laurent Viennot<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-02340382v1\" target=\"_blank\" >Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>SODA 2020 &#8211; ACM-SIAM Symposium on Discrete Algorithms<\/i>, Jan 2020, Salt Lake City, United States<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-02340382\/file\/vc-diameter.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-02340382\/file\/vc-diameter.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-02340382\/file\/vc-diameter.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-02340382v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Book sections<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Nicolas Isoart, Jean-Charles R\u00e9gin<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-02969580v1\" target=\"_blank\" >Parallelization of TSP Solving in CP<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>International Conference on Principles and Practice of Constraint Programming<\/i>, pp.410-426, 2020, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-58475-7_24\">&#x27E8;10.1007\/978-3-030-58475-7_24&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/978-3-030-58475-7_24\" target=\"_blank\" >10.1007\/978-3-030-58475-7_24<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\"> <a href=\"https:\/\/hal.science\/hal-02969580v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/dd>\n<\/dl>\n<p class='SousRubrique'>Reports<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Ali Al Zoobi, David Coudert, Nicolas Nisse<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-02465317v1\" target=\"_blank\" >Space and time trade-off for the k shortest simple paths problem<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">[Research Report] Inria &#038; Universit\u00e9 Cote d&#8217;Azur, CNRS, I3S, Sophia Antipolis, France. 2020<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.science\/hal-02465317\/file\/HAL_kSSP.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-02465317\/file\/HAL_kSSP.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-02465317\/file\/HAL_kSSP.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-02465317v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, Simon Nivelle<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-03010346v1\" target=\"_blank\" >Treelength of Series-parallel graphs<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">[Research Report] Inria &#038; Universit\u00e9 Cote d&#8217;Azur, CNRS, I3S, Sophia Antipolis, France. 2020<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.science\/hal-03010346\/file\/Lagos_2021.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-03010346\/file\/Lagos_2021.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-03010346\/file\/Lagos_2021.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-03010346v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Preprints, Working Papers, &#8230;<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Samvel Balassanian Dersarkissian, Arnaud Malapert<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-02494158v1\" target=\"_blank\" >Flexibilit\u00e9 et Portabilit\u00e9 pour Embarrassingly Parallel Search<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">2020<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.science\/hal-02494158\/file\/preprint_draft_10971-1.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-02494158\/file\/preprint_draft_10971-1.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-02494158\/file\/preprint_draft_10971-1.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-02494158v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='Rubrique'>2019<\/p>\n<p class='SousRubrique'>Conference papers<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Guillaume Ducoffe, Michel Habib, Laurent Viennot<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-03373614v1\" target=\"_blank\" >Fast Diameter Computation within Split Graphs<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>COCOA 2019 &#8211; 13th Annual International Conference on Combinatorial Optimization and Applications<\/i>, Dec 2019, Xiamen, China<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\"> <a href=\"https:\/\/arxiv.org\/pdf\/1910.03438\"  target=\"_blank\"><img decoding=\"async\" alt=\"https:\/\/arxiv.org\/pdf\/1910.03438\" src=\"https:\/\/haltools.inria.fr\/images\/arxiv.gif\" border=\"0\" title=\"arXiv PDF\" width=\"16px\" height=\"16px\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-03373614v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Nicolas Isoart, Jean-Charles R\u00e9gin<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-02160046v1\" target=\"_blank\" >Introduction de contraintes structurelles pour la r\u00e9solution du probl\u00e8me du voyageur de commerce<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>JFPC<\/i>, Jun 2019, Albi, France<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.science\/hal-02160046\/file\/jfpc.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-02160046\/file\/jfpc.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-02160046\/file\/jfpc.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-02160046v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Adrian Kosowski, Przemys\u0142aw Uzna\u0144ski, Laurent Viennot<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-02429930v1\" target=\"_blank\" >Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>PODC &#8217;19 &#8211; ACM Symposium on Principles of Distributed Computing<\/i>, Jul 2019, Toronto, Canada. pp.272-279, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1145\/3293611.3331625\">&#x27E8;10.1145\/3293611.3331625&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1145\/3293611.3331625\" target=\"_blank\" >10.1145\/3293611.3331625<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au bibtex<\/dt>\n<dd class=\"ValeurRes LienBibtex\"> <a href=\"https:\/\/arxiv.org\/pdf\/1902.07055\"  target=\"_blank\"><img decoding=\"async\" alt=\"https:\/\/arxiv.org\/pdf\/1902.07055\" src=\"https:\/\/haltools.inria.fr\/images\/arxiv.gif\" border=\"0\" title=\"arXiv PDF\" width=\"16px\" height=\"16px\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-02429930v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Duc-Minh Phan, Laurent Viennot<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/inria.hal.science\/hal-02161283v1\" target=\"_blank\" >Fast Public Transit Routing with Unrestricted Walking through Hub Labeling<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Special Event on Analysis of Experimental Algorithms (SEA2)<\/i>, Jun 2019, Kalamata, Greece<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/inria.hal.science\/hal-02161283\/file\/arxiv.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/inria.hal.science\/hal-02161283\/file\/arxiv.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/inria.hal.science\/hal-02161283\/file\/arxiv.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/inria.hal.science\/hal-02161283v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Book sections<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Nicolas Isoart, Jean-Charles R\u00e9gin<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-02456686v1\" target=\"_blank\" >Integration of Structural Constraints into TSP Models<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\"><i>Principles and Practice of Constraint Programming<\/i>, pp.284-299, 2019, <a target=\"_blank\" href=\"https:\/\/dx.doi.org\/10.1007\/978-3-030-30048-7_17\">&#x27E8;10.1007\/978-3-030-30048-7_17&#x27E9;<\/a><\/dd>\n<dt class=\"ChampRes\">DOI<\/dt>\n<dd class=\"ValeurRes DOI\">DOI : <a href=\"\/\/dx.doi.org\/10.1007\/978-3-030-30048-7_17\" target=\"_blank\" >10.1007\/978-3-030-30048-7_17<\/a><\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.science\/hal-02456686\/file\/Integration_of_structural_constraints_into_TSP_models.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-02456686\/file\/Integration_of_structural_constraints_into_TSP_models.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-02456686\/file\/Integration_of_structural_constraints_into_TSP_models.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-02456686v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl>\n<p class='SousRubrique'>Reports<\/p>\n<dl class='NoticeRes'>\n<dt class=\"ChampRes\">auteur<\/dt>\n<dd class=\"ValeurRes Auteurs\">Nicolas Isoart, Jean-Charles R\u00e9gin<\/dd>\n<dt class=\"ChampRes\">titre<\/dt>\n<dd class=\"ValeurRes Titre\"><a href=\"https:\/\/hal.science\/hal-02165374v1\" target=\"_blank\" >An adaptive CP method for TSP solving<\/a><\/dd>\n<dt class=\"ChampRes\">article<\/dt>\n<dd class=\"ValeurRes article\">[Research Report] Universit\u00e9 C\u00f4te d&#8217;Azur. 2019<\/dd>\n<dt class=\"ChampRes\">Acc\u00e8s au texte int\u00e9gral et bibtex<\/dt>\n<dd class=\"ValeurRes Fichier_joint\"> <a href=\"https:\/\/hal.science\/hal-02165374\/file\/LagrangianFilter.pdf\"  target=\"_blank\"> <img decoding=\"async\" alt=\"https:\/\/hal.science\/hal-02165374\/file\/LagrangianFilter.pdf\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_pdf.png\" border=\"0\" title=\"https:\/\/hal.science\/hal-02165374\/file\/LagrangianFilter.pdf\" \/><\/a> <span class=\"LienBibtexACoteFulltext\"><a href=\"https:\/\/hal.science\/hal-02165374v1\/bibtex\" target=\"_self\"> <img decoding=\"async\" alt=\"BibTex\" src=\"https:\/\/haltools.inria.fr\/images\/Haltools_bibtex3.png\" border=\"0\"  title=\"BibTex\" \/><\/a> <\/span><\/dd>\n<\/dl><\/div>\n<p> <\/body> <\/html> <\/p>\n","protected":false},"excerpt":{"rendered":"<p>Publications HAL du projet ANR. 17-CE22-0016 2023 \u2026<\/p>\n<p> <a class=\"continue-reading-link\" href=\"https:\/\/project.inria.fr\/multimod\/publications\/\"><span>Continue reading<\/span><i class=\"crycon-right-dir\"><\/i><\/a> <\/p>\n","protected":false},"author":491,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-73","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/pages\/73","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/users\/491"}],"replies":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/comments?post=73"}],"version-history":[{"count":9,"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/pages\/73\/revisions"}],"predecessor-version":[{"id":222,"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/pages\/73\/revisions\/222"}],"wp:attachment":[{"href":"https:\/\/project.inria.fr\/multimod\/wp-json\/wp\/v2\/media?parent=73"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}