- 35
- 9
- 7
- 2
- 2
- 1
- 1
- 1
SB
Stéphane Bessy
58
Documents
Researcher identifiers
stephane-bessy
-
0000-0001-7130-4990
- IdRef : 07748181X
Presentation
Publications
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 9
- 8
- 7
- 7
- 7
- 6
- 6
- 6
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 56
- 2
- 8
- 7
- 6
- 4
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 5
- 3
- 2
- 8
- 3
- 8
- 1
- 3
- 2
- 2
- 3
- 2
- 4
- 2
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 9
- 2
- 2
- 2
- 1
- 1
- 1
Kernelization for Graph Packing Problems via Rainbow MatchingSODA 2023 - ACM-SIAM Symposium on Discrete Algorithms, Jan 2023, Florence, Italy. pp.3654-3663, ⟨10.1137/1.9781611977554.ch139⟩
Conference papers
hal-04042995v1
|
|
|
Width Parameterizations for Knot-Free Vertex Deletion on DigraphsIPEC 2019 - 14th International Symposium on Parameterized and Exact Computation, Sep 2019, Munich, Germany. pp.2:1-2:16, ⟨10.4230/LIPIcs.IPEC.2019.2⟩
Conference papers
lirmm-03526774v1
|
|
Packing Arc-Disjoint Cycles in TournamentsMFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. pp.27:1-27:14, ⟨10.4230/LIPIcs.MFCS.2019.27⟩
Conference papers
hal-02277436v1
|
|
Triangle packing in (sparse) tournaments: approximation and kernelizationESA 2017 - 25th Annual European Symposium on Algorithms, Sep 2017, Vienne, Austria. pp.14:1--14:13, ⟨10.4230/LIPIcs.ESA.2017.14⟩
Conference papers
lirmm-01550313v1
|
On Independent Set on B1-EPG GraphsWAOA: Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.158-169, ⟨10.1007/978-3-319-28684-6_14⟩
Conference papers
lirmm-01264022v1
|
|
|
Polynomial Kernels for Proper Interval Completion and Related ProblemsFundamentals of Computation Theory 2011, Norway. pp.229-239
Conference papers
lirmm-00738226v1
|
|
Enumerating the edge-colourings and total colourings of a regular graph2012 Workshop on Graph Theory and Combinatorics, Aug 2012, National Sun Yat-sen University, Kaohsiung, Taiwan
Conference papers
lirmm-00811571v1
|
Polynomial Kernels for 3-Leaf Power Graph Modification ProblemsIWOCA'09: International Workshop on Combinatorial Algorithms, pp.72-82
Conference papers
lirmm-00432664v1
|
|
|
Kernels for Feedback Arc Set In TournamentsIARCS 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⟩
Conference papers
lirmm-00432668v1
|
Two proofs of Bermond-Thomassen conjecture for regular tournaments6th 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⟩
Conference papers
lirmm-00153984v1
|
|
Enumerating the edge-colourings and total colourings of a regular graph[Research Report] RR-7652, INRIA. 2011
Reports
inria-00602188v1
|
|
Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree[Research Report] RR-5364, INRIA. 2004, pp.20
Reports
inria-00070639v1
|
|
Choosability of bipartite graphs with maximum degree $Delta$RR-4522, INRIA. 2002
Reports
inria-00072066v1
|
|
Some problems in graph theory and graphs algorithmic theoryDiscrete Mathematics [cs.DM]. Université Montpellier II - Sciences et Techniques du Languedoc, 2012
Habilitation à diriger des recherches
tel-00806716v1
|