Dabrowski, Konrad K.; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Zamaraev, Viktor On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. (English) Zbl 07793118 Eur. J. Comb. 117, Article ID 103821, 22 p. (2024). MSC: 05C70 05C69 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., Eur. J. Comb. 117, Article ID 103821, 22 p. (2024; Zbl 07793118) Full Text: DOI
Bonomo-Braberman, Flavia; Brettell, Nick; Munaro, Andrea; Paulusma, Daniël Solving problems on generalized convex graphs via mim-width. (English) Zbl 07783118 J. Comput. Syst. Sci. 140, Article ID 103493, 15 p. (2024). MSC: 68-XX PDFBibTeX XMLCite \textit{F. Bonomo-Braberman} et al., J. Comput. Syst. Sci. 140, Article ID 103493, 15 p. (2024; Zbl 07783118) Full Text: DOI
Paulusma, Daniël (ed.); Ries, Bernard (ed.) Graph-theoretic concepts in computer science. 49th international workshop, WG 2023, Fribourg, Switzerland, June 28–30, 2023. Revised selected papers. (English) Zbl 07768553 Lecture Notes in Computer Science 14093. Cham: Springer (ISBN 978-3-031-43379-5/pbk; 978-3-031-43380-1/ebook). xiii, 478 p. (2023). MSC: 68-06 68R10 00B25 PDFBibTeX XMLCite \textit{D. Paulusma} (ed.) and \textit{B. Ries} (ed.), Graph-theoretic concepts in computer science. 49th international workshop, WG 2023, Fribourg, Switzerland, June 28--30, 2023. Revised selected papers. Cham: Springer (2023; Zbl 07768553) Full Text: DOI
Berthe, Gaétan; Martin, Barnaby; Paulusma, Daniël; Smith, Siani The complexity of \(L(p, q)\)-edge-labelling. (English) Zbl 07767695 Algorithmica 85, No. 11, 3406-3429 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{G. Berthe} et al., Algorithmica 85, No. 11, 3406--3429 (2023; Zbl 07767695) Full Text: DOI
Dabrowski, Konrad K.; Masařík, Tomáš; Novotná, Jana; Paulusma, Daniël; Rzążewski, Paweł Clique-width: harnessing the power of atoms. (English) Zbl 1526.05119 J. Graph Theory 104, No. 4, 769-810 (2023). MSC: 05C75 05C69 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., J. Graph Theory 104, No. 4, 769--810 (2023; Zbl 1526.05119) Full Text: DOI OA License
Lucke, Felicia; Paulusma, Daniël; Ries, Bernard Finding matching cuts in \(H\)-free graphs. (English) Zbl 07746799 Algorithmica 85, No. 10, 3290-3322 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{F. Lucke} et al., Algorithmica 85, No. 10, 3290--3322 (2023; Zbl 07746799) Full Text: DOI arXiv OA License
Martin, Barnaby; Paulusma, Daniël; Smith, Siani; van Leeuwen, Erik Jan Induced disjoint paths and connected subgraphs for \(H\)-free graphs. (English) Zbl 07742465 Algorithmica 85, No. 9, 2580-2604 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{B. Martin} et al., Algorithmica 85, No. 9, 2580--2604 (2023; Zbl 07742465) Full Text: DOI OA License
Martin, Barnaby; Paulusma, Daniël; Smith, Siani; van Leeuwen, Erik Jan Few induced disjoint paths for \(H\)-free graphs. (English) Zbl 1527.05104 Theor. Comput. Sci. 939, 182-193 (2023). Reviewer: Marko Radovanović (Beograd) MSC: 05C38 68Q25 PDFBibTeX XMLCite \textit{B. Martin} et al., Theor. Comput. Sci. 939, 182--193 (2023; Zbl 1527.05104) Full Text: DOI arXiv
Le, Van Bang; Lucke, Felicia; Paulusma, Daniël; Ries, Bernard Maximizing Matching Cuts. arXiv:2312.12960 Preprint, arXiv:2312.12960 [math.CO] (2023). BibTeX Cite \textit{V. B. Le} et al., ``Maximizing Matching Cuts'', Preprint, arXiv:2312.12960 [math.CO] (2023) Full Text: arXiv OA License
Dabrowski, Konrad K.; Dross, François; Jeong, Jisu; Kanté, Mamadou Moustapha; Kwon, O-joung; Oum, Sang-il; Paulusma, Daniël Computing pivot-minors. arXiv:2311.04656 Preprint, arXiv:2311.04656 [math.CO] (2023). BibTeX Cite \textit{K. K. Dabrowski} et al., ``Computing pivot-minors'', Preprint, arXiv:2311.04656 [math.CO] (2023) Full Text: arXiv OA License
Brettell, Nick; Munaro, Andrea; Paulusma, Daniël; Yang, Shizhou Comparing Width Parameters on Graph Classes. arXiv:2308.05817 Preprint, arXiv:2308.05817 [math.CO] (2023). BibTeX Cite \textit{N. Brettell} et al., ``Comparing Width Parameters on Graph Classes'', Preprint, arXiv:2308.05817 [math.CO] (2023) Full Text: arXiv OA License
Brettell, Nick; Oostveen, Jelle J.; Pandey, Sukanya; Paulusma, Daniël; van Leeuwen, Erik Jan Computing Subset Vertex Covers in \(H\)-Free Graphs. arXiv:2307.05701 Preprint, arXiv:2307.05701 [math.CO] (2023). BibTeX Cite \textit{N. Brettell} et al., ``Computing Subset Vertex Covers in $H$-Free Graphs'', Preprint, arXiv:2307.05701 [math.CO] (2023) Full Text: arXiv OA License
Bodlaender, Hans L.; Johnson, Matthew; Martin, Barnaby; Oostveen, Jelle J.; Pandey, Sukanya; Paulusma, Daniel; Smith, Siani; van Leeuwen, Erik Jan Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. arXiv:2305.01613 Preprint, arXiv:2305.01613 [math.CO] (2023). BibTeX Cite \textit{H. L. Bodlaender} et al., ``Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem'', Preprint, arXiv:2305.01613 [math.CO] (2023) Full Text: arXiv OA License
Johnson, Matthew; Martin, Barnaby; Pandey, Sukanya; Paulusma, Daniël; Smith, Siani; van Leeuwen, Erik Jan Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs. arXiv:2305.01104 Preprint, arXiv:2305.01104 [cs.DS] (2023). BibTeX Cite \textit{M. Johnson} et al., ``Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs'', Preprint, arXiv:2305.01104 [cs.DS] (2023) Full Text: arXiv OA License
Lucke, Felicia; Paulusma, Daniël; Ries, Bernard Dichotomies for Maximum Matching Cut: \(H\)-Freeness, Bounded Diameter, Bounded Radius. arXiv:2304.01099 Preprint, arXiv:2304.01099 [math.CO] (2023). BibTeX Cite \textit{F. Lucke} et al., ``Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius'', Preprint, arXiv:2304.01099 [math.CO] (2023) Full Text: arXiv OA License
Benedek, Márton; Biró, Péter; Kern, Walter; Pálvölgyi, Dömötör; Paulusma, Daniël Partitioned Matching Games for International Kidney Exchange. arXiv:2301.13181 Preprint, arXiv:2301.13181 [cs.GT] (2023). BibTeX Cite \textit{M. Benedek} et al., ``Partitioned Matching Games for International Kidney Exchange'', Preprint, arXiv:2301.13181 [cs.GT] (2023) Full Text: arXiv OA License
Brettell, Nick; Horsfield, Jake; Munaro, Andrea; Paesani, Giacomo; Paulusma, Daniël Bounding the mim-width of hereditary graph classes. (English) Zbl 1522.05394 J. Graph Theory 99, No. 1, 117-151 (2022). MSC: 05C75 05C70 05C85 PDFBibTeX XMLCite \textit{N. Brettell} et al., J. Graph Theory 99, No. 1, 117--151 (2022; Zbl 1522.05394) Full Text: DOI arXiv
Martin, Barnaby; Paulusma, Daniël; Smith, Siani; van Leeuwen, Erik Jan Few induced disjoint paths for \(H\)-free graphs. (English) Zbl 1528.90224 Ljubić, Ivana (ed.) et al., Combinatorial optimization. 7th international symposium, ISCO 2022, virtual event, May 18–20, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13526, 89-101 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{B. Martin} et al., Lect. Notes Comput. Sci. 13526, 89--101 (2022; Zbl 1528.90224) Full Text: DOI
Paesani, Giacomo; Paulusma, Daniël; Rzążewski, Paweł Classifying subset feedback vertex set for \(H\)-free graphs. (English) Zbl 07682426 Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 412-424 (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{G. Paesani} et al., Lect. Notes Comput. Sci. 13453, 412--424 (2022; Zbl 07682426) Full Text: DOI arXiv
Martin, Barnaby; Paulusma, Daniël; Smith, Siani; van Leeuwen, Erik Jan Induced disjoint paths and connected subgraphs for \(H\)-free graphs. (English) Zbl 07682425 Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 398-411 (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{B. Martin} et al., Lect. Notes Comput. Sci. 13453, 398--411 (2022; Zbl 07682425) Full Text: DOI arXiv
Bulteau, Laurent; Dabrowski, Konrad K.; Köhler, Noleen; Ordyniak, Sebastian; Paulusma, Daniël An algorithmic framework for locally constrained homomorphisms. (English) Zbl 07682405 Bekos, Michael A. (ed.) et al., Graph-theoretic concepts in computer science. 48th international workshop, WG 2022, Tübingen, Germany, June 22–24, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13453, 114-128 (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{L. Bulteau} et al., Lect. Notes Comput. Sci. 13453, 114--128 (2022; Zbl 07682405) Full Text: DOI arXiv
Lucke, Felicia; Paulusma, Daniël; Ries, Bernard On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs. (English) Zbl 07604600 Theor. Comput. Sci. 936, 33-42 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{F. Lucke} et al., Theor. Comput. Sci. 936, 33--42 (2022; Zbl 07604600) Full Text: DOI arXiv
Paesani, Giacomo; Paulusma, Daniël; Rzążwski, Paweł Feedback vertex set and even cycle transversal for \(H\)-free graphs: finding large block graphs. (English) Zbl 1498.05275 SIAM J. Discrete Math. 36, No. 4, 2453-2472 (2022). MSC: 05D15 05C85 05C69 05B05 68Q25 PDFBibTeX XMLCite \textit{G. Paesani} et al., SIAM J. Discrete Math. 36, No. 4, 2453--2472 (2022; Zbl 1498.05275) Full Text: DOI arXiv
Martin, Barnaby; Paulusma, Daniël; Smith, Siani Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter. (English) Zbl 07579639 Theor. Comput. Sci. 931, 104-116 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{B. Martin} et al., Theor. Comput. Sci. 931, 104--116 (2022; Zbl 07579639) Full Text: DOI arXiv
Brause, Christoph; Golovach, Petr; Martin, Barnaby; Paulusma, Daniël; Smith, Siani Partitioning \(H\)-free graphs of bounded diameter. (English) Zbl 07575095 Theor. Comput. Sci. 930, 37-52 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{C. Brause} et al., Theor. Comput. Sci. 930, 37--52 (2022; Zbl 07575095) Full Text: DOI arXiv
Berthe, Gaétan; Martin, Barnaby; Paulusma, Daniël; Smith, Siani The complexity of \(L(p, q)\)-edge-labelling. (English) Zbl 07556570 Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 175-186 (2022). MSC: 68Wxx PDFBibTeX XMLCite \textit{G. Berthe} et al., Lect. Notes Comput. Sci. 13174, 175--186 (2022; Zbl 07556570) Full Text: DOI arXiv
Brause, Christoph; Golovach, Petr; Martin, Barnaby; Ochem, Pascal; Paulusma, Daniël; Smith, Siani Acyclic, star, and injective colouring: bounding the diameter. (English) Zbl 1491.05074 Electron. J. Comb. 29, No. 2, Research Paper P2.43, 29 p. (2022). MSC: 05C15 05C78 05C85 05C12 05C45 PDFBibTeX XMLCite \textit{C. Brause} et al., Electron. J. Comb. 29, No. 2, Research Paper P2.43, 29 p. (2022; Zbl 1491.05074) Full Text: DOI
Brettell, Nick; Johnson, Matthew; Paulusma, Daniël Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs. (English) Zbl 07526471 J. Comput. Syst. Sci. 128, 71-85 (2022). MSC: 68-XX PDFBibTeX XMLCite \textit{N. Brettell} et al., J. Comput. Syst. Sci. 128, 71--85 (2022; Zbl 07526471) Full Text: DOI
Martin, Barnaby; Paulusma, Daniël; Smith, Siani Colouring graphs of bounded diameter in the absence of small cycles. (English) Zbl 1489.05056 Discrete Appl. Math. 314, 150-161 (2022). MSC: 05C15 68Q25 PDFBibTeX XMLCite \textit{B. Martin} et al., Discrete Appl. Math. 314, 150--161 (2022; Zbl 1489.05056) Full Text: DOI arXiv
Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël Computing subset transversals in \(H\)-free graphs. (English) Zbl 07458786 Theor. Comput. Sci. 902, 76-92 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{N. Brettell} et al., Theor. Comput. Sci. 902, 76--92 (2022; Zbl 07458786) Full Text: DOI arXiv
Martin, Barnaby; Paulusma, Daniël; Smith, Siani Hard problems that quickly become very easy. (English) Zbl 07444827 Inf. Process. Lett. 174, Article ID 106213, 6 p. (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{B. Martin} et al., Inf. Process. Lett. 174, Article ID 106213, 6 p. (2022; Zbl 07444827) Full Text: DOI arXiv
Kern, Walter; Martin, Barnaby; Paulusma, Daniël; Smith, Siani; van Leeuwen, Erik Jan Disjoint paths and connected subgraphs for \(H\)-free graphs. (English) Zbl 07437224 Theor. Comput. Sci. 898, 59-68 (2022). MSC: 68Q25 05C85 68R10 PDFBibTeX XMLCite \textit{W. Kern} et al., Theor. Comput. Sci. 898, 59--68 (2022; Zbl 07437224) Full Text: DOI arXiv
Golovach, Petr A.; Paulusma, Daniël; van Leeuwen, Erik Jan Induced disjoint paths in AT-free graphs. (English) Zbl 1478.68240 J. Comput. Syst. Sci. 124, 170-191 (2022). MSC: 68R10 05C38 05C85 68Q25 68Q27 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., J. Comput. Syst. Sci. 124, 170--191 (2022; Zbl 1478.68240) Full Text: DOI arXiv
Brettell, Nick; Horsfield, Jake; Munaro, Andrea; Paulusma, Daniël List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective. (English) Zbl 1476.05050 Inf. Process. Lett. 173, Article ID 106168, 7 p. (2022). MSC: 05C15 05C85 PDFBibTeX XMLCite \textit{N. Brettell} et al., Inf. Process. Lett. 173, Article ID 106168, 7 p. (2022; Zbl 1476.05050) Full Text: DOI arXiv
Feghali, Carl; Lucke, Felicia; Paulusma, Daniel; Ries, Bernard Matching Cuts in Graphs of High Girth and H-Free Graphs. arXiv:2212.12317 Preprint, arXiv:2212.12317 [math.CO] (2022). BibTeX Cite \textit{C. Feghali} et al., ``Matching Cuts in Graphs of High Girth and H-Free Graphs'', Preprint, arXiv:2212.12317 [math.CO] (2022) Full Text: arXiv OA License
Martin, Barnaby; Pandey, Sukanya; Paulusma, Daniel; Siggers, Mark; Smith, Siani; van Leeuwen, Erik Jan Complexity Framework for Forbidden Subgraphs II: When Hardness Is Not Preserved under Edge Subdivision. arXiv:2211.14214 Preprint, arXiv:2211.14214 [cs.DM] (2022). BibTeX Cite \textit{B. Martin} et al., ``Complexity Framework for Forbidden Subgraphs II: When Hardness Is Not Preserved under Edge Subdivision'', Preprint, arXiv:2211.14214 [cs.DM] (2022) Full Text: arXiv OA License
Johnson, Matthew; Martin, Barnaby; Oostveen, Jelle J.; Pandey, Sukanya; Paulusma, Daniël; Smith, Siani; van Leeuwen, Erik Jan Complexity Framework For Forbidden Subgraphs I: The Framework. arXiv:2211.12887 Preprint, arXiv:2211.12887 [math.CO] (2022). BibTeX Cite \textit{M. Johnson} et al., ``Complexity Framework For Forbidden Subgraphs I: The Framework'', Preprint, arXiv:2211.12887 [math.CO] (2022) Full Text: arXiv OA License
Brause, Christoph; Golovach, Petr; Martin, Barnaby; Paulusma, Daniël; Smith, Siani Partitioning \(H\)-free graphs of bounded diameter. (English) Zbl 07788594 Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 21, 14 p. (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{C. Brause} et al., LIPIcs -- Leibniz Int. Proc. Inform. 212, Article 21, 14 p. (2021; Zbl 07788594) Full Text: DOI
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. (English) Zbl 1522.05362 J. Graph Theory 98, No. 1, 81-109 (2021). MSC: 05C70 05C62 PDFBibTeX XMLCite \textit{M. Bonamy} et al., J. Graph Theory 98, No. 1, 81--109 (2021; Zbl 1522.05362) Full Text: DOI arXiv OA License
Larose, Benoît; Marković, Petar; Martin, Barnaby; Paulusma, Daniël; Smith, Siani; Żivný, Stanislav QCSP on reflexive tournaments. (English) Zbl 07740913 Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 58, 15 p. (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{B. Larose} et al., LIPIcs -- Leibniz Int. Proc. Inform. 204, Article 58, 15 p. (2021; Zbl 07740913) Full Text: DOI arXiv
Paesani, Giacomo; Paulusma, Daniël; Rzążewski, Paweł Feedback vertex set and even cycle transversal for \(H\)-free graphs: finding large block graphs. (English) Zbl 07724255 Bonchi, Filippo (ed.) et al., 46th international symposium on mathematical foundations of computer science, MFCS 2021, August 23–27, 2021, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 202, Article 82, 14 p. (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{G. Paesani} et al., LIPIcs -- Leibniz Int. Proc. Inform. 202, Article 82, 14 p. (2021; Zbl 07724255) Full Text: DOI
Martin, Barnaby; Paulusma, Daniël; Smith, Siani Colouring graphs of bounded diameter in the absence of small cycles. (English) Zbl 07667143 Calamoneri, Tiziana (ed.) et al., Algorithms and complexity. 12th international conference, CIAC 2021, virtual event, May 10–12, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12701, 367-380 (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{B. Martin} et al., Lect. Notes Comput. Sci. 12701, 367--380 (2021; Zbl 07667143) Full Text: DOI
Dabrowski, Konrad K. (ed.); Gadouleau, Maximilien (ed.); Georgiou, Nicholas (ed.); Johnson, Matthew (ed.); Mertzios, George B. (ed.); Paulusma, Daniël (ed.) Preface. (English) Zbl 07620416 Dabrowski, Konrad K. (ed.) et al., Surveys in combinatorics 2021. Based on plenary lectures given at the 28th British combinatorial conference, hosted online by Durham University, Durham, UK, July 5–9, 2021. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 470, vii-viii (2021). MSC: 00Bxx PDFBibTeX XMLCite \textit{K. K. Dabrowski} (ed.) et al., Lond. Math. Soc. Lect. Note Ser. 470, vii-viii (2021; Zbl 07620416) Full Text: Link
Brause, Christoph; Golovach, Petr; Martin, Barnaby; Paulusma, Daniël; Smith, Siani Acyclic, star, and injective colouring: bounding the diameter. (English) Zbl 07538588 Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 336-348 (2021). MSC: 68R10 PDFBibTeX XMLCite \textit{C. Brause} et al., Lect. Notes Comput. Sci. 12911, 336--348 (2021; Zbl 07538588) Full Text: DOI arXiv
Brettell, Nick; Johnson, Matthew; Paulusma, Daniël Computing weighted subset transversals in \(H\)-free graphs. (English) Zbl 07498680 Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 229-242 (2021). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{N. Brettell} et al., Lect. Notes Comput. Sci. 12808, 229--242 (2021; Zbl 07498680) Full Text: DOI
Bonomo-Braberman, Flavia; Brettell, Nick; Munaro, Andrea; Paulusma, Daniël Solving problems on generalized convex graphs via mim-width. (English) Zbl 07498678 Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 200-214 (2021). MSC: 68P05 68Wxx PDFBibTeX XMLCite \textit{F. Bonomo-Braberman} et al., Lect. Notes Comput. Sci. 12808, 200--214 (2021; Zbl 07498678) Full Text: DOI arXiv
Kern, Walter; Martin, Barnaby; Paulusma, Daniël; Smith, Siani; van Leeuwen, Erik Jan Disjoint paths and connected subgraphs for \(H\)-free graphs. (English) Zbl 07495038 Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 414-427 (2021). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{W. Kern} et al., Lect. Notes Comput. Sci. 12757, 414--427 (2021; Zbl 07495038) Full Text: DOI
Bok, Jan; Jedličková, Nikola; Martin, Barnaby; Paulusma, Daniël; Smith, Siani Injective colouring for H-free graphs. (English) Zbl 07493522 Santhanam, Rahul (ed.) et al., Computer science – theory and applications. 16th international computer science symposium in Russia, CSR 2021, Sochi, Russia, June 28 – July 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12730, 18-30 (2021). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Bok} et al., Lect. Notes Comput. Sci. 12730, 18--30 (2021; Zbl 07493522) Full Text: DOI
Johnson, Matthew; Paulusma, Daniël; van Leeuwen, Erik Jan What graphs are \(2\)-dot product graphs? (English) Zbl 07467603 Int. J. Comput. Geom. Appl. 31, No. 1, 1-16 (2021). MSC: 68U05 PDFBibTeX XMLCite \textit{M. Johnson} et al., Int. J. Comput. Geom. Appl. 31, No. 1, 1--16 (2021; Zbl 07467603) Full Text: DOI
Dabrowski, Konrad K.; Dross, François; Jeong, Jisu; Kanté, Mamadou M.; Kwon, O-joung; Oum, Sang-il; Paulusma, Daniël Tree pivot-minors and linear rank-width. (English) Zbl 1480.05119 SIAM J. Discrete Math. 35, No. 4, 2922-2945 (2021). MSC: 05C83 05C05 05C75 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., SIAM J. Discrete Math. 35, No. 4, 2922--2945 (2021; Zbl 1480.05119) Full Text: DOI arXiv
Hochstättler, Winfried; Hurink, Johann; Manthey, Bodo; Paulusma, Daniel; Peis, Britta; Still, Georg In memoriam Walter Kern. (English) Zbl 1473.01064 Discrete Appl. Math. 303, 2-3 (2021). MSC: 01A70 PDFBibTeX XMLCite \textit{W. Hochstättler} et al., Discrete Appl. Math. 303, 2--3 (2021; Zbl 1473.01064) Full Text: DOI
Dabrowski, Konrad K. (ed.); Gadouleau, Maximilien (ed.); Georgiou, Nicholas (ed.); Johnson, Matthew (ed.); Mertzios, George B. (ed.); Paulusma, Daniël (ed.) Surveys in combinatorics 2021. Based on plenary lectures given at the 28th British combinatorial conference, hosted online by Durham University, Durham, UK, July 5–9, 2021. (English) Zbl 1497.05001 London Mathematical Society Lecture Note Series 470. Cambridge: Cambridge University Press (ISBN 978-1-00-901888-3/pbk; 978-1-00-903621-4/ebook). viii, 369 p. (2021). MSC: 05-06 00B25 PDFBibTeX XMLCite \textit{K. K. Dabrowski} (ed.) et al., Surveys in combinatorics 2021. Based on plenary lectures given at the 28th British combinatorial conference, hosted online by Durham University, Durham, UK, July 5--9, 2021. Cambridge: Cambridge University Press (2021; Zbl 1497.05001) Full Text: DOI
Bodlaender, Hans L.; Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; van Leeuwen, Erik Jan Steiner trees for hereditary graph classes: a treewidth perspective. (English) Zbl 1477.68203 Theor. Comput. Sci. 867, 30-39 (2021). Reviewer: Charles J. Colbourn (Tempe) MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Theor. Comput. Sci. 867, 30--39 (2021; Zbl 1477.68203) Full Text: DOI arXiv
Bonamy, Marthe; Bousquet, Nicolas; Dabrowski, Konrad Kazimierz; Johnson, Matthew; Paulusma, Daniël; Pierron, Théo Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy. (English) Zbl 1512.68195 Algorithmica 83, No. 3, 822-852 (2021). MSC: 68R10 05C60 05C69 68Q25 PDFBibTeX XMLCite \textit{M. Bonamy} et al., Algorithmica 83, No. 3, 822--852 (2021; Zbl 1512.68195) Full Text: DOI arXiv
Kern, Walter; Paulusma, Daniël Contracting to a longest path in \(H\)-free graphs. (English) Zbl 07765380 Cao, Yixin (ed.) et al., 31st international symposium on algorithms and computation, ISAAC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 181, Article 22, 18 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{W. Kern} and \textit{D. Paulusma}, LIPIcs -- Leibniz Int. Proc. Inform. 181, Article 22, 18 p. (2020; Zbl 07765380) Full Text: DOI arXiv
Brettell, Nick; Horsfield, Jake; Munaro, Andrea; Paesani, Giacomo; Paulusma, Daniël Bounding the mim-width of hereditary graph classes. (English) Zbl 07764097 Cao, Yixin (ed.) et al., 15th international symposium on parameterized and exact computation, IPEC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 180, Article 6, 18 p. (2020). MSC: 68Q25 68Q27 68Wxx PDFBibTeX XMLCite \textit{N. Brettell} et al., LIPIcs -- Leibniz Int. Proc. Inform. 180, Article 6, 18 p. (2020; Zbl 07764097) Full Text: DOI
Bok, Jan; Jedličková, Nikola; Martin, Barnaby; Paulusma, Daniël; Smith, Siani Acyclic, star and injective colouring: a complexity picture for \(H\)-free graphs. (English) Zbl 07651161 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 22, 22 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{J. Bok} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 22, 22 p. (2020; Zbl 07651161) Full Text: DOI arXiv
Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël Computing subset transversals in \(H\)-free graphs. (English) Zbl 07636205 Adler, Isolde (ed.) et al., Graph-theoretic concepts in computer science. 46th international workshop, WG 2020, Leeds, UK, June 24–26, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12301, 187-199 (2020). MSC: 68R10 PDFBibTeX XMLCite \textit{N. Brettell} et al., Lect. Notes Comput. Sci. 12301, 187--199 (2020; Zbl 07636205) Full Text: DOI
Dabrowski, Konrad K.; Masařík, Tomáš; Novotná, Jana; Paulusma, Daniël; Rzążewski, Paweł Clique-width: harnessing the power of atoms. (English) Zbl 07636200 Adler, Isolde (ed.) et al., Graph-theoretic concepts in computer science. 46th international workshop, WG 2020, Leeds, UK, June 24–26, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12301, 119-133 (2020). MSC: 68R10 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., Lect. Notes Comput. Sci. 12301, 119--133 (2020; Zbl 07636200) Full Text: DOI arXiv
Bodlaender, Hans L.; Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; van Leeuwen, Erik Jan Steiner trees for hereditary graph classes. (English) Zbl 07600807 Kohayakawa, Yoshiharu (ed.) et al., Latin 2020: theoretical informatics. 14th Latin American symposium, São Paulo, Brazil, January 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12118, 613-624 (2020). MSC: 68Qxx 68Rxx 68Wxx PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Lect. Notes Comput. Sci. 12118, 613--624 (2020; Zbl 07600807) Full Text: DOI
Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Rzążewski, Paweł On cycle transversals and their connected variants in the absence of a small linear forest. (English) Zbl 1459.05332 Algorithmica 82, No. 10, 2841-2866 (2020). MSC: 05D15 05C38 68Q17 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., Algorithmica 82, No. 10, 2841--2866 (2020; Zbl 1459.05332) Full Text: DOI
Martin, Barnaby; Paulusma, Daniël; van Leeuwen, Erik Jan Disconnected cuts in claw-free graphs. (English) Zbl 1450.05073 J. Comput. Syst. Sci. 113, 60-75 (2020). MSC: 05C76 05C70 PDFBibTeX XMLCite \textit{B. Martin} et al., J. Comput. Syst. Sci. 113, 60--75 (2020; Zbl 1450.05073) Full Text: DOI Link
Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Lozin, Vadim V.; Paulusma, Daniël; Zamaraev, Viktor Clique-width for graph classes closed under complementation. (English) Zbl 1441.05167 SIAM J. Discrete Math. 34, No. 2, 1107-1147 (2020). MSC: 05C69 05C78 05C75 PDFBibTeX XMLCite \textit{A. Blanché} et al., SIAM J. Discrete Math. 34, No. 2, 1107--1147 (2020; Zbl 1441.05167) Full Text: DOI arXiv
Klimošová, Tereza; Malík, Josef; Masařík, Tomáš; Novotná, Jana; Paulusma, Daniël; Slívová, Veronika Colouring \((P_r + P_s)\)-free graphs. (English) Zbl 1441.68095 Algorithmica 82, No. 7, 1833-1858 (2020). MSC: 68Q25 05C15 PDFBibTeX XMLCite \textit{T. Klimošová} et al., Algorithmica 82, No. 7, 1833--1858 (2020; Zbl 1441.68095) Full Text: DOI arXiv
Hof, Frits; Kern, Walter; Kurz, Sascha; Pashkovich, Kanstantsin; Paulusma, Daniël Simple games versus weighted voting games: bounding the critical threshold value. (English) Zbl 1436.91060 Soc. Choice Welfare 54, No. 4, 609-621 (2020). MSC: 91B12 91A12 91A68 PDFBibTeX XMLCite \textit{F. Hof} et al., Soc. Choice Welfare 54, No. 4, 609--621 (2020; Zbl 1436.91060) Full Text: DOI arXiv Link
Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël Connected vertex cover for \((sP_1+P_5)\)-free graphs. (English) Zbl 1436.68245 Algorithmica 82, No. 1, 20-40 (2020). MSC: 68R10 05C70 05C85 68W40 PDFBibTeX XMLCite \textit{M. Johnson} et al., Algorithmica 82, No. 1, 20--40 (2020; Zbl 1436.68245) Full Text: DOI Link
Dabrowski, Konrad K.; Lozin, Vadim V.; Paulusma, Daniël Clique-width and well-quasi-ordering of triangle-free graph classes. (English) Zbl 1442.05184 J. Comput. Syst. Sci. 108, 64-91 (2020). MSC: 05C75 05C70 05C78 05C85 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., J. Comput. Syst. Sci. 108, 64--91 (2020; Zbl 1442.05184) Full Text: DOI
Brettell, Nick; Johnson, Matthew; Paulusma, Daniel Computing Weighted Subset Transversals in \(H\)-Free Graphs. arXiv:2007.14514 Preprint, arXiv:2007.14514 [cs.DS] (2020). BibTeX Cite \textit{N. Brettell} et al., ``Computing Weighted Subset Transversals in $H$-Free Graphs'', Preprint, arXiv:2007.14514 [cs.DS] (2020) Full Text: arXiv OA License
Brettell, Nick; Horsfield, Jake; Paulusma, Daniel Colouring \((sP_1+P_5)\)-Free Graphs: a Mim-Width Perspective. arXiv:2004.05022 Preprint, arXiv:2004.05022 [cs.DS] (2020). BibTeX Cite \textit{N. Brettell} et al., ``Colouring $(sP_1+P_5)$-Free Graphs: a Mim-Width Perspective'', Preprint, arXiv:2004.05022 [cs.DS] (2020) Full Text: arXiv OA License
Martin, Barnaby; Paulusma, Daniël; Smith, Siani Colouring \(H\)-free graphs of bounded diameter. (English) Zbl 07561658 Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 14, 14 p. (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{B. Martin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 138, Article 14, 14 p. (2019; Zbl 07561658) Full Text: DOI
Bulteau, Laurent; Dabrowski, Konrad K.; Fertin, Guillaume; Johnson, Matthew; Paulusma, Daniël; Vialette, Stéphane Finding a small number of colourful components. (English) Zbl 1514.68204 Pisanti, Nadia (ed.) et al., 30th annual symposium on combinatorial pattern matching, CPM 2019, Pisa, Italy, June 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 128, Article 20, 14 p. (2019). MSC: 68R10 05C15 05C70 68Q17 68Q25 68Q27 PDFBibTeX XMLCite \textit{L. Bulteau} et al., LIPIcs -- Leibniz Int. Proc. Inform. 128, Article 20, 14 p. (2019; Zbl 1514.68204) Full Text: DOI arXiv
Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël Clique-width for hereditary graph classes. (English) Zbl 1476.05175 Lo, Allan (ed.) et al., Surveys in combinatorics 2019. Papers based on the 27th British combinatorial conference, University of Birmingham, Birmingham, UK, July 29 – August 2, 2019. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 456, 1-56 (2019). MSC: 05C75 05C15 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., Lond. Math. Soc. Lect. Note Ser. 456, 1--56 (2019; Zbl 1476.05175) Full Text: DOI arXiv
Dabrowski, Konrad K.; Dross, François; Johnson, Matthew; Paulusma, Daniël Filling the complexity gaps for colouring planar and bounded degree graphs. (English) Zbl 1443.05064 J. Graph Theory 92, No. 4, 377-393 (2019). MSC: 05C15 05C10 05C07 05C35 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., J. Graph Theory 92, No. 4, 377--393 (2019; Zbl 1443.05064) Full Text: DOI Link
Feghali, Carl; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël On cycle transversals and their connected variants in the absence of a small linear forest. (English) Zbl 07160840 Gąsieniec, Leszek Antoni (ed.) et al., Fundamentals of computation theory. 22nd international symposium, FCT 2019, Copenhagen, Denmark, August 12–14, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11651, 258-273 (2019). MSC: 68Qxx PDFBibTeX XMLCite \textit{C. Feghali} et al., Lect. Notes Comput. Sci. 11651, 258--273 (2019; Zbl 07160840) Full Text: DOI arXiv Link
Bonamy, Marthe; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy. (English) Zbl 1512.68196 Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 181-195 (2019). MSC: 68R10 05C60 05C69 68Q25 PDFBibTeX XMLCite \textit{M. Bonamy} et al., Lect. Notes Comput. Sci. 11646, 181--195 (2019; Zbl 1512.68196) Full Text: DOI Link
Larose, Benoît; Martin, Barnaby; Paulusma, Daniël Surjective H-colouring over reflexive digraphs. (English) Zbl 1485.68190 ACM Trans. Comput. Theory 11, No. 1, Article No. 3, 21 p. (2019). MSC: 68R10 05C20 05C60 08A70 68Q17 68Q25 PDFBibTeX XMLCite \textit{B. Larose} et al., ACM Trans. Comput. Theory 11, No. 1, Article No. 3, 21 p. (2019; Zbl 1485.68190) Full Text: DOI arXiv Link
Manea, Florin (ed.); Martin, Barnaby (ed.); Paulusma, Daniël (ed.); Primiero, Giuseppe (ed.) Computing with foresight and industry. 15th conference on computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019. Proceedings. (English) Zbl 1428.68037 Lecture Notes in Computer Science 11558. Cham: Springer (ISBN 978-3-030-22995-5/pbk; 978-3-030-22996-2/ebook). xii, 323 p. (2019). MSC: 68-06 68Qxx 00B25 PDFBibTeX XMLCite \textit{F. Manea} (ed.) et al., Computing with foresight and industry. 15th conference on computability in Europe, CiE 2019, Durham, UK, July 15--19, 2019. Proceedings. Cham: Springer (2019; Zbl 1428.68037) Full Text: DOI
Golovach, Petr A.; Johnson, Matthew; Martin, Barnaby; Paulusma, Daniël; Stewart, Anthony Surjective \(H\)-colouring: new hardness results. (English) Zbl 1425.05055 Computability 8, No. 1, 27-42 (2019). MSC: 05C15 68Q17 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Computability 8, No. 1, 27--42 (2019; Zbl 1425.05055) Full Text: DOI
Bonsma, Paul; Paulusma, Daniël Using contracted solution graphs for solving reconfiguration problems. (English) Zbl 1431.90161 Acta Inf. 56, No. 7-8, 619-648 (2019). MSC: 90C35 05C15 05C85 68W40 PDFBibTeX XMLCite \textit{P. Bonsma} and \textit{D. Paulusma}, Acta Inf. 56, No. 7--8, 619--648 (2019; Zbl 1431.90161) Full Text: DOI Link
Gaspers, Serge; Huang, Shenwei; Paulusma, Daniël Colouring square-free graphs without long induced paths. (English) Zbl 1429.68081 J. Comput. Syst. Sci. 106, 60-79 (2019). MSC: 68Q25 05C15 68Q17 PDFBibTeX XMLCite \textit{S. Gaspers} et al., J. Comput. Syst. Sci. 106, 60--79 (2019; Zbl 1429.68081) Full Text: DOI arXiv Link
Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël Hereditary graph classes: when the complexities of coloring and clique cover coincide. (English) Zbl 1417.05060 J. Graph Theory 91, No. 3, 267-289 (2019). MSC: 05C15 05C70 05C69 05C75 PDFBibTeX XMLCite \textit{A. Blanché} et al., J. Graph Theory 91, No. 3, 267--289 (2019; Zbl 1417.05060) Full Text: DOI arXiv Link
Dabrowski, Konrad K.; Huang, Shenwei; Paulusma, Daniël Bounding clique-width via perfect graphs. (English) Zbl 1428.05220 J. Comput. Syst. Sci. 104, 202-215 (2019). MSC: 05C60 05C69 05C12 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., J. Comput. Syst. Sci. 104, 202--215 (2019; Zbl 1428.05220) Full Text: DOI arXiv Link
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Lima, Paloma T.; Paulusma, Daniël Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. (English) Zbl 1421.68082 Algorithmica 81, No. 7, 2795-2828 (2019). MSC: 68Q25 05C85 68R10 68W40 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Algorithmica 81, No. 7, 2795--2828 (2019; Zbl 1421.68082) Full Text: DOI arXiv Link
Galby, Esther; Lima, Paloma T.; Paulusma, Daniël; Ries, Bernard Classifying \(k\)-edge colouring for \(H\)-free graphs. (English) Zbl 1481.05045 Inf. Process. Lett. 146, 39-43 (2019). MSC: 05C15 68Q17 PDFBibTeX XMLCite \textit{E. Galby} et al., Inf. Process. Lett. 146, 39--43 (2019; Zbl 1481.05045) Full Text: DOI arXiv
Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël Independent feedback vertex set for \(P_5\)-free graphs. (English) Zbl 1422.68105 Algorithmica 81, No. 4, 1342-1369 (2019). MSC: 68Q25 05C69 PDFBibTeX XMLCite \textit{M. Bonamy} et al., Algorithmica 81, No. 4, 1342--1369 (2019; Zbl 1422.68105) Full Text: DOI arXiv
Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard Critical vertices and edges in \(H\)-free graphs. (English) Zbl 1406.05037 Discrete Appl. Math. 257, 361-367 (2019). MSC: 05C15 PDFBibTeX XMLCite \textit{D. Paulusma} et al., Discrete Appl. Math. 257, 361--367 (2019; Zbl 1406.05037) Full Text: DOI arXiv
Paulusma, Daniël; Szeider, Stefan On the parameterized complexity of \((k,s)\)-SAT. (English) Zbl 1478.68105 Inf. Process. Lett. 143, 34-36 (2019). MSC: 68Q27 68R07 68W40 PDFBibTeX XMLCite \textit{D. Paulusma} and \textit{S. Szeider}, Inf. Process. Lett. 143, 34--36 (2019; Zbl 1478.68105) Full Text: DOI Link
Galby, Esther; Lima, Paloma T.; Paulusma, Daniël; Ries, Bernard On the Parameterized Complexity of \(k\)-Edge Colouring. arXiv:1901.01861 Preprint, arXiv:1901.01861 [cs.DM] (2019). BibTeX Cite \textit{E. Galby} et al., ``On the Parameterized Complexity of $k$-Edge Colouring'', Preprint, arXiv:1901.01861 [cs.DM] (2019) Full Text: arXiv OA License
Klimošová, Tereza; Malík, Josef; Masařík, Tomáš; Novotná, Jana; Paulusma, Daniël; Slívová, Veronika Colouring \((P_r+P_s)\)-free graphs. (English) Zbl 07561359 Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 5, 13 p. (2018). MSC: 68R10 05C15 68Q25 PDFBibTeX XMLCite \textit{T. Klimošová} et al., LIPIcs -- Leibniz Int. Proc. Inform. 123, Article 5, 13 p. (2018; Zbl 07561359) Full Text: DOI
Martin, Barnaby; Paulusma, Daniël; van Leeuwen, Erik Jan Disconnected cuts in claw-free graphs. (English) Zbl 1524.05256 Azar, Yossi (ed.) et al., 26th annual European symposium on algorithms, ESA 2018, August 20–22, 2018, Helsinki, Finland. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 112, Article 61, 14 p. (2018). MSC: 05C76 05C40 05C70 68Q25 PDFBibTeX XMLCite \textit{B. Martin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 112, Article 61, 14 p. (2018; Zbl 1524.05256) Full Text: DOI arXiv
Dabrowski, Konrad K.; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Zamaraev, Viktor On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. (English) Zbl 1516.05185 Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 63, 15 p. (2018). MSC: 05C70 05D15 05C38 05C35 05C69 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., LIPIcs -- Leibniz Int. Proc. Inform. 117, Article 63, 15 p. (2018; Zbl 1516.05185) Full Text: DOI arXiv
Larose, Benoît; Martin, Barnaby; Paulusma, Daniël Surjective H-colouring over reflexive digraphs. (English) Zbl 1485.68191 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 49, 14 p. (2018). MSC: 68R10 05C20 05C60 08A70 68Q17 68Q25 PDFBibTeX XMLCite \textit{B. Larose} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 49, 14 p. (2018; Zbl 1485.68191) Full Text: DOI
Gaspers, Serge; Huang, Shenwei; Paulusma, Daniël Colouring square-free graphs without long induced paths. (English) Zbl 1487.68127 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 35, 15 p. (2018). MSC: 68Q25 05C15 68Q17 68R10 PDFBibTeX XMLCite \textit{S. Gaspers} et al., LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 35, 15 p. (2018; Zbl 1487.68127) Full Text: DOI
Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël Connected vertex cover for \((sP_1+P_5)\)-free graphs. (English) Zbl 1436.68244 Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 44th international workshop, WG 2018, Cottbus, Germany, June 27–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11159, 279-291 (2018). MSC: 68R10 05C70 05C85 68Q25 PDFBibTeX XMLCite \textit{M. Johnson} et al., Lect. Notes Comput. Sci. 11159, 279--291 (2018; Zbl 1436.68244) Full Text: DOI arXiv Link
Dabrowski, Konrad K.; Dross, François; Jeong, Jisu; Kanté, Mamadou Moustapha; Kwon, O-joung; Oum, Sang-il; Paulusma, Daniël Computing small pivot-minors. (English) Zbl 1517.68286 Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 44th international workshop, WG 2018, Cottbus, Germany, June 27–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11159, 125-138 (2018). MSC: 68R10 05C83 05C85 68Q17 68W40 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., Lect. Notes Comput. Sci. 11159, 125--138 (2018; Zbl 1517.68286) Full Text: DOI Link
Hof, Frits; Kern, Walter; Kurz, Sascha; Paulusma, Daniël Simple games versus weighted voting games. (English) Zbl 1415.91028 Deng, Xiaotie (ed.), Algorithmic game theory. 11th international symposium, SAGT 2018, Beijing, China, September 11–14, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11059, 69-81 (2018). MSC: 91A12 91B12 PDFBibTeX XMLCite \textit{F. Hof} et al., Lect. Notes Comput. Sci. 11059, 69--81 (2018; Zbl 1415.91028) Full Text: DOI arXiv Link
Diner, Öznur Yaşar; Paulusma, Daniël; Picouleau, Christophe; Ries, Bernard Contraction and deletion blockers for perfect graphs and \(H\)-free graphs. (English) Zbl 1400.68087 Theor. Comput. Sci. 746, 49-72 (2018). MSC: 68Q25 05C17 05C75 PDFBibTeX XMLCite \textit{Ö. Y. Diner} et al., Theor. Comput. Sci. 746, 49--72 (2018; Zbl 1400.68087) Full Text: DOI arXiv
Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony Computing square roots of graphs with low maximum degree. (English) Zbl 1395.05083 Discrete Appl. Math. 248, 93-101 (2018). MSC: 05C31 05C07 05C35 PDFBibTeX XMLCite \textit{M. Cochefert} et al., Discrete Appl. Math. 248, 93--101 (2018; Zbl 1395.05083) Full Text: DOI arXiv Link
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony Finding cactus roots in polynomial time. (English) Zbl 1391.68052 Theory Comput. Syst. 62, No. 6, 1409-1426 (2018). MSC: 68Q25 05C76 68R10 PDFBibTeX XMLCite \textit{P. A. Golovach} et al., Theory Comput. Syst. 62, No. 6, 1409--1426 (2018; Zbl 1391.68052) Full Text: DOI
Dabrowski, Konrad K.; Lozin, Vadim V.; Paulusma, Daniël Well-quasi-ordering versus clique-width: new results on bigenic classes. (English) Zbl 1404.05179 Order 35, No. 2, 253-274 (2018). MSC: 05C75 PDFBibTeX XMLCite \textit{K. K. Dabrowski} et al., Order 35, No. 2, 253--274 (2018; Zbl 1404.05179) Full Text: DOI arXiv