Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Stéphan Thomassé
2010 – today
- 2013
[j42]Louigi Addario-Berry, Frédéric Havet, Cláudia Linhares Sales, Bruce A. Reed, Stéphan Thomassé: Oriented trees in digraphs. Discrete Mathematics 313(8): 967-974 (2013)- [j41]Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé: A linear vertex kernel for maximum internal spanning tree. J. Comput. Syst. Sci. 79(1): 1-6 (2013)
- [j40]Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Jacob Fox, Martin Loebl, Alex Scott, Paul D. Seymour, Stéphan Thomassé: Tournaments and colouring. J. Comb. Theory, Ser. B 103(1): 1-20 (2013)
- [j39]Felix Brandt, Maria Chudnovsky, Ilhee Kim, Gaku Liu, Sergey Norin, Alex Scott, Paul D. Seymour, Stéphan Thomassé: A counterexample to a conjecture of Schwartz. Social Choice and Welfare 40(3): 739-743 (2013)
- [c14]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé: Graph coloring, communication complexity and the stubborn problem (Invited talk). STACS 2013: 3-4
- [i15]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé: Clique versus Independent Set. CoRR abs/1301.2474 (2013)
- [i14]Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé: The Erdős-Hajnal Conjecture for Paths and Antipaths. CoRR abs/1303.5205 (2013)
- 2012
- [j38]Nicolas Bousquet, Stéphan Thomassé: Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs. Combinatorics, Probability & Computing 21(4): 512-514 (2012)
- [j37]Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé: On spanning galaxies in digraphs. Discrete Applied Mathematics 160(6): 744-754 (2012)
- [j36]Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé: A stability theorem on fractional covering of triangles by edges. Eur. J. Comb. 33(5): 799-806 (2012)
- [j35]Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé: Packing and Covering Triangles in K 4-free Planar Graphs. Graphs and Combinatorics 28(5): 653-662 (2012)
- [j34]Jan van den Heuvel, Stéphan Thomassé: Cyclic orderings and cyclic arboricity of matroids. J. Comb. Theory, Ser. B 102(3): 638-646 (2012)
- [c13]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé: Parameterized Domination in Circle Graphs. WG 2012: 308-319
- [i13]Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé: Parameterized Domination in Circle Graphs. CoRR abs/1205.3728 (2012)
- [i12]Bruno Grenet, Thierry Monteil, Stéphan Thomassé: Symmetric Determinantal Representations in Characteristic 2. CoRR abs/1210.5879 (2012)
- 2011
- [j33]Flavio Guiñez, Martín Matamala, Stéphan Thomassé: Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem. Discrete Applied Mathematics 159(1): 23-30 (2011)
- [j32]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)
- [j31]Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé: The Domination Number of Grids. SIAM J. Discrete Math. 25(3): 1443-1453 (2011)
- [j30]Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35): 4570-4578 (2011)
- [c12]Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé: Hitting and Harvesting Pumpkins. ESA 2011: 394-407
- [c11]Robert Crowston, Michael R. Fellows, Gregory Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo: Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average. FSTTCS 2011: 229-240
- [c10]Christophe Paul, Anthony Perez, Stéphan Thomassé: Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem. MFCS 2011: 497-507
- [c9]
- [i11]Christophe Paul, Anthony Perez, Stéphan Thomassé: Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems. CoRR abs/1101.4491 (2011)
- [i10]Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé: The Domination Number of Grids. CoRR abs/1102.5206 (2011)
- [i9]Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé: Hitting and Harvesting Pumpkins. CoRR abs/1105.2704 (2011)
- 2010
- [j29]Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé: WDM and Directed Star Arboricity. Combinatorics, Probability & Computing 19(2): 161-182 (2010)
- [j28]Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé: Partitions versus sets: A case of duality. Eur. J. Comb. 31(3): 681-687 (2010)
- [j27]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)
- [j26]Jean Daligault, Michaël Rao, Stéphan Thomassé: Well-Quasi-Order of Relabel Functions. Order 27(3): 301-315 (2010)
- [j25]
- [i8]
- [i7]
2000 – 2009
- 2009
- [j24]Frédéric Havet, Stéphan Thomassé: Complexity of (p, 1)-total labelling. Discrete Applied Mathematics 157(13): 2859-2870 (2009)
- [j23]Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé: Submodular partition functions. Discrete Mathematics 309(20): 6000-6008 (2009)
- [j22]Daniel Gonçalves, Alexandre Pinlou, Stéphan Thomassé, Frédéric Havet: Spanning galaxies in digraphs. Electronic Notes in Discrete Mathematics 34: 139-143 (2009)
- [c8]Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo: Kernel Bounds for Disjoint Cycles and Disjoint Paths. ESA 2009: 635-646
- [c7]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
- [c6]Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé: A Linear Vertex Kernel for Maximum Internal Spanning Tree. ISAAC 2009: 275-282
- [c5]
- [c4]
- [c3]Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo: A Polynomial Kernel for Multicut in Trees. STACS 2009: 183-194
- [i6]Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo: A Polynomial Kernel For Multicut In Trees. CoRR abs/0902.1047 (2009)
- [i5]Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé: Partitions versus sets : a case of duality. CoRR abs/0903.2100 (2009)
- [i4]Jean Daligault, Stéphan Thomassé: On Finding Directed Trees with Many Leaves. CoRR abs/0904.2658 (2009)
- [i3]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)
- [i2]Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé: A Linear Vertex Kernel for Maximum Internal Spanning Tree. CoRR abs/0907.3208 (2009)
- 2008
- [j21]Frédéric Havet, Stéphan Thomassé, Anders Yeo: Hoàng-Reed conjecture holds for tournaments. Discrete Mathematics 308(15): 3412-3415 (2008)
- [j20]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)
- [c2]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
- 2007
- [j19]Stéphan Thomassé, Anders Yeo: Total domination of graphs and small transversals of hypergraphs. Combinatorica 27(4): 473-487 (2007)
- [j18]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)
- [j17]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)
- [j16]Pierre Charbit, Stéphan Thomassé: Graphs with Large Girth Not Embeddable in the Sphere. Combinatorics, Probability & Computing 16(6): 829-832 (2007)
- [j15]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)
- [i1]Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé: WDM and Directed Star Arboricity. CoRR abs/0705.0315 (2007)
- 2006
- [j14]John Adrian Bondy, Jian Shen, Stéphan Thomassé, Carsten Thomassen: Density Conditions For Triangles In Multipartite Graphs. Combinatorica 26(2): 121-131 (2006)
- 2005
- [j13]
- [j12]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
- [j11]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)
- [c1]Stéphane Bessy, Stéphan Thomassé: Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs. IPCO 2004: 132-138
- 2003
- [j10]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)
- [j9]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)
- [j8]Jørgen Bang-Jensen, Stéphan Thomassé, Anders Yeo: Small degree out-branchings. Journal of Graph Theory 42(4): 297-307 (2003)
- 2002
- [j7]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
- [j6]Jean-Luc Rullière, Stéphan Thomassé: Countable alpha-extendable graphs. Discrete Mathematics 239(1-3): 53-67 (2001)
- [j5]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
- [j4]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)
- [j3]Frédéric Havet, Stéphan Thomassé: Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture. Journal of Graph Theory 35(4): 244-256 (2000)
1990 – 1999
- 1998
- [j2]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
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-28 20:45 CEST by the dblp team