Filtrer vos résultats
- 27
- 6
- 1
- 18
- 10
- 2
- 2
- 1
- 1
- 23
- 9
- 3
- 1
- 2
- 2
- 2
- 2
- 4
- 4
- 2
- 6
- 3
- 4
- 1
- 1
- 1
- 31
- 3
- 33
- 33
- 33
- 6
- 4
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 34
- 10
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
34 résultats
|
|
|
triés par
|
|
|
Edge-partitions of sparse graphs and their applications to game coloring2009
Autre publication scientifique
hal-00368828v1
|
||
Diffusion and/or Plastic Deformation around Fluid Inclusions in Synthetic Quartz: New InvestigationsFluid Movements — Element Transport and the Composition of the Deep Crust, Springer Netherlands, pp.345-360, 1989, ⟨10.1007/978-94-009-0991-5_28⟩
Chapitre d'ouvrage
istex
hal-02558502v1
|
|||
Computing the clique number of a-perfect graphs in polynomial timeProceedings of Eurocomb'11, Aug 2011, Budapest, Hungary. pp.705-710
Communication dans un congrès
hal-00592080v1
|
|||
On the polynomial time computability of the circular chromatic number for some superclasses of perfect graphLagos'09, 2009, Brazil. pp.53-58
Communication dans un congrès
hal-00790656v1
|
|||
Optimal Weighting to Minimize the Independence Ratio of a GraphISMP, Jun 2018, Bordeaux, France
Communication dans un congrès
hal-02491101v1
|
|||
Circular-clique polytopes and circular-perfect graphsKolKom08 - Kolloquium über Kombinatorik, Nov 2008, Magdeburg, Germany
Communication dans un congrès
hal-00333063v1
|
|||
Consecutive ones matrices for multi-dimensional orthogonal packing problemsInternational Symposium on Combinatorial Optimization, Mar 2010, Hammamet, Tunisia. pp.327-334
Communication dans un congrès
hal-00453404v1
|
|||
MPQ-trees for orthogonal packing problemInternational Symposium on Combinatorial Optimization, Mar 2010, Hammamet, Tunisia. pp.423-429
Communication dans un congrès
hal-00453408v1
|
|||
How unique is Lovasz's theta function?,2012 International Conference on Graph Theory, Combinatorics and Applications, Oct 2012, Jinhua, China
Communication dans un congrès
hal-00760631v1
|
|||
Interval graphs for orthogonal packing problemsInternational Conference in Discrete Mathematics, Jun 2013, Dharwad, India
Communication dans un congrès
hal-00920835v1
|
|||
Computing clique and chromatic number of circular-perfect graphs in polynomial timeMathematical Programming, Series A, 2013, 141, pp.121-133
Article dans une revue
hal-00760621v1
|
|||
|
|
On the density of sets avoiding parallelohedron distance 12017
Pré-publication, Document de travail
hal-01567118v1
|
||
Sur le polytope des cliques circulairesJournée H. Thuillier, Jul 2008, Orléans, France
Communication dans un congrès
hal-00292026v1
|
|||
|
|
On the Density of Sets Avoiding Parallelohedron Distance 1Discrete and Computational Geometry, 2019, 62 (3), pp.497-524. ⟨10.1007/s00454-019-00113-x⟩
Article dans une revue
hal-02491098v1
|
||
|
|
Strong chromatic index of planar graphs with large girthDiscussiones Mathematicae Graph Theory, 2014, 34 (4), pp.723-733. ⟨10.7151/dmgt.1763⟩
Article dans une revue
hal-00920932v1
|
||
On the density of sets of the Euclidean plane avoiding distanceICGCA 2019 - International Conference on Graph Theory, Combinatorics and Applications, Jun 2019, Kaohsiung, Taiwan
Communication dans un congrès
hal-02491085v1
|
|||
Clique and chromatic number of circular-perfect graphsInternational Symposium on Combinatorial Optimization, Mar 2010, Hammamet, Tunisia. pp.199-206
Communication dans un congrès
hal-00453400v1
|
|||
|
|
On facets of stable set polytopes of claw-free graphs with stability number threeDiscrete Mathematics, 2010, 310 (3), pp.493-498. ⟨10.1016/j.disc.2009.03.031⟩
Article dans une revue
hal-00283138v1
|
||
Générer des facettes pour le polytope des stables dans un graphe sans griffes par la programmation entièreFRANCORO V / ROADEF, Feb 2007, Grenoble, France
Communication dans un congrès
inria-00281949v1
|
|||
Polynomial time computability of some graph parameters for superclasses of perfect graphsInternational Journal of Mathematics in Operational Research, 2012, 4 (3), pp.263-275. ⟨10.1504/IJMOR.2012.046687⟩
Article dans une revue
inria-00560144v1
|
|||
Lovász's theta function and perfect graphsThe beauty of discrete mathematics, Oct 2017, Montreal, Canada
Communication dans un congrès
hal-01670333v1
|
|||
On the Lovasz's Theta function of power of chordless cycles2010 International Conference on Graph Theory, Combinatorics and Applications, Oct 2010, Jinhua, China
Communication dans un congrès
hal-00538996v1
|
|||
|
|
Claw-free circular-perfect graphsJournal of Graph Theory, 2010, 65 (2), pp.163-172. ⟨10.1002/jgt.20474⟩
Article dans une revue
hal-00431241v1
|
||
|
|
On the theta number of powers of cycle graphs2011
Pré-publication, Document de travail
hal-00572897v1
|
||
Polytope des cliques circulaires et calcul du nombre d'indépendance des graphes quasi-adjointsJPOC5 Journées Polyèdres et Optimisation Combinatoire, 2008, Rouen, France
Communication dans un congrès
hal-00286418v1
|
|||
Beyond Perfection: Computational Results for SuperclassesM. Jünger and G. Reinelt. Facets of Combinatorial Optimization - Festschrift for Martin Grötschel, Springer, pp.133-161, 2013, 978-3-642-38188-1
Chapitre d'ouvrage
hal-00920940v1
|
|||
Strong chromatic index of planar graphs with large girthEuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2013, Pisa, Italy. pp.265-270, ⟨10.1007/978-88-7642-475-5_43⟩
Communication dans un congrès
istex
hal-00920842v1
|
|||
A construction for non-rank facets of stable set polytopes of websEuropean Journal of Combinatorics, 2006, 27 (7), pp.1172--1185
Article dans une revue
hal-00333677v1
|
|||
Weighted independence ratio of geometric distance graphsICGT, Jun 2018, Lyon, France
Communication dans un congrès
hal-02491104v1
|
|||
|
|
Des multiples facettes des graphes circulantsInformatique [cs]. Université Sciences et Technologies - Bordeaux I, 2008
HDR
tel-00332976v1
|
- 1
- 2