Fomin, Fedor V.
Fedor Fomin investigador
Fomin, Fedor V., 1968-....
VIAF ID: 157860065 (Personal)
Permalink: http://viaf.org/viaf/157860065
Preferred Forms
- 100 0 _ ‡a Fedor Fomin ‡c investigador
- 100 1 _ ‡a Fomin, Fedor V.
- 100 1 _ ‡a Fomin, Fedor V.
-
-
- 100 1 _ ‡a Fomin, Fedor V.
-
-
-
- 100 1 _ ‡a Fomin, Fedor V.
- 100 1 _ ‡a Fomin, Fedor V., ‡d 1968-....
4xx's: Alternate Name Forms (7)
Works
Title | Sources |
---|---|
Algorithm theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012 : proceedings | |
Aspects algorithmiques et structurels des relations d'ordre partiel sur les graphes. | |
Automata, languages, and programming 40th international colloquium ; proceedings | |
Computer Science – Theory and Applications : 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, Proceedings | |
Dominating sets in planar graphs : branch-width and exponential speed-up | |
Exact Exponential Algorithms | |
Graph searching, elimination trees, and a generalization of bandwidth | |
Graph-theoretic concepts in computer science, c2006: | |
How to hunt an invisible rabbit on a graph | |
ICALP 2013 | |
k-Gap Interval Graphs | |
Kernel | |
Kernelization : theory of parameterized preprocessing | |
Large Induced Subgraphs via Triangulations and CMSO | |
Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n | |
Local search: Is brute-force avoidable? | |
Long Circuits and Large Euler Subgraphs | |
Measure and conquer | |
Metric Dimension of Bounded Width Graphs | |
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation | |
More About Subcolorings | |
Nondeterministic Graph Searching: From Pathwidth to Treewidth | |
On distance constrained labeling of disk graphs | |
On maximum number of minimal dominating sets in graphs | |
On self duality of pathwidth in polyhedral graph embeddings | |
On the domination search number | |
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms | |
On the monotonicity of games generated by symmetric submodular functions | |
On the parameterized complexity of vertex cover and edge cover with connectivity constraints | |
On tractability of Cops and Robbers game | |
Parameterized algorithms | |
Parameterized and exact computation : 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 1011, 2009 : revised selected papers | |
Parameterized complexity of the anchored k -core problem for directed graphs | |
Pathwidth of cubic graphs and exact algorithms | |
Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms | |
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult | |
Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin | |
Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? | |
Pursuing a fast robber on a graph | |
Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles | |
Radio Labeling with Preassigned Frequencies | |
Rank-width and tree-width of H -minor-free graphs | |
Ranking and Drawing in Subexponential Time | |
Representative Sets of Product Families | |
Searching for better fill-in | |
A simple and fast approach for solving problems on planar graphs | |
Solving Connected Dominating Set Faster than 2 n | |
Sort and Search: Exact algorithms for generalized domination | |
Spanners of bounded degree graphs | |
Spanning Directed Trees with Many Leaves | |
Special Issue on Parameterized Complexity of Discrete Optimization | |
Strengthening Erdös-Pósa property for minor-closed graph classes | |
Structural and algorithmic aspects of partial orderings of graphs | |
SWAT 2012 | |
Three Complexity Results on Coloring P k -Free Graphs | |
Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters | |
To Satisfy Impatient Web Surfers Is Hard | |
Tree decompositions with small cost | |
Treewidth computation and extremal combinatorics | |
Treewidth, Kernels, and Algorithms : Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday | |
Vertex Cover Structural Parameterization Revisited |