|
|
Papers
- Bachoc, Pêcher, Thiery, On the theta number of powers of cycle graphs, Combinatorica, to appear
- Pêcher, Wagler, Computing clique and chromatic number of circular-perfect graphs in polynomial time, Mathematical Programming A, to appear
- Joncour, Pêcher, Consecutive Ones Matrices for Multi-dimensional Orthogonal Packing Problems, Journal of Mathematical Modelling and Algorithms, to appear
- Joncour, Pêcher, Valicov, MPQ-trees for the orthogonal packing problem, Journal of Mathematical Modelling and Algorithms, to appear
- Pêcher, Wagler, Polynomial time computability of some graph parameters for superclasses of perfect graphs, International Journal of Mathematics in Operational Research Vol. 4, No. 3, pages 263-275, 2012
- Pêcher, Zhu, Claw-free circular-perfect graphs, Journal of Graph Theory (65), pages 163-172, 2010
- Montassier, Pêcher, Raspaud, West, Zhu, Decomposition of sparse graphs, with application to game coloring number, Discrete Mathematics (310) pages 1520-1523, 2010
- Pêcher, Wagler, On facets of stable set polytopes of claw-free graphs with stability number three, Discrete Mathematics (310) pages 493-498, 2010
- Coulonges, Pêcher, Wagler, Triangle-free strongly circular-perfect graphs, Discrete Mathematics (309) pages 3632-3643, 2009
- Coulonges, Pêcher, Wagler, Characterizing and bounding the imperfection ratio for some classes of graphs, Mathematical Programming A (118), no 1, pages 37-46, 2009
- Pêcher, Wagler, On classes of minimal circular-imperfect graphs, Discrete Applied Mathematics (156) pages 998-1010, 2008
- Pêcher, Wagler, A note on the Chvátal rank of clique family inequalities, RAIRO - Operations Research (41) pages 289-294, 2007
- Pêcher, Wagler, Almost all webs are not rank-perfect, Mathematical Programming (105), pages 311-328, 2006
- Pêcher, Wagler, On Non-Rank Facets in Stable Set Polytopes of Webs with Clique Number Four, Discrete Applied Mathematics (154), no 9, pages 1408-1415, 2006
- Pêcher, Wagler, A construction for non-rank facets of stable set polytopes of webs, European Journal of Combinatorics (27), no 7, pages 1172-1185, 2006
- Pêcher, Zhu, On the Circular Chromatic Number of Circular Partitionable Graphs, Journal of Graph Theory (52), no 4, pages 294-306, 2006
- Pêcher, Partitionable graphs arising from near-factorizations of finite groups, Discrete Mathematics (276), pages 295-311, 2004
- Pêcher, Cayley partitionable graphs, Discrete Mathematics (269), pages 191-218, 2003
Conferences
- Pêcher, Wagler, Computing the clique number of a-perfect graphs in polynomial time, Proceedings of Eurocomb’11, Hungary, Electronic Notes in Discrete Mathematics, pages 705-710, 2011
- Pêcher, Wagler, Clique and chromatic number of circular-perfect graphs, ISCO'10, Tunisia - Electronic Notes in Discrete Mathematics (36), pages 199-206, 2010
- Joncour, Pêcher, Consecutive ones matrices for multi-dimensional orthogonal packing problems, ISCO'10, Tunisia - Electronic Notes in Discrete Mathematics (36), pages 327-334, 2010
- Joncour, Pêcher, Valicov, MPQ-trees for orthogonal packing problem, ISCO'10, Tunisia - Electronic Notes in Discrete Mathematics (36), pages 423-429, 2010
- Pêcher, Wagler, On the polynomial time computability of the circular chromatic number for some superclasses of perfect graph. LAGOS'09, Brazil - Electronic Notes in Discrete Mathematics (35), pages 53-58, 2009
- Pêcher, Zhu, Claw-free circular-perfect graphs, Proceedings of Eurocomb’07, Electronic Notes in Discrete Mathematics (29), Sevilla, Spain, pages 451-455, 2007
- Pêcher, Wagler, Generalized clique family inequalities for claw-free graphs, CTW’06 - Cologne- Twente Workshop on Graphs and Combinatorial Optimization, Electronic Notes in Discrete Mathematics (25), pages 117-121, 2006
- Pêcher, Pesneau, Wagler, On facets of stable set polytope of claw-free graphs with maximum stable set size three, CS’06 - Sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Electronic Notes in Discrete Mathematics (28), pages 185-190, 2006
- Coulonges, Pêcher, Wagler, On strongly circular-perfectness, 7th International Colloquium on Graph Theory, Electronic Notes in Discrete Mathematics (22), pages 369-374, 2005.
- Pêcher, Wagler, Zhu, Three classes of minimal circular imperfect graphs, Proceedings of GRACO2005, Electronic Notes Discrete Mathematics (19), Rio de Janeiro, Brazil, pages 9-15, 2005
- Pêcher, Wagler, A construction for non-rank facets of stable set polytopes of webs, Eurocomb, Prague, Czech republic - ITI Series 2003-145, pages 301-305, 2003
- Pêcher, Wagler, On Non-Rank Facets in Stable Set Polytopes of Webs with Clique Number Four, 2nd Cologne Twente Workshop (CTW) on Graphs and Combinatorial Optimization, Twente, Nederlands - Electronic Notes in Discrete Mathematics (13), pages 96-99, 2003
- Pêcher, Cayley partitionable graphs, 6th International Conference on Graph Theory, Electronic Notes in Discrete Mathematics (5), pages 256-259, 2000
Invited talks
- Pêcher, The circular chromatic number of circular-perfect graphs is polytime, 2011 Workshop on Graph Theory, Taipei, Taiwan, 2011
- Pêcher, On the Lovasz's Theta function of power of chordless cycles, 2010 International Conference on Graph Theory, Combinatorics and Applications, Jinhua, Chine, 2010
- Pêcher, Circular-clique polytopes to compute the circular chromatic number, JPOC6, Bordeaux, 2009
- Pêcher, Circular-clique polytope and circular-perfect graphs, 2009 Workshop on Graph Theory, Kaohsiung, Taiwan, 2009
- Pêcher, Stable set polytopes of claw-free graphs, Coloring workshop, Kaohsiung, Taiwan, 2008
Manuscripts
HAL lists of publications at LaBRI, IRIT, RealOpt
|