Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Paulusma, Daniël
22  Ergebnisse:
Buchkapitel (Online) X
Personensuche X
?
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 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/..
 
?
3

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

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani. - p. 398-411 , 2022
Link: https://doi.org/10.1007/..
 
?
4

An Algorithmic Framework for Locally Constrained Homomorphi..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Bulteau, Laurent ; Dabrowski, Konrad K. ; Köhler, Noleen.. - p. 114-128 , 2022
Link: https://doi.org/10.1007/..
 
?
5

Few Induced Disjoint Paths for H-Free Graphs:

, In: Lecture Notes in Computer Science; Combinatorial Optimization,
Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani. - p. 89-101 , 2022
Link: https://doi.org/10.1007/..
 
?
6

Classifying Subset Feedback Vertex Set for H-Free Graphs:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Paesani, Giacomo ; Paulusma, Daniël ; Rzążewski, Paweł - p. 412-424 , 2022
Link: https://doi.org/10.1007/..
 
?
7

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

, In: WALCOM: Algorithms and Computation; Lecture Notes in Computer Science,
Berthe, Gaétan ; Martin, Barnaby ; Paulusma, Daniël. - p. 175-186 , 2022
Link: https://doi.org/10.1007/..
 
?
8

Colouring Graphs of Bounded Diameter in the Absence of Smal..:

, In: Lecture Notes in Computer Science; Algorithms and Complexity,
Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani - p. 367-380 , 2021
Link: https://doi.org/10.1007/..
 
?
9

Acyclic, Star, and Injective Colouring: Bounding the Diamet..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Brause, Christoph ; Golovach, Petr ; Martin, Barnaby.. - p. 336-348 , 2021
Link: https://doi.org/10.1007/..
 
?
10

Injective Colouring for H-Free Graphs:

, In: Computer Science – Theory and Applications; Lecture Notes in Computer Science,
Bok, Jan ; Jedličková, Nikola ; Martin, Barnaby.. - p. 18-30 , 2021
Link: https://doi.org/10.1007/..
 
?
11

Solving Problems on Generalized Convex Graphs via Mim-Width:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Bonomo-Braberman, Flavia ; Brettell, Nick ; Munaro, Andrea. - p. 200-214 , 2021
Link: https://doi.org/10.1007/..
 
?
12

Computing Weighted Subset Transversals in H-Free Graphs:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Brettell, Nick ; Johnson, Matthew ; Paulusma, Daniël - p. 229-242 , 2021
Link: https://doi.org/10.1007/..
 
?
13

Disjoint Paths and Connected Subgraphs for H-Free Graphs:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Kern, Walter ; Martin, Barnaby ; Paulusma, Daniël.. - p. 414-427 , 2021
Link: https://doi.org/10.1007/..
 
?
14

Clique-Width: Harnessing the Power of Atoms:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Dabrowski, Konrad K. ; Masařík, Tomáš ; Novotná, Jana.. - p. 119-133 , 2020
Link: https://doi.org/10.1007/..
 
?
15

Computing Subset Transversals in H-Free Graphs:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Brettell, Nick ; Johnson, Matthew ; Paesani, Giacomo. - p. 187-199 , 2020
Link: https://doi.org/10.1007/..
 
1-15