The following pages link to Daniël Paulusma (Q170462):
Displayed 50 items.
- Computing small pivot-minors (Q1627161) (← links)
- The stable fixtures problem with payments (Q1651275) (← links)
- Obtaining online ecological colourings by generalizing first-fit (Q1678751) (← links)
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity (Q1680547) (← links)
- Independent feedback vertex sets for graphs of bounded diameter (Q1685021) (← links)
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
- On the parameterized complexity of \((k,s)\)-SAT (Q1711421) (← links)
- Critical vertices and edges in \(H\)-free graphs (Q1730263) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
- 4-coloring \(H\)-free graphs when \(H\) is small (Q1759872) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- Three complexity results on coloring \(P_k\)-free graphs (Q1933643) (← links)
- Exact algorithms for finding longest cycles in claw-free graphs (Q1939671) (← links)
- Choosability on \(H\)-free graphs (Q1943624) (← links)
- Obtaining planarity by contracting few edges (Q1945931) (← links)
- In memoriam Walter Kern (Q1983102) (← links)
- Simple games versus weighted voting games: bounding the critical threshold value (Q1986594) (← links)
- Surjective \(H\)-colouring: new hardness results (Q2011662) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Hard problems that quickly become very easy (Q2059897) (← links)
- Steiner trees for hereditary graph classes (Q2081657) (← links)
- On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs (Q2087455) (← links)
- Few induced disjoint paths for \(H\)-free graphs (Q2098179) (← links)
- Clique-width: harnessing the power of atoms (Q2110611) (← links)
- Injective colouring for H-free graphs (Q2117071) (← links)
- Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (Q2136850) (← links)
- The complexity of \(L(p, q)\)-edge-labelling (Q2154095) (← links)
- Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
- Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
- Disconnected cuts in claw-free graphs (Q2186821) (← links)
- List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
- Detecting fixed patterns in chordal graphs in polynomial time (Q2249737) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- List coloring in the absence of a linear forest (Q2258070) (← links)
- The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- On disconnected cuts and separators (Q2275942) (← links)
- Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy (Q2285091) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- Knocking out \(P_k\)-free graphs (Q2352787) (← links)
- Detecting induced star-like minors in polynomial time (Q2376792) (← links)
- The computational complexity of the elimination problem in generalized sports competitions (Q2386202) (← links)
- A linear kernel for finding square roots of almost planar graphs (Q2402259) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Reducing the chromatic number by vertex or edge deletions (Q2413179) (← links)
- Computing square roots of graphs with low maximum degree (Q2413970) (← links)