Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
A measure & conquer approach for the analysis of exact algorithmsFomin, Fedor ; Grandoni, Fabrizio ; Kratsch, DieterJournal of the ACM, 2009-08, Vol.56 (5), p.1-32 [Periódico revisado por pares]New York, NY: ACMTexto completo disponível |
|
2 |
Material Type: Artigo
|
Efficient Computation of Representative Families with Applications in Parameterized and Exact AlgorithmsFomin, Fedor ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, SaketJournal of the ACM, 2016-11, Vol.63 (4), p.1-60 [Periódico revisado por pares]New York: ACMTexto completo disponível |
|
3 |
Material Type: Artigo
|
Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphsDemaine, Erik ; Fomin, Fedor ; Hajiaghayi, Mohammadtaghi ; Thilikos, DimitriosJournal of the ACM, 2005-11, Vol.52 (6), p.866-893 [Periódico revisado por pares]New York, NY: ACMTexto completo disponível |
|
4 |
Material Type: Artigo
|
Exact Algorithms via Monotone Local SearchFomin, Fedor ; Gaspers, Serge ; Lokshtanov, Daniel ; Saurabh, SaketJournal of the ACM, 2019-04, Vol.66 (2), p.1-23 [Periódico revisado por pares]New York: ACMTexto completo disponível |
|
5 |
Material Type: Artigo
|
Exact Algorithms for Terrain GuardingAshok, Pradeesha ; Fomin, Fedor ; Kolay, Sudeshna ; Saurabh, Saket ; Zehavi, MeiravACM transactions on algorithms, 2018-06, Vol.14 (2), p.1-20 [Periódico revisado por pares]ACMTexto completo disponível |
|
6 |
Material Type: Artigo
|
(Meta) KernelizationBodlaender, Hans ; Fomin, Fedor ; Lokshtanov, Daniel ; Penninkx, Eelko ; Saurabh, Saket ; Thilikos, DimitriosJournal of the ACM, 2016-12, Vol.63 (5), p.1-69 [Periódico revisado por pares]New York: ACMTexto completo disponível |
|
7 |
Material Type: Artigo
|
Multiplicative Parameterization Above a GuaranteeFomin, Fedor V. ; Golovach, Petr A. ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, MeiravACM transactions on computation theory, 2021-09, Vol.13 (3), p.1-16 [Periódico revisado por pares]Texto completo disponível |
|
8 |
Material Type: Artigo
|
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower BoundsFomin, Fedor V. ; Lokshtanov, Daniel ; Mihajlin, Ivan ; Saurabh, Saket ; Zehavi, MeiravACM transactions on computation theory, 2021-06, Vol.13 (2), p.1-25, Article 10 [Periódico revisado por pares]New York, NY, USA: ACMTexto completo disponível |
|
9 |
Material Type: Artigo
|
Tight Lower Bounds on Graph Embedding ProblemsCygan, Marek ; Fomin, Fedor ; Golovnev, Alexander ; Kulikov, Alexander ; Mihajlin, Ivan ; Pachocki, Jakub ; Socała, ArkadiuszJournal of the ACM, 2017-06, Vol.64 (3), p.1-22 [Periódico revisado por pares]New York: ACMTexto completo disponível |
|
10 |
Material Type: Artigo
|
Excluded Grid Minors and Efficient Polynomial-Time Approximation SchemesFomin, Fedorr ; Lokshtanov, Daniel ; Saurabh, SaketJournal of the ACM, 2018-03, Vol.65 (2), p.1-44 [Periódico revisado por pares]New York: ACMTexto completo disponível |