Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
11 |
Material Type: Artigo
|
Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk GraphsFomin, Fedor V. ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, MeiravDiscrete & computational geometry, 2019-12, Vol.62 (4), p.879-911 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
12 |
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 |
|
13 |
Material Type: Artigo
|
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphsFomin, Fedor V. ; Golovach, Petr A. ; Thilikos, Dimitrios M.Information and computation, 2023-08, Vol.293, p.105049, Article 105049 [Periódico revisado por pares]Elsevier IncTexto completo disponível |
|
14 |
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 |
|
15 |
Material Type: Artigo
|
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problemCohen, Nathann ; Fomin, Fedor V. ; Gutin, Gregory ; Kim, Eun Jung ; Saurabh, Saket ; Yeo, AndersJournal of computer and system sciences, 2010-11, Vol.76 (7), p.650-662 [Periódico revisado por pares]Elsevier IncTexto completo disponível |
|
16 |
Material Type: Artigo
|
Approximating Long Cycle Above Dirac’s GuaranteeFomin, Fedor V. ; Golovach, Petr A. ; Sagunov, Danil ; Simonov, KirillAlgorithmica, 2024-08, Vol.86 (8), p.2676-2713 [Periódico revisado por pares]New York: Springer USTexto completo disponível |
|
17 |
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 |
|
18 |
Material Type: Artigo
|
Computing Optimal Steiner Trees in Polynomial SpaceFomin, Fedor V. ; Grandoni, Fabrizio ; Kratsch, Dieter ; Lokshtanov, Daniel ; Saurabh, SaketAlgorithmica, 2013-03, Vol.65 (3), p.584-604 [Periódico revisado por pares]New York: Springer-VerlagTexto completo disponível |
|
19 |
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 |
|
20 |
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 |