Documentation
Français (FR)

Anglais (EN)

SB

Stéphane Bessy

12

Documents

Identifiants chercheurs

stephane-bessy
0000-0001-7130-4990
IdRef : 07748181X

Présentation

Publications

50383

	Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs Stéphane Bessy , Johannes Pardey , Lucas Picasarri-Arrieta , Dieter Rautenbach The Electronic Journal of Combinatorics, 2023, 30 (1), pp.1-35. ⟨10.37236/10866⟩ Article dans une revue hal-04172966v1
	Complexity of some arc-partition problems for digraphs Jørgen Bang-Jensen , Stéphane Bessy , Daniel Gonçalves , Lucas Picasarri-Arrieta Theoretical Computer Science, 2022, 928, pp.167-182. ⟨10.1016/j.tcs.2022.06.023⟩ Article dans une revue hal-03699980v1
	Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2 Jørgen Bang-Jensen , Stéphane Bessy , Anders Yeo Graphs and Combinatorics, 2022, 38 (6), ⟨10.1007/s00373-022-02589-6⟩ Article dans une revue hal-04032270v1
	Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound Stéphane Bessy , Johannes Pardey , Lucas Picasarri-Arrieta , Dieter Rautenbach The Electronic Journal of Combinatorics, 2022, 29 (2), ⟨10.37236/10610⟩ Article dans une revue hal-03701284v1
	Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2 Jørgen Bang-Jensen , Stéphane Bessy , Frédéric Havet , Anders Yeo Journal of Graph Theory, 2022, 100 (2), pp.294-314. ⟨10.1002/jgt.22779⟩ Article dans une revue lirmm-04032263v1
	Packing Arc-Disjoint Cycles in Tournaments Stéphane Bessy , Marin Bougeret , Ramaswamy Krithika , Abhishek Sahu , Saket Saurabh Algorithmica, 2021, 83 (5), pp.1393-1420. ⟨10.1007/s00453-020-00788-2⟩ Article dans une revue lirmm-03271568v1
	Good orientations of unions of edge‐disjoint spanning trees Jørgen Bang-Jensen , Stéphane Bessy , Jing Huang , Matthias Kriesell Journal of Graph Theory, 2021, 96 (4), pp.594-618. ⟨10.1002/jgt.22633⟩ Article dans une revue lirmm-03271567v1
	Out‐colourings of digraphs Noga Alon , Jørgen Bang‐jensen , Stéphane Bessy Journal of Graph Theory, 2020, 93 (1), pp.88-112. ⟨10.1002/jgt.22476⟩ Article dans une revue lirmm-03271566v1

	Temporalizing Digraphs via Linear-Size Balanced Bi-Trees Stéphane Bessy , Stéphan Thomassé , Laurent Viennot STACS 2024 - 41st International Symposium on Theoretical Aspects of Computer Science, Mar 2024, Clermont-Ferrand, France. pp.13:1-13:12, ⟨10.4230/LIPIcs.STACS.2024.13⟩ Communication dans un congrès hal-04531675v1
	Kernelization for Graph Packing Problems via Rainbow Matching Stéphane Bessy , Marin Bougeret , Dimitrios M. Thilikos , Sebastian Wiederrecht SODA 2023 - ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Jan 2023, Florence, Italy. pp.3654-3663, ⟨10.1137/1.9781611977554.ch139⟩ Communication dans un congrès hal-04042995v1

	Dichromatic number of chordal graphs Stéphane Bessy , Frédéric Havet , Lucas Picasarri-Arrieta 2023 Pré-publication, Document de travail hal-04379896v1
	Constrained Flows in Networks Stéphane Bessy , Jørgen Bang-Jensen , Lucas Picasarri-Arrieta 2023 Pré-publication, Document de travail hal-04379871v1