Skip to Main content

Keywords

Researcher identifiers

Social networks

    Export Publications

    Export the displayed publications:

    External widget

    Number of documents

    49

    Publications of Stéphane Bessy


    Journal articles37 documents

    Conference papers8 documents

    • Stéphane Bessy, Marin Bougeret, Ramaswamy Krithika, Abhishek Sahu, Saket Saurabh, et al.. Packing Arc-Disjoint Cycles in Tournaments. MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. pp.1 - 23, ⟨10.4230/LIPIcs.CVIT.2016.23⟩. ⟨hal-02277436⟩
    • Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut. Triangle packing in (sparse) tournaments: approximation and kernelization. ESA: European Symposium on Algorithms, Sep 2017, Vienne, Austria. pp.14:1--14:13, ⟨10.4230/LIPIcs.ESA.2017.14⟩. ⟨lirmm-01550313⟩
    • Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul. On Independent Set on B1-EPG Graphs. WAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.158-169, ⟨10.1007/978-3-319-28684-6_14⟩. ⟨lirmm-01264022⟩
    • Stéphane Bessy, Anthony Perez. Polynomial Kernels for Proper Interval Completion and Related Problems. Fundamentals of Computation Theory 2011, Norway. pp.229-239. ⟨lirmm-00738226⟩
    • Stéphane Bessy, Frédéric Havet. Enumerating the edge-colourings and total colourings of a regular graph. 2012 Workshop on Graph Theory and Combinatorics, Aug 2012, National Sun Yat-sen University, Kaohsiung, Taiwan. ⟨lirmm-00811571⟩
    • Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, et al.. Kernels for Feedback Arc Set In Tournaments. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2009, IIT Kanpur, India. pp.37-47, ⟨10.4230/LIPIcs.FSTTCS.2009.2305⟩. ⟨lirmm-00432668⟩
    • Stéphane Bessy, Anthony Perez, Christophe Paul. Polynomial Kernels for 3-Leaf Power Graph Modification Problems. IWOCA'09: International Workshop on Combinatorial Algorithms, pp.72-82. ⟨lirmm-00432664⟩
    • Stéphane Bessy, Jean-Sébastien Sereni, Nicolas Lichiardopol. Two proofs of Bermond-Thomassen conjecture for regular tournaments. 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Jul 2007, Prague, République Tchèque, Czech Republic. pp.47-53, ⟨10.1016/j.endm.2007.01.008⟩. ⟨lirmm-00153984⟩

    Reports3 documents

    • Stéphane Bessy, Frédéric Havet. Enumerating the edge-colourings and total colourings of a regular graph. [Research Report] RR-7652, INRIA. 2011. ⟨inria-00602188⟩
    • Stéphane Bessy, Etienne Birmelé, Frédéric Havet. Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree. [Research Report] RR-5364, INRIA. 2004, pp.20. ⟨inria-00070639⟩
    • Stéphane Bessy, Frédéric Havet, Jérôme Palaysi. Choosability of bipartite graphs with maximum degree $Delta$. RR-4522, INRIA. 2002. ⟨inria-00072066⟩

    Habilitation à diriger des recherches1 document

    • Stéphane Bessy. Some problems in graph theory and graphs algorithmic theory. Discrete Mathematics [cs.DM]. Université Montpellier II - Sciences et Techniques du Languedoc, 2012. ⟨tel-00806716⟩