Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
Catalan structures and dynamic programming in H-minor-free graphsDorn, Frederic ; Fomin, Fedor V. ; Thilikos, Dimitrios M.Journal of computer and system sciences, 2012-09, Vol.78 (5), p.1606-1622 [Periódico revisado por pares]Elsevier IncTexto completo disponível |
|
2 |
Material Type: Artigo
|
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-UpFomin, Fedor V. ; Thilikos, Dimitrios M.SIAM journal on computing, 2006-01, Vol.36 (2), p.281-309 [Periódico revisado por pares]Philadelphia: Society for Industrial and Applied MathematicsTexto completo disponível |
|
3 |
Material Type: Artigo
|
On exact algorithms for treewidthBodlaender, Hans L. ; Fomin, Fedor V. ; Koster, Arie M. C. A. ; Kratsch, Dieter ; Thilikos, Dimitrios M.ACM transactions on algorithms, 2012-12, Vol.9 (1), p.1-23 [Periódico revisado por pares]Association for Computing MachineryTexto completo disponível |
|
4 |
Material Type: Artigo
|
Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphsDemaine, Erik D. ; Fomin, Fedor V. ; Hajiaghayi, Mohammadtaghi ; Thilikos, Dimitrios M.ACM transactions on algorithms, 2005-07, Vol.1 (1), p.33-47 [Periódico revisado por pares]Texto completo disponível |
|
5 |
Material Type: Artigo
|
Efficient Computation of Representative Families with Applications in Parameterized and Exact AlgorithmsFomin, Fedor V ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, SaketJournal of the ACM, 2016-11, Vol.63 (4), p.1-60 [Periódico revisado por pares]New York: Association for Computing MachineryTexto completo disponível |
|
6 |
Material Type: Artigo
|
Excluded Grid Minors and Efficient Polynomial-Time Approximation SchemesFomin, Fedorr V. ; Lokshtanov, Daniel ; Saurabh, SaketJournal of the ACM, 2018-03, Vol.65 (2), p.1-44 [Periódico revisado por pares]New York: Association for Computing MachineryTexto completo disponível |
|
7 |
Material Type: Artigo
|
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphsDEMAINE, Erik D ; FOMIN, Fedor V ; HAJIAGHAYI, Mohammadtaghi ; THILIKOS, Dimitrios MJournal of the ACM, 2005-11, Vol.52 (6), p.866-893 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
|
8 |
Material Type: Artigo
|
A Measure & Conquer Approach for the Analysis of Exact AlgorithmsFOMIN, Fedor V ; GRANDONI, Fabrizio ; KRATSCH, DieterJournal of the ACM, 2009-08, Vol.56 (5), p.1-32 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
|
9 |
Material Type: Artigo
|
Subexponential Parameterized Algorithm for Minimum Fill-InFomin, Fedor V ; Villanger, YngveSIAM journal on computing, 2013-01, Vol.42 (6), p.2197-2216 [Periódico revisado por pares]Philadelphia: Society for Industrial and Applied MathematicsSem texto completo |
|
10 |
Material Type: Artigo
|
A linear vertex kernel for maximum internal spanning treeFomin, Fedor V. ; Gaspers, Serge ; Saurabh, Saket ; Thomassé, StéphanJournal of computer and system sciences, 2013-02, Vol.79 (1), p.1-6 [Periódico revisado por pares]Elsevier IncTexto completo disponível |