Arnaud Pêcher

36 papers Journal 35
YearRankTypeTitle / Venue / Authors
2021 J jnl
On circular-perfect graphs: A survey.
Eur. J. Comb.
Arnaud Pêcher, Annegret K. Wagler
2021 J jnl
On the density of sets of the Euclidean plane avoiding distance 1.
Discret. Math. Theor. Comput. Sci.
Thomas Bellitto, Arnaud Pêcher, Antoine Sédillot
2019 J jnl
On the Density of Sets Avoiding Parallelohedron Distance 1.
Discret. Comput. Geom.
Christine Bachoc, Thomas Bellitto, Philippe Moustrou, Arnaud Pêcher
2018 J jnl
On the density of sets of the Euclidean plane avoiding distance 1.
CoRR
Thomas Bellitto, Arnaud Pêcher, Antoine Sédillot
2014 J jnl
Computing the clique number of
Eur. J. Comb.
Arnaud Pêcher, Annegret K. Wagler
2014 J jnl
Strong chromatic index of planar graphs with large girth.
Discuss. Math. Graph Theory
Gerard Jennhwa Chang, Mickaël Montassier, Arnaud Pêcher, André Raspaud
2013 J jnl
Computing clique and chromatic number of circular-perfect graphs in polynomial time.
Math. Program.
Arnaud Pêcher, Annegret K. Wagler
2013 J jnl
On the theta number of powers of cycle graphs.
Comb.
Christine Bachoc, Arnaud Pêcher, Alain Thiéry
2012 J jnl
Consecutive Ones Matrices for Multi-dimensional Orthogonal Packing Problems.
J. Math. Model. Algorithms
Cédric Joncour, Arnaud Pêcher
2012 J jnl
MPQ-trees for the Orthogonal Packing Problem.
J. Math. Model. Algorithms
Cédric Joncour, Arnaud Pêcher, Petru Valicov
2012 J jnl
Polynomial time computability of some graph parameters for superclasses of perfect graphs.
Int. J. Math. Oper. Res.
Arnaud Pêcher, Annegret K. Wagler
2011 J jnl
Computing the clique number of a-perfect graphs in polynomial time.
Electron. Notes Discret. Math.
Arnaud Pêcher, Annegret K. Wagler
2010 J jnl
Claw-free circular-perfect graphs.
J. Graph Theory
Arnaud Pêcher, Xuding Zhu
2010 J jnl
Clique and chromatic number of circular-perfect graphs.
Electron. Notes Discret. Math.
Arnaud Pêcher, Annegret K. Wagler
2010 J jnl
Consecutive ones matrices for multi-dimensional orthogonal packing problems.
Electron. Notes Discret. Math.
Cédric Joncour, Arnaud Pêcher
2010 J jnl
Decomposition of sparse graphs, with application to game coloring number.
Discret. Math.
Mickaël Montassier, Arnaud Pêcher, André Raspaud, Douglas B. West, Xuding Zhu
2010 J jnl
MPQ-trees for orthogonal packing problem.
Electron. Notes Discret. Math.
Cédric Joncour, Arnaud Pêcher, Petru Valicov
2010 J jnl
On facets of stable set polytopes of claw-free graphs with stability number 3.
Discret. Math.
Arnaud Pêcher, Annegret K. Wagler
2009 J jnl
Characterizing and bounding the imperfection ratio for some classes of graphs.
Math. Program.
Sylvain Coulonges, Arnaud Pêcher, Annegret K. Wagler
2009 J jnl
On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs.
Electron. Notes Discret. Math.
Arnaud Pêcher, Annegret K. Wagler
2009 J jnl
Triangle-free strongly circular-perfect graphs.
Discret. Math.
Sylvain Coulonges, Arnaud Pêcher, Annegret K. Wagler
2008 — book
Des multiples facettes des graphes circulants.
Arnaud Pêcher
2008 J jnl
On classes of minimal circular-imperfect graphs.
Discret. Appl. Math.
Arnaud Pêcher, Annegret K. Wagler
2007 J jnl
A note on the Chvátal-rank of clique family inequalities.
RAIRO Oper. Res.
Arnaud Pêcher, Annegret K. Wagler
2007 J jnl
Claw-free circular-perfect graphs.
Electron. Notes Discret. Math.
Arnaud Pêcher, Xuding Zhu
2007 J jnl
On facets of stable set polytopes of claw-free graphs with stability number three.
Electron. Notes Discret. Math.
Arnaud Pêcher, Pierre Pesneau, Annegret K. Wagler
2006 J jnl
A construction for non-rank facets of stable set polytopes of webs.
Eur. J. Comb.
Arnaud Pêcher, Annegret K. Wagler
2006 J jnl
Almost all webs are not rank-perfect.
Math. Program.
Arnaud Pêcher, Annegret K. Wagler
2006 J jnl
Generalized clique family inequalities for claw-free graphs.
Electron. Notes Discret. Math.
Arnaud Pêcher, Annegret K. Wagler
2006 J jnl
On non-rank facets of stable set polytopes of webs with clique number four.
Discret. Appl. Math.
Arnaud Pêcher, Annegret K. Wagler
2006 J jnl
On the circular chromatic number of circular partitionable graphs.
J. Graph Theory
Arnaud Pêcher, Xuding Zhu
2005 J jnl
On strongly circular-perfectness.
Electron. Notes Discret. Math.
Sylvain Coulonges, Arnaud Pêcher, Annegret K. Wagler
2005 J jnl
Three classes of minimal circular-imperfect graphs.
Electron. Notes Discret. Math.
Arnaud Pêcher, Annegret K. Wagler, Xuding Zhu
2004 J jnl
Cayley partitionable graphs and near-factorizations of finite groups.
Discret. Math.
Arnaud Pêcher
2003 J jnl
On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four-Extended Abstract-.
Electron. Notes Discret. Math.
Arnaud Pêcher, Annegret K. Wagler
2003 J jnl
Partitionable graphs arising from near-factorizations of finite groups.
Discret. Math.
Arnaud Pêcher