E-LIB Suche - Ergebnisse für: Paulusma, Daniël

1

Complexity Framework for Forbidden Subgraphs IV: The Steine..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,

Bodlaender, Hans L. ; Johnson, Matthew ; Martin, Barnaby... - p. 206-217 , 2024

Link: https://doi.org/10.1007/..

2

Computing balanced solutions for large international kidney..:

Benedek, Márton ; Biró, Péter ; Paulusma, Daniel.
Autonomous Agents and Multi-Agent Systems. 38 (2024) 1 - p. , 2024

Link: https://doi.org/10.1007/..

3

An Algorithmic Framework for Locally Constrained Homomorphi..:

Bulteau, Laurent ; Dabrowski, Konrad K. ; Köhler, Noleen..
SIAM Journal on Discrete Mathematics. 38 (2024) 2 - p. 1315-1350 , 2024

Link: https://doi.org/10.1137/..

4

Classifying subset feedback vertex set for H-free graphs:

Paesani, Giacomo ; Paulusma, Daniël ; Rzążewski, Paweł
Theoretical Computer Science. 1003 (2024) - p. 114624 , 2024

Link: https://doi.org/10.1016/..

5

On the price of independence for vertex cover, feedback ver..:

Dabrowski, Konrad K. ; Johnson, Matthew ; Paesani, Giacomo..
European Journal of Combinatorics. 117 (2024) - p. 103821 , 2024

Link: https://doi.org/10.1016/..

6

Solving problems on generalized convex graphs via mim-width:

Bonomo-Braberman, Flavia ; Brettell, Nick ; Munaro, Andrea.
Journal of Computer and System Sciences. 140 (2024) - p. 103493 , 2024

Link: https://doi.org/10.1016/..

7

Clique‐width: Harnessing the power of atoms:

Dabrowski, Konrad K. ; Masařík, Tomáš ; Novotná, Jana..
Journal of Graph Theory. 104 (2023) 4 - p. 769-810 , 2023

Link: https://doi.org/10.1002/..

8

Finding Matching Cuts in H-Free Graphs:

Lucke, Felicia ; Paulusma, Daniël ; Ries, Bernard
Algorithmica. 85 (2023) 10 - p. 3290-3322 , 2023

Link: https://doi.org/10.1007/..

9

Few induced disjoint paths for H-free graphs:

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani.
Theoretical Computer Science. 939 (2023) - p. 182-193 , 2023

Link: https://doi.org/10.1016/..

10

The Complexity of L(p, q)-Edge-Labelling:

Berthe, Gaétan ; Martin, Barnaby ; Paulusma, Daniël.
Algorithmica. 85 (2023) 11 - p. 3406-3429 , 2023

Link: https://doi.org/10.1007/..

11

Graph-Theoretic Concepts in Computer Science: 49th Internat..

Lecture Notes in Computer Science, 14093

Paulusma, Daniël ; Ries, Bernard - 1st ed. 2023 . , 2023

Link: https://doi.org/10.1007/..

12

Induced Disjoint Paths and Connected Subgraphs for H-Free G..:

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani.
Algorithmica. 85 (2023) 9 - p. 2580-2604 , 2023

Link: https://doi.org/10.1007/..

13

Computing Subset Vertex Covers in H-Free Graphs:

, In: Fundamentals of Computation Theory; Lecture Notes in Computer Science,

Brettell, Nick ; Oostveen, Jelle J. ; Pandey, Sukanya.. - p. 88-102 , 2023

Link: https://doi.org/10.1007/..

14

Colouring graphs of bounded diameter in the absence of smal..:

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani
Discrete Applied Mathematics. 314 (2022) - p. 150-161 , 2022

Link: https://doi.org/10.1016/..

15

Computing Weighted Subset Odd Cycle Transversals in H-free ..:

Brettell, Nick ; Johnson, Matthew ; Paulusma, Daniël
Journal of Computer and System Sciences. 128 (2022) - p. 71-85 , 2022

Link: https://doi.org/10.1016/..