Daniel Paulusma
Durham University
H-index: 35
Europe-United Kingdom
Top articles of Daniel Paulusma
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal | European Journal of Combinatorics | Konrad K Dabrowski Matthew Johnson Giacomo Paesani Daniël Paulusma Viktor Zamaraev | 2024/1/13 |
Maximizing matching cuts | arXiv preprint arXiv:2312.12960 | Van Bang Le Felicia Lucke Daniël Paulusma Bernard Ries | 2023/12/20 |
The complexity of Diameter on H-free graphs | Proc. WG 2024, LNCS (to appear) | Jelle J Oostveen Daniël Paulusma Erik Jan van Leeuwen | 2024 |
An Algorithmic Framework for Locally Constrained Homomorphisms | SIAM Journal on Discrete Mathematics | Laurent Bulteau Konrad K Dabrowski Noleen Köhler Sebastian Ordyniak Daniël Paulusma | 2024/6/30 |
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem | arXiv preprint arXiv:2305.01613 | Hans L Bodlaender Matthew Johnson Barnaby Martin Jelle J Oostveen Sukanya Pandey | 2023/5/2 |
Computing balanced solutions for large international kidney exchange schemes when cycle length is unbounded | arXiv preprint arXiv:2109.06788 | Márton Benedek Péter Biró Daniel Paulusma Xin Ye | 2021/9/14 |
Solving problems on generalized convex graphs via mim-width | Journal of Computer and System Sciences | Flavia Bonomo-Braberman Nick Brettell Andrea Munaro Daniël Paulusma | 2024/3/1 |
Finding -cuts in graphs of bounded diameter, graphs of bounded radius and -free graphs | Proc. WG 2024, LNCS (to appear) | Felicia Lucke Ali Momeni Daniël Paulusma Siani Smith | 2024 |
Dichotomies for Maximum Matching Cut: -freeness, bounded diameter, bounded radius | arXiv preprint arXiv:2304.01099 | Felicia Lucke Daniël Paulusma Bernard Ries | 2023/4/3 |
Few induced disjoint paths for -free graphs | Theoretical Computer Science | Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen | 2023 |
Comparing width parameters on graph classes | arXiv preprint arXiv:2308.05817 | Nick Brettell Andrea Munaro Daniël Paulusma Shizhou Yang | 2023/8/10 |
Clique-width: Harnessing the power of atoms | Journal of Graph Theory | Konrad K Dabrowski Tomáš Masařík Jana Novotná Daniël Paulusma Paweł Rzążewski | 2023/12 |
Matching cuts in graphs of high girth and H-free graphs | arXiv preprint arXiv:2212.12317 | Carl Feghali Felicia Lucke Daniël Paulusma Bernard Ries | 2022/12/23 |
Computing subset vertex covers in -free graphs | Proc. FCT 2023, LNCS | Nick Brettell Jelle J Oostveen Sukanya Pandey Daniël Paulusma Erik Jan van Leeuwen | 2023 |
Induced Disjoint Paths and Connected Subgraphs for -Free Graphs | Algorithmica | Barnaby Martin Daniël Paulusma Siani Smith Erik Jan van Leeuwen | 2023/3/11 |
Finding matching cuts in -free graphs | Algorithmica | Felicia Lucke Daniël Paulusma Bernard Ries | 2023 |
Complexity framework for forbidden subgraphs III: When problems are tractable on subcubic graphs | arXiv preprint arXiv:2305.01104 | Matthew Johnson Barnaby Martin Sukanya Pandey Daniël Paulusma Siani Smith | 2023/5/1 |
The complexity of matching games: A survey | Journal of Artificial Intelligence Research | Márton Benedek Péter Biró Matthew Johnson Daniël Paulusma Xin Ye | 2023 |
QCSP on reflexive tournaments | ACM Transactions on Computational Logic (TOCL) | Benoît Larose Barnaby Martin Petar Marković Daniël Paulusma Siani Smith | 2022/4/6 |
Complexity framework for forbidden subgraphs I: The framework | arXiv:2211.12887 | Matthew Johnson Barnaby Martin Jelle J Oostveen Sukanya Pandey Daniël Paulusma | 2022/11/23 |
