default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStéphane Bessy
Person information
- affiliation: LIRMM Montpellier, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j51]Stéphane Bessy
, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau:
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. Discret. Appl. Math. 346: 80-94 (2024)- [j50]Jørgen Bang-Jensen, Stéphane Bessy, Lucas Picasarri-Arrieta:
Constrained flows in networks. Theor. Comput. Sci. 1010: 114702 (2024) - [c10]Stéphane Bessy, Stéphan Thomassé, Laurent Viennot:
Temporalizing Digraphs via Linear-Size Balanced Bi-Trees. STACS 2024: 13:1-13:12 - [i23]Stéphane Bessy, Daniel Gonçalves, Amadeus Reinald:
Oriented trees in O(k √k)-chromatic digraphs, a subquadratic bound for Burr's conjecture. CoRR abs/2402.19351 (2024) - 2023
- [j49]Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach:
Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs. Electron. J. Comb. 30(1) (2023) - [j48]Stéphane Bessy, Jocelyn Thiebaut:
Complementary cycles of any length in regular bipartite tournaments. J. Graph Theory 103(2): 186-211 (2023) - [c9]Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Kernelization for Graph Packing Problems via Rainbow Matching. SODA 2023: 3654-3663 - [i22]Stéphane Bessy, Stéphan Thomassé, Laurent Viennot:
Temporalizing digraphs via linear-size balanced bi-trees. CoRR abs/2304.03567 (2023) - [i21]Stéphane Bessy, Frédéric Havet, Lucas Picasarri-Arrieta:
Dichromatic number of chordal graphs. CoRR abs/2309.17385 (2023) - [i20]Stéphane Bessy, Jørgen Bang-Jensen, Lucas Picasarri-Arrieta:
Constrained Flows in Networks. CoRR abs/2310.01042 (2023) - 2022
- [j47]Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach:
Factorially Many Maximum Matchings Close to the Erdős-Gallai Bound. Electron. J. Comb. 29(2) (2022) - [j46]Stéphane Bessy, Dieter Rautenbach:
Algorithmic aspects of broadcast independence. Discret. Appl. Math. 314: 142-149 (2022) - [j45]Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo:
Non-separating Spanning Trees and Out-Branchings in Digraphs of Independence Number 2. Graphs Comb. 38(6): 187 (2022) - [j44]Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo:
Arc-disjoint in- and out-branchings in digraphs of independence number at most 2. J. Graph Theory 100(2): 294-314 (2022) - [j43]Jørgen Bang-Jensen, Stéphane Bessy, Daniel Gonçalves, Lucas Picasarri-Arrieta:
Complexity of some arc-partition problems for digraphs. Theor. Comput. Sci. 928: 167-182 (2022) - [i19]Stéphane Bessy, Marin Bougeret, Dimitrios M. Thilikos, Sebastian Wiederrecht:
Kernelization for Graph Packing Problems via Rainbow Matching. CoRR abs/2207.06874 (2022) - 2021
- [j42]Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi:
Packing Arc-Disjoint Cycles in Tournaments. Algorithmica 83(5): 1393-1420 (2021) - [j41]Stéphane Bessy, Johannes Pardey, Dieter Rautenbach:
Exponential independence in subcubic graphs. Discret. Math. 344(8): 112439 (2021) - [j40]Jørgen Bang-Jensen, Stéphane Bessy, Jing Huang, Matthias Kriesell:
Good orientations of unions of edge-disjoint spanning trees. J. Graph Theory 96(4): 594-618 (2021) - [i18]Stéphane Bessy, Jocelyn Thiebaut:
Complementary cycles of any length in regular bipartite tournaments. CoRR abs/2102.04514 (2021) - [i17]Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau:
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. CoRR abs/2105.01582 (2021) - 2020
- [j39]Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski:
Maximal Wiener index for graphs with prescribed number of blocks. Appl. Math. Comput. 380: 125274 (2020) - [j38]Stéphane Bessy, Marin Bougeret, Steven Chaplick, Daniel Gonçalves, Christophe Paul:
On independent set in B1-EPG graphs. Discret. Appl. Math. 278: 62-72 (2020) - [j37]Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski:
Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs. Discret. Appl. Math. 284: 195-200 (2020) - [j36]Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski:
The structure of graphs with given number of blocks and the maximum Wiener index. J. Comb. Optim. 39(1): 170-184 (2020) - [j35]Noga Alon, Jørgen Bang-Jensen, Stéphane Bessy:
Out-colourings of digraphs. J. Graph Theory 93(1): 88-112 (2020) - [i16]Jørgen Bang-Jensen, Stéphane Bessy, Anders Yeo:
Non-separating spanning trees and out-branchings in digraphsof independence number 2. CoRR abs/2007.02834 (2020)
2010 – 2019
- 2019
- [j34]Stéphane Bessy, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach:
Dynamic monopolies for interval graphs with bounded thresholds. Discret. Appl. Math. 260: 256-261 (2019) - [j33]Stéphane Bessy, Dieter Rautenbach:
Relating broadcast independence and independence. Discret. Math. 342(12) (2019) - [j32]Stéphane Bessy, Pascal Ochem, Dieter Rautenbach:
On the Kőnig?Egerváry theorem for k?paths. J. Graph Theory 91(1): 73-87 (2019) - [j31]Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo:
Bipartite spanning sub(di)graphs induced by 2-partitions. J. Graph Theory 92(2): 130-151 (2019) - [j30]Stéphane Bessy, Rodolphe Giroudeau:
Parameterized complexity of a coupled-task scheduling problem. J. Sched. 22(3): 305-313 (2019) - [j29]Jørgen Bang-Jensen, Stéphane Bessy:
Degree-constrained 2-partitions of graphs. Theor. Comput. Sci. 776: 64-74 (2019) - [c8]Stéphane Bessy, Marin Bougeret, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza:
Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. IPEC 2019: 2:1-2:16 - [c7]Stéphane Bessy, Marin Bougeret, R. Krithika, Abhishek Sahu, Saket Saurabh, Jocelyn Thiebaut, Meirav Zehavi:
Packing Arc-Disjoint Cycles in Tournaments. MFCS 2019: 27:1-27:14 - [i15]Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski:
The structure of graphs with given number of blocks and the maximum Wiener index. CoRR abs/1905.02633 (2019) - [i14]Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski:
Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs. CoRR abs/1905.04291 (2019) - [i13]Stéphane Bessy, Marin Bougeret, Alan Diêgo A. Carneiro, Fábio Protti, Uéverton S. Souza:
Width Parameterizations for Knot-free Vertex Deletion on Digraphs. CoRR abs/1910.01783 (2019) - 2018
- [j28]Stéphane Bessy, Anthony Bonato, Jeannette C. M. Janssen, Dieter Rautenbach, Elham Roshanbin:
Bounds on the burning number. Discret. Appl. Math. 235: 16-22 (2018) - [j27]Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
The Geodetic Hull Number is Hard for Chordal Graphs. SIAM J. Discret. Math. 32(1): 543-547 (2018) - [j26]Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo:
Out-degree reducing partitions of digraphs. Theor. Comput. Sci. 719: 64-72 (2018) - [i12]Jørgen Bang-Jensen, Stéphane Bessy:
Degree-constrained 2-partitions of graphs. CoRR abs/1801.06216 (2018) - [i11]Stéphane Bessy, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach:
Dynamic monopolies for interval graphs with bounded thresholds. CoRR abs/1802.03935 (2018) - [i10]Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut:
(Arc-disjoint) cycle packing in tournament: classical and parameterized complexity. CoRR abs/1802.06669 (2018) - 2017
- [j25]Stéphane Bessy, Anthony Bonato, Jeannette C. M. Janssen, Dieter Rautenbach, Elham Roshanbin:
Burning a graph is hard. Discret. Appl. Math. 232: 73-87 (2017) - [j24]Stéphane Bessy, Pascal Ochem, Dieter Rautenbach:
Bounds on the exponential domination number. Discret. Math. 340(3): 494-503 (2017) - [j23]Stéphane Bessy, Nicolas Bousquet:
Colorful paths for 3-chromatic graphs. Discret. Math. 340(5): 1000-1007 (2017) - [j22]Stéphane Bessy, Jocelyn Thiebaut:
Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture. Electron. Notes Discret. Math. 61: 115-121 (2017) - [j21]Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
The Geodetic Hull Number is Hard for Chordal Graphs. Electron. Notes Discret. Math. 62: 291-296 (2017) - [j20]Stéphane Bessy, Dieter Rautenbach:
Extremal Values of the Chromatic Number for a Given Degree Sequence. Graphs Comb. 33(4): 789-799 (2017) - [j19]Jørgen Bang-Jensen, Stéphane Bessy, Bill Jackson, Matthias Kriesell:
Antistrong digraphs. J. Comb. Theory B 122: 68-90 (2017) - [c6]Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut:
Triangle Packing in (Sparse) Tournaments: Approximation and Kernelization. ESA 2017: 14:1-14:13 - [i9]Stéphane Bessy, Mitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach:
The Geodetic Hull Number is Hard for Chordal Graphs. CoRR abs/1704.02242 (2017) - [i8]Noga Alon, Jørgen Bang-Jensen, Stéphane Bessy:
Out-colourings of Digraphs. CoRR abs/1706.06441 (2017) - [i7]Stéphane Bessy, Marin Bougeret, Jocelyn Thiebaut:
Triangle packing in (sparse) tournaments: approximation and kernelization. CoRR abs/1707.04220 (2017) - [i6]Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo:
Out-degree reducing partitions of digraphs. CoRR abs/1707.09349 (2017) - [i5]Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo:
Bipartite spanning sub(di)graphs induced by 2-partitions. CoRR abs/1707.09400 (2017) - 2016
- [j18]Stéphane Bessy, Pascal Ochem, Dieter Rautenbach:
Exponential Domination in Subcubic Graphs. Electron. J. Comb. 23(4): 4 (2016) - 2015
- [j17]Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni:
Two-floor buildings need eight colors. J. Graph Algorithms Appl. 19(1): 1-9 (2015) - [j16]Jørgen Bang-Jensen, Stéphane Bessy:
Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles. J. Graph Theory 79(4): 249-266 (2015) - [c5]Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul:
On Independent Set on B1-EPG Graphs. WAOA 2015: 158-169 - [i4]Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul:
On independent set on B1-EPG graphs. CoRR abs/1510.00598 (2015) - 2014
- [j15]Jørgen Bang-Jensen, Stéphane Bessy, Stéphan Thomassé:
Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments. J. Graph Theory 75(3): 284-302 (2014) - [j14]Jørgen Bang-Jensen, Stéphane Bessy:
(Arc-)disjoint flows in networks. Theor. Comput. Sci. 526: 28-40 (2014) - 2013
- [j13]Stéphane Bessy, Anthony Perez:
Polynomial kernels for Proper Interval Completion and related problems. Inf. Comput. 231: 89-108 (2013) - [j12]Stéphane Bessy, Frédéric Havet:
Enumerating the edge-colourings and total colourings of a regular graph. J. Comb. Optim. 25(4): 523-535 (2013) - 2012
- [b1]Stéphane Bessy:
Some problems in graph theory and graphs algorithmic theory. Montpellier 2 University, France, 2012 - 2011
- [j11]Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé:
Kernels for feedback arc set in tournaments. J. Comput. Syst. Sci. 77(6): 1071-1078 (2011) - [c4]Stéphane Bessy, Anthony Perez:
Polynomial Kernels for Proper Interval Completion and Related Problems. FCT 2011: 229-239 - [i3]Stéphane Bessy, Anthony Perez:
Polynomial kernels for Proper Interval Completion and related problems. CoRR abs/1103.5599 (2011) - 2010
- [j10]Stéphane Bessy, Christophe Paul, Anthony Perez:
Polynomial kernels for 3-leaf power graph modification problems. Discret. Appl. Math. 158(16): 1732-1744 (2010) - [j9]Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni:
Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree. Discret. Math. 310(3): 557-560 (2010) - [j8]Stéphane Bessy, Stéphan Thomassé:
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture. J. Comb. Theory B 100(2): 176-180 (2010) - [j7]Stéphane Bessy, Clément Lepelletier:
Optical index of fault tolerant routings in WDM networks. Networks 56(2): 95-102 (2010)
2000 – 2009
- 2009
- [c3]Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé:
Kernels for Feedback Arc Set In Tournaments. FSTTCS 2009: 37-47 - [c2]Stéphane Bessy, Christophe Paul, Anthony Perez:
Polynomial Kernels for 3-Leaf Power Graph Modification Problems. IWOCA 2009: 72-82 - [i2]Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé:
Kernels for Feedback Arc Set In Tournaments. CoRR abs/0907.2165 (2009) - 2008
- [j6]Stéphane Bessy:
Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdös condition approach. Discret. Math. 308(18): 4108-4115 (2008) - [i1]Stéphane Bessy, Christophe Paul, Anthony Perez:
Polynomial kernels for 3-leaf power graph modification problems. CoRR abs/0809.2858 (2008) - 2007
- [j5]Stéphane Bessy, Stéphan Thomassé:
Spanning a strong digraph by alpha circuits: A proof of Gallai's conjecture. Comb. 27(6): 659-667 (2007) - [j4]Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni:
Two proofs of Bermond-Thomassen conjecture for regular tournaments. Electron. Notes Discret. Math. 28: 47-53 (2007) - 2006
- [j3]Stéphane Bessy, Frédéric Havet, Etienne Birmelé:
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. J. Graph Theory 53(4): 315-332 (2006) - 2005
- [j2]Stéphane Bessy, Stéphan Thomassé:
The categorical product of two 5-chromatic digraphs can be 3-chromatic. Discret. Math. 305(1-3): 344-346 (2005) - 2004
- [c1]Stéphane Bessy, Stéphan Thomassé:
Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs. IPCO 2004: 132-138 - 2003
- [j1]Stéphane Bessy, Stéphan Thomassé:
Every strong digraph has a spanning strong subgraph with at most n+2 alpha-2 arcs. J. Comb. Theory B 87(2): 289-299 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
