BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Denmark
1 × Finland
1 × Greece
1 × Iceland
1 × Japan
1 × Poland
1 × Portugal
1 × The Netherlands
1 × United Kingdom
Collaborated with:
D.M.Thilikos S.Saurabh P.A.Golovach D.Kratsch Y.Villanger D.Lokshtanov O.Amini F.F.Dragan F.Dorn F.Grandoni I.Todinca A.Golovnev A.S.Kulikov I.Mihajlin J.Nederlof M.Pilipczuk E.D.Demaine M.T.Hajiaghayi P.Kaski F.Panolan N.Alon G.Gutin M.Krivelevich M.Basavaraju P.Misra M.S.Ramanujan M.R.Fellows E.Losievskaja F.A.Rosamond
Talks about:
algorithm (7) parameter (5) graph (5) exponenti (3) treewidth (2) homomorph (2) problem (2) paramet (2) fix (2) subexponenti (1)

Person: Fedor V. Fomin

DBLP DBLP: Fomin:Fedor_V=

Facilitated 2 volumes:

ICALP (1) 2013Ed
ICALP (2) 2013Ed

Contributed to:

ICALP (1) 20152015
ICALP (1) 20142014
ICALP (2) 20122012
ICALP (1) 20092009
ICALP (1) 20082008
ICALP 20072007
ICALP 20052005
ICALP 20042004
ICALP 20032003

Wrote 14 papers:

ICALP-v1-2015-FominGKM #bound #graph #morphism #problem
Lower Bounds for the Graph Homomorphism Problem (FVF, AG, ASK, IM), pp. 481–493.
ICALP-v1-2015-FominKLPS #algorithm #polynomial
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (FVF, PK, DL, FP, SS), pp. 494–505.
ICALP-v1-2014-BasavarajuFGMRS #algorithm
Parameterized Algorithms to Preserve Connectivity (MB, FVF, PAG, PM, MSR, SS), pp. 800–811.
ICALP-v2-2012-FominGNP #game studies #multi
Minimizing Rosenthal Potential in Multicast Games (FVF, PAG, JN, MP), pp. 525–536.
ICALP-v1-2009-AminiFS #morphism
Counting Subgraphs via Homomorphisms (OA, FVF, SS), pp. 71–82.
ICALP-v1-2009-FellowsFLLRS #parametricity
Distortion Is Fixed Parameter Tractable (MRF, FVF, DL, EL, FAR, SS), pp. 463–474.
ICALP-A-2008-DraganFG #graph
Spanners in Sparse Graphs (FFD, FVF, PAG), pp. 597–608.
ICALP-A-2008-FominV #combinator
Treewidth Computation and Extremal Combinatorics (FVF, YV), pp. 210–221.
ICALP-2007-AlonFGKS #algorithm #problem
Parameterized Algorithms for Directed Maximum Leaf Problems (NA, FVF, GG, MK, SS), pp. 352–362.
ICALP-2007-DornFT #algorithm
Subexponential Parameterized Algorithms (FD, FVF, DMT), pp. 15–27.
ICALP-2005-FominGK #case study
Measure and Conquer: Domination — A Case Study (FVF, FG, DK), pp. 191–203.
ICALP-2004-FominKT #algorithm #exponential
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In (FVF, DK, IT), pp. 568–580.
ICALP-2004-FominT #algorithm #exponential #graph #kernel #linear #performance
Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up (FVF, DMT), pp. 581–592.
ICALP-2003-DemaineFHT #algorithm #graph #parametricity
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs (EDD, FVF, MTH, DMT), pp. 829–844.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.