Fedor V. Fomin

Cited by

	All	Since 2016
Citations	12175	6025
h-index	56	35
i10-index	188	123

1600

800

400

1200

200320042005200620072008200920102011201220132014201520162017201820192020202161 94 158 275 196 421 509 582 590 670 738 766 801 871 1103 1172 1250 1524 65

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. ThilikosDepartment of Mathematics, National and Kapodistrian University of Athens, AthensVerified email at math.uoa.gr
Dieter Kratschprofesseur d'informatique, Universite de LorraineVerified email at univ-lorraine.fr
Michał PilipczukUniversity of WarsawVerified email at mimuw.edu.pl
Yngve VillangerUniversity of BergenVerified email at uib.no
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Hans L. BodlaenderProfessor Computer Science, Utrecht University and Technical University EindhovenVerified email at uu.nl
Dániel MarxCISPA Helmholtz Center for Information SecurityVerified email at cispa.saarland
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiVerified email at mimuw.edu.pl
Fahad PanolanIndian Institute of Technology HyderabadVerified email at iith.ac.in
Serge GaspersAssociate Professor, 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
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerified email at mit.edu
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

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 4 (8), 2015	1466	2015
Exact Exponential Algorithms FV Fomin, P Kaski Communications of the ACM 56 (3), 80-88, 2013	506	2013
Exact Exponential Algorithms FV Fomin, D Kratsch	506	2010
An annotated bibliography on guaranteed graph searching FV Fomin, DM Thilikos Theoretical computer science 399 (3), 236-245, 2008	380	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	348*	2005
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	247	2009
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	240	2016
Dominating sets in planar graphs: branch-width and exponential speed-up FV Fomin, DM Thilikos SIAM Journal on Computing 36 (2), 281-309, 2006	209	2006
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010	198	2010
Measure and conquer: a simple O (2 0.288 n) independent set algorithm FV Fomin, F Grandoni, D Kratsch Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006	182	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	180*	2010
(Meta) kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 629-638, 2009	180	2009
Measure and conquer: domination–a case study FV Fomin, F Grandoni, D Kratsch International Colloquium on Automata, Languages, and Programming, 191-203, 2005	175	2005
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	172	2008
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	167	2012
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	159*	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	158	2005
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	148*	2008
Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings FV Fomin, R Freivalds, M Kwiatkowska, D Peleg Springer, 2013	143	2013
Exact (exponential) algorithms for the dominating set problem FV Fomin, D Kratsch, GJ Woeginger International Workshop on Graph-Theoretic Concepts in Computer Science, 245-256, 2004	139	2004

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

Upload PDF

Follow this author

Cited by

Co-authors