The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stéphan Thomassé: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stéphane Bessy, Stéphan Thomassé
    Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:132-138 [Conf]
  2. Adrian Bondy, Jian Shen, Stéphan Thomassé, Carsten Thomassen
    Density Conditions For Triangles In Multipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:2, pp:121-131 [Journal]
  3. Jørgen Bang-Jensen, Stéphan Thomassé
    Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:555-559 [Journal]
  4. Stéphane Bessy, Stéphan Thomassé
    The categorical product of two 5-chromatic digraphs can be 3-chromatic. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:305, n:1-3, pp:344-346 [Journal]
  5. Abderrahim Boussaïri, Pierre Ille, Gérard Lopez, Stéphan Thomassé
    The C3-structure of the tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:277, n:1-3, pp:29-43 [Journal]
  6. Gena Hahn, Pierre Ille, Stéphan Thomassé
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:291, n:1-3, pp:1-0 [Journal]
  7. Jean-Luc Rullière, Stéphan Thomassé
    Countable alpha-extendable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:53-67 [Journal]
  8. Anthony Bonato, Peter J. Cameron, Dejan Delic, Stéphan Thomassé
    Generalized Pigeonhole Properties of Graphs and Oriented Graphs*1. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:3, pp:257-274 [Journal]
  9. Stéphan Thomassé
    Indivisibility and Alpha-morphisms. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1997, v:18, n:4, pp:445-454 [Journal]
  10. Stéphane Bessy, Stéphan Thomassé
    Every strong digraph has a spanning strong subgraph with at most n+2 alpha-2 arcs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:289-299 [Journal]
  11. Barry Guiduli, András Gyárfás, Stéphan Thomassé, Peter Weidl
    2-Partition-Transitive Tournaments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:72, n:2, pp:181-196 [Journal]
  12. Frédéric Havet, Stéphan Thomassé
    Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:78, n:2, pp:243-273 [Journal]
  13. Stéphan Thomassé
    Covering a Strong Digraph by -1 Disjoint Paths: A Proof of Las Vergnas' Conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:331-333 [Journal]
  14. Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé
    WDM and Directed Star Arboricity [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  15. Louigi Addario-Berry, Frédéric Havet, Stéphan Thomassé
    Paths with two blocks in n-chromatic digraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:4, pp:620-626 [Journal]

  16. Kernel Bounds for Disjoint Cycles and Disjoint Paths. [Citation Graph (, )][DBLP]


  17. Kernels for Feedback Arc Set In Tournaments. [Citation Graph (, )][DBLP]


  18. A Linear Vertex Kernel for Maximum Internal Spanning Tree. [Citation Graph (, )][DBLP]


  19. On Finding Directed Trees with Many Leaves. [Citation Graph (, )][DBLP]


  20. A quadratic kernel for feedback vertex set. [Citation Graph (, )][DBLP]


  21. A Polynomial Kernel for Multicut in Trees. [Citation Graph (, )][DBLP]


  22. Guarding Art Galleries: The Extra Cost for Sculptures Is Linear. [Citation Graph (, )][DBLP]


  23. Spanning a strong digraph by alpha circuits: A proof of Gallai's conjecture. [Citation Graph (, )][DBLP]


  24. Total domination of graphs and small transversals of hypergraphs. [Citation Graph (, )][DBLP]


  25. A Polynomial Kernel For Multicut In Trees [Citation Graph (, )][DBLP]


  26. Partitions versus sets : a case of duality [Citation Graph (, )][DBLP]


  27. On Finding Directed Trees with Many Leaves [Citation Graph (, )][DBLP]


  28. Kernels for Feedback Arc Set In Tournaments [Citation Graph (, )][DBLP]


  29. A Linear Vertex Kernel for Maximum Internal Spanning Tree [Citation Graph (, )][DBLP]


  30. The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. [Citation Graph (, )][DBLP]


  31. Graphs with Large Girth Not Embeddable in the Sphere. [Citation Graph (, )][DBLP]


  32. Complexity of (p, 1)-total labelling. [Citation Graph (, )][DBLP]


  33. Hoàng-Reed conjecture holds for tournaments. [Citation Graph (, )][DBLP]


  34. Submodular partition functions. [Citation Graph (, )][DBLP]


  35. Partitions versus sets: A case of duality. [Citation Graph (, )][DBLP]


Search in 0.117secs, Finished in 0.120secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002