skip to main content
Idioma:
Primo Advanced Search
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search Query Term
Primo Advanced Search prefilters
Busca Simples
Mostrar Somente
Refinado por: Nome da Publicação: Acm Transactions On Algorithms remover assunto: Theory Of Computation remover
Result Number Material Type Add to My Shelf Action Record Details and Options
1
Polynomial Kernel for Interval Vertex Deletion
Polynomial Kernel for Interval Vertex Deletion
Material Type:
Artigo 		Adicionar ao Meu Espaço

Polynomial Kernel for Interval Vertex Deletion

Agrawal, Akanksha ; Lokshtanov, Daniel ; Misra, Pranabendu ; Saurabh, Saket ; Zehavi, Meirav

ACM transactions on algorithms, 2023-04, Vol.19 (2), p.1-68, Article 11 [Periódico revisado por pares]

New York, NY: ACM

Texto completo disponível

Citações Citado por
2
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
Material Type:
Artigo 		Adicionar ao Meu Espaço

Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs

Pilipczuk, Marcin ; Pilipczuk, Michał ; Sankowski, Piotr ; Leeuwen, Erik Jan Van

ACM transactions on algorithms, 2018-10, Vol.14 (4), p.1-73, Article 53 [Periódico revisado por pares]

New York, NY, USA: ACM

Texto completo disponível

Citações Citado por
3
Cluster Editing Parameterized above Modification-disjoint P3-packings
Cluster Editing Parameterized above Modification-disjoint P3-packings
Material Type:
Artigo 		Adicionar ao Meu Espaço

Cluster Editing Parameterized above Modification-disjoint P3-packings

Li, Shaohua ; Pilipczuk, Marcin ; Sorge, Manuel

ACM transactions on algorithms, 2023-12, Vol.20 (1), p.1-43, Article 3 [Periódico revisado por pares]

New York, NY: ACM

Texto completo disponível

Citações Citado por
4
Recognizing k-Leaf Powers in Polynomial Time, for Constant k
Recognizing k-Leaf Powers in Polynomial Time, for Constant k
Material Type:
Artigo 		Adicionar ao Meu Espaço

Recognizing k-Leaf Powers in Polynomial Time, for Constant k

Lafond, Manuel

ACM transactions on algorithms, 2023-09, Vol.19 (4), p.1-35, Article 35 [Periódico revisado por pares]

New York, NY: ACM

Texto completo disponível

Citações Citado por
5
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity
Material Type:
Artigo 		Adicionar ao Meu Espaço

Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity

Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav

ACM transactions on algorithms, 2024-04, Vol.20 (2), p.1-50, Article 15 [Periódico revisado por pares]

New York, NY: ACM

Texto completo disponível

Citações Citado por
6
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
Material Type:
Artigo 		Adicionar ao Meu Espaço

Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs

Coudert, David ; Ducoffe, Guillaume ; Popa, Alexandru

ACM transactions on algorithms, 2019-07, Vol.15 (3), p.1-57, Article 33 [Periódico revisado por pares]

New York, NY, USA: ACM

Texto completo disponível

Citações Citado por
7
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs
True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs
Material Type:
Artigo 		Adicionar ao Meu Espaço

True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs

Bandyapadhyay, Sayan ; Lochet, William ; Lokshtanov, Daniel ; Saurabh, Saket ; Xue, Jie

ACM transactions on algorithms [Periódico revisado por pares]

New York, NY: ACM

Sem texto completo

Citações Citado por
8
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width
Material Type:
Artigo 		Adicionar ao Meu Espaço

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width

Ganian, Robert ; Hamm, Thekla ; Korchemna, Viktoriia ; Okrasa, Karolina ; Simonov, Kirill

ACM transactions on algorithms [Periódico revisado por pares]

New York, NY: ACM

Sem texto completo

Citações Citado por

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

Buscando em bases de dados remotas. Favor aguardar.