|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 17 publication records. Showing 17 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Stéphane Bessy, Anthony Perez |
Polynomial kernels for Proper Interval Completion and related problems  |
CoRR  |
2011 |
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. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Bessy, Anthony Perez |
Polynomial Kernels for Proper Interval Completion and Related Problems. |
FCT |
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 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Bessy, Clément Lepelletier |
Optical index of fault tolerant routings in WDM networks. |
Networks |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Bessy, Christophe Paul, Anthony Perez |
Polynomial kernels for 3-leaf power graph modification problems. |
Discrete Applied Mathematics |
2010 |
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 |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Bessy, Christophe Paul, Anthony Perez |
Polynomial Kernels for 3-Leaf Power Graph Modification Problems. |
IWOCA |
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 | Stéphane Bessy, Christophe Paul, Anthony Perez |
Polynomial kernels for 3-leaf power graph modification problems |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Bessy, Nicolas Lichiardopol, Jean-Sébastien Sereni |
Two proofs of Bermond-Thomassen conjecture for regular tournaments. |
Electronic Notes in Discrete Mathematics |
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é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 |
2006 |
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 | 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 |
|
Displaying result #1 - #17 of 17 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")