Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
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 |
2 |
Material Type: Artigo
|
![]() |
Parameterized Complexity of Directed Spanner ProblemsFomin, Fedor V. ; Golovach, Petr A. ; Lochet, William ; Misra, Pranabendu ; Saurabh, Saket ; Sharma, RoohaniAlgorithmica, 2022-08, Vol.84 (8), p.2292-2308 [Periódico revisado por pares]New York: Springer USTexto 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
|
![]() |
Parameterized Complexity of Broadcasting in GraphsFomin, Fedor V ; Fraigniaud, Pierre ; Golovach, Petr AarXiv.org, 2023-06Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
Stability in Graphs with Matroid ConstraintsFomin, Fedor V ; Golovach, Petr A ; Korhonen, Tuukka ; Saket SaurabharXiv.org, 2024-04Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
Computing paths of large rank in planar frameworks deterministicallyFomin, Fedor V ; Golovach, Petr A ; Korhonen, Tuukka ; Stamoulis, GiannosarXiv.org, 2023-05Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
Building large k-cores from sparse graphsFomin, Fedor V ; Sagunov, Danil ; Simonov, KirillarXiv.org, 2020-07Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on GraphsFomin, Fedor V ; Golovach, Petr A ; Thilikos, Dimitrios MarXiv.org, 2021-03Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
Finding Detours is Fixed-parameter TractableBezáková, Ivona ; Curticapean, Radu ; Dell, Holger ; Fomin, Fedor VarXiv.org, 2017-05Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph ProblemDidimo, Walter ; Fomin, Fedor V ; Golovach, Petr A ; Inamdar, Tanmay ; Kobourov, Stephen ; Sieper, Marie DianaarXiv.org, 2023-08Ithaca: Cornell University Library, arXiv.orgTexto completo disponível |