The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Arnaud Pêcher" ( http://dblp.L3S.de/Authors/Arnaud_Pêcher )

  Author page on DBLP  Author page in RDF  Community of Arnaud Pêcher in ASPL-2

Publication years (Num. hits)
2003-2009 (17) 2010-2012 (8)
Publication types (Num. hits)
article(25)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1 occurrences of 1 keywords

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