Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
Polynomial Kernel for Interval Vertex DeletionAgrawal, Akanksha ; Lokshtanov, Daniel ; Misra, Pranabendu ; Saurabh, Saket ; Zehavi, MeiravACM transactions on algorithms, 2023-04, Vol.19 (2), p.1-68, Article 11 [Periódico revisado por pares]New York, NY: ACMTexto completo disponível |
|
2 |
Material Type: Artigo
|
Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity BoundsFocke, Jacob ; Marx, Dániel ; Rzążewski, PawełACM transactions on algorithms, 2024-02, Vol.20 (2), p.1-32, Article 11 [Periódico revisado por pares]New York, NY: ACMTexto completo disponível |
|
3 |
Material Type: Ata de Congresso
|
Vertex deletion parameterized by elimination distance and even lessJansen, Bart M. P. ; de Kroon, Jari J. H. ; Włodarczyk, MichałProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, p.1757-1769 [Periódico revisado por pares]New York, NY, USA: ACMSem texto completo |
|
4 |
Material Type: Artigo
|
Cluster Editing Parameterized above Modification-disjoint P3-packingsLi, Shaohua ; Pilipczuk, Marcin ; Sorge, ManuelACM transactions on algorithms, 2023-12, Vol.20 (1), p.1-43, Article 3 [Periódico revisado por pares]New York, NY: ACMTexto completo disponível |
|
5 |
Material Type: Artigo
|
Parameterized Complexity of Logic-based Argumentation in Schaefer’s FrameworkMahmood, Yasir ; Meier, Arne ; Schmidt, JohannesACM transactions on computational logic, 2023-05, Vol.24 (3), p.1-25, Article 26 [Periódico revisado por pares]New York, NY: ACMTexto completo disponível |
|
6 |
Material Type: Ata de Congresso
|
A nearly-linear time algorithm for linear programs with small treewidth: a multiscale representation of robust central pathDong, Sally ; Lee, Yin Tat ; Ye, GuanghaoProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, p.1784-1797 [Periódico revisado por pares]New York, NY, USA: ACMSem texto completo |
|
7 |
Material Type: Ata de Congresso
|
An Improved Parameterized Algorithm for TreewidthKorhonen, Tuukka ; Lokshtanov, DanielProceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, p.528-541 [Periódico revisado por pares]New York, NY, USA: ACMSem texto completo |
|
8 |
Material Type: Ata de Congresso
|
Hitting topological minors is FPTFomin, Fedor V. ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, MeiravProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, p.1317-1326 [Periódico revisado por pares]New York, NY, USA: ACMTexto completo disponível |
|
9 |
Material Type: Artigo
|
Advanced tools and methods for treewidth-based problem solvingHecher, MarkusInformation technology (Munich, Germany), 2023-05, Vol.65 (1-2), p.65-73 [Periódico revisado por pares]Sem texto completo |
|
10 |
Material Type: Ata de Congresso
|
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the OutdegreeBressan, Marco ; Lanzinger, Matthias ; Roth, MarcProceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, p.542-552 [Periódico revisado por pares]New York, NY, USA: ACMSem texto completo |