Publications of Fedor V. Fomin
BACK TO COATI PUBLICATION INDEX
Publications of Fedor V. Fomin
-
Fedor V. Fomin,
Pierre Fraigniaud,
Nicolas Nisse,
and Dimitrios M. Thilikos.
Forewords: Special issue on Theory and Applications of Graph Searching Problems,
volume 655:1 of Theoretical Computer Science - Special Issue on Theory and Applications of Graph Searching Problems.
December 2016.
[WWW
] [bibtex-entry]
-
Fedor V. Fomin,
Frédéric Giroire,
Alain Jean-Marie,
Dorian Mazauric,
and Nicolas Nisse.
To satisfy impatient Web surfers is hard.
Journal of Theoretical Computer Science (TCS),
526:1-17,
March 2014.
[WWW
] [PDF
] [bibtex-entry]
-
N. Cohen,
F. V. Fomin,
G. Gutin,
E. Jung Kim,
S. Saurabh,
and A. Yeo.
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem.
Journal of Computer and System Sciences,
76(7):650 - 662,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. V. Fomin,
P. A. Golovach,
J. Kratochvil,
N. Nisse,
and K. Suchan.
Pursuing a fast robber on a graph.
Theoretical Computer Science,
411(7-9):1167-1181,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. V. Fomin,
P. Fraigniaud,
and N. Nisse.
Nondeterministic Graph Searching: From Pathwidth to Treewidth.
Algorithmica,
53(3):358-373,
2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. V. Fomin,
F. Giroire,
A. Jean-Marie,
D. Mazauric,
and N. Nisse.
Satisfaire un internaute impatient est difficile.
In 14es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 79-82,
2012.
Note: Best paper.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. V. Fomin,
F. Giroire,
A. Jean-Marie,
D. Mazauric,
and N. Nisse.
To Satisfy Impatient Web surfers is Hard.
In 6th International Conference on FUN with Algorithms (FUN),
volume 7288,
pages 166-176,
2012.
Springer, LNCS.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen,
F. V. Fomin,
G. Gutin,
E. J. Kim,
S. Saurabh,
and A. Yeo.
Algorithm for Finding it -Vertex Out-trees and Its Application to it -Internal Out-branching Problem.
In 15th Annual International Conference on Computing and Combinatorics (COCOON),
volume 5609 of Lecture Notes in Computer Science,
pages 37-46,
2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. V. Fomin,
P. Fraigniaud,
and N. Nisse.
Strategies d'encerclement non deterministes.
In 8èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 81-84,
2006.
[WWW
] [Abstract] [bibtex-entry]
-
F. V. Fomin,
P. Fraigniaud,
and N. Nisse.
Nondeterministic Graph Searching: From Pathwidth to Treewidth.
In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS),
pages 364-375,
2005.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Barrière,
P. Flocchini,
F. V. Fomin,
P. Fraigniaud,
N. Nisse,
N. Santoro,
and D. Thilikos.
Connected Graph Searching.
Research Report 7363,
INRIA,
August 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:44 2022
