Arnaud Pêcher

Publication Activity (10 Years)

Years Active: 2003-2021
Publications (10 Years): 4

Top Topics

Subgraph Isomorphism

Graph Theoretical

Packing Problem

Top Venues

J. Math. Model. Algorithms

Discret. Comput. Geom.

Publications

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