Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Article
|
Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal CliquesFomin, Fedor V. ; Liedloff, Mathieu ; Montealegre, Pedro ; Todinca, IoanAlgorithmica, 2018-04, Vol.80 (4), p.1146-1169 [Peer Reviewed Journal]New York: Springer USFull text available |
|
2 |
Material Type: Article
|
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut DecompositionsDorn, Frederic ; Penninkx, Eelko ; Bodlaender, Hans L. ; Fomin, Fedor V.Algorithmica, 2010-11, Vol.58 (3), p.790-810 [Peer Reviewed Journal]New York: Springer-VerlagFull text available |
|
3 |
Material Type: Article
|
On Two Techniques of Combining Branching and TreewidthFomin, Fedor V. ; Gaspers, Serge ; Saurabh, Saket ; Stepanov, Alexey A.Algorithmica, 2009-06, Vol.54 (2), p.181-207 [Peer Reviewed Journal]New York: Springer-VerlagFull text available |
|
4 |
Material Type: Article
|
On the Tractability of Optimization Problems on H-GraphsFomin, Fedor V. ; Golovach, Petr A. ; Raymond, Jean-FlorentAlgorithmica, 2020-09, Vol.82 (9), p.2432-2473 [Peer Reviewed Journal]New York: Springer USFull text available |
|
5 |
Material Type: Article
|
Approximating Long Cycle Above Dirac’s GuaranteeFomin, Fedor V. ; Golovach, Petr A. ; Sagunov, Danil ; Simonov, KirillAlgorithmica, 2024-08, Vol.86 (8), p.2676-2713 [Peer Reviewed Journal]New York: Springer USFull text available |
|
6 |
Material Type: Article
|
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 [Peer Reviewed Journal]New York: Springer-VerlagFull text available |
|
7 |
Material Type: Article
|
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 [Peer Reviewed Journal]New York: Springer-VerlagFull text available |
|
8 |
Material Type: Article
|
On the Parameterized Complexity of the Expected Coverage ProblemFomin, Fedor V. ; Ramamoorthi, VijayaragunathanTheory of computing systems, 2022-04, Vol.66 (2), p.432-453 [Peer Reviewed Journal]New York: Springer USFull text available |
|
9 |
Material Type: Article
|
Diverse Pairs of MatchingsFomin, Fedor V. ; Golovach, Petr A. ; Jaffke, Lars ; Philip, Geevarghese ; Sagunov, DanilAlgorithmica, 2024-06, Vol.86 (6), p.2026-2040 [Peer Reviewed Journal]New York: Springer USFull text available |
|
10 |
Material Type: Article
|
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 [Peer Reviewed Journal]New York: Springer USFull text available |