Hans L. Bodlaender

1. BODLAENDER, Hans L. (urednik), ITALIANO, Giuseppe F. (urednik). Algorithms : 21st Annual European Symposium : proceedings. Berlin; Heidelberg: Springer, 2013. XVIII, 829 str., ilustr. Lecture notes in computer science, Theoretical computer science and general issues, 8125. ISBN 978-3-642-40449-8, ISBN 978-3-642-40450-4. ISSN 0302-9743. [COBISS.SI-ID 10148180]

2. LARSEN, Kim G. (urednik), BODLAENDER, Hans L. (urednik), RASKIN, Jean-François (urednik). 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017, Aalborg, Denmark. Leibniz: Schloss Dagstuhl, 2017. ISBN 978-3-95977-046-0. http://www.dagstuhl.de/dagpub/978-3-95977-046-0. [COBISS.SI-ID 1540051908]

3. BODLAENDER, Hans L. (urednik), WOEGINGER, Gerhard J. (urednik), WG 2075, 31th International Workshop on Graph-Theoretic Concepts in Computer Science, Eindhoven, The Netherlands, June 21-23, 2017. Graph-theoretic concepts in computer science : 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017 : revised selected papers. Berlin; Heidelberg: Springer, cop. 2017. XIII, 440 str., ilustr. Lecture notes in computer science, 10520. ISBN 978-3-319-68704-9, ISBN 978-3-319-68705-6. ISSN 0302-9743. http://dx.doi.org/10.1007/978-3-319-68705-6, DOI: 10.1007/978-3-319-68705-6. [COBISS.SI-ID 1539850180]

4. BODLAENDER, Hans L., BONNET, Édouard, JAFFKE, Lars, KNOP, Dušan, LIM, Paloma T., MILANIČ, Martin, ORDYNIAK, Sebastian, PANDEY, Sukanya, SUCHÝ, Ondřej. Treewidth Is NP-complete on cubic graphs. V: MISRA, Neeldhara (ur.), WAHLSTRÖM, Magnus. 18th International Symposium on Parameterized and Exact Computation : IPEC 2023, September 6–8, 2023, Amsterdam, The Netherlands. 18th International Symposium on Parameterized and Exact Computation, September 6–8, 2023, Amsterdam, The Netherland. Saarbrücken; Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. Str. 7.1-7.13, ilustr. Leibniz international proceedings in informatics (LIPIcs), 285. ISBN 978-3-95977-305-8. ISSN 1868-8969. https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.7, https://doi.org/10.4230/LIPIcs.IPEC.2023.7, DOI: 10.4230/LIPIcs.IPEC.2023.7. [COBISS.SI-ID 179249411]

5. BODLAENDER, Hans L. (urednik). 19th Scandinavian Symposium and Workshops on Algorithm Theory : SWAT 2024, June 12-14, 2024, Helsinki, Finland. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik: Dagstuhl Publishing, 2024. 1 spletni vir (1 datoteka PDF (686 str.)). LIPIcs - Leibniz International Proceedings in Informatics, vol. 294. ISBN 978-3-95977-318-8. ISSN 1868-8969. https://drops.dagstuhl.de/entities/volume/LIPIcs-volume-294, https://doi.org/10.4230/LIPIcs.SWAT.2024, https://www.dagstuhl.de/dagpub/978-3-95977-318-8, DOI: 10.4230/LIPIcs.SWAT.2024. [COBISS.SI-ID 202480643]

6. BODLAENDER, Hans L., BONNET, Édouard, JAFFKE, Lars, KNOP, Dušan, LIMA, Paloma T., MILANIČ, Martin, ORDYNIAK, Sebastian, PANDEY, Sukanya, SUCHÝ, Ondřej. Treewidth is NP-complete on cubic graphs. The Electronic journal of combinatorics. [Online ed.]. 2025, vol. 32, iss. 3, article no. p3.36, str. 1-23, ilustr. ISSN 1077-8926. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v32i3p36, Repozitorij Univerze na Primorskem - RUP, DOI: 10.37236/13205. [COBISS.SI-ID 261951235]