The following pages link to Daniël Paulusma (Q170462):
Displayed 50 items.
- Parameterized algorithms for finding square roots (Q262249) (← links)
- Finding shortest paths between graph colourings (Q309791) (← links)
- What graphs are 2-dot product graphs? (Q322356) (← links)
- Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
- Graph editing to a fixed target (Q344855) (← links)
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- Satisfiability of acyclic and almost acyclic CNF formulas (Q385062) (← links)
- Detecting induced minors in AT-free graphs (Q390909) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Distance three labelings of trees (Q415278) (← links)
- On graph contractions and induced minors (Q415282) (← links)
- Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- Coloring graphs characterized by a forbidden subgraph (Q476308) (← links)
- Squares of low clique number (Q510991) (← links)
- The price of connectivity for feedback vertex set (Q516802) (← links)
- Contracting planar graphs to contractions of triangulations (Q635743) (← links)
- On partitioning a graph into two connected subgraphs (Q650911) (← links)
- Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
- Computing solutions for matching games (Q662281) (← links)
- Computing role assignments of chordal graphs (Q708211) (← links)
- Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
- Finding vertex-surjective graph homomorphisms (Q715053) (← links)
- Well-quasi-ordering versus clique-width: new results on bigenic classes (Q722586) (← links)
- Finding cactus roots in polynomial time (Q726100) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- The price of connectivity for cycle transversals (Q739064) (← links)
- Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Containment relations in split graphs (Q765349) (← links)
- A complete complexity classification of the role assignment problem (Q817773) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Computing weighted subset transversals in \(H\)-free graphs (Q832863) (← links)
- Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs (Q844222) (← links)
- Editing to Eulerian graphs (Q896016) (← links)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
- Path factors and parallel knock-out schemes of almost claw-free graphs (Q968408) (← links)
- A new characterization of \(P_{6}\)-free graphs (Q972332) (← links)
- Comparing universal covers in polynomial time (Q987372) (← links)
- Computing sharp 2-factors in claw-free graphs (Q988693) (← links)
- Upper bounds and algorithms for parallel knock-out numbers (Q1008728) (← links)
- Covering graphs with few complete bipartite subgraphs (Q1019181) (← links)
- Partitioning graphs into connected parts (Q1034603) (← links)
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings (Q1045046) (← links)
- (Q1396954) (redirect page) (← links)
- Two extensions of the shapley value for cooperative games (Q1396955) (← links)
- Note on the computational complexity of least core concepts for min-cost spanning tree games. (Q1403160) (← links)
- Simple games versus weighted voting games (Q1617644) (← links)