Keywords

Researcher identifiers

Social networks

    Export Publications

    Export the displayed publications:

    External widget

    Number of documents

    42

    Publications of Stéphane Bessy


    Journal articles30 documents

    • Jørgen Bang-Jensen, Stéphane Bessy. Degree-constrained 2-partitions of graphs. Theoretical Computer Science, Elsevier, In press, ⟨10.1016/j.tcs.2018.12.023⟩. ⟨lirmm-02011257⟩
    • Stéphane Bessy, Pascal Ochem, Dieter Rautenbach. On the Kőnig-Egerváry theorem for k-paths. Journal of Graph Theory, Wiley, 2019, 91 (1), pp.73-87. ⟨10.1002/jgt.22421⟩. ⟨lirmm-02078255⟩
    • Stéphane Bessy, Rodolphe Giroudeau. Parameterized complexity of a coupled-task scheduling problem. Journal of Scheduling, Springer Verlag, 2019, 22 (3), pp.305-313. ⟨10.1007/s10951-018-0581-1⟩. ⟨lirmm-02133404⟩
    • Stéphane Bessy, Anthony Bonato, Jeannette Janssen, Dieter Rautenbach, Elham Roshanbin. Bounds on the burning number. Discrete Applied Mathematics, Elsevier, 2018, 235, pp.16-22. ⟨10.1016/j.dam.2017.09.012⟩. ⟨lirmm-01713736⟩
    • Joergen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo. Out-degree reducing partitions of digraphs. Theoretical Computer Science, Elsevier, 2018, 719, pp.64-72. ⟨10.1016/j.tcs.2017.11.007⟩. ⟨hal-01765642⟩
    • Stéphane Bessy, Mitre Dourado, Lucia Penso, Dieter Rautenbach. The Geodetic Hull Number is Hard for Chordal Graphs. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2018, 32 (1), pp.543-547. ⟨10.1137/17M1131726⟩. ⟨lirmm-01997429⟩
    • Jørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias Kriesell. Antistrong digraphs. Journal of Combinatorial Theory, Series B, Elsevier, 2017, 122, pp.68-90. ⟨10.1016/j.jctb.2016.05.004⟩. ⟨lirmm-01348862⟩
    • Stéphane Bessy, Anthony Bonato, Jeannette Janssen, Dieter Rautenbach, Elham Roshanbin. Burning a graph is hard. Discrete Applied Mathematics, Elsevier, 2017, 232, pp.73-87. ⟨10.1016/j.dam.2017.07.016⟩. ⟨lirmm-01692784⟩
    • Nicolas Bousquet, Stéphane Bessy. Colorful paths for 3-chromatic graphs. Discrete Mathematics, Elsevier, 2017, 340 (5), pp.1000-1007. ⟨10.1016/j.disc.2017.01.016⟩. ⟨hal-01592548⟩
    • Stéphane Bessy, Pascal Ochem, Dieter Rautenbach. Bounds on the exponential domination number. Discrete Mathematics, Elsevier, 2017, 340 (3), pp.494-503. ⟨10.1016/j.disc.2016.08.024⟩. ⟨lirmm-01692753⟩
    • Stéphane Bessy, Dieter Rautenbach. Extremal Values of the Chromatic Number for a Given Degree Sequence. Graphs and Combinatorics, Springer Verlag, 2017, 33 (4), pp.789-799. ⟨10.1007/s00373-017-1814-3⟩. ⟨lirmm-01997424⟩
    • Stéphane Bessy, Mitre Dourado, Lucia Penso, Dieter Rautenbach. The Geodetic Hull Number is Hard for Chordal Graphs. Electronic Notes in Discrete Mathematics, Elsevier, 2017, 62, pp.291-296. ⟨10.1016/j.endm.2017.10.050⟩. ⟨lirmm-01997425⟩
    • Stéphane Bessy, Jocelyn Thiebaut. Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture. Electronic Notes in Discrete Mathematics, Elsevier, 2017, 61, pp.115-121. ⟨10.1016/j.endm.2017.06.028⟩. ⟨lirmm-01713782⟩
    • Stéphane Bessy, Pascal Ochem, Dieter Rautenbach. Exponential Domination in Subcubic Graphs. The Electronic Journal of Combinatorics, Open Journal Systems, 2016, 23 (4), pp.#P4.42. ⟨lirmm-01997215⟩
    • Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni. Two floor building needing eight colors. Journal of Graph Algorithms and Applications, Brown University, 2015, 19 (1), pp.1--9. ⟨hal-00996709v2⟩
    • Jørgen Bang-Jensen, Stéphane Bessy. Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles. Journal of Graph Theory, Wiley, 2015, 79 (4), pp.249-266. ⟨10.1002/jgt.21830⟩. ⟨lirmm-01282883⟩
    • Jørgen Bang-Jensen, Stéphane Bessy. (Arc-)disjoint flows in networks. Theoretical Computer Science, Elsevier, 2014, 526, pp.28-40. ⟨10.1016/j.tcs.2014.01.011⟩. ⟨lirmm-01282881⟩
    • Jørgen Bang-Jensen, Stéphane Bessy, Stéphan Thomassé. Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments. Journal of Graph Theory, Wiley, 2014, 75 (3), pp.284-302. ⟨10.1002/jgt.21740⟩. ⟨lirmm-01282882⟩
    • Stéphane Bessy, Anthony Perez. Polynomial kernels for Proper Interval Completion and related problems. Information and Computation, Elsevier, 2013, 231, pp.89-108. ⟨10.1016/j.ic.2013.08.006⟩. ⟨hal-00942650⟩
    • Stéphane Bessy, Frédéric Havet. Enumerating the edge-colourings and total colourings of a regular graph. Journal of Combinatorial Optimization, Springer Verlag, 2013, 25 (4), pp.523-535. ⟨10.1007/s10878-011-9448-5⟩. ⟨hal-00821598⟩
    • Stéphane Bessy, Fedor Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, et al.. Kernels for feedback arc set in tournaments. Journal of Computer and System Sciences, Elsevier, 2011, 77 (6), pp.1071-1078. ⟨lirmm-00738221⟩
    • Stéphane Bessy, Clément Lepelletier. Optical index of fault tolerant routings in WDM networks. Networks, Wiley, 2010, 56 (2), pp.95-102. ⟨lirmm-00738222⟩
    • Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni. Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree. Discrete Mathematics, Elsevier, 2010, 310 (3), pp.557--560. ⟨10.1016/j.disc.2009.03.039⟩. ⟨hal-00487977⟩
    • Stéphane Bessy, Christophe Paul, Anthony Perez. Polynomial Kernels for 3-Leaf Power Graph Modification Problems. Discrete Applied Mathematics, Elsevier, 2010, 158 (16), pp.1732-1744. ⟨lirmm-00533517⟩
    • Stéphane Bessy, Stéphan Thomassé. Partitioning a Graph into a Cycle and an Anticycle: A Proof of Lehel's Conjecture. Journal of Combinatorial Theory, Series B, Elsevier, 2010, 100, pp.176-180. ⟨lirmm-00512762⟩
    • Stéphane Bessy. Paths partition with prescribed beginnings in digraphs: A Chvátal–Erdős condition approach. Discrete Mathematics, Elsevier, 2008, 308 (18), pp.4108-4115. ⟨10.1016/j.disc.2007.07.113⟩. ⟨lirmm-00324584⟩
    • Stéphane Bessy, Stéphan Thomassé. Spanning a strong digraph by $\alpha$ circuits: A proof of Gallai's conjecture. Combinatorica, Springer Verlag, 2007, 27 (6), pp.659-667. ⟨10.1007/s00493-007-2073-3⟩. ⟨lirmm-00256609⟩
    • Stéphane Bessy, Etienne Birmelé, Frédéric Havet. Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree.. Journal of Graph Theory, Wiley, 2006, 53 (4), pp.315-332. ⟨lirmm-00153978⟩
    • Stéphane Bessy, Stéphan Thomassé. The Categorical Product of Two 5-Chromatic Digraphs can be 3-Chromatic. Discrete Mathematics, Elsevier, 2005, 305, pp.344-346. ⟨10.1016/j.disc.2004.01.023⟩. ⟨lirmm-00140331⟩
    • Stéphane Bessy, Stéphan Thomassé. Every strong digraph has a spanning strong subgraph with at most n+2α-2 arcs. Journal of Combinatorial Theory, Series B, Elsevier, 2003, 87, pp.289-299. ⟨lirmm-00738215⟩

    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 Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, et al.. Kernels for Feedback Arc Set In Tournaments. FSTTCS'09: Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2009, IIT Kanpur, India. pp.N/A. ⟨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⟩