The following pages link to Daniël Paulusma (Q170462):
Displayed 50 items.
- Minimal Disconnected Cuts in Planar Graphs (Q2947884) (← links)
- Model Counting for CNF Formulas of Bounded Modular Treewidth (Q2957871) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- (Q2978505) (← links)
- Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions (Q2988844) (← links)
- Computing Role Assignments of Proper Interval Graphs in Polynomial Time (Q3000505) (← links)
- Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees (Q3007632) (← links)
- Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) (Q3007673) (← links)
- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs (Q3057613) (← links)
- On Coloring Graphs without Induced Forests (Q3060770) (← links)
- Contracting a Chordal Graph to a Split Graph or a Tree (Q3088052) (← links)
- Coloring Graphs without Short Cycles and Long Induced Paths (Q3088283) (← links)
- Graph labelings derived from models in distributed computing: A complete complexity classification (Q3100700) (← links)
- (Q3104255) (← links)
- Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths (Q3104605) (← links)
- List Coloring in the Absence of a Linear Forest (Q3104770) (← links)
- (Q3113764) (← links)
- Characterizing Graphs of Small Carving-Width (Q3167377) (← links)
- On the Core and <i>f</i>-Nucleolus of Flow Games (Q3169076) (← links)
- Computing Role Assignments of Chordal Graphs (Q3183609) (← links)
- Editing to a Planar Graph of Given Degrees (Q3194713) (← links)
- Filling the complexity gaps for colouring planar and bounded degree graphs (Q3299212) (← links)
- Colouring square-free graphs without long induced paths. (Q3304134) (← links)
- (Q3304148) (← links)
- Partitioning Graphs into Connected Parts (Q3392949) (← links)
- On Contracting Graphs to Fixed Pattern Graphs (Q3401113) (← links)
- On-Line Coloring of H-Free Bipartite Graphs (Q3434564) (← links)
- On components of 2-factors in claw-free graphs (Q3503486) (← links)
- Comparing Universal Covers in Polynomial Time (Q3503635) (← links)
- The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases (Q3507648) (← links)
- A New Characterization of P 6-Free Graphs (Q3511353) (← links)
- Graph Labelings Derived from Models in Distributed Computing (Q3522967) (← links)
- The Computational Complexity of the Parallel Knock-Out Problem (Q3525764) (← links)
- Packing Bipartite Graphs with Covers of Complete Bipartite Graphs (Q3563009) (← links)
- On Solution Concepts for Matching Games (Q3569069) (← links)
- L(2,1,1)-Labeling Is NP-Complete for Trees (Q3569077) (← links)
- Obtaining Online Ecological Colourings by Generalizing First-Fit (Q3569747) (← links)
- Contractions of Planar Graphs in Polynomial Time (Q3586456) (← links)
- Computing Sharp 2-Factors in Claw-Free Graphs (Q3599127) (← links)
- A New Algorithm for On-line Coloring Bipartite Graphs (Q3614195) (← links)
- The computational complexity of graph contractions II: Two tough polynomially solvable cases (Q3632967) (← links)
- Three Complexity Results on Coloring P k -Free Graphs (Q3651537) (← links)
- Induced Packing of Odd Cycles in a Planar Graph (Q3652239) (← links)
- Parameterizing Cut Sets in a Graph by the Number of Their Components (Q3652247) (← links)
- On Partitioning a Graph into Two Connected Subgraphs (Q3652306) (← links)
- (Q4449222) (← links)
- Using contracted solution graphs for solving reconfiguration problems. (Q4608579) (← links)
- Minimal disconnected cuts in planar graphs (Q4642401) (← links)
- Closing Complexity Gaps for Coloring Problems on H-Free Graphs (Q4909517) (← links)
- Detecting Induced Minors in AT-Free Graphs (Q4909566) (← links)