Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
Connected graph searchingBarrière, Lali ; Flocchini, Paola ; Fomin, Fedor V. ; Fraigniaud, Pierre ; Nisse, Nicolas ; Santoro, Nicola ; Thilikos, Dimitrios M.Information and computation, 2012-10, Vol.219, p.1-16 [Periódico revisado por pares]Elsevier IncTexto completo disponível |
|
2 |
Material Type: Artigo
|
Parameterized complexity of the anchored k-core problem for directed graphsChitnis, Rajesh ; Fomin, Fedor V. ; Golovach, Petr A.Information and computation, 2016-04, Vol.247, p.11-22 [Periódico revisado por pares]Elsevier IncTexto completo disponível |
|
3 |
Material Type: Artigo
|
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphsDorn, Frederic ; Fomin, Fedor V. ; Lokshtanov, Daniel ; Raman, Venkatesh ; Saurabh, SaketInformation and computation, 2013-12, Vol.233, p.60-70 [Periódico revisado por pares]Elsevier IncTexto completo disponível |
|
4 |
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 |
|
5 |
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 |