Fedor V. Fomin

Dikutip oleh

	Semua	Sejak 2020
Kutipan	18266	7494
indeks-h	64	33
indeks-i10	234	149

1600

800

400

1200

2003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202569 93 165 271 211 382 502 557 600 678 765 802 817 925 1081 1174 1225 1309 1300 1432 1496 1545 402

Akses publik

Lihat semua

120 artikel

7 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

Saket SaurabhProfessor at Institute of Mathematical SciencesEmail yang diverifikasi di imsc.res.in
Daniel LokshtanovProfessor of Computer Science, UCSBEmail yang diverifikasi di ucsb.edu
Petr GolovachUniversity of BergenEmail yang diverifikasi di ii.uib.no
Dimitrios M. ThilikosNational and Kapodistrian University of AthensEmail yang diverifikasi di thilikos.info
Michał PilipczukUniversity of WarsawEmail yang diverifikasi di mimuw.edu.pl
Dieter Kratschprofesseur d'informatique, Universite de LorraineEmail yang diverifikasi di univ-lorraine.fr
Dániel MarxCISPA Helmholtz Center for Information SecurityEmail yang diverifikasi di cispa.saarland
Marek CyganUniversity of WarsawEmail yang diverifikasi di mimuw.edu.pl
Yngve VillangerUniversity of BergenEmail yang diverifikasi di uib.no
Fahad PanolanSchool of Computing, University of LeedsEmail yang diverifikasi di leeds.ac.uk
Hans L. BodlaenderProfessor Computer Science, Utrecht UniversityEmail yang diverifikasi di uu.nl
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiEmail yang diverifikasi di mimuw.edu.pl
Meirav ZehaviBen-Gurion University of the NegevEmail yang diverifikasi di bgu.ac.il
Serge GaspersProfessor, UNSW Sydney, AustraliaEmail yang diverifikasi di cse.unsw.edu.au
Fabrizio GrandoniProfessor, IDSIA, USI-SUPSI, SwitzerlandEmail yang diverifikasi di idsia.ch
Kirill SimonovAssociate Professor, University of BergenEmail yang diverifikasi di uib.no
Pierre FraigniaudCNRS and Université Paris CitéEmail yang diverifikasi di irif.fr
Gerhard WoegingerProfessor of Computer Science, RWTH AachenEmail yang diverifikasi di cs.rwth-aachen.de
Lukasz KowalikUniversity of WarsawEmail yang diverifikasi di mimuw.edu.pl
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyEmail yang diverifikasi di mit.edu

Ikuti

Fedor V. Fomin

Professor of Computer Science, University of Bergen

Email yang diverifikasi di uib.no - Beranda

Theoretical Computer Science Parameterized Complexity Graph Algorithms Discrete Mathematics


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015	3160	2015
Exact Exponential Algorithms FV Fomin, P Kaski Communications of the ACM 56 (3), 80-88, 2013	738	2013
Exact Exponential Algorithms FV Fomin, D Kratsch	738	2010
An annotated bibliography on guaranteed graph searching FV Fomin, DM Thilikos Theoretical computer science 399 (3), 236-245, 2008	457	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	417	2015
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	388	2016
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	387	2005
Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019	365	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	332	2009
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	240	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	230	2006
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010	220	2010
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions F Dorn, E Penninkx, HL Bodlaender, FV Fomin Algorithmica 58 (3), 790-810, 2010	212*	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	210	2016
Measure and conquer: A simple O (20. 288 n) independent set algorithm FV Fomin, F Grandoni, D Kratsch SODA 6, 18-25, 2006	202	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	199*	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	199	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	196	2005
(Meta) kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 1-69, 2016	185	2016
Measure and conquer: Domination–a case study FV Fomin, F Grandoni, D Kratsch International Colloquium on Automata, Languages, and Programming, 191-203, 2005	183	2005

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama