Stéphane Bessy

	2011
17		Stéphane Bessy, Anthony Perez: Polynomial Kernels for Proper Interval Completion and Related Problems. FCT 2011: 229-239
16		Stéphane Bessy, Anthony Perez: Polynomial kernels for Proper Interval Completion and related problems CoRR abs/1103.5599: (2011)
15		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)
	2010
14		Stéphane Bessy, Christophe Paul, Anthony Perez: Polynomial kernels for 3-leaf power graph modification problems. Discrete Applied Mathematics 158(16): 1732-1744 (2010)
13		Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni: Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree. Discrete Mathematics 310(3): 557-560 (2010)
12		Stéphane Bessy, Stéphan Thomassé: Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture. J. Comb. Theory, Ser. B 100(2): 176-180 (2010)
11		Stéphane Bessy, Clément Lepelletier: Optical index of fault tolerant routings in WDM networks. Networks 56(2): 95-102 (2010)
	2009
10		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
9		Stéphane Bessy, Christophe Paul, Anthony Perez: Polynomial Kernels for 3-Leaf Power Graph Modification Problems. IWOCA 2009: 72-82
8		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
7		Stéphane Bessy, Christophe Paul, Anthony Perez: Polynomial kernels for 3-leaf power graph modification problems CoRR abs/0809.2858: (2008)
	2007
6		Stéphane Bessy, Stéphan Thomassé: Spanning a strong digraph by alpha circuits: A proof of Gallai's conjecture. Combinatorica 27(6): 659-667 (2007)
5		Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni: Two proofs of Bermond-Thomassen conjecture for regular tournaments. Electronic Notes in Discrete Mathematics 28: 47-53 (2007)
	2006
4		Stéphane Bessy, Frédéric Havet, Etienne Birmelé: Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. Journal of Graph Theory 53(4): 315-332 (2006)
	2005
3		Stéphane Bessy, Stéphan Thomassé: The categorical product of two 5-chromatic digraphs can be 3-chromatic. Discrete Mathematics 305(1-3): 344-346 (2005)
	2004
2		Stéphane Bessy, Stéphan Thomassé: Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs. IPCO 2004: 132-138
	2003
1		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, Ser. B 87(2): 289-299 (2003)

Coauthor Index

1	Etienne Birmelé	[4]
2	Fedor V. Fomin	[8] [10] [15]
3	Serge Gaspers	[8] [10] [15]
4	Frédéric Havet	[4]
5	Clément Lepelletier	[11]
6	Nicolas Lichiardopol	[5] [13]
7	Christophe Paul	[7] [8] [9] [10] [14] [15]
8	Anthony Perez	[7] [8] [9] [10] [14] [15] [16] [17]
9	Saket Saurabh	[8] [10] [15]
10	Jean-Sébastien Sereni	[5] [13]
11	Stéphan Thomassé	[1] [2] [3] [6] [8] [10] [12] [15]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page