Stéphane Bessy
Présentation
Publications
Publications
|
|
Oriented Trees in $O(k \sqrt{k})$-Chromatic Digraphs, a Subquadratic Bound for Burr’s ConjectureWG 2024 - 50th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2024, Gozd Martuljek, Slovenia. pp.79-91, ⟨10.1007/978-3-031-75409-8_6⟩ |
|
|
Temporalizing Digraphs via Linear-Size Balanced Bi-TreesSTACS 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⟩ |
|
|
Kernelization for Graph Packing Problems via Rainbow MatchingSODA 2023 - 34th ACM/SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Jan 2023, Florence, Italy. pp.3654-3663, ⟨10.1137/1.9781611977554.ch139⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
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⟩ |
|
|
On Independent Set on B1-EPG GraphsWAOA 2015 - 13th International Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.158-169, ⟨10.1007/978-3-319-28684-6_14⟩ |
|
|
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 |
|
|
Polynomial Kernels for Proper Interval Completion and Related ProblemsFundamentals of Computation Theory 2011, Norway. pp.229-239 |
|
|
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⟩ |
Polynomial Kernels for 3-Leaf Power Graph Modification ProblemsIWOCA'09: International Workshop on Combinatorial Algorithms, pp.72-82 |
|
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⟩ |
|
|
Enumerating the edge-colourings and total colourings of a regular graph[Research Report] RR-7652, INRIA. 2011 |
|
|
Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree[Research Report] RR-5364, INRIA. 2004, pp.20 |
|
|
Choosability of bipartite graphs with maximum degree $Delta$RR-4522, INRIA. 2002 |
|
|
Some problems in graph theory and graphs algorithmic theoryDiscrete Mathematics [cs.DM]. Université Montpellier II - Sciences et Techniques du Languedoc, 2012 |