Search - Archive ouverte HAL Access content directly

Filter your results

34 Results

On the polynomial time computability of the circular chromatic number for some superclasses of perfect graph

Arnaud Pêcher , Annegret K. Wagler
Lagos'09, 2009, Brazil. pp.53-58
Conference papers hal-00790656v1

Optimal Weighting to Minimize the Independence Ratio of a Graph

Arnaud Pêcher , Thomas Bellitto
ISMP, Jun 2018, Bordeaux, France
Conference papers hal-02491101v1

Diffusion and/or Plastic Deformation around Fluid Inclusions in Synthetic Quartz: New Investigations

Anne-Marie Boullier , Gérard Michot , Arnaud Pêcher , Odile Barres
Fluid Movements — Element Transport and the Composition of the Deep Crust, Springer Netherlands, pp.345-360, 1989, ⟨10.1007/978-94-009-0991-5_28⟩
Book sections istex hal-02558502v1
Image document

Edge-partitions of sparse graphs and their applications to game coloring

Mickael Montassier , Arnaud Pêcher , André Raspaud , Xuding Zhu
2009
Other publications hal-00368828v1

Computing the clique number of a-perfect graphs in polynomial time

Arnaud Pêcher , Annegret K. Wagler
Proceedings of Eurocomb'11, Aug 2011, Budapest, Hungary. pp.705-710
Conference papers hal-00592080v1

On facets of stable set polytopes of claw-free graphs with stability number three

Arnaud Pêcher , Annegret K. Wagler
Discrete Mathematics, 2010, 310 (3), pp.493-498. ⟨10.1016/j.disc.2009.03.031⟩
Journal articles hal-00283138v1

Polynomial time computability of some graph parameters for superclasses of perfect graphs

Arnaud Pêcher , Annegret K. Wagler
International Journal of Mathematics in Operational Research, 2012, 4 (3), pp.263-275. ⟨10.1504/IJMOR.2012.046687⟩
Journal articles inria-00560144v1

On the density of sets of the Euclidean plane avoiding distance

Arnaud Pêcher , Thomas Bellitto , Antoine Sedillot
ICGCA 2019 - International Conference on Graph Theory, Combinatorics and Applications, Jun 2019, Kaohsiung, Taiwan
Conference papers hal-02491085v1

Clique and chromatic number of circular-perfect graphs

Arnaud Pêcher , Annegret K. Wagler
International Symposium on Combinatorial Optimization, Mar 2010, Hammamet, Tunisia. pp.199-206
Conference papers hal-00453400v1

Générer des facettes pour le polytope des stables dans un graphe sans griffes par la programmation entière

Arnaud Pêcher , Pierre Pesneau , A. Wagler
FRANCORO V / ROADEF, Feb 2007, Grenoble, France
Conference papers inria-00281949v1

How unique is Lovasz's theta function?,

Arnaud Pêcher
2012 International Conference on Graph Theory, Combinatorics and Applications, Oct 2012, Jinhua, China
Conference papers hal-00760631v1

Circular-clique polytopes and circular-perfect graphs

Arnaud Pêcher
KolKom08 - Kolloquium über Kombinatorik, Nov 2008, Magdeburg, Germany
Conference papers hal-00333063v1

MPQ-trees for orthogonal packing problem

Cedric Joncour , Arnaud Pêcher , Petru Valicov
International Symposium on Combinatorial Optimization, Mar 2010, Hammamet, Tunisia. pp.423-429
Conference papers hal-00453408v1

Consecutive ones matrices for multi-dimensional orthogonal packing problems

Cedric Joncour , Arnaud Pêcher
International Symposium on Combinatorial Optimization, Mar 2010, Hammamet, Tunisia. pp.327-334
Conference papers hal-00453404v1

Lovász's theta function and perfect graphs

Arnaud Pêcher
The beauty of discrete mathematics, Oct 2017, Montreal, Canada
Conference papers hal-01670333v1

Beyond Perfection: Computational Results for Superclasses

Arnaud Pêcher , Annegret K. Wagler
M. Jünger and G. Reinelt. Facets of Combinatorial Optimization - Festschrift for Martin Grötschel, Springer, pp.133-161, 2013, 978-3-642-38188-1
Book sections hal-00920940v1

Polytope des cliques circulaires et calcul du nombre d'indépendance des graphes quasi-adjoints

Arnaud Pêcher
JPOC5 Journées Polyèdres et Optimisation Combinatoire, 2008, Rouen, France
Conference papers hal-00286418v1
Image document

On the theta number of powers of cycle graphs

Christine Bachoc , Arnaud Pêcher , Alain Thiery
2011
Preprints, Working Papers, ... hal-00572897v1

On the Lovasz's Theta function of power of chordless cycles

Arnaud Pêcher
2010 International Conference on Graph Theory, Combinatorics and Applications, Oct 2010, Jinhua, China
Conference papers hal-00538996v1

Claw-free circular-perfect graphs

Arnaud Pêcher , Xuding Zhu
Journal of Graph Theory, 2010, 65 (2), pp.163-172. ⟨10.1002/jgt.20474⟩
Journal articles hal-00431241v1

Interval graphs for orthogonal packing problems

Arnaud Pêcher
International Conference in Discrete Mathematics, Jun 2013, Dharwad, India
Conference papers hal-00920835v1

Sur le polytope des cliques circulaires

Arnaud Pêcher
Journée H. Thuillier, Jul 2008, Orléans, France
Conference papers hal-00292026v1
Image document

On the density of sets avoiding parallelohedron distance 1

Christine Bachoc , Thomas Bellitto , Philippe Moustrou , Arnaud Pêcher
2017
Preprints, Working Papers, ... hal-01567118v1

On the Density of Sets Avoiding Parallelohedron Distance 1

Christine Bachoc , Thomas Bellitto , Philippe Moustrou , Arnaud Pêcher
Discrete and Computational Geometry, 2019, 62 (3), pp.497-524. ⟨10.1007/s00454-019-00113-x⟩
Journal articles hal-02491098v1

Computing clique and chromatic number of circular-perfect graphs in polynomial time

Arnaud Pêcher , Annegret K. Wagler
Mathematical Programming, Series A, 2013, 141, pp.121-133
Journal articles hal-00760621v1

Strong chromatic index of planar graphs with large girth

Gerard Jennhwa Chang , Mickaël Montassier , Arnaud Pêcher , André Raspaud
Discussiones Mathematicae Graph Theory, 2014, 34 (4), pp.723-733. ⟨10.7151/dmgt.1763⟩
Journal articles hal-00920932v1
Image document

Consecutive ones matrices for multi-dimensional orthogonal packing problems

Cédric Joncour , Arnaud Pêcher
Journal of Mathematical Modelling and Algorithms, 2012, Journal of Mathematical Modelling and Algorithm, 11 (1), pp.23-44. ⟨10.1007/s10852-011-9167-z⟩
Journal articles istex hal-00652574v1

Computing the clique number of a-perfect graphs in polynomial time

Arnaud Pêcher , Annegret K. Wagler
European Journal of Combinatorics, 2014, 35, pp.449-458. ⟨10.1016/j.ejc.2013.06.025⟩
Journal articles hal-00920846v1

Strong chromatic index of planar graphs with large girth

Arnaud Pêcher , Mickaël Montassier , André Raspaud
EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2013, Pisa, Italy. pp.265-270, ⟨10.1007/978-88-7642-475-5_43⟩
Conference papers istex hal-00920842v1

Circular-clique polytopes and circular-perfect graphs

Arnaud Pêcher
2009 Workshop on Graph Theory, Jan 2009, Kaohsiung, Taiwan
Conference papers hal-00336143v1