Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Paulusma, Daniël
397  Ergebnisse:
Personensuche X
?
1

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/..
 
?
2

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/..
 
?
3

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/..
 
?
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

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/..
 
?
6

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/..
 
?
7

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/..
 
?
8

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/..
 
?
9

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/..
 
?
10

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/..
 
?
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

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/..
 
?
13

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/..
 
?
14

On the complexity of matching cut for graphs of bounded rad..:

Lucke, Felicia ; Paulusma, Daniël ; Ries, Bernard
Theoretical Computer Science.  936 (2022)  - p. 33-42 , 2022
Link: https://doi.org/10.1016/..
 
?
15

QCSP on Reflexive Tournaments:

Larose, Benoît ; Martin, Barnaby ; Marković, Petar...
ACM Transactions on Computational Logic.  23 (2022)  3 - p. 1-22 , 2022
Link: https://doi.org/10.1145/..
 
1-15