Daniël Paulusma

University of Durham

United Kingdom

Research Interests

Explore related searches

Professors in United Kingdom

Contact this professor

Get a free first email built on one of their papers, ready for you to edit and send yourself.

Articles (18)

Year:

2024

Year:

2024

Year:

2024

Year:

2024

Year:

2024

Year:

2023

Year:

2023

Year:

2023

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Collaborators (6)

Stanislav Zivny

Professor of Computer Science

University of Oxford

UNITED KINGDOM

View details

Bernard Ries

Professor

University of Fribourg

SWITZERLAND

View details

Nick Brettell

Lecturer in Mathematics

Victoria University of Wellington

NEW ZEALAND

View details

Giacomo Paesani

University of Leeds

UNITED KINGDOM

View details

Andrea Munaro

The Queen's University Belfast

UNITED KINGDOM

View details

Barnaby Martin

Lecturer in Computer Science

University of Durham

UNITED KINGDOM

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Daniël Paulusma

Research Interests

Explore related searches

Contact this professor

Articles (18)

An Algorithmic Framework for Locally Constrained Homomorphisms

An algorithmic framework for locally constrained homomorphisms

On the price of independence for vertex cover, feedback vertex set and odd cycle transversal

Solving problems on generalized convex graphs via mim-width

Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius

Clique-width: harnessing the power of atoms

Induced disjoint paths and connected subgraphs for H-free graphs

The complexity of matching games: A survey

Bounding the mim‐width of hereditary graph classes

List k-colouring Pt-free graphs: A Mim-width perspective

QCSP on Reflexive Tournaments

On the complexity of matching cut for graphs of bounded radius and H-free graphs

Computing subset transversals in H-free graphs

Hard problems that quickly become very easy

Induced disjoint paths in AT-free graphs

Disjoint paths and connected subgraphs for H-free graphs

Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter

Colouring graphs of bounded diameter in the absence of small cycles

Collaborators (6)

Stanislav Zivny

Bernard Ries

Nick Brettell

Giacomo Paesani

Andrea Munaro

Barnaby Martin

Make your next move.