Stéphane Bessy - Citegraph

Author Info

Name	Affiliation	Papers
STÉPHANE BESSY	Laboratoire LIRMM, Université Montpellier 2, 161, rue Ada, 34000 Montpellier, France	43
Collaborators	Citations	PageRank
48	117	19.68
Referers	Referees	References
182	347	226

Search Limit

100347

Publications (43 rows)

Collaborators (48 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Arc-disjoint in- and out-branchings in digraphs of independence number at most 2	0	0.34	2022
Packing Arc-Disjoint Cycles In Tournaments	0	0.34	2021
Exponential Independence In Subcubic Graphs	0	0.34	2021
On independent set in B1-EPG graphs	0	0.34	2020
On the Kőnig-Egerváry theorem for k-paths: BESSY et al.	0	0.34	2019
Parameterized complexity of a coupled-task scheduling problem	1	0.36	2019
The structure of graphs with given number of blocks and the maximum Wiener index.	0	0.34	2019
Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs.	0	0.34	2019
Bipartite spanning sub(di)graphs induced by 2-partitions: BANG-JENSEN et al.	0	0.34	2019
Width Parameterizations for Knot-Free Vertex Deletion on Digraphs.	0	0.34	2019
Dynamic monopolies for interval graphs with bounded thresholds.	1	0.36	2018
Bounds on the burning number.	5	0.64	2018
Degree-constrained 2-partitions of graphs.	0	0.34	2018
(Arc-disjoint) cycle packing in tournament: classical and parameterized complexity.	0	0.34	2018
Out-degree reducing partitions of digraphs.	1	0.41	2018
Colorful paths for 3-chromatic graphs	0	0.34	2017
Triangle packing in (sparse) tournaments: approximation and kernelization.	1	0.36	2017
Extremal Values of the Chromatic Number for a Given Degree Sequence.	0	0.34	2017
The Geodetic Hull Number is Hard for Chordal Graphs.	2	0.38	2017
Bounds on the Exponential Domination Number	3	0.57	2017
Out-colourings of digraphs.	0	0.34	2017
Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang Conjecture.	0	0.34	2017
Antistrong digraphs.	0	0.34	2017
Bipartite spanning sub(di)graphs induced by 2-partitions.	0	0.34	2017
Burning a graph is hard.	1	0.35	2017
Exponential Domination In Subcubic Graphs	2	0.53	2016
Cycle Transversals in Tournaments with Few Vertex Disjoint Cycles	0	0.34	2015
On independent set on B1-EPG graphs	1	0.36	2015
Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for Tournaments.	9	0.79	2014
(Arc-)disjoint flows in networks	4	0.53	2014
Enumerating the edge-colourings and total colourings of a regular graph.	5	0.46	2013
Kernels for feedback arc set in tournaments	21	0.79	2011
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture	27	1.51	2010
Optical index of fault tolerant routings in WDM networks	3	0.43	2010
Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree	10	1.23	2010
Polynomial Kernels for 3-Leaf Power Graph Modification Problems	8	0.50	2009
Spanning a strong digraph by alpha circuits: A proof of Gallai's conjecture	0	0.34	2007
Two proofs of Bermond-Thomassen conjecture for regular tournaments	2	0.66	2007
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree	5	0.52	2006
The categorical product of two 5-chromatic digraphs can be 3-chromatic	1	0.40	2005
Every strong digraph has a spanning strong subgraph with at most n+2α-2 arcs	2	0.37	2003
Every strong digraph has a spanning strong subgraph with at most n+2 alpha-2 arcs	1	0.36	2003
Every strong digraph has a spanning strong subgraph with at most n +2 α −2 arcs	1	0.36	2003