Daniël Paulusma

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 219

Top Venues

Publications

Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. SWAT (2024)
Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. Eur. J. Comb. 117 (2024)
Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen
The Complexity of Diameter on H-free graphs. CoRR (2024)
Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma
Solving problems on generalized convex graphs via mim-width. J. Comput. Syst. Sci. 140 (2024)
Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
An Algorithmic Framework for Locally Constrained Homomorphisms. SIAM J. Discret. Math. 38 (2) (2024)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Classifying subset feedback vertex set for H-free graphs. Theor. Comput. Sci. 1003 (2024)
Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Siani Smith
Graph Homomorphism, Monotone Classes and Bounded Pathwidth. CiE (2024)
Felicia Lucke, Ali Momeni, Daniël Paulusma, Siani Smith
-Free Graphs. CoRR (2024)
Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Mark Siggers, Siani Smith
Graph Homomorphism, Monotone Classes and Bounded Pathwidth. CoRR (2024)
Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye
Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded. AAMAS (2024)
Márton Benedek, Péter Biró, Daniël Paulusma, Xin Ye
Computing balanced solutions for large international kidney exchange schemes. Auton. Agents Multi Agent Syst. 38 (1) (2024)
Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. IWOCA (2024)
Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
Clique-width: Harnessing the power of atoms. J. Graph Theory 104 (4) (2023)
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
Computing Subset Vertex Covers in H-Free Graphs. FCT (2023)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Computing pivot-minors. CoRR (2023)
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
Computing Subset Vertex Covers in H-Free Graphs. CoRR (2023)
Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs. CoRR (2023)
Márton Benedek, Péter Biró, Walter Kern, Dömötör Pálvölgyi, Daniël Paulusma
Partitioned Matching Games for International Kidney Exchange. CoRR (2023)
Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. MFCS (2023)
Felicia Lucke, Daniël Paulusma, Bernard Ries
Finding Matching Cuts in H-Free Graphs. Algorithmica 85 (10) (2023)
Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye
Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded. CoRR (2023)
Felicia Lucke, Daniël Paulusma, Bernard Ries
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. CoRR (2023)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
-free graphs. Theor. Comput. Sci. 939 (2023)
Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
Matching Cuts in Graphs of High Girth and H-Free Graphs. ISAAC (2023)
Márton Benedek, Péter Biró, Matthew Johnson, Daniël Paulusma, Xin Ye
The Complexity of Matching Games: A Survey. J. Artif. Intell. Res. 77 (2023)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. Algorithmica 85 (9) (2023)
Van Bang Le, Felicia Lucke, Daniël Paulusma, Bernard Ries
Maximizing Matching Cuts. CoRR (2023)
Felicia Lucke, Daniël Paulusma, Bernard Ries
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. MFCS (2023)
Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. CoRR (2023)
Gaétan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith
The Complexity of L(p, q)-Edge-Labelling. Algorithmica 85 (11) (2023)
Nick Brettell, Andrea Munaro, Daniël Paulusma, Shizhou Yang
Comparing Width Parameters on Graph Classes. CoRR (2023)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Classifying Subset Feedback Vertex Set for H-Free Graphs. CoRR (2022)
Felicia Lucke, Daniël Paulusma, Bernard Ries
-free graphs. Theor. Comput. Sci. 936 (2022)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. WG (2022)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR (2022)
Felicia Lucke, Daniël Paulusma, Bernard Ries
Finding Matching Cuts in H-Free Graphs. ISAAC (2022)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs. SIAM J. Discret. Math. 36 (4) (2022)
Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
An Algorithmic Framework for Locally Constrained Homomorphisms. WG (2022)
Gaetan Berthe, Barnaby Martin, Daniël Paulusma, Siani Smith
The Complexity of L(p, q)-Edge-Labelling. WALCOM (2022)
Nick Brettell, Matthew Johnson, Daniël Paulusma
-free graphs. J. Comput. Syst. Sci. 128 (2022)
Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework For Forbidden Subgraphs. CoRR (2022)
Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
Induced Disjoint Paths in AT-free graphs. J. Comput. Syst. Sci. 124 (2022)
Felicia Lucke, Daniël Paulusma, Bernard Ries
Finding Matching Cuts in H-Free Graphs. CoRR (2022)
Felicia Lucke, Daniël Paulusma, Bernard Ries
On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs. CoRR (2022)
Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Complexity Framework for Forbidden Subgraphs: When Hardness Is Not Preserved under Edge Subdivision. CoRR (2022)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Pascal Ochem, Daniël Paulusma, Siani Smith
Acyclic, Star, and Injective Colouring: Bounding the Diameter. Electron. J. Comb. 29 (2) (2022)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Classifying Subset Feedback Vertex Set for H-Free Graphs. WG (2022)
Márton Benedek, Péter Biró, Walter Kern, Daniël Paulusma
Computing Balanced Solutions for Large International Kidney Exchange Schemes. AAMAS (2022)
Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
An Algorithmic Framework for Locally Constrained Homomorphisms. CoRR (2022)
Maria Chudnovsky, Neeldhara Misra, Daniël Paulusma, Oliver Schaudt, Akanksha Agrawal
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481). Dagstuhl Reports 12 (11) (2022)
Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
-free graphs. Theor. Comput. Sci. 902 (2022)
Barnaby Martin, Daniël Paulusma, Siani Smith
Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter. Theor. Comput. Sci. 931 (2022)
Matthew Johnson, Barnaby Martin, Siani Smith, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs. CoRR (2022)
Benoît Larose, Barnaby Martin, Petar Markovic, Daniël Paulusma, Siani Smith, Stanislav Zivný
QCSP on Reflexive Tournaments. ACM Trans. Comput. Log. 23 (3) (2022)
Barnaby Martin, Daniël Paulusma, Siani Smith
Hard problems that quickly become very easy. Inf. Process. Lett. 174 (2022)
Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching. CoRR (2022)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Few Induced Disjoint Paths for H-Free Graphs. CoRR (2022)
Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Few Induced Disjoint Paths for H-Free Graphs. ISCO (2022)
Nick Brettell, Jake Horsfield, Andrea Munaro, Daniël Paulusma
-free graphs: A Mim-width perspective. Inf. Process. Lett. 173 (2022)
Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
-free graphs. Theor. Comput. Sci. 898 (2022)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
-free graphs of bounded diameter. Theor. Comput. Sci. 930 (2022)
Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma
Bounding the mim-width of hereditary graph classes. J. Graph Theory 99 (1) (2022)
Barnaby Martin, Daniël Paulusma, Siani Smith
Colouring graphs of bounded diameter in the absence of small cycles. Discret. Appl. Math. 314 (2022)
Márton Benedek, Péter Biró, Matthew Johnson, Daniël Paulusma, Xin Ye
The Complexity of Matching Games: A Survey. CoRR (2022)
Winfried Hochstättler, Johann L. Hurink, Bodo Manthey, Daniël Paulusma, Britta Peis, Georg Still
In Memoriam Walter Kern. Discret. Appl. Math. 303 (2021)
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
Steiner trees for hereditary graph classes: A treewidth perspective. Theor. Comput. Sci. 867 (2021)
Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Disjoint Paths and Connected Subgraphs for H-Free Graphs. CoRR (2021)
Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
What Graphs are 2-Dot Product Graphs? Int. J. Comput. Geom. Appl. 31 (1) (2021)
Barnaby Martin, Daniël Paulusma, Siani Smith
Colouring Graphs of Bounded Diameter in the Absence of Small Cycles. CIAC (2021)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
Acyclic, Star, and Injective Colouring: Bounding the Diameter. CoRR (2021)
Barnaby Martin, Daniël Paulusma, Siani Smith
Colouring Graphs of Bounded Diameter in the Absence of Small Cycles. CoRR (2021)
Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma, Théo Pierron
-Free Graphs: An Almost Complete Dichotomy. Algorithmica 83 (3) (2021)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. CoRR (2021)
Barnaby Martin, Daniël Paulusma, Siani Smith
Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter. CoRR (2021)
Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith
Injective Colouring for H-Free Graphs. CSR (2021)
Walter Kern, Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
Disjoint Paths and Connected Subgraphs for H-Free Graphs. IWOCA (2021)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
Partitioning H-Free Graphs of Bounded Diameter. CoRR (2021)
Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný
QCSP on Reflexive Tournaments. ESA (2021)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Tree Pivot-Minors and Linear Rank-Width. SIAM J. Discret. Math. 35 (4) (2021)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. J. Graph Theory 98 (1) (2021)
Nick Brettell, Matthew Johnson, Daniël Paulusma
Computing Weighted Subset Transversals in H-Free Graphs. WADS (2021)
Márton Benedek, Péter Biró, Walter Kern, Daniël Paulusma
Computing Balanced Solutions for Large International Kidney Exchange Schemes. CoRR (2021)
Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný
QCSP on Reflexive Tournaments. CoRR (2021)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
Partitioning H-Free Graphs of Bounded Diameter. ISAAC (2021)
Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma
Preface. BCC (2021)
Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith
Acyclic, Star, and Injective Colouring: Bounding the Diameter. WG (2021)
Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs. MFCS (2021)
Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma
Solving Problems on Generalized Convex Graphs via Mim-Width. WADS (2021)
Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
Clique-width and well-quasi-ordering of triangle-free graph classes. J. Comput. Syst. Sci. 108 (2020)
Barnaby Martin, Daniël Paulusma, Siani Smith
Hard Problems That Quickly Become Very Easy. CoRR (2020)
Nick Brettell, Andrea Munaro, Daniël Paulusma
: a Mim-width Perspective. CoRR (2020)
Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. ESA (2020)
Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
Computing Subset Transversals in H-Free Graphs. WG (2020)
Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
Clique-Width: Harnessing the Power of Atoms. CoRR (2020)
Petr A. Golovach, Daniël Paulusma, Erik Jan van Leeuwen
Induced Disjoint Paths in AT-free Graphs. CoRR (2020)
Nick Brettell, Matthew Johnson, Daniël Paulusma
Computing Weighted Subset Transversals in H-Free Graphs. CoRR (2020)
Walter Kern, Daniël Paulusma
Contracting to a Longest Path in H-Free Graphs. ISAAC (2020)
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective. CoRR (2020)
Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith
Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs. CoRR (2020)
Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
Steiner Trees for Hereditary Graph Classes. LATIN (2020)

Daniël Paulusma.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Daniël Paulusma