Fedor V. Fomin

Cited by

	All	Since 2018
Citations	15825	7746
h-index	61	35
i10-index	214	145

1600

800

400

1200

20032004200520062007200820092010201120122013201420152016201720182019202020212022202357 88 170 264 207 378 495 523 584 652 749 770 778 892 1080 1105 1148 1318 1337 1533 1290

Public access

View all

102 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. ThilikosDepartment of Mathematics, National and Kapodistrian University of AthensVerified 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 PanolanIndian Institute of Technology HyderabadVerified email at iith.ac.in
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
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified email at cs.rwth-aachen.de
Hajo BroersmaFaculty EEMCS, University of Twente, NLVerified email at utwente.nl
Kirill SimonovPostdoc, TU WienVerified email at ac.tuwien.ac.at
Pierre FraigniaudCNRS and Université Paris CitéVerified email at irif.fr
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 4 (8), 2015	2541	2015
Exact Exponential Algorithms FV Fomin, P Kaski Communications of the ACM 56 (3), 80-88, 2013	639	2013
Exact Exponential Algorithms FV Fomin, D Kratsch	639	2010
An annotated bibliography on guaranteed graph searching FV Fomin, DM Thilikos Theoretical computer science 399 (3), 236-245, 2008	447	2008
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	398	2005
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	398	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	344	2016
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	299	2009
Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019	290	2019
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	217	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	216	2006
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos SIAM Journal on Computing 49 (6), 1397-1422, 2020	215	2020
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	213	2013
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 F Grandoni, D Kratsch SODA, 18-25, 2006	197	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	192*	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	186	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	184	2005
Measure and conquer: Domination–a case study FV Fomin, F Grandoni, D Kratsch Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005	180	2005
(Meta) kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 1-69, 2016	174	2016

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