Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
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 |
2 |
Material Type: Artigo
|
![]() |
On the optimality of pseudo-polynomial algorithms for integer programmingFomin, Fedor V. ; Panolan, Fahad ; Ramanujan, M. S. ; Saurabh, SaketMathematical programming, 2023-03, Vol.198 (1), p.561-593 [Periódico revisado por pares]Berlin/Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
3 |
Material Type: Artigo
|
![]() |
On the Parameterized Complexity of Graph Modification to First-Order Logic PropertiesFomin, Fedor V. ; Golovach, Petr A. ; Thilikos, Dimitrios M.Theory of computing systems, 2020-02, Vol.64 (2), p.251-271 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
4 |
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 |
5 |
Material Type: Artigo
|
![]() |
On the Parameterized Complexity of the Expected Coverage ProblemFomin, Fedor V. ; Ramamoorthi, VijayaragunathanTheory of computing systems, 2022-04, Vol.66 (2), p.432-453 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
A Note on Exact Algorithms for Vertex Ordering Problems on GraphsBodlaender, Hans L. ; Fomin, Fedor V. ; Koster, Arie M. C. A. ; Kratsch, Dieter ; Thilikos, Dimitrios M.Theory of computing systems, 2012-04, Vol.50 (3), p.420-432 [Periódico revisado por pares]New York: Springer-VerlagTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
Lossy Kernelization of Same-Size ClusteringBandyapadhyay, Sayan ; Fomin, Fedor V. ; Golovach, Petr A. ; Purohit, Nidhi ; Simonov, KirillTheory of computing systems, 2023-08, Vol.67 (4), p.785-824 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
INTRACTABILITY OF CLIQUE-WIDTH PARAMETERIZATIONSFOMIN, Fedor V ; GOLOVACH, Petr A ; LOKSHTANOV, Daniel ; SAURABH, SaketSIAM journal on computing, 2010, Vol.39 (5), p.1941-1956 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
Parameterized Complexity of Secluded Connectivity ProblemsFomin, Fedor V. ; Golovach, Petr A. ; Karpov, Nikolay ; Kulikov, Alexander S.Theory of computing systems, 2017-10, Vol.61 (3), p.795-819 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
Exact Algorithms for Treewidth and Minimum Fill-InFomin, Fedor V. ; Kratsch, Dieter ; Todinca, Ioan ; Villanger, YngveSIAM journal on computing, 2008-01, Vol.38 (3), p.1058-1079 [Periódico revisado por pares]Philadelphia: Society for Industrial and Applied MathematicsTexto completo disponível |