Publications of F. V. Fomin
BACK TO MASCOTTE PUBLICATION INDEX

Publications of F. V. Fomin

Articles in journal or book chapters
  1. 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]

  2. 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]

  3. 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]

Conference articles
  1. 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]

  2. 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]

  3. N. Cohen, F. V. Fomin, G. Gutin, E. J. Kim, S. Saurabh, and A. Yeo. Algorithm for Finding -Vertex Out-trees and Its Application to -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]

  4. 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]

  5. 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]

Internal reports
  1. 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 MASCOTTE PUBLICATION INDEX




Last modified: Thu Oct 10 14:10:01 2013


This document was translated from BibTEX by bibtex2html