Fedor V. Fomin

Cited by

	All	Since 2019
Citations	17317	7860
h-index	63	35
i10-index	223	143

1600

800

400

1200

200320042005200620072008200920102011201220132014201520162017201820192020202120222023202467 90 166 262 211 382 503 535 589 666 736 792 824 918 1125 1195 1247 1298 1314 1513 1580 896

Public access

View all

114 articles

4 articles

available

not available

Based on funding mandates

Co-authors

Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Daniel LokshtanovProfessor of Computer Science, UCSBVerified email at ucsb.edu
Petr GolovachUniversity of BergenVerified email at ii.uib.no
Dimitrios M. ThilikosVerified email at thilikos.info
Michał PilipczukUniversity of WarsawVerified email at mimuw.edu.pl
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerified email at univ-lorraine.fr
Dániel MarxCISPA Helmholtz Center for Information SecurityVerified email at cispa.saarland
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Yngve VillangerUniversity of BergenVerified email at uib.no
Hans L. BodlaenderProfessor Computer Science, Utrecht UniversityVerified email at uu.nl
Fahad PanolanSchool of Computing, University of LeedsVerified email at leeds.ac.uk
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiVerified email at mimuw.edu.pl
Meirav ZehaviBen-Gurion University of the NegevVerified email at bgu.ac.il
Serge GaspersProfessor, UNSW Sydney, AustraliaVerified email at cse.unsw.edu.au
Fabrizio GrandoniProfessor, IDSIA, USI-SUPSI, SwitzerlandVerified email at idsia.ch
Kirill SimonovPostdoc, TU WienVerified email at ac.tuwien.ac.at
Pierre FraigniaudCNRS and Université Paris CitéVerified email at irif.fr
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified email at cs.rwth-aachen.de
Hajo BroersmaFaculty EEMCS, University of Twente, NLVerified email at utwente.nl
Lukasz KowalikUniversity of WarsawVerified email at mimuw.edu.pl

Fedor V. Fomin

Professor of Computer Science, University of Bergen

Verified email at uib.no - Homepage

Parameterized Complexity Graph Algorithms Discrete Mathematics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015	2882	2015
Exact Exponential Algorithms FV Fomin, P Kaski Communications of the ACM 56 (3), 80-88, 2013	693	2013
Exact Exponential Algorithms FV Fomin, D Kratsch	693	2010
An annotated bibliography on guaranteed graph searching FV Fomin, DM Thilikos Theoretical computer science 399 (3), 236-245, 2008	426	2008
Lower bounds based on the exponential-time hypothesis M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Parameterized Algorithms, 467-521, 2015	396	2015
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	377	2005
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	367	2016
Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019	331	2019
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	314	2009
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	242	2013
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	229	2012
Dominating sets in planar graphs: branch-width and exponential speed-up FV Fomin, DM Thilikos SIAM Journal on Computing 36 (2), 281-309, 2006	226	2006
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010	217	2010
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	197	2016
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions F Dorn, E Penninkx, HL Bodlaender, FV Fomin Algorithmica 58 (3), 790-810, 2010	197*	2010
Measure and conquer: A simple O (20. 288 n) independent set algorithm FV Fomin, F Grandoni, D Kratsch SODA 6, 18-25, 2006	195	2006
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	194*	2008
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	194	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	193	2005
Measure and conquer: Domination–a case study FV Fomin, F Grandoni, D Kratsch Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005	181	2005

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors