skip to main content
Idioma:
Mostrar Somente
Refinado por: Base de dados/Biblioteca: Utrecht University Repository remover
Result Number Material Type Add to My Shelf Action Record Details and Options
1
Few induced disjoint paths for H-free graphs
Few induced disjoint paths for H-free graphs
Material Type:
Artigo 		Adicionar ao Meu Espaço

Few induced disjoint paths for H-free graphs

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani ; Leeuwen, Erik Jan van

2023-01

Texto completo disponível

Citações Citado por
2
Induced Disjoint Paths in AT-free graphs
Induced Disjoint Paths in AT-free graphs
Material Type:
Artigo 		Adicionar ao Meu Espaço

Induced Disjoint Paths in AT-free graphs

Golovach, Petr A ; Paulusma, Daniël ; Leeuwen, Erik Jan van

2022-03

Texto completo disponível

Citações Citado por
3
Disjoint paths and connected subgraphs for H-free graphs
Disjoint paths and connected subgraphs for H-free graphs
Material Type:
Artigo 		Adicionar ao Meu Espaço

Disjoint paths and connected subgraphs for H-free graphs

Kern, Walter ; Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani ; Leeuwen, Erik Jan van

2022-01

Texto completo disponível

Citações Citado por
4
Steiner trees for hereditary graph classes: A treewidth perspective
Steiner trees for hereditary graph classes: A treewidth perspective
Material Type:
Artigo 		Adicionar ao Meu Espaço

Steiner trees for hereditary graph classes: A treewidth perspective

Bodlaender, Hans L ; Brettell, Nick ; Johnson, Matthew ; Paesani, Giacomo ; Paulusma, Daniël ; van Leeuwen, Erik Jan

2021-05

Texto completo disponível

Citações Citado por
5
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
Material Type:
Artigo 		Adicionar ao Meu Espaço

Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani ; Leeuwen, Erik Jan van

2022-02

Texto completo disponível

Citações Citado por
6
Few Induced Disjoint Paths for H-Free Graphs
Few Induced Disjoint Paths for H-Free Graphs
Material Type:
Artigo 		Adicionar ao Meu Espaço

Few Induced Disjoint Paths for H-Free Graphs

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani ; van Leeuwen, Erik Jan

2022

Texto completo disponível

Citações Citado por
7
Computing Subset Vertex Covers in H-Free Graphs
Computing Subset Vertex Covers in H-Free Graphs
Material Type:
Artigo 		Adicionar ao Meu Espaço

Computing Subset Vertex Covers in H-Free Graphs

Brettell, Nick ; Oostveen, Jelle ; Pandey, Sukanya ; Paulusma, Daniël ; van Leeuwen, Erik Jan

2023-07

Texto completo disponível

Citações Citado por
8
Complexity Framework for Forbidden Subgraphs {III:}: When Problems are Tractable on Subcubic Graphs
Complexity Framework for Forbidden Subgraphs {III:}: When Problems are Tractable on Subcubic Graphs
Material Type:
Artigo 		Adicionar ao Meu Espaço

Complexity Framework for Forbidden Subgraphs {III:}: When Problems are Tractable on Subcubic Graphs

Johnson, Matthew ; Martin, Barnaby ; Pandey, Sukanya ; Paulusma, Daniël ; Smith, Siani ; van Leeuwen, Erik Jan

2023-05

Texto completo disponível

Citações Citado por
9
Edge Multiway Cut and Node Multiway Cut are NP-complete on Subcubic Graphs
Edge Multiway Cut and Node Multiway Cut are NP-complete on Subcubic Graphs
Material Type:
Artigo 		Adicionar ao Meu Espaço

Edge Multiway Cut and Node Multiway Cut are NP-complete on Subcubic Graphs

Johnson, Matthew S ; Martin, Barnaby ; Smith, Siani ; Pandey, Sukanya ; Paulusma, Daniël ; van Leeuwen, Erik Jan

2022-11

Texto completo disponível

Citações Citado por
10
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem
Material Type:
Artigo 		Adicionar ao Meu Espaço

Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem

Bodlaender, Hans L ; Johnson, Matthew ; Martin, Barnaby ; Oostveen, Jelle ; Pandey, Sukanya ; Paulusma, Daniël ; Smith, Siani ; van Leeuwen, Erik Jan

2023-05

Texto completo disponível

Citações Citado por

  • Realização: ABCD-USP USP   Logos de Redes Sociais: Freepik

Buscando em bases de dados remotas. Favor aguardar.