Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
An annotated bibliography on guaranteed graph searchingFomin, Fedor V. ; Thilikos, Dimitrios M.Theoretical computer science, 2008-06, Vol.399 (3), p.236-245 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto 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
|
![]() |
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 |
4 |
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 |
5 |
Material Type: Artigo
|
![]() |
Preprocessing subgraph and minor problems: When does a small vertex cover help?Fomin, Fedor V. ; Jansen, Bart M.P. ; Pilipczuk, MichałJournal of computer and system sciences, 2014-03, Vol.80 (2), p.468-495 [Periódico revisado por pares]Elsevier IncTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
Faster exact algorithms for some terminal set problemsChitnis, Rajesh ; Fomin, Fedor V. ; Lokshtanov, Daniel ; Misra, Pranabendu ; Ramanujan, M.S. ; Saurabh, SaketJournal of computer and system sciences, 2017-09, Vol.88, p.195-207 [Periódico revisado por pares]Elsevier IncTexto completo disponível |
7 |
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 |
8 |
Material Type: Artigo
|
![]() |
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological MinorsFomin, Fedor V. ; Lokshtanov, Daniel ; Saurabh, Saket ; Thilikos, Dimitrios M.ACM transactions on algorithms, 2018-01, Vol.14 (1), p.1-31 [Periódico revisado por pares]Association for Computing MachineryTexto completo disponível |
9 |
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 |
10 |
Material Type: Artigo
|
![]() |
Fast Minor Testing in Planar GraphsAdler, Isolde ; Dorn, Frederic ; Fomin, Fedor V. ; Sau, Ignasi ; Thilikos, Dimitrios M.Algorithmica, 2012-09, Vol.64 (1), p.69-84 [Periódico revisado por pares]New York: Springer-VerlagTexto completo disponível |