Fedor V. Fomin

Cited by

	All	Since 2017
Citations	14133	7070
h-index	59	35
i10-index	201	137

1500

750

375

1125

2003200420052006200720082009201020112012201320142015201620172018201920202021202259 87 166 271 204 404 521 564 602 641 764 791 787 892 1073 1123 1165 1333 1494 870

Public access

View all

104 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
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 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
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
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified email at cs.rwth-aachen.de
Hajo BroersmaFaculty EEMCS, University of Twente, NLVerified email at utwente.nl
MohammadTaghi HajiaghayiACM Fellow, Jack and Rita Minker Professor of Computer Science, University of Maryland, College ParkVerified email at cs.umd.edu
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	2051	2015
Exact Exponential Algorithms FV Fomin, P Kaski Communications of the ACM 56 (3), 80-88, 2013	580	2013
Exact Exponential Algorithms FV Fomin, D Kratsch	580	2010
An annotated bibliography on guaranteed graph searching FV Fomin, DM Thilikos Theoretical computer science 399 (3), 236-245, 2008	417	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	379	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	379	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	305	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	275	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	215	2006
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010	212	2010
Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019	204	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	197	2012
Measure and conquer: A simple O (20. 288 n) independent set algorithm FV Fomin, F Grandoni, D Kratsch SODA 6, 18-25, 2006	189	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	188*	2010
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	188	2008
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	186	2013
Measure and conquer: Domination–a case study FV Fomin, F Grandoni, D Kratsch International Colloquium on Automata, Languages, and Programming, 191-203, 2005	182	2005
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	180*	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	167	2005
(Meta) kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 1-69, 2016	165	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 this author

Cited by

Co-authors