Fedor V. Fomin

Cited by

	All	Since 2017
Citations	13464	6341
h-index	58	33
i10-index	201	129

1500

750

375

1125

2003200420052006200720082009201020112012201320142015201620172018201920202021202259 90 168 270 201 422 526 570 592 667 740 792 778 879 1048 1106 1213 1451 1410 100

Public access

View all

102 articles

8 articles

available

not available

Based on funding mandates

Co-authors

Saket SaurabhProfessor at Institute of Mathematical SciencesVerified email at imsc.res.in
Daniel LokshtanovAssociate Professor in 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
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Yngve VillangerUniversity of BergenVerified email at uib.no
Dániel MarxCISPA Helmholtz Center for Information SecurityVerified email at cispa.saarland
Hans L. BodlaenderProfessor Computer Science, Utrecht University and Technical University EindhovenVerified 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
Serge GaspersProfessor, UNSW Sydney, AustraliaVerified email at cse.unsw.edu.au
Fabrizio GrandoniProfessor, IDSIA, USI-SUPSI, SwitzerlandVerified email at idsia.ch
Meirav ZehaviBen-Gurion University of the NegevVerified email at bgu.ac.il
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College ParkVerified email at cs.umd.edu
Hajo BroersmaFaculty EEMCS, University of Twente, NLVerified email at utwente.nl
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified email at cs.rwth-aachen.de
Pierre FraigniaudCNRS and University Paris DiderotVerified email at liafa.univ-paris-diderot.fr
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerified email at mit.edu

Fedor V. Fomin

Professor of Computer Science, University of Bergen

Verified email at uib.no - Homepage

Parameterized Complexity Graph Algorithms


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	1848	2015
Exact Exponential Algorithms FV Fomin, P Kaski Communications of the ACM 56 (3), 80-88, 2013	553	2013
Exact Exponential Algorithms FV Fomin, D Kratsch	553	2010
An annotated bibliography on guaranteed graph searching FV Fomin, DM Thilikos Theoretical computer science 399 (3), 236-245, 2008	428	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	372	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	372	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	284	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	268	2009
Dominating sets in planar graphs: branch-width and exponential speed-up FV Fomin, DM Thilikos SIAM Journal on Computing 36 (2), 281-309, 2006	217	2006
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010	210	2010
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	187	2012
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
Measure and conquer: A simple O (20. 288 n) independent set algorithm FV Fomin, F Grandoni, D Kratsch SODA 6, 18-25, 2006	184	2006
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions F Dorn, E Penninkx, HL Bodlaender, FV Fomin Algorithmica 58 (3), 790-810, 2010	182*	2010
Measure and conquer: Domination–a case study FV Fomin, F Grandoni, D Kratsch International Colloquium on Automata, Languages, and Programming, 191-203, 2005	180	2005
Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019	170	2019
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	169*	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	164	2005
(Meta) kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 1-69, 2016	159	2016
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	154*	2008

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 this author

Cited by

Co-authors