1. Recherche
46 résultats  enregistrer la recherche


  • 1
  • 2
...
ensl-00153736v1  Pré-publication, Document de travail
Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé. Finding a Vector Orthogonal to Roughly Half a Collection of Vectors
13 pages. 2007
...
lirmm-00325147v1  Communication dans un congrès
Louigi Addario-Berry, Omid Amini, Jean-Sébastien Sereni, Stéphan Thomassé. Guarding Art Galleries: The Extra Cost for Sculptures is Linear
SWAT'08: 11th Scandinavian Workshop on Algorithm Theory, Jul 2008, Gothenburg, Sweden. Springer, pp.41-52, 2008, LNCS. <http://www.dmist.net/swat2008/>. <10.1007/978-3-540-69903-3>
lirmm-00433050v1  Communication dans un congrès
Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé. Spanning galaxies in digraphs
Jaroslav Nešetřil and André Raspaud. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. Elsevier, 34, pp.139-143, 2009, Electronic Notes in Discrete Mathematics. <http://eurocomb09.labri.fr/>. <10.1016/j.endm.2009.07.023>
lirmm-00738534v1  Communication dans un congrès
Nicolas Bousquet, Daniel Gonçalves, George Mertzios, Christophe Paul, Ignasi Sau et al.  Parameterized Domination in Circle Graphs
WG'12: 38th International Workshop on Graph Theoretic Concepts in Computer Science, Jun 2012, Jerusalem, Israel. LNCS (7551), pp.308-319, 2012, Graph-Theoretic Concepts in Computer Science. <https://sites.google.com/site/wg2012conf/>. <10.1007/978-3-642-34611-8_31>
...
inria-00132396v3  Rapport
Omid Amini, Frédéric Havet, Florian Huc, Stéphan Thomassé. WDM and Directed Star Arboricity
[Research Report] RR-6179, INRIA. 2007, pp.20
...
inria-00173438v3  Rapport
Frédéric Havet, Stéphan Thomassé. Complexity of $(p,1)$-total labelling
[Research Report] RR-6305, INRIA. 2007, pp.22
...
inria-00551133v1  Rapport
Louigi Addario-Berry, Frédéric Havet, Claudia Linhares Sales, Bruce Reed, Stéphan Thomassé. Oriented trees in digraphs.
[Research Report] RR-7502, INRIA. 2011
lirmm-00806805v1  Article dans une revue
Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo. Kernel bounds for disjoint cycles and disjoint paths
Theoretical Computer Science, Elsevier, 2011, 412, pp.4570-4578. <10.1016/j.tcs.2011.04.039>
hal-01178188v1  Article dans une revue
Christophe Paul, Nicolas Bousquet, Daniel Gonçalves, George Mertzios, Ignasi Sau et al.  Parameterized domination in circle graphs
Theory of Computing Systems, Springer Verlag, 2014, 54 (1), pp.45-72. <10.1007/s00224-013-9478-8>
...
hal-01347776v1  Article dans une revue
Robert Crowston, Michael Fellows, Gregory Gutin, Mark Jones, Eun Jung Kim et al.  Satisfying more than half of a system of linear equations over GF(2): A multivariate approach
Journal of Computer and System Sciences, 2014, 80 (4), <10.1016/j.jcss.2013.10.002>
...
ensl-01345746v2  Pré-publication, Document de travail
Ignacio Garcia-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé. On the complexity of partial derivatives
2016
...
ensl-00850791v2  Rapport
Pascal Koiran, Natacha Portier, Sébastien Tavenas, Stéphan Thomassé. A tau-conjecture for Newton polygons
2014, pp.14
...
hal-01403921v1  Rapport
Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo Moura et al.  Subdivisions in digraphs of large out-degree or large dichromatic number *
[Research Report] INRIA Sophia Antipolis - I3S. 2016
...
inria-00091366v2  Rapport
Frédéric Havet, Stéphan Thomassé, Anders Yeo. Hoàng-Reed conjecture holds for tournaments
[Research Report] RR-5976, INRIA. 2006, pp.7
...
inria-00070325v1  Rapport
Louigi Addario-Berry, Stéphan Thomassé, Frédéric Havet. Paths with two blocks in $n$-chromatic digraphs
[Research Report] RR-5688, INRIA. 2005, pp.8
...
hal-00012312v1  Pré-publication, Document de travail
Frédéric Mazoit, Stéphan Thomassé. Branchwidth of graphic matroids.
2005
...
hal-00821609v1  Article dans une revue
Louigi Addario-Berry, Frédéric Havet, Claudia Linhares Sales, Bruce Reed, Stéphan Thomassé. Oriented trees in digraphs
Discrete Mathematics, Elsevier, 2013, 313 (8), pp.967-974. <http://www.sciencedirect.com/science/article/pii/S0012365X13000289>. <10.1016/j.disc.2013.01.011>
hal-01324090v1  Article dans une revue
Nicolas Bousquet, Stéphan Thomassé. VC-dimension and Erdős–Pósa property
Discrete Mathematics, Elsevier, 2015, 338, pp.2302-2317. <10.1016/j.disc.2015.05.026>
...
hal-00749191v1  Article dans une revue
Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé. The spanning galaxy problem
Discrete Applied Mathematics, Elsevier, 2012, 160 (6), pp.744-754
...
lirmm-00292710v1  Article dans une revue
Frédéric Havet, Stéphan Thomassé, Anders Yeo. The Hoàng-Reed Conjecture holds for tournaments
Discrete Mathematics, Elsevier, 2008, 308, pp.3412-3415. <10.1016/j.disc.2007.06.033>
...
lirmm-00432698v1  Article dans une revue
Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé. Submodular Partition Functions
Discrete Mathematics, Elsevier, 2009, 309, pp.6000-6008. <10.1016/j.disc.2009.04.033>
...
lirmm-00432700v1  Article dans une revue
Frédéric Havet, Stéphan Thomassé. Complexity of $(p,1)$-Total Labelling
Discrete Applied Mathematics, Elsevier, 2009, 157, pp.2859-2870
lirmm-00806743v1  Article dans une revue
Penny Haxell, Alexandr Kostochka, Stéphan Thomassé. Packing and Covering Triangles in K 4-free Planar Graphs
Graphs and Combinatorics, Springer Verlag, 2012, 28 (5), pp.653-662. <10.1007/s00373-011-1071-9>
...
hal-00345894v3  Article dans une revue
Laurent Lyaudet, Frédéric Mazoit, Stéphan Thomassé. Partitions versus sets : a case of duality
European Journal of Combinatorics, Elsevier, 2009, pp.1-7. <10.1016/j.ejc.2009.09.004>
  • 1
  • 2

Contact


archive-ouverte@inria.fr