Fedor V. Fomin - Concepedia

Author

Fedor V. Fomin

Also Known As

CSR 2018 Moskau, D. Kratsch, Dieter Kratsch, F. V. FOMIN, F.V. Fomin, Fedor Fomin, Fedor V Fomin, Fedor V. Fomin, Fedorr V. Fomin, Fomin, F. V.

706

Publications

13.8K

Citations

H-Index

Concepts

All Affiliations

University of Bergen Institute of Mathematical Sciences National and Kapodistrian University of Athens Utrecht University University of Warsaw

About

Fedor V. Fomin is an author at University of Bergen specializing in engineering, combinatorial optimization, and graph theory.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	47	123	6.8K
2	Education	16	23	809
3	Business	13	15	839
4	Law	1	1	12
5	Management	1	1	45

Fedor V. Fomin

160

Publications

7.9K

Citations

H-Index

Page 1

	Year	Citations
An annotated bibliography on guaranteed graph searching Fedor V. Fomin, Dimitrios M. Thilikos Theoretical Computer Science EngineeringGraph TheoryData ScienceInformation RetrievalKnowledge Discovery	2008	323
Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, Journal of the ACM Graph MinorEngineeringGraph TheoryAlgebraic Graph TheoryStructural Graph Theory	2005	320
A measure & conquer approach for the analysis of exact algorithms Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch Journal of the ACM Mathematical ProgrammingComputational Complexity TheoryEngineeringAnalysis Of AlgorithmComputational Complexity	2009	240
A $c^k n$ 5-Approximation Algorithm for Treewidth Hans L. Bodlaender, Pål Grønås Drange, Markus Sortland Dregi, SIAM Journal on Computing	2016	198
Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Journal of the ACM Mathematical ProgrammingComputational Complexity TheoryEfficient ComputationEngineeringAlgorithmic Library	2016	164
Bidimensionality and kernels Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Symposium on Discrete Algorithms Mathematical ProgrammingComputational Complexity TheoryEngineeringComputational ComplexityFunctional Analysis	2010	158
(Meta) Kernelization Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, EngineeringGraph TheoryLinear KernelsAlgebraic Graph TheoryStructural Graph Theory	2009	154
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Numerical AnalysisEngineeringPlanar GraphStructural Graph TheoryDiscrete Mathematics	2012	152
Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, ACM Transactions on Algorithms EngineeringPlanar GraphNetwork AnalysisEducationComputational Complexity	2005	145
Improved algorithms for feedback vertex set problems Jianer Chen, Fedor V. Fomin, Yang Liu, Journal of Computer and System Sciences Mathematical ProgrammingEngineeringGraph TheoryExtremal Graph TheoryStructural Graph Theory	2008	144

Page 1