Publications of Anders Yeo

BACK TO COATI PUBLICATION INDEX

Publications of Anders Yeo

Articles in journal or book's chapters
  1. Jorgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, and Anders Yeo. Bipartite spanning sub(di)graphs induced by 2-partitions. Journal of Graph Theory, 92(2):130-151, October 2019. [WWW ] [PDF ]
    Keywords: Eulerian, Spanning bipartite subdigraph, Strong spanning subdigraph, 2-partition, Minimum out-degree. [bibtex-entry]
     
  2. Joergen Bang-Jensen, Stéphane Bessy, Frédéric Havet, and Anders Yeo. Out-degree reducing partitions of digraphs. Theoretical Computer Science, 719:64-72, April 2018. [WWW ] [PDF ]
    Keywords: Polynomial algorithm, 2-partition, Maximum out-degree reducing partition, NP-complete. [bibtex-entry]
     
  3. J Bang-Jensen, Frédéric Havet, and Anders Yeo. The complexity of finding arc-disjoint branching flows. Discrete Applied Mathematics, 209:16-26, 2016. [WWW ] [PDF ] [bibtex-entry]
     
  4. 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]
     
  5. F. Havet, S. Thomassé, and A. Yeo. Hoang-Reed conjecture for tournaments. Discrete Mathematics, 308(15):3412--3415, August 2008. [PDF ] [Abstract] [bibtex-entry]
     
  6. P. Charbit, S. Thomassé, and A. Yeo. The minimum feedback arc set problem is NP-hard for tournament. Combinatorics, Probability and Computing, 16:1--4, 2007. [bibtex-entry]
     
Conference's articles
  1. 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]
     
Internal reports
  1. Frédéric Havet, Jorgen Bang-Jensen, and Anders Yeo. Spanning eulerian subdigraphs in semicomplete digraphs. Research Report, Inria ; CNRS ; I3S ; Université côte d'azur, December 2021. [WWW ] [PDF ]
    Keywords: Arc-connectivity, Eulerian subdigraph, Tournament, Semicomplete digraph, polynomial algorithm. [bibtex-entry]
     
  2. Joergen Bang-Jensen, Frédéric Havet, and Anders Yeo. The complexity of finding arc-disjoint branching flows. Research Report RR-8640, INRIA Sophia Antipolis ; INRIA, November 2014. [WWW ] [PDF ]
    Keywords: disjoint branchings, branching flow, polynomial algorithm, NP-complete. [bibtex-entry]
     
  3. F. Havet, S. Thomassé, and A. Yeo. Hoàng-Reed conjecture holds for tournaments. Research report, INRIA Research Report 5976, September 2006.
    Note: Submitted Discrete Mathematics. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     

BACK TO COATI PUBLICATION INDEX



Last modified: Sat Jan 29 19:00:47 2022