| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Cédric Joncour, Arnaud Pêcher, Petru Valicov |
MPQ-trees for the Orthogonal Packing Problem.  |
J. Math. Model. Algorithms  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Cédric Joncour, Arnaud Pêcher |
Consecutive Ones Matrices for Multi-dimensional Orthogonal Packing Problems.  |
J. Math. Model. Algorithms  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Pêcher, Annegret Katrin Wagler |
Clique and chromatic number of circular-perfect graphs.  |
Electronic Notes in Discrete Mathematics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Cédric Joncour, Arnaud Pêcher |
Consecutive ones matrices for multi-dimensional orthogonal packing problems.  |
Electronic Notes in Discrete Mathematics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Cédric Joncour, Arnaud Pêcher, Petru Valicov |
MPQ-trees for orthogonal packing problem.  |
Electronic Notes in Discrete Mathematics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Pêcher, Annegret Katrin Wagler |
On facets of stable set polytopes of claw-free graphs with stability number 3.  |
Discrete Mathematics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mickaël Montassier, Arnaud Pêcher, André Raspaud, Douglas B. West, Xuding Zhu |
Decomposition of sparse graphs, with application to game coloring number.  |
Discrete Mathematics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Pêcher, Xuding Zhu |
Claw-free circular-perfect graphs.  |
Journal of Graph Theory  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Pêcher, Annegret Katrin Wagler |
On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs.  |
Electronic Notes in Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvain Coulonges, Arnaud Pêcher, Annegret Katrin Wagler |
Triangle-free strongly circular-perfect graphs.  |
Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvain Coulonges, Arnaud Pêcher, Annegret Wagler |
Characterizing and bounding the imperfection ratio for some classes of graphs.  |
Math. Program.  |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C57 (90C27) |
| 1 | Arnaud Pêcher, Annegret Wagler |
On classes of minimal circular-imperfect graphs.  |
Discrete Applied Mathematics  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Pêcher, Pierre Pesneau, Annegret Wagler |
On facets of stable set polytopes of claw-free graphs with stability number three.  |
Electronic Notes in Discrete Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Pêcher, Xuding Zhu |
Claw-free circular-perfect graphs.  |
Electronic Notes in Discrete Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Pêcher, Annegret Wagler |
A note on the Chvátal-rank of clique family inequalities.  |
RAIRO - Operations Research  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Pêcher, Annegret Wagler |
Generalized clique family inequalities for claw-free graphs.  |
Electronic Notes in Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Pêcher, Annegret Wagler |
A construction for non-rank facets of stable set polytopes of webs.  |
Eur. J. Comb.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Pêcher, Xuding Zhu |
On the circular chromatic number of circular partitionable graphs.  |
Journal of Graph Theory  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Pêcher, Annegret Wagler |
On non-rank facets of stable set polytopes of webs with clique number four.  |
Discrete Applied Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Pêcher, Annegret Wagler |
Almost all webs are not rank-perfect.  |
Math. Program.  |
2006 |
DBLP DOI BibTeX RDF |
Rank-perfect graph, Stable set polytope, (Non-)rank facet, Web |
| 1 | Arnaud Pêcher, Annegret Wagler, Xuding Zhu |
Three classes of minimal circular-imperfect graphs.  |
Electronic Notes in Discrete Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvain Coulonges, Arnaud Pêcher, Annegret Wagler |
On strongly circular-perfectness.  |
Electronic Notes in Discrete Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Pêcher |
Cayley partitionable graphs and near-factorizations of finite groups.  |
Discrete Mathematics  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Pêcher, Annegret Wagler |
On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four-Extended Abstract-.  |
Electronic Notes in Discrete Mathematics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnaud Pêcher |
Partitionable graphs arising from near-factorizations of finite groups.  |
Discrete Mathematics  |
2003 |
DBLP DOI BibTeX RDF |
|