Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Livro
|
Surveys in Combinatorics 2021Konrad K. Dabrowski Maximilien Gadouleau Nicholas Georgiou; Maximilien Gadouleau; Nicholas Georgiou; Matthew Johnson; George B Mertzios; Daniël PaulusmaCambridge University Press 2021Acesso online |
|
2 |
Material Type: Artigo
|
On the complexity of matching cut for graphs of bounded radius and H-free graphsLucke, Felicia ; Paulusma, Daniël ; Ries, BernardTheoretical computer science, 2022-11, Vol.936, p.33-42 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
|
3 |
Material Type: Artigo
|
A Survey on the Computational Complexity of Coloring Graphs with Forbidden SubgraphsGolovach, Petr A. ; Johnson, Matthew ; Paulusma, Daniël ; Song, JianJournal of graph theory, 2017-04, Vol.84 (4), p.331-363 [Periódico revisado por pares]Hoboken: Wiley Subscription Services, IncTexto completo disponível |
|
4 |
Material Type: Ata de Congresso
|
Computing with Foresight and Industry: 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019, ProceedingsManea, Florin ; Paulusma, Daniël ; Primiero, Giuseppe ; Martin, BarnabyCham: Springer International Publishing 2019Sem texto completo |
|
5 |
Material Type: Artigo
|
Finding Matching Cuts in H-Free GraphsLucke, Felicia ; Paulusma, Daniël ; Ries, BernardAlgorithmica, 2023-10, Vol.85 (10), p.3290-3322 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
6 |
Material Type: Artigo
|
Classifying the clique-width of H-free bipartite graphsDabrowski, Konrad K. ; Paulusma, DaniëlDiscrete Applied Mathematics, 2016-02, Vol.200, p.43-51 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
|
7 |
Material Type: Artigo
|
Colouring graphs of bounded diameter in the absence of small cyclesMartin, Barnaby ; Paulusma, Daniël ; Smith, SianiDiscrete Applied Mathematics, 2022-06, Vol.314, p.150-161 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
8 |
Material Type: Artigo
|
Computing subset transversals in H-free graphsBrettell, Nick ; Johnson, Matthew ; Paesani, Giacomo ; Paulusma, DaniëlTheoretical computer science, 2022-01, Vol.902, p.76-92 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
|
9 |
Material Type: Artigo
|
Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameterMartin, Barnaby ; Paulusma, Daniël ; Smith, SianiTheoretical computer science, 2022-09, Vol.931, p.104-116 [Periódico revisado por pares]Elsevier B.VTexto completo disponível |
|
10 |
Material Type: Artigo
|
Computing Weighted Subset Odd Cycle Transversals in H-free graphsBrettell, Nick ; Johnson, Matthew ; Paulusma, DaniëlJournal of computer and system sciences, 2022-09, Vol.128, p.71-85 [Periódico revisado por pares]Elsevier IncTexto completo disponível |