Colouring H-free graphs of bounded diameter B Martin, D Paulusma, S Smith, P Rossmanith, P Heggernes, JP Katoen
16 2019 Acyclic, star and injective colouring: a complexity picture for H-free graphs J Bok, N Jedlicková, B Martin, P Ochem, D Paulusma, S Smith
arXiv preprint arXiv:2008.09415, 2020
15 2020 Acyclic, star, and injective colouring: bounding the diameter C Brause, P Golovach, B Martin, P Ochem, D Paulusma, S Smith
The Electronic Journal of Combinatorics, P2. 43-P2. 43, 2022
13 2022 Complexity framework for forbidden subgraphs I: The framework M Johnson, B Martin, JJ Oostveen, S Pandey, D Paulusma, S Smith, ...
arXiv preprint arXiv:2211.12887, 2022
9 2022 Acyclic, star, and injective colouring: Bounding the diameter C Brause, P Golovach, B Martin, D Paulusma, S Smith
Graph-Theoretic Concepts in Computer Science: 47th International Workshop …, 2021
9 2021 Injective Colouring for H -Free Graphs J Bok, N Jedličková, B Martin, D Paulusma, S Smith
Computer Science–Theory and Applications: 16th International Computer …, 2021
9 2021 Disjoint paths and connected subgraphs for H-free graphs W Kern, B Martin, D Paulusma, S Smith, EJ van Leeuwen
Theoretical Computer Science 898, 59-68, 2022
8 2022 Colouring graphs of bounded diameter in the absence of small cycles B Martin, D Paulusma, S Smith
Algorithms and Complexity: 12th International Conference, CIAC 2021, Virtual …, 2021
8 2021 Partitioning H-free graphs of bounded diameter C Brause, P Golovach, B Martin, D Paulusma, S Smith
Theoretical Computer Science 930, 37-52, 2022
7 2022 Colouring graphs of bounded diameter in the absence of small cycles B Martin, D Paulusma, S Smith
Discrete Applied Mathematics 314, 150-161, 2022
7 2022 Complexity framework for forbidden subgraphs IV: The Steiner Forest problem HL Bodlaender, M Johnson, B Martin, JJ Oostveen, S Pandey, ...
arXiv preprint arXiv:2305.01613, 2023
5 2023 Few induced disjoint paths for H-free graphs B Martin, D Paulusma, S Smith, EJ van Leeuwen
Theoretical Computer Science 939, 182-193, 2023
5 2023 Hard problems that quickly become very easy B Martin, D Paulusma, S Smith
Information Processing Letters 174, 106213, 2022
5 2022 Complexity framework for forbidden subgraphs II: When hardness is not preserved under edge subdivision B Martin, S Pandey, D Paulusma, M Siggers, S Smith, EJ van Leeuwen
arXiv preprint arXiv:2211.14214, 2022
4 2022 Induced Disjoint Paths and Connected Subgraphs for H -Free Graphs B Martin, D Paulusma, S Smith, EJ van Leeuwen
International Workshop on Graph-Theoretic Concepts in Computer Science, 398-411, 2022
3 2022 Complexity framework for forbidden subgraphs III: When problems are tractable on subcubic graphs M Johnson, B Martin, S Pandey, D Paulusma, S Smith, EJ Van Leeuwen
arXiv preprint arXiv:2305.01104, 2023
2 2023 QCSP on reflexive tournaments B Larose, B Martin, P Marković, D Paulusma, S Smith, S Živný
ACM Transactions on Computational Logic (TOCL) 23 (3), 1-22, 2022
2 2022 The Complexity of L (p , q )-Edge-Labelling G Berthe, B Martin, D Paulusma, S Smith
International Conference and Workshops on Algorithms and Computation, 175-186, 2022
2 2022 Finding -Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and -Free Graphs F Lucke, A Momeni, D Paulusma, S Smith
arXiv preprint arXiv:2404.11389, 2024
2024 Graph Homomorphism, Monotone Classes and Bounded Pathwidth T Eagling-Vose, B Martin, D Paulusma, M Siggers, S Smith
arXiv preprint arXiv:2403.00497, 2024
2024