Obserwuj
Fedor V. Fomin
Tytuł
Cytowane przez
Cytowane przez
Rok
Parameterized algorithms
M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ...
Springer 5 (4), 16, 2015
30472015
Exact Exponential Algorithms
FV Fomin, P Kaski
Communications of the ACM 56 (3), 80-88, 2013
7312013
Exact Exponential Algorithms
FV Fomin, D Kratsch
7312010
An annotated bibliography on guaranteed graph searching
FV Fomin, DM Thilikos
Theoretical computer science 399 (3), 236-245, 2008
4442008
Lower bounds based on the exponential-time hypothesis
M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ...
Parameterized Algorithms, 467-521, 2015
4052015
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
ED Demaine, FV Fomin, M Hajiaghayi, DM Thilikos
Journal of the ACM (JACM) 52 (6), 866-893, 2005
3882005
A 5-Approximation Algorithm for Treewidth
HL Bodlaender, PG Drange, MS Dregi, FV Fomin, D Lokshtanov, ...
SIAM Journal on Computing 45 (2), 317-378, 2016
3812016
Kernelization: theory of parameterized preprocessing
FV Fomin, D Lokshtanov, S Saurabh, M Zehavi
Cambridge University Press, 2019
3532019
A measure & conquer approach for the analysis of exact algorithms
FV Fomin, F Grandoni, D Kratsch
Journal of the ACM (JACM) 56 (5), 1-32, 2009
3212009
Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I
FV Fomin, R Freivalds, M Kwiatkowska, D Peleg
Springer, 2013
2512013
Planar F-deletion: Approximation, kernelization and optimal FPT algorithms
FV Fomin, D Lokshtanov, N Misra, S Saurabh
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 470-479, 2012
2352012
Dominating sets in planar graphs: branch-width and exponential speed-up
FV Fomin, DM Thilikos
SIAM Journal on Computing 36 (2), 281-309, 2006
2272006
Bidimensionality and kernels
FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
2192010
Efficient computation of representative families with applications in parameterized and exact algorithms
FV Fomin, D Lokshtanov, F Panolan, S Saurabh
Journal of the ACM (JACM) 63 (4), 1-60, 2016
2022016
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
F Dorn, E Penninkx, HL Bodlaender, FV Fomin
Algorithmica 58 (3), 790-810, 2010
200*2010
Measure and conquer: A simple O (20. 288 n) independent set algorithm
FV Fomin, F Grandoni, D Kratsch
SODA 6, 18-25, 2006
1982006
Improved algorithms for feedback vertex set problems
J Chen, FV Fomin, Y Liu, S Lu, Y Villanger
Journal of Computer and System Sciences 74 (7), 1188-1198, 2008
1962008
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications
FV Fomin, F Grandoni, AV Pyatkin, AA Stepanov
ACM Transactions on Algorithms (TALG) 5 (1), 1-17, 2008
195*2008
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs
ED Demaine, FV Fomin, MT Hajiaghayi, DM Thilikos
ACM Transactions on Algorithms (TALG) 1 (1), 33-47, 2005
1952005
Measure and conquer: Domination–a case study
FV Fomin, F Grandoni, D Kratsch
Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005
1822005
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20