Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Livro
|
Graph-theoretic concepts in computer science 32nd international workshop, WG 2006, Bergen, Norway, June 22-24, 2006 revised papersInternational Workshop WG (32nd 2006 Bergen, Norway) Fedor V FominBerlin Springer New York c2006Localização: ICMC - Inst. Ciên. Mat. Computação (68-02 LNCS v.4271 ) e outros locais(Acessar) |
|
2 |
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 |
|
3 |
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 |
|
4 |
Material Type: Artigo
|
An annotated bibliography on guaranteed graph searchingFomin, Fedor V. ; Thilikos, Dimitrios M.Theoretical computer science, 2008-06, Vol.399 (3), p.236-245 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
5 |
Material Type: Artigo
|
Diverse collections in matroids and graphsFomin, Fedor V. ; Golovach, Petr A. ; Panolan, Fahad ; Philip, Geevarghese ; Saurabh, SaketMathematical programming, 2024, Vol.204 (1-2), p.415-447 [Periódico revisado por pares]Berlin/Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
6 |
Material Type: Livro
|
Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthdayvan Leeuwen, Erik Jan ; Fomin, Fedor V. ; Kratsch, StefanCham: Springer International Publishing 2022Sem texto completo |
|
7 |
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 |
|
8 |
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 |
|
9 |
Material Type: Artigo
|
Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal CliquesFomin, Fedor V. ; Liedloff, Mathieu ; Montealegre, Pedro ; Todinca, IoanAlgorithmica, 2018-04, Vol.80 (4), p.1146-1169 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
10 |
Material Type: Artigo
|
On the complexity of some colorful problems parameterized by treewidthFellows, Michael R. ; Fomin, Fedor V. ; Lokshtanov, Daniel ; Rosamond, Frances ; Saurabh, Saket ; Szeider, Stefan ; Thomassen, CarstenInformation and computation, 2011-02, Vol.209 (2), p.143-153 [Periódico revisado por pares]Amsterdam: Elsevier IncTexto completo disponível |