|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2 occurrences of 2 keywords
|
|
|
|
|
Results
Found 57 publication records. Showing 57 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jan van den Heuvel, Stéphan Thomassé |
Cyclic orderings and cyclic arboricity of matroids.  |
J. Comb. Theory, Ser. B  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Penny E. Haxell, Alexandr V. Kostochka, Stéphan Thomassé |
A stability theorem on fractional covering of triangles by edges. |
Eur. J. Comb. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé |
On spanning galaxies in digraphs. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo |
Kernel bounds for disjoint cycles and disjoint paths. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé |
Hitting and Harvesting Pumpkins |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Christophe Paul, Anthony Perez, Stéphan Thomassé |
Conflict Packing yields linear vertex-kernels for Rooted Triplet Inconsistency and other problems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé |
The Domination Number of Grids |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé |
The Domination Number of Grids. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gwenaël Joret, Christophe Paul, Ignasi Sau, Saket Saurabh, Stéphan Thomassé |
Hitting and Harvesting Pumpkins. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bousquet, Jean Daligault, Stéphan Thomassé |
Multicut is FPT. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé |
Partitions versus sets: A case of duality. |
Eur. J. Comb. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé |
WDM and Directed Star Arboricity. |
Combinatorics, Probability & Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphan Thomassé |
A 4k2 kernel for feedback vertex set. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bousquet, Jean Daligault, Stéphan Thomassé |
Multicut is FPT |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Matt DeVos, Stéphan Thomassé |
Edge Growth in Graph Cubes |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jean Daligault, Michaël Rao, Stéphan Thomassé |
Well-Quasi-Order of Relabel Functions. |
Order |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Gonçalves, Alexandre Pinlou, Stéphan Thomassé, Frédéric Havet |
Spanning galaxies in digraphs. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé |
Submodular partition functions. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé |
A Linear Vertex Kernel for Maximum Internal Spanning Tree |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP BibTeX RDF |
|
| 1 | Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé |
Partitions versus sets : a case of duality |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Jean Daligault, Stéphan Thomassé |
On Finding Directed Trees with Many Leaves |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo |
A Polynomial Kernel For Multicut In Trees |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Frédéric Havet, Stéphan Thomassé |
Complexity of (p, 1)-total labelling. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo |
Kernel Bounds for Disjoint Cycles and Disjoint Paths. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphan Thomassé |
A quadratic kernel for feedback vertex set. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Daligault, Stéphan Thomassé |
On Finding Directed Trees with Many Leaves. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo |
A Polynomial Kernel for Multicut in Trees. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé |
A Linear Vertex Kernel for Maximum Internal Spanning Tree. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé |
Finding a vector orthogonal to roughly half a collection of vectors. |
J. Complexity |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Havet, Stéphan Thomassé, Anders Yeo |
Hoàng-Reed conjecture holds for tournaments. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé |
Guarding Art Galleries: The Extra Cost for Sculptures Is Linear. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
Pseudo-triangulation, Art Gallery |
| 1 | Louigi Addario-Berry, Frédéric Havet, Stéphan Thomassé |
Paths with two blocks in n-chromatic digraphs. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Charbit, Stéphan Thomassé |
Graphs with Large Girth Not Embeddable in the Sphere. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Charbit, Stéphan Thomassé, Anders Yeo |
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. |
Combinatorics, Probability & Computing |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Bessy, Stéphan Thomassé |
Spanning a strong digraph by alpha circuits: A proof of Gallai's conjecture. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphan Thomassé, Anders Yeo |
Total domination of graphs and small transversals of hypergraphs. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé |
WDM and Directed Star Arboricity |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Adrian Bondy, Jian Shen, Stéphan Thomassé, Carsten Thomassen |
Density Conditions For Triangles In Multipartite Graphs. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C35 |
| 1 | Gena Hahn, Pierre Ille, Stéphan Thomassé |
Preface. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Bessy, Stéphan Thomassé |
The categorical product of two 5-chromatic digraphs can be 3-chromatic. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Abderrahim Boussaïri, Pierre Ille, Gérard Lopez, Stéphan Thomassé |
The C3-structure of the tournaments. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Bessy, Stéphan Thomassé |
Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs. |
IPCO |
2004 |
DBLP DOI BibTeX RDF |
|
| 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 |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jørgen Bang-Jensen, Stéphan Thomassé |
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Anthony Bonato, Peter J. Cameron, Dejan Delic, Stéphan Thomassé |
Generalized Pigeonhole Properties of Graphs and Oriented Graphs*1. |
Eur. J. Comb. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphan Thomassé |
Covering a Strong Digraph by -1 Disjoint Paths: A Proof of Las Vergnas' Conjecture. |
J. Comb. Theory, Ser. B |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Luc Rullière, Stéphan Thomassé |
Countable alpha-extendable graphs. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Havet, Stéphan Thomassé |
Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture. |
J. Comb. Theory, Ser. B |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Barry Guiduli, András Gyárfás, Stéphan Thomassé, Peter Weidl |
2-Partition-Transitive Tournaments. |
J. Comb. Theory, Ser. B |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphan Thomassé |
Indivisibility and Alpha-morphisms. |
Eur. J. Comb. |
1997 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #57 of 57 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")