The following pages link to Daniël Paulusma (Q170462):
Displayed 6 items.
- Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs (Q6434976) (← links)
- Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem (Q6435083) (← links)
- Computing Subset Vertex Covers in $H$-Free Graphs (Q6443388) (← links)
- Comparing Width Parameters on Graph Classes (Q6446979) (← links)
- Computing pivot-minors (Q6458553) (← links)
- Maximizing Matching Cuts (Q6464393) (← links)