CV Accueil - Archive ouverte HAL

	Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter Julien Baste , Didem Gözüpek , Ignasi Sau , Mordechai Shalom , Dimitrios M. Thilikos IPEC 2017 - 12th International Symposium on Parameterized and Exact Computation, Sep 2017, Vienna, Austria. pp.3:1--3:12, ⟨10.4230/LIPIcs.IPEC.2017.3⟩ Communication dans un congrès hal-01733767v1

	Traffic Grooming: Combinatorial Results and Practical Resolutions. Tibor Cinkler , David Coudert , Michele Flammini , Gianpiero Monaco , Luca Moscardelli Arie Koster and Xavier Muñoz. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks., XXVII, Springer, pp.63-94, 2010, EATCS Texts in Theoretical Computer Science, 978-3-642-02249-4. ⟨10.1007/978-3-642-02250-0⟩ Chapitre d'ouvrage inria-00530964v1

Ignasi Sau