| 2009 |
|---|
| 118 | EE | Fedor V. Fomin,
Petr A. Golovach,
Daniel Lokshtanov,
Saket Saurabh:
Clique-width: on the price of generality.
SODA 2009: 825-834 |
| 117 | EE | Henning Fernau,
Fedor V. Fomin,
Daniel Lokshtanov,
Daniel Raible,
Saket Saurabh,
Yngve Villanger:
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves.
STACS 2009: 421-432 |
| 116 | EE | Fedor V. Fomin,
Petr A. Golovach,
Dimitrios M. Thilikos:
Approximating Acyclicity Parameters of Sparse Hypergraphs.
STACS 2009: 445-456 |
| 115 | EE | Fedor V. Fomin,
Pierre Fraigniaud,
Nicolas Nisse:
Nondeterministic Graph Searching: From Pathwidth to Treewidth.
Algorithmica 53(3): 358-373 (2009) |
| 114 | EE | Nathann Cohen,
Fedor V. Fomin,
Gregory Gutin,
Eun Jung Kim,
Saket Saurabh,
Anders Yeo:
Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem
CoRR abs/0903.0938: (2009) |
| 113 | EE | Hans L. Bodlaender,
Fedor V. Fomin,
Daniel Lokshtanov,
Eelko Penninkx,
Saket Saurabh,
Dimitrios M. Thilikos:
(Meta) Kernelization
CoRR abs/0904.0727: (2009) |
| 2008 |
|---|
| 112 | | Fedor V. Fomin,
Saket Saurabh,
Dimitrios M. Thilikos:
Improving the gap of Erdös-Pósa property for minor-closed graph classes.
CTW 2008: 2-6 |
| 111 | EE | Fedor V. Fomin,
Fabrizio Grandoni,
Dieter Kratsch:
Faster Steiner Tree Computation in Polynomial-Space.
ESA 2008: 430-441 |
| 110 | EE | Omid Amini,
Fedor V. Fomin,
Saket Saurabh:
Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract).
FSTTCS 2008 |
| 109 | EE | Fedor V. Fomin,
Yngve Villanger:
Treewidth Computation and Extremal Combinatorics.
ICALP (1) 2008: 210-221 |
| 108 | EE | Feodor F. Dragan,
Fedor V. Fomin,
Petr A. Golovach:
Spanners in Sparse Graphs.
ICALP (1) 2008: 597-608 |
| 107 | EE | Fedor V. Fomin,
Petr A. Golovach,
Jan Kratochvíl:
On tractability of Cops and Robbers game.
IFIP TCS 2008: 171-185 |
| 106 | EE | Fedor V. Fomin,
Petr A. Golovach,
Alexander Hall,
Matús Mihalák,
Elias Vicari,
Peter Widmayer:
How to Guard a Graph?.
ISAAC 2008: 318-329 |
| 105 | EE | Fedor V. Fomin,
Jan Kratochvíl,
Daniel Lokshtanov,
Federico Mancini,
Jan Arne Telle:
On the Complexity of Reconstructing H -free Graphs from Their Star Systems.
LATIN 2008: 194-205 |
| 104 | EE | Feodor F. Dragan,
Fedor V. Fomin,
Petr A. Golovach:
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs.
MFCS 2008: 290-298 |
| 103 | EE | Fedor V. Fomin,
Serge Gaspers,
Dieter Kratsch,
Mathieu Liedloff,
Saket Saurabh:
Iterative Compression and Exact Algorithms.
MFCS 2008: 335-346 |
| 102 | EE | Frederic Dorn,
Fedor V. Fomin,
Dimitrios M. Thilikos:
Catalan structures and dynamic programming in H-minor-free graphs.
SODA 2008: 631-640 |
| 101 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
Branchwidth of Graphs.
Encyclopedia of Algorithms 2008 |
| 100 | EE | Fedor V. Fomin,
Fabrizio Grandoni,
Artem V. Pyatkin,
Alexey A. Stepanov:
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications.
ACM Transactions on Algorithms 5(1): (2008) |
| 99 | EE | Fedor V. Fomin,
Fabrizio Grandoni,
Dieter Kratsch:
Solving Connected Dominating Set Faster than 2 n .
Algorithmica 52(2): 153-166 (2008) |
| 98 | EE | Fedor V. Fomin,
Serge Gaspers,
Artem V. Pyatkin,
Igor Razgon:
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms.
Algorithmica 52(2): 293-307 (2008) |
| 97 | EE | Omid Amini,
Fedor V. Fomin,
Saket Saurabh:
Parameterized Algorithms for Partial Cover Problems
CoRR abs/0802.1722: (2008) |
| 96 | EE | Noga Alon,
Fedor V. Fomin,
Gregory Gutin,
Michael Krivelevich,
Saket Saurabh:
Spanning directed trees with many leaves
CoRR abs/0803.0701: (2008) |
| 95 | EE | Fedor V. Fomin,
Yngve Villanger:
Treewidth computation and extremal combinatorics
CoRR abs/0803.1321: (2008) |
| 94 | EE | Michael R. Fellows,
Fedor V. Fomin,
Daniel Lokshtanov,
Elena Losievskaja,
Frances A. Rosamond,
Saket Saurabh:
Parameterized Low-distortion Embeddings - Graph metrics into lines and trees
CoRR abs/0804.3028: (2008) |
| 93 | EE | Fedor V. Fomin,
Petr A. Golovach,
Dimitrios M. Thilikos:
Approximating acyclicity parameters of sparse hypergraphs
CoRR abs/0809.3646: (2008) |
| 92 | EE | Henning Fernau,
Fedor V. Fomin,
Daniel Lokshtanov,
Daniel Raible,
Saket Saurabh,
Yngve Villanger:
Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves
CoRR abs/0810.4796: (2008) |
| 91 | EE | Frederic Dorn,
Fedor V. Fomin,
Dimitrios M. Thilikos:
Subexponential parameterized algorithms.
Computer Science Review 2(1): 29-39 (2008) |
| 90 | EE | Jianer Chen,
Fedor V. Fomin,
Yang Liu,
Songjian Lu,
Yngve Villanger:
Improved algorithms for feedback vertex set problems.
J. Comput. Syst. Sci. 74(7): 1188-1198 (2008) |
| 89 | EE | Fedor V. Fomin,
Dieter Kratsch,
Ioan Todinca,
Yngve Villanger:
Exact Algorithms for Treewidth and Minimum Fill-In.
SIAM J. Comput. 38(3): 1058-1079 (2008) |
| 88 | EE | Fedor V. Fomin,
Pierre Fraigniaud,
Dimitrios M. Thilikos:
Forewords: Special issue on graph searching.
Theor. Comput. Sci. 399(3): 157 (2008) |
| 87 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
An annotated bibliography on guaranteed graph searching.
Theor. Comput. Sci. 399(3): 236-245 (2008) |
| 2007 |
|---|
| 86 | EE | Michael R. Fellows,
Fedor V. Fomin,
Daniel Lokshtanov,
Frances A. Rosamond,
Saket Saurabh,
Stefan Szeider,
Carsten Thomassen:
On the Complexity of Some Colorful Problems Parameterized by Treewidth.
COCOA 2007: 366-377 |
| 85 | EE | Fedor V. Fomin,
Alexey A. Stepanov:
Counting Minimum Weighted Dominating Sets.
COCOON 2007: 165-175 |
| 84 | EE | Fedor V. Fomin,
Serge Gaspers,
Saket Saurabh:
Improved Exact Algorithms for Counting 3- and 4-Colorings.
COCOON 2007: 65-74 |
| 83 | EE | Noga Alon,
Fedor V. Fomin,
Gregory Gutin,
Michael Krivelevich,
Saket Saurabh:
Better Algorithms and Bounds for Directed Maximum Leaf Problems.
FSTTCS 2007: 316-327 |
| 82 | EE | Frederic Dorn,
Fedor V. Fomin,
Dimitrios M. Thilikos:
Subexponential Parameterized Algorithms.
ICALP 2007: 15-27 |
| 81 | EE | Noga Alon,
Fedor V. Fomin,
Gregory Gutin,
Michael Krivelevich,
Saket Saurabh:
Parameterized Algorithms for Directed Maximum Leaf Problems.
ICALP 2007: 352-362 |
| 80 | EE | Jianer Chen,
Fedor V. Fomin,
Yang Liu,
Songjian Lu,
Yngve Villanger:
Improved Algorithms for the Feedback Vertex Set Problems.
WADS 2007: 422-433 |
| 79 | EE | Fedor V. Fomin,
Petr A. Golovach,
Jan Kratochvíl,
Dieter Kratsch,
Mathieu Liedloff:
Branch and Recharge: Exact Algorithms for Generalized Domination.
WADS 2007: 507-518 |
| 78 | EE | Fedor V. Fomin,
Pinar Heggernes,
Rodica Mihai:
Mixed Search Number and Linear-Width of Interval and Split Graphs.
WG 2007: 304-315 |
| 77 | EE | Noga Alon,
Fedor V. Fomin,
Gregory Gutin,
Michael Krivelevich,
Saket Saurabh:
Better Algorithms and Bounds for Directed Maximum Leaf Problems
CoRR abs/0707.1095: (2007) |
| 76 | EE | Noga Alon,
Fedor V. Fomin,
Gregory Gutin,
Michael Krivelevich,
Saket Saurabh:
Parameterized Algorithms for Directed Maximum Leaf Problems
CoRR abs/cs/0702049: (2007) |
| 75 | EE | Hajo Broersma,
Fedor V. Fomin,
Rastislav Kralovic,
Gerhard J. Woeginger:
Eliminating graphs by means of parallel knock-out schemes.
Discrete Applied Mathematics 155(2): 92-102 (2007) |
| 74 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
On self duality of pathwidth in polyhedral graph embeddings.
Journal of Graph Theory 55(1): 42-54 (2007) |
| 73 | EE | Hajo Broersma,
Fedor V. Fomin,
Petr A. Golovach,
Gerhard J. Woeginger:
Backbone colorings for graphs: Tree and path backbones.
Journal of Graph Theory 55(2): 137-152 (2007) |
| 72 | EE | Fedor V. Fomin,
Pinar Heggernes,
Dieter Kratsch:
Exact Algorithms for Graph Homomorphisms.
Theory Comput. Syst. 41(2): 381-393 (2007) |
| 2006 |
|---|
| 71 | | Fedor V. Fomin:
Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers
Springer 2006 |
| 70 | EE | Hans L. Bodlaender,
Fedor V. Fomin,
Arie M. C. A. Koster,
Dieter Kratsch,
Dimitrios M. Thilikos:
On Exact Algorithms for Treewidth.
ESA 2006: 672-683 |
| 69 | EE | Fedor V. Fomin,
Fabrizio Grandoni,
Dieter Kratsch:
Solving Connected Dominating Set Faster Than 2n.
FSTTCS 2006: 152-163 |
| 68 | EE | Fedor V. Fomin,
Serge Gaspers,
Saket Saurabh:
Branching and Treewidth Based Exact Algorithms.
ISAAC 2006: 16-25 |
| 67 | EE | Fedor V. Fomin,
Serge Gaspers,
Artem V. Pyatkin:
Finding a Minimum Feedback Vertex Set in Time O (1.7548n).
IWPEC 2006: 184-191 |
| 66 | EE | Johanne Cohen,
Fedor V. Fomin,
Pinar Heggernes,
Dieter Kratsch,
Gregory Kucherov:
Optimal Linear Arrangement of Interval Graphs.
MFCS 2006: 267-279 |
| 65 | EE | Fedor V. Fomin,
Fabrizio Grandoni,
Dieter Kratsch:
Measure and conquer: a simple O(20.288n) independent set algorithm.
SODA 2006: 18-25 |
| 64 | EE | Frederic Dorn,
Fedor V. Fomin,
Dimitrios M. Thilikos:
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus.
SWAT 2006: 172-183 |
| 63 | EE | Hajo Broersma,
Fedor V. Fomin,
Jan Kratochvíl,
Gerhard J. Woeginger:
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult.
Algorithmica 44(4): 343-361 (2006) |
| 62 | EE | Fedor V. Fomin,
Kjartan Høie:
Pathwidth of cubic graphs and exact algorithms.
Inf. Process. Lett. 97(5): 191-196 (2006) |
| 61 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
A 3-approximation for the pathwidth of Halin graphs.
J. Discrete Algorithms 4(4): 499-510 (2006) |
| 60 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
New upper bounds on the decomposability of planar graphs.
Journal of Graph Theory 51(1): 53-81 (2006) |
| 59 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up.
SIAM J. Comput. 36(2): 281-309 (2006) |
| 2005 |
|---|
| 58 | EE | Frederic Dorn,
Eelko Penninkx,
Hans L. Bodlaender,
Fedor V. Fomin:
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions.
ESA 2005: 95-106 |
| 57 | EE | Fedor V. Fomin,
Pinar Heggernes,
Dieter Kratsch:
Exact Algorithms for Graph Homomorphisms.
FCT 2005: 161-171 |
| 56 | EE | Fedor V. Fomin,
Fabrizio Grandoni,
Dieter Kratsch:
Measure and Conquer: Domination - A Case Study.
ICALP 2005: 191-203 |
| 55 | EE | Fedor V. Fomin,
Fabrizio Grandoni,
Artem V. Pyatkin,
Alexey A. Stepanov:
Bounding the Number of Minimal Dominating Sets: A Measure and Conquer Approach.
ISAAC 2005: 573-582 |
| 54 | EE | Fedor V. Fomin,
Pierre Fraigniaud,
Nicolas Nisse:
Nondeterministic Graph Searching: From Pathwidth to Treewidth.
MFCS 2005: 364-375 |
| 53 | EE | Fedor V. Fomin,
Frédéric Mazoit,
Ioan Todinca:
Computing Branchwidth Via Efficient Triangulations and Blocks.
WG 2005: 374-384 |
| 52 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs.
ACM Transactions on Algorithms 1(1): 33-47 (2005) |
| 51 | | Fedor V. Fomin,
Fabrizio Grandoni,
Dieter Kratsch:
Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms.
Bulletin of the EATCS 87: 47-77 (2005) |
| 50 | EE | Hans L. Bodlaender,
Fedor V. Fomin:
Tree decompositions with small cost.
Discrete Applied Mathematics 145(2): 143-154 (2005) |
| 49 | EE | Fedor V. Fomin,
Fabrizio Grandoni,
Artem V. Pyatkin,
Alexey A. Stepanov:
On maximum number of minimal dominating sets in graphs.
Electronic Notes in Discrete Mathematics 22: 157-162 (2005) |
| 48 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos,
Ioan Todinca:
Connected Graph Searching in Outerplanar Graphs.
Electronic Notes in Discrete Mathematics 22: 213-216 (2005) |
| 47 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs.
J. ACM 52(6): 866-893 (2005) |
| 46 | EE | Hans L. Bodlaender,
Fedor V. Fomin:
Equitable colorings of bounded treewidth graphs.
Theor. Comput. Sci. 349(1): 22-30 (2005) |
| 2004 |
|---|
| 45 | EE | Fedor V. Fomin,
Dieter Kratsch,
Ioan Todinca:
Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In.
ICALP 2004: 568-580 |
| 44 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up.
ICALP 2004: 581-592 |
| 43 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Bidimensional Parameters and Local Treewidth.
LATIN 2004: 109-118 |
| 42 | EE | Hans L. Bodlaender,
Fedor V. Fomin:
Equitable Colorings of Bounded Treewidth Graphs.
MFCS 2004: 180-190 |
| 41 | EE | Hajo Broersma,
Fedor V. Fomin,
Gerhard J. Woeginger:
Parallel Knock-Out Schemes in Networks.
MFCS 2004: 204-214 |
| 40 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs.
SODA 2004: 830-839 |
| 39 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
A Simple and Fast Approach for Solving Problems on Planar Graphs.
STACS 2004: 56-67 |
| 38 | EE | Fedor V. Fomin,
Dieter Kratsch,
Gerhard J. Woeginger:
Exact (Exponential) Algorithms for the Dominating Set Problem.
WG 2004: 245-256 |
| 37 | EE | Fedor V. Fomin,
Pinar Heggernes,
Jan Arne Telle:
Graph Searching, Elimination Trees, and a Generalization of Bandwidth.
Algorithmica 41(2): 73-87 (2004) |
| 36 | EE | Fedor V. Fomin,
Dieter Kratsch,
Haiko Müller:
Algorithms for graphs with small octopus.
Discrete Applied Mathematics 134(1-3): 105-128 (2004) |
| 35 | EE | Fedor V. Fomin:
Searching expenditure and interval graphs.
Discrete Applied Mathematics 135(1-3): 97-104 (2004) |
| 34 | EE | Fedor V. Fomin,
Martín Matamala,
Erich Prisner,
Ivan Rapaport:
AT-free graphs: linear bounds for the oriented diameter.
Discrete Applied Mathematics 141(1-3): 135-148 (2004) |
| 33 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
A 3-approximation for the pathwidth of Halin graphs.
Electronic Notes in Discrete Mathematics 17: 157-162 (2004) |
| 32 | EE | Fedor V. Fomin,
Martín Matamala,
Ivan Rapaport:
Complexity of approximating the oriented diameter of chordal graphs.
Journal of Graph Theory 45(4): 255-269 (2004) |
| 31 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Bidimensional Parameters and Local Treewidth.
SIAM J. Discrete Math. 18(3): 501-511 (2004) |
| 30 | EE | Jirí Fiala,
Aleksei V. Fishkin,
Fedor V. Fomin:
On distance constrained labeling of disk graphs.
Theor. Comput. Sci. 326(1-3): 261-292 (2004) |
| 2003 |
|---|
| 29 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
Dominating Sets and Local Treewidth.
ESA 2003: 221-229 |
| 28 | EE | Fedor V. Fomin,
Pinar Heggernes,
Jan Arne Telle:
Graph Searching, Elimination Trees, and a Generalization of Bandwidth.
FCT 2003: 73-85 |
| 27 | EE | Erik D. Demaine,
Fedor V. Fomin,
Mohammad Taghi Hajiaghayi,
Dimitrios M. Thilikos:
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs.
ICALP 2003: 829-844 |
| 26 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
Dominating sets in planar graphs: branch-width and exponential speed-up.
SODA 2003: 168-177 |
| 25 | EE | Hajo Broersma,
Fedor V. Fomin,
Petr A. Golovach,
Gerhard J. Woeginger:
Backbone Colorings for Networks.
WG 2003: 131-142 |
| 24 | EE | Fedor V. Fomin,
Dieter Kratsch,
Haiko Müller:
On the Domination Search Number.
Discrete Applied Mathematics 127(3): 565-580 (2003) |
| 23 | EE | Fedor V. Fomin,
Petr A. Golovach:
Interval degree and bandwidth of a graph.
Discrete Applied Mathematics 129(2-3): 345-359 (2003) |
| 22 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
On the monotonicity of games generated by symmetric submodular functions.
Discrete Applied Mathematics 131(2): 323-335 (2003) |
| 21 | EE | Fedor V. Fomin:
Pathwidth of Planar and Line Graphs.
Graphs and Combinatorics 19(1): 91-99 (2003) |
| 2002 |
|---|
| 20 | EE | Hans L. Bodlaender,
Hajo Broersma,
Fedor V. Fomin,
Artem V. Pyatkin,
Gerhard J. Woeginger:
Radio Labeling with Pre-assigned Frequencies.
ESA 2002: 211-222 |
| 19 | EE | Hajo Broersma,
Fedor V. Fomin,
Jan Kratochvíl,
Gerhard J. Woeginger:
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.
SWAT 2002: 160-169 |
| 18 | EE | Hans L. Bodlaender,
Fedor V. Fomin:
Tree Decompositions with Small Cost.
SWAT 2002: 378-387 |
| 17 | EE | Fedor V. Fomin,
Martín Matamala,
Ivan Rapaport:
The Complexity of Approximating the Oriented Diameter of Chordal Graphs.
WG 2002: 211-222 |
| 16 | EE | Hajo Broersma,
Fedor V. Fomin,
Jaroslav Nesetril,
Gerhard J. Woeginger:
More about Subcolorings.
WG 2002: 68-79 |
| 15 | EE | Hajo Broersma,
Fedor V. Fomin,
Jaroslav Nesetril,
Gerhard J. Woeginger:
More About Subcolorings.
Computing 69(3): 187-203 (2002) |
| 14 | EE | Fedor V. Fomin,
Andrzej Lingas:
Approximation algorithms for time-dependent orienteering.
Inf. Process. Lett. 83(2): 57-62 (2002) |
| 13 | EE | Fedor V. Fomin,
Dieter Kratsch,
Jean-Christophe Novelli:
Approximating minimum cocolorings.
Inf. Process. Lett. 84(5): 285-290 (2002) |
| 12 | EE | Hans L. Bodlaender,
Fedor V. Fomin:
Approximation of pathwidth of outerplanar graphs.
J. Algorithms 43(2): 190-200 (2002) |
| 2001 |
|---|
| 11 | EE | Jirí Fiala,
Aleksei V. Fishkin,
Fedor V. Fomin:
Online and Offline Distance Constrained Labeling of Disk Graphs.
ESA 2001: 464-475 |
| 10 | EE | Fedor V. Fomin,
Dieter Kratsch,
Jean-Christophe Novelli:
Approximating Minimum Cocolourings.
FCT 2001: 118-125 |
| 9 | EE | Fedor V. Fomin,
Andrzej Lingas:
Approximation Algorithms for Time-Dependent Orienteering.
FCT 2001: 508-515 |
| 8 | EE | Fedor V. Fomin,
Hans L. Bodlaender:
Approximation of Pathwidth of Outerplanar Graphs.
WG 2001: 166-176 |
| 7 | EE | Fedor V. Fomin,
Dimitrios M. Thilikos:
On the Monotonicity of Games Generated by Symmetric Submodular Functions.
WG 2001: 177-188 |
| 6 | EE | Fedor V. Fomin,
Martín Matamala,
Erich Prisner,
Ivan Rapaport:
Bilateral Orientations and Domination.
Electronic Notes in Discrete Mathematics 7: 26-29 (2001) |
| 2000 |
|---|
| 5 | EE | Fedor V. Fomin,
Dieter Kratsch,
Haiko Müller:
On the Domination Search Number.
WG 2000: 161-171 |
| 4 | EE | Fedor V. Fomin,
Petr A. Golovach:
Graph Searching and Interval Completion.
SIAM J. Discrete Math. 13(4): 454-464 (2000) |
| 1999 |
|---|
| 3 | EE | Fedor V. Fomin:
Note on a Helicopter Search Problem on Graphs.
Discrete Applied Mathematics 95(1-3): 241-249 (1999) |
| 1998 |
|---|
| 2 | | Fedor V. Fomin,
Petr A. Golovach:
Interval Completion with the Smallest Max-degree.
WG 1998: 359-371 |
| 1 | EE | Fedor V. Fomin:
Helicopter Search Problems, Bandwidth and Pathwidth.
Discrete Applied Mathematics 85(1): 59-70 (1998) |
