The following pages link to Daniël Paulusma (Q170462):
Displayed 50 items.
- Computing subset transversals in \(H\)-free graphs (Q5918592) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918624) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5918693) (← links)
- Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
- On cycle transversals and their connected variants in the absence of a small linear forest (Q5919358) (← links)
- Contracting bipartite graphs to paths and cycles (Q5920049) (← links)
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5920195) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5925554) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5925681) (← links)
- The new FIFA rules are hard: Complexity aspects of sports competitions. (Q5929315) (← links)
- Kempe equivalence of colourings of cubic graphs (Q5965525) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6039418) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6039437) (← links)
- Classifying subset feedback vertex set for \(H\)-free graphs (Q6039438) (← links)
- Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)
- QCSP on Reflexive Tournaments (Q6075950) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- The complexity of \(L(p, q)\)-edge-labelling (Q6090539) (← links)
- Feedback Vertex Set and Even Cycle Transversal for H-free graphs: finding large block graphs (Q6113370) (← links)
- (Q6147518) (← links)
- Few induced disjoint paths for \(H\)-free graphs (Q6166893) (← links)
- On the price of independence for vertex cover, feedback vertex set and odd cycle transversal (Q6181986) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- New Bounds for the Snake-in-the-Box Problem (Q6271546) (← links)
- Disconnected Cuts in Claw-free Graphs (Q6298858) (← links)
- Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy (Q6310429) (← links)
- On the Parameterized Complexity of $k$-Edge Colouring (Q6312102) (← links)
- On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest (Q6323047) (← links)
- On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal (Q6327025) (← links)
- Colouring $(sP_1+P_5)$-Free Graphs: a Mim-Width Perspective (Q6338474) (← links)
- Computing Subset Transversals in $H$-Free Graphs (Q6341605) (← links)
- Clique-Width: Harnessing the Power of Atoms (Q6342208) (← links)
- Computing Weighted Subset Transversals in $H$-Free Graphs (Q6346052) (← links)
- Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs (Q6347488) (← links)
- Acyclic, Star, and Injective Colouring: Bounding the Diameter (Q6365823) (← links)
- Partitioning H-Free Graphs of Bounded Diameter (Q6367297) (← links)
- Disjoint Paths and Connected Subgraphs for H-Free Graphs (Q6367593) (← links)
- Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter (Q6383756) (← links)
- Few Induced Disjoint Paths for $H$-Free Graphs (Q6393005) (← links)
- On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs (Q6396539) (← links)
- Complexity Framework For Forbidden Subgraphs I: The Framework (Q6418235) (← links)
- Complexity Framework for Forbidden Subgraphs II: When Hardness Is Not Preserved under Edge Subdivision (Q6418480) (← links)
- Matching Cuts in Graphs of High Girth and H-Free Graphs (Q6421514) (← links)