1. Graph-theoretic concepts in computer science : 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers /: 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19-21, 2019, Revised Papers. (2019) Editors: Sau, Ignasi; Thilikos, Dimitrios M Other Names: International Workshop WG, 45th Record Type: Book Extent: 1 online resource (xxi, 394 pages), illustrations (some color) View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Minors in graphs of large θr-girth. (October 2017) Authors: Chatzidimitriou, Dimitris; Raymond, Jean-Florent; Sau, Ignasi; Thilikos, Dimitrios M. Journal: European journal of combinatorics Issue: Volume 65(2017) Page Start: 106 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. On the number of labeled graphs of bounded treewidth. (June 2018) Authors: Baste, Julien; Noy, Marc; Sau, Ignasi Journal: European journal of combinatorics Issue: Volume 71(2018) Page Start: 12 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Parameterized complexity of finding a spanning tree with minimum reload cost diameter. Issue 3 (11th December 2019) Authors: Baste, Julien; Gözüpek, Didem; Paul, Christophe; Sau, Ignasi; Shalom, Mordechai; Thilikos, Dimitrios M. Journal: Networks Issue: Volume 75:Issue 3(2020) Page Start: 259 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Upper bounds on the uniquely restricted chromatic index. Issue 3 (21st November 2018) Authors: Baste, Julien; Rautenbach, Dieter; Sau, Ignasi Journal: Journal of graph theory Issue: Volume 91:Issue 3(2019) Page Start: 251 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗