Daniël Paulusma

1. HARTINGER, Tatiana Romina, JOHNSON, Matthew, MILANIČ, Martin, PAULUSMA, Daniël. The price of connectivity for cycle transversals. European journal of combinatorics. 2016, vol. 58, str. 203-224. ISSN 0195-6698. http://dx.doi.org/10.1007/978-3-662-48054-0_33, Repozitorij Univerze na Primorskem - RUP, DOI: 10.1016/j.ejc.2016.06.003. [COBISS.SI-ID 1538483140]

2. BREŠAR, Boštjan, HEGGERNES, Pinar, KAMIŃSKI, Marcin, MILANIČ, Martin, PAULUSMA, Daniël, POTOČNIK, Primož, TROTIGNON, Nicolas. Preface : Algorithmic Graph Theory on the Adriatic Coast. Discrete applied mathematics. [Print ed.]. 20 Nov. 2017, vol. 231, str. 1-3, ilustr. ISSN 0166-218X. https://www.sciencedirect.com/science/article/pii/S0166218X17302445, DOI: 10.1016/j.dam.2017.05.007. [COBISS.SI-ID 272868355]

3. MILANIČ, Martin, CHIARELLI, Nina, HARTINGER, Tatiana Romina, JOHNSON, Matthew, PAULUSMA, Daniël. Minimum connected transversals in graphs : new hardness results and tractable cases using the price of connectivity. V: Workshop on Graph Classes, Optimization, and Width Parameters (GROW 2017) October 10 - 13, 2017, Toronto. [S. l.: s. n.], 2017. Str. [9-10]. [COBISS.SI-ID 1540564164]

4. CHIARELLI, Nina, HARTINGER, Tatiana Romina, JOHNSON, Matthew, MILANIČ, Martin, PAULUSMA, Daniël. Minimum connected transversals in graphs : new hardness results and tractable cases using the price of connectivity. Theoretical computer science. 2018, vol. 705, str. 75-83. ISSN 0304-3975. http://doi.org/10.1016/j.tcs.2017.09.033, DOI: 10.1016/j.tcs.2017.09.033. [COBISS.SI-ID 18180441]

5. PAULUSMA, Daniël (urednik), RIES, Bernard (urednik), 9th International Workshop, WG 2023 Fribourg, Switzerland, June 28–30, 2023. Graph-theoretic concepts in computer science : 49th International Workshop, WG 2023 Fribourg, Switzerland, June 28–30, 2023 : revised selected papers. Cham: Springer, cop. 2023. XIII, 478 str., ilustr. Lecture notes in computer science, 14093. ISBN 978-3-031-43379-5, ISBN 978-3-031-43380-1. ISSN 0302-9743. https://link.springer.com/book/10.1007/978-3-031-43380-1, DOI: 10.1007/978-3-031-43380-1. [COBISS.SI-ID 177782787]

6. DABROWSKI, Konrad K., LOZIN, Vadim V., MILANIČ, Martin, MUNARO, Andrea, PAULUSMA, Daniël, ZAMARAEV, Viktor. Graph classes closed under self-intersection. V: GOEDGEBEUR, Jan (ur.), RZĄŻEWSKI, Paweł (ur.). 52nd International Workshop on Graph-Theoretic Concepts in Computer Science : WG 2026, June 2–4, 2026, Kortrijk, Belgium. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2026. Str. 14:1–14:15, ilustr. Leibniz international proceedings in informatics, vol. 376. ISBN 978-3-95977-430-7. ISSN 1868-8969. https://drops.dagstuhl.de/storage/00lipics/lipics-vol376-wg2026/LIPIcs.WG.2026.14/LIPIcs.WG.2026.14.pdf, Repozitorij Univerze na Primorskem - RUP, DOI: 10.4230/LIPIcs.WG.2026.14. [COBISS.SI-ID 284824579]