Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
11 |
Material Type: Artigo
|
Subquadratic Kernels for Implicit 3-H itting S et and 3-S et P acking ProblemsFomin, Fedor ; Le, Tien-Nam ; Lokshtanov, Daniel ; Saurabh, Saket ; Thomassé, Stéphan ; Zehavi, MeiravACM transactions on algorithms, 2019-01, Vol.15 (1), p.1-44 [Periódico revisado por pares]ACMTexto completo disponível |
|
12 |
Material Type: Artigo
|
On exact algorithms for treewidthBodlaender, Hans ; Fomin, Fedor ; Koster, Arie ; Kratsch, Dieter ; Thilikos, Dimitrios MACM transactions on algorithms, 2012-12, Vol.9 (1), p.1-23 [Periódico revisado por pares]ACMTexto completo disponível |
|
13 |
Material Type: Artigo
|
Shortest Cycles with Monotone Submodular CostsFomin, Fedor V. ; Golovach, Petr A. ; Korhonen, Tuukka ; Lokshtanov, Daniel ; Stamoulis, GiannosACM transactions on algorithms, 2023-11, Vol.20 (1), p.1-16, Article 2 [Periódico revisado por pares]New York, NY: ACMTexto completo disponível |
|
14 |
Material Type: Artigo
|
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low TreewidthFomin, Fedor ; Lokshtanov, Daniel ; Saurabh, Saket ; Pilipczuk, MichaŁ ; Wrochna, MarcinACM transactions on algorithms, 2018-07, Vol.14 (3), p.1-45 [Periódico revisado por pares]ACMTexto completo disponível |
|
15 |
Material Type: Artigo
|
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing ProblemsFomin, Fedor V. ; Le, Tien-Nam ; Lokshtanov, Daniel ; Saurabh, Saket ; Thomassé, Stéphan ; Zehavi, MeiravACM transactions on algorithms, 2019-01, Vol.15 (1), p.1-44 [Periódico revisado por pares]Association for Computing MachineryTexto completo disponível |
|
16 |
Material Type: Artigo
|
Deterministic Truncation of Linear MatroidsLokshtanov, Daniel ; Misra, Pranabendu ; Panolan, Fahad ; Saurabh, SaketACM transactions on algorithms, 2018-06, Vol.14 (2), p.1-20 [Periódico revisado por pares]ACMTexto completo disponível |
|
17 |
Material Type: Artigo
|
Linear Kernels and Single-Exponential Algorithms Via Protrusion DecompositionsKim, Eun ; Langer, Alexander ; Paul, Christophe ; Reidl, Felix ; Rossmanith, Peter ; Sau, Ignasi ; Sikdar, SomnathACM transactions on algorithms, 2016-02, Vol.12 (2), p.1-41 [Periódico revisado por pares]ACMTexto completo disponível |
|
18 |
Material Type: Artigo
|
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion ProblemsAgrawal, Akanksha ; Lokshtanov, Daniel ; Misra, Pranabendu ; Saurabh, Saket ; Zehavi, MeiravACM transactions on algorithms, 2020-09, Vol.16 (4), p.1-38 [Periódico revisado por pares]ACMTexto completo disponível |
|
19 |
Material Type: Artigo
|
Network Sparsification for Steiner Problems on Planar and Bounded-Genus GraphsPilipczuk, Marcin ; Pilipczuk, Michał ; Sankowski, Piotr ; Leeuwen, Erik Jan VanACM transactions on algorithms, 2018-10, Vol.14 (4), p.1-73, Article 53 [Periódico revisado por pares]New York, NY, USA: ACMTexto completo disponível |
|
20 |
Material Type: Artigo
|
Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete DigraphsBarbero, Florian ; Paul, Christophe ; Pilipczuk, MichaŁACM transactions on algorithms, 2018-07, Vol.14 (3), p.1-31 [Periódico revisado por pares]ACMTexto completo disponível |