Daniel Paulusma

Given name	Daniel
Surname	Paulusma

Releases

This creator has contributed to:

2018-06-26	Independent Feedback Vertex Set for $$P_5$$P5-Free Graphs published \| article-journal doi:10.1007/s00453-018-0474-x
2018	Computing Small Pivot-Minors published \| chapter doi:10.1007/978-3-030-00256-5_11
2018-11-25	Hereditary graph classes: When the complexities of coloring and clique cover coincide published \| article-journal doi:10.1002/jgt.22431
2019-05-31	Using contracted solution graphs for solving reconfiguration problems published \| article-journal doi:10.1007/s00236-019-00336-8
2019-05-31	Filling the complexity gaps for colouring planar and bounded degree graphs published \| article-journal doi:10.1002/jgt.22459
2019-06-20	Connected Vertex Cover for $$(sP_1+P_5)$$ ( s P 1 + P 5 ) -Free Graphs published \| article-journal doi:10.1007/s00453-019-00601-9
2019	Graph Isomorphism for $$(H_1,H_2)$$ ( H 1 , H 2 ) -Free Graphs: An Almost Complete Dichotomy published \| chapter doi:10.1007/978-3-030-24766-9_14
2019	On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest published \| chapter doi:10.1007/978-3-030-25027-0_18
2019-09-28	Simple games versus weighted voting games: bounding the critical threshold value published \| article-journal doi:10.1007/s00355-019-01221-6
2020-04-29	On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest published \| article-journal doi:10.1007/s00453-020-00706-6
2020	Clique-Width for Graph Classes Closed under Complementation published \| article-journal doi:10.1137/18m1235016
2020-08-05	Graph Isomorphism for $$(H_1,H_2)$$-Free Graphs: An Almost Complete Dichotomy published \| article-journal \| CC-BY doi:10.1007/s00453-020-00747-x
2020	Clique-Width: Harnessing the Power of Atoms published \| chapter doi:10.1007/978-3-030-60440-0_10
2020	Steiner Trees for Hereditary Graph Classes published \| chapter doi:10.1007/978-3-030-61792-9_48
2020-12-04	Bounding the Mim-Width of Hereditary Graph Classes published \| article-journal \| CC-BY doi:10.4230/lipics.ipec.2020.6
2020-12-04	Contracting to a Longest Path in H-Free Graphs published \| article-journal \| CC-BY doi:10.4230/lipics.isaac.2020.22
2020-08-26	Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs published \| article-journal \| CC-BY doi:10.4230/lipics.esa.2020.22
2021	Colouring Graphs of Bounded Diameter in the Absence of Small Cycles published \| chapter doi:10.1007/978-3-030-75242-2_26
2021-05-24	Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration published \| article-journal \| CC-BY doi:10.1002/jgt.22683
2021	Solving Problems on Generalized Convex Graphs via Mim-Width published \| chapter doi:10.1007/978-3-030-83508-8_15
2021	Computing Weighted Subset Transversals in H-Free Graphs published \| chapter doi:10.1007/978-3-030-83508-8_17
2021-08-18	Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs published \| article-journal \| CC-BY doi:10.4230/lipics.mfcs.2021.82
2021-08-25	Bounding the mim‐width of hereditary graph classes published \| article-journal doi:10.1002/jgt.22730
2021	Acyclic, Star, and Injective Colouring: Bounding the Diameter published \| chapter doi:10.1007/978-3-030-86838-3_26
2021	Induced Disjoint Paths in AT-free Graphs published \| article-journal doi:10.1016/j.jcss.2021.10.003
2021-11-30	Partitioning H-Free Graphs of Bounded Diameter published \| article-journal \| CC-BY doi:10.4230/lipics.isaac.2021.21
2021	Computing Subset Transversals in H-Free Graphs published \| article-journal doi:10.1016/j.tcs.2021.12.010
2022	Colouring graphs of bounded diameter in the absence of small cycles published \| article-journal doi:10.1016/j.dam.2022.02.026
2022	Computing weighted subset odd cycle transversals in H-free graphs published \| article-journal doi:10.1016/j.jcss.2022.03.002
2022	Partitioning H-Free Graphs of Bounded Diameter published \| article-journal doi:10.1016/j.tcs.2022.07.009
2022	Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter published \| article-journal doi:10.1016/j.tcs.2022.07.034
2022	On the complexity of matching cut for graphs of bounded radius and H-free graphs published \| article-journal \| CC-BY doi:10.1016/j.tcs.2022.09.014
2022	Few induced disjoint paths for H-free graphs published \| article-journal \| CC-BY doi:10.1016/j.tcs.2022.10.024
2022-12-14	Finding Matching Cuts in H-Free Graphs published \| article-journal \| CC-BY doi:10.4230/lipics.isaac.2022.22
2023-07-10	Clique‐width: Harnessing the power of atoms published \| article-journal \| CC-BY doi:10.1002/jgt.23000
2023-08-21	Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius published \| article-journal \| CC-BY doi:10.4230/lipics.mfcs.2023.64
2023-08-21	Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs published \| article-journal \| CC-BY doi:10.4230/lipics.mfcs.2023.57
2023	Computing Subset Vertex Covers in H-Free Graphs published \| chapter doi:10.1007/978-3-031-43587-4_7
2023-11-28	Matching Cuts in Graphs of High Girth and H-Free Graphs published \| article-journal \| CC-BY doi:10.4230/lipics.isaac.2023.31
2024-05-31	Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs published \| unknown type \| CC-BY doi:10.4230/lipics.swat.2024.29
2024	Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem published \| chapter doi:10.1007/978-3-031-63021-7_16
2024-04-18	An Algorithmic Framework for Locally Constrained Homomorphisms published \| article-journal doi:10.1137/22m1513290
2024-03-01	Solving problems on generalized convex graphs via mim-width published \| article-journal \| v1 doi:10.60692/2f7hy-zfx82
2024-03-01	Solving problems on generalized convex graphs via mim-width published \| article-journal \| v1 doi:10.60692/gfy6q-6sf45
2022	Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs published \| chapter doi:10.1007/978-3-031-15914-5_29
2024-12-04	Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-Graphs published \| unknown type \| CC-BY doi:10.4230/lipics.isaac.2024.47
2025	The Complexity of Diameter on H-free Graphs published \| chapter doi:10.1007/978-3-031-75409-8_31
2025	Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs published \| chapter doi:10.1007/978-3-031-75409-8_29
2025	Computing subset vertex covers in H-free graphs published \| article-journal \| CC-BY doi:10.1016/j.tcs.2025.115088
2025	Computing subset vertex covers in H-free graphs published \| article-journal doi:10.18154/rwth-2025-01705

ORCID^? 0000-0001-5945-9287

Lookup Links
wikidata.org
VIAF
dblp (CS)
Google Scholar

Catalog Record
Revision: e9cd114c-a277-4201-b3ab-d5ee493a4f43
API URL: JSON

Daniel Paulusma creator_sg2gmem42zc6hatr7syyz5sixa

Releases

Daniel Paulusma `creator_sg2gmem42zc6hatr7syyz5sixa`