Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Article
|
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 [Peer Reviewed Journal]Philadelphia: Society for Industrial and Applied MathematicsFull text available |
|
2 |
Material Type: Article
|
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 [Peer Reviewed Journal]Elsevier IncFull text available |
|
3 |
Material Type: Article
|
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 [Peer Reviewed Journal]Elsevier IncFull text available |
|
4 |
Material Type: Article
|
Efficient Computation of Representative Families with Applications in Parameterized and Exact AlgorithmsFomin, Fedor V ; Lokshtanov, Daniel ; Panolan, Fahad ; Saurabh, SaketJournal of the ACM, 2016-11, Vol.63 (4), p.1-60 [Peer Reviewed Journal]New York: Association for Computing MachineryFull text available |
|
5 |
Material Type: Article
|
(Meta) KernelizationBodlaender, Hans L ; Fomin, Fedor V ; Lokshtanov, Daniel ; Penninkx, Eelko ; Saurabh, Saket ; Thilikos, Dimitrios MJournal of the ACM, 2016-12, Vol.63 (5), p.1-69 [Peer Reviewed Journal]New York: Association for Computing MachineryFull text available |
|
6 |
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 |
|
7 |
Material Type: Article
|
Diverse collections in matroids and graphsFomin, Fedor V. ; Golovach, Petr A. ; Panolan, Fahad ; Philip, Geevarghese ; Saurabh, SaketMathematical programming, 2024, Vol.204 (1-2), p.415-447 [Peer Reviewed Journal]Berlin/Heidelberg: Springer Berlin HeidelbergFull text available |
|
8 |
Material Type: Article
|
Excluded Grid Minors and Efficient Polynomial-Time Approximation SchemesFomin, Fedorr V. ; Lokshtanov, Daniel ; Saurabh, SaketJournal of the ACM, 2018-03, Vol.65 (2), p.1-44 [Peer Reviewed Journal]New York: Association for Computing MachineryFull text available |
|
9 |
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 |
|
10 |
Material Type: Article
|
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphsDEMAINE, Erik D ; FOMIN, Fedor V ; HAJIAGHAYI, Mohammadtaghi ; THILIKOS, Dimitrios MJournal of the ACM, 2005-11, Vol.52 (6), p.866-893 [Peer Reviewed Journal]New York, NY: Association for Computing MachineryFull text available |