Dušan Knop

1. 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]

2. 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]