CV Accueil - Archive ouverte HAL

	Complexity dichotomies for the Minimum F -Overlay problem Nathann Cohen , Frédéric Havet , Dorian Mazauric , Ignasi Sau , Rémi Watrigant Journal of Discrete Algorithms, 2018, 52-53, pp.133-142. ⟨10.1016/j.jda.2018.11.010⟩ Article dans une revue hal-01947563v1
	A polynomial-time algorithm for Outerplanar Diameter Improvement Nathann Cohen , Daniel Gonçalves , Eun Jung Kim , Christophe Paul , Ignasi Sau Journal of Computer and System Sciences, 2017, 89, pp.315 - 327. ⟨10.1016/j.jcss.2017.05.016⟩ Article dans une revue hal-01592242v1

	Complexity Dichotomies for the Minimum $F$-Overlay Problem Nathann Cohen , Frédéric Havet , Dorian Mazauric , Ignasi Sau , Rémi Watrigant 28th International Workshop on Combinatorial Algorithms (IWOCA), Jul 2017, Newcastle, Australia. pp.116-127, ⟨10.1007/978-3-319-78825-8_10⟩ Communication dans un congrès hal-01571229v1
	A Polynomial-Time Algorithm for Outerplanar Diameter Improvement Nathann Cohen , Daniel Gonçalves , Eun Jung Kim , Christophe Paul , Ignasi Sau CSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.123-142, ⟨10.1007/978-3-319-20297-6_9⟩ Communication dans un congrès hal-01178222v1

	Complexity Dichotomies for the Minimum F-Overlay Problem Nathann Cohen , Frédéric Havet , Dorian Mazauric , Ignasi Sau , Rémi Watrigant [Research Report] RR-9045, Inria Sophia Antipolis. 2013, pp.16 Rapport hal-01490535v1

Ignasi Sau