Partitionable graphs arising from near-factorizations of finite groups. - Arnaud Pêcher (Discret. Math., 2003)

On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four-Extended Abstract-. - Arnaud Pêcher; Annegret Wagler (Electron. Notes Discret. Math., 2003)

Cayley partitionable graphs and near-factorizations of finite groups. - Arnaud Pêcher (Discret. Math., 2004)

On strongly circular-perfectness. - Sylvain Coulonges; Arnaud Pêcher; Annegret Wagler (Electron. Notes Discret. Math., 2005)

Three classes of minimal circular-imperfect graphs. - Arnaud Pêcher; Annegret Wagler; Xuding Zhu (Electron. Notes Discret. Math., 2005)

On non-rank facets of stable set polytopes of webs with clique number four. - Arnaud Pêcher; Annegret Wagler (Discret. Appl. Math., 2006)

A construction for non-rank facets of stable set polytopes of webs. - Arnaud Pêcher; Annegret Wagler (Eur. J. Comb., 2006)

Generalized clique family inequalities for claw-free graphs. - Arnaud Pêcher; Annegret Wagler (Electron. Notes Discret. Math., 2006)

On the circular chromatic number of circular partitionable graphs. - Arnaud Pêcher; Xuding Zhu (J. Graph Theory, 2006)

Almost all webs are not rank-perfect. - Arnaud Pêcher; Annegret Wagler (Math. Program., 2006)

On facets of stable set polytopes of claw-free graphs with stability number three. - Arnaud Pêcher; Pierre Pesneau; Annegret Wagler (Electron. Notes Discret. Math., 2007)

A note on the Chvátal-rank of clique family inequalities. - Arnaud Pêcher; Annegret Wagler (RAIRO Oper. Res., 2007)

Des multiples facettes des graphes circulants. - Arnaud Pêcher (2008)

On classes of minimal circular-imperfect graphs. - Arnaud Pêcher; Annegret Wagler (Discret. Appl. Math., 2008)

Triangle-free strongly circular-perfect graphs. - Sylvain Coulonges; Arnaud Pêcher; Annegret Katrin Wagler (Discret. Math., 2009)

On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs. - Arnaud Pêcher; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2009)

Characterizing and bounding the imperfection ratio for some classes of graphs. - Sylvain Coulonges; Arnaud Pêcher; Annegret Wagler (Math. Program., 2009)

Decomposition of sparse graphs, with application to game coloring number. - Mickaël Montassier; Arnaud Pêcher; André Raspaud; Douglas B. West; Xuding Zhu (Discret. Math., 2010)

On facets of stable set polytopes of claw-free graphs with stability number 3. - Arnaud Pêcher; Annegret Katrin Wagler (Discret. Math., 2010)

Consecutive ones matrices for multi-dimensional orthogonal packing problems. - Cédric Joncour; Arnaud Pêcher (Electron. Notes Discret. Math., 2010)

MPQ-trees for orthogonal packing problem. - Cédric Joncour; Arnaud Pêcher; Petru Valicov (Electron. Notes Discret. Math., 2010)

Clique and chromatic number of circular-perfect graphs. - Arnaud Pêcher; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2010)

Claw-free circular-perfect graphs. - Arnaud Pêcher; Xuding Zhu (J. Graph Theory, 2010)

Computing the clique number of a-perfect graphs in polynomial time. - Arnaud Pêcher; Annegret Katrin Wagler (Electron. Notes Discret. Math., 2011)

Polynomial time computability of some graph parameters for superclasses of perfect graphs. - Arnaud Pêcher; Annegret Katrin Wagler (Int. J. Math. Oper. Res., 2012)

On the theta number of powers of cycle graphs. - Christine Bachoc; Arnaud Pêcher; Alain Thiéry (Comb., 2013)

Computing clique and chromatic number of circular-perfect graphs in polynomial time. - Arnaud Pêcher; Annegret Katrin Wagler (Math. Program., 2013)

Strong chromatic index of planar graphs with large girth. - Gerard Jennhwa Chang; Mickaël Montassier; Arnaud Pêcher; André Raspaud (Discuss. Math. Graph Theory, 2014)

Computing the clique number of aa-perfect graphs in polynomial time. - Arnaud Pêcher; Annegret Wagler (Eur. J. Comb., 2014)

On the Density of Sets Avoiding Parallelohedron Distance 1. - Christine Bachoc; Thomas Bellitto; Philippe Moustrou; Arnaud Pêcher (Discret. Comput. Geom., 2019)

On the density of sets of the Euclidean plane avoiding distance 1. - Thomas Bellitto; Arnaud Pêcher; Antoine Sédillot (Discret. Math. Theor. Comput. Sci., 2021)

On circular-perfect graphs: A survey. - Arnaud Pêcher; Annegret Katrin Wagler (Eur. J. Comb., 2021)