2009 |
26 | EE | Stéphan Thomassé,
Stéphan Thomassé:
A quadratic kernel for feedback vertex set.
SODA 2009: 115-119 |
25 | EE | Stéphan Thomassé,
Stéphan Thomassé:
A quadratic kernel for feedback vertex set.
SODA 2009: 115-119 |
24 | EE | Nicolas Bousquet,
Jean Daligault,
Stéphan Thomassé,
Anders Yeo:
A Polynomial Kernel for Multicut in Trees.
STACS 2009: 183-194 |
23 | EE | Nicolas Bousquet,
Jean Daligault,
Stéphan Thomassé,
Anders Yeo:
A Polynomial Kernel For Multicut In Trees
CoRR abs/0902.1047: (2009) |
22 | EE | Laurent Lyaudet,
Frédéric Mazoit,
Stéphan Thomassé:
Partitions versus sets : a case of duality
CoRR abs/0903.2100: (2009) |
21 | EE | Jean Daligault,
Stéphan Thomassé:
On Finding Directed Trees with Many Leaves
CoRR abs/0904.2658: (2009) |
2008 |
20 | EE | Louigi Addario-Berry,
Omid Amini,
Jean-Sébastien Sereni,
Stéphan Thomassé:
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear.
SWAT 2008: 41-52 |
19 | EE | Frédéric Havet,
Stéphan Thomassé,
Anders Yeo:
Hoàng-Reed conjecture holds for tournaments.
Discrete Mathematics 308(15): 3412-3415 (2008) |
18 | EE | Pierre Charbit,
Emmanuel Jeandel,
Pascal Koiran,
Sylvain Perifel,
Stéphan Thomassé:
Finding a vector orthogonal to roughly half a collection of vectors.
J. Complexity 24(1): 39-53 (2008) |
2007 |
17 | EE | Omid Amini,
Frédéric Havet,
Florian Huc,
Stéphan Thomassé:
WDM and Directed Star Arboricity
CoRR abs/0705.0315: (2007) |
16 | EE | Pierre Charbit,
Stéphan Thomassé,
Anders Yeo:
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments.
Combinatorics, Probability & Computing 16(1): 1-4 (2007) |
15 | EE | Pierre Charbit,
Stéphan Thomassé:
Graphs with Large Girth Not Embeddable in the Sphere.
Combinatorics, Probability & Computing 16(6): 829-832 (2007) |
14 | EE | Louigi Addario-Berry,
Frédéric Havet,
Stéphan Thomassé:
Paths with two blocks in n-chromatic digraphs.
J. Comb. Theory, Ser. B 97(4): 620-626 (2007) |
2006 |
13 | EE | Adrian Bondy,
Jian Shen,
Stéphan Thomassé,
Carsten Thomassen:
Density Conditions For Triangles In Multipartite Graphs.
Combinatorica 26(2): 121-131 (2006) |
2005 |
12 | EE | Gena Hahn,
Pierre Ille,
Stéphan Thomassé:
Preface.
Discrete Mathematics 291(1-3): 1- (2005) |
11 | EE | 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 |
10 | EE | Stéphane Bessy,
Stéphan Thomassé:
Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs.
IPCO 2004: 132-138 |
9 | EE | Abderrahim Boussaïri,
Pierre Ille,
Gérard Lopez,
Stéphan Thomassé:
The C3-structure of the tournaments.
Discrete Mathematics 277(1-3): 29-43 (2004) |
2003 |
8 | EE | Jørgen Bang-Jensen,
Stéphan Thomassé:
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs.
Discrete Applied Mathematics 131(2): 555-559 (2003) |
7 | EE | 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) |
2002 |
6 | EE | Anthony Bonato,
Peter J. Cameron,
Dejan Delic,
Stéphan Thomassé:
Generalized Pigeonhole Properties of Graphs and Oriented Graphs*1.
Eur. J. Comb. 23(3): 257-274 (2002) |
2001 |
5 | EE | Jean-Luc Rullière,
Stéphan Thomassé:
Countable alpha-extendable graphs.
Discrete Mathematics 239(1-3): 53-67 (2001) |
4 | EE | Stéphan Thomassé:
Covering a Strong Digraph by -1 Disjoint Paths: A Proof of Las Vergnas' Conjecture.
J. Comb. Theory, Ser. B 83(2): 331-333 (2001) |
2000 |
3 | EE | Frédéric Havet,
Stéphan Thomassé:
Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture.
J. Comb. Theory, Ser. B 78(2): 243-273 (2000) |
1998 |
2 | EE | Barry Guiduli,
András Gyárfás,
Stéphan Thomassé,
Peter Weidl:
2-Partition-Transitive Tournaments.
J. Comb. Theory, Ser. B 72(2): 181-196 (1998) |
1997 |
1 | EE | Stéphan Thomassé:
Indivisibility and Alpha-morphisms.
Eur. J. Comb. 18(4): 445-454 (1997) |