Fedor V. Fomin
Fedor V. Fomin
Professor of Computer Science, University of Bergen
Email verificata su uib.no - Home page
TitoloCitata daAnno
Parameterized algorithms
M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ...
Springer 4 (8), 2015
10012015
Exact Exponential Algorithms
FV Fomin, P Kaski
Communications of the ACM 56 (3), 80-88, 2013
4342013
Exact Exponential Algorithms
FV Fomin, D Kratsch
4342010
An annotated bibliography on guaranteed graph searching
FV Fomin, DM Thilikos
Theoretical computer science 399 (3), 236-245, 2008
3162008
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
315*2005
A measure & conquer approach for the analysis of exact algorithms
FV Fomin, F Grandoni, D Kratsch
Journal of the ACM (JACM) 56 (5), 25, 2009
2222009
Dominating sets in planar graphs: branch-width and exponential speed-up
FV Fomin, DM Thilikos
SIAM Journal on Computing 36 (2), 281-309, 2006
2022006
Measure and conquer: a simple O (2 0.288 n) independent set algorithm
FV Fomin, F Grandoni, D Kratsch
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
1932006
Bidimensionality and kernels
FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
1842010
Measure and conquer: domination–a case study
FV Fomin, F Grandoni, D Kratsch
International Colloquium on Automata, Languages, and Programming, 191-203, 2005
1762005
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
1712016
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
F Dorn, E Penninkx, HL Bodlaender, FV Fomin
Algorithmica 58 (3), 790-810, 2010
166*2010
(Meta) kernelization
HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ...
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 629-638, 2009
1632009
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
1552008
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs
ED Demaine, FV Fomin, M Hajiaghayi, DM Thilikos
ACM Transactions on Algorithms (TALG) 1 (1), 33-47, 2005
1482005
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), 9, 2008
146*2008
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
1432012
Exact algorithms for treewidth and minimum fill-in
FV Fomin, D Kratsch, I Todinca, Y Villanger
SIAM Journal on Computing 38 (3), 1058-1079, 2008
137*2008
Exact (exponential) algorithms for the dominating set problem
FV Fomin, D Kratsch, GJ Woeginger
International Workshop on Graph-Theoretic Concepts in Computer Science, 245-256, 2004
1302004
Kernel (s) for problems with no kernel: On out-trees with many leaves
D Binkele-Raible, H Fernau, FV Fomin, D Lokshtanov, S Saurabh, ...
ACM Transactions on Algorithms (TALG) 8 (4), 38, 2012
127*2012
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20