Recherche

Accueil CEDRIC > Laboratoire > Membre > Picoulec >

Christophe Picouleau

Professeur
Equipe OC
Mail : christophe.picouleau

cnam.fr
Tel : 0140272027
Fax : (33)15880
http://cedric.cnam.fr/oc/picouleau_html/Picouleau.htm

Christophe's Tag-Cloud :

description

Projets

Publications

2019

Revue Internationale avec comité de lecture

[PPR19] C. Picouleau, D. Paulusma, B. Ries. "Critical Vertices and Edges in H-free Graphs", Discrete Applied Math. , vol. 257, pp. 361-367, 2019, (doi:https://doi.org/10.1016/j.dam.2018.08.016)

Conférence Internationale avec comité de lecture

[PFR19] C. Picouleau, A. Frosini, S. Rinaldi. "On the degree sequence of 3-uniform hypergraph", 21 st International Conference on Discrete Geometry for Computer Imagery, February 2019, pp.to appear, Series LNCS, France,

2018

Revue Internationale avec comité de lecture

[PPD18] C. Picouleau, D. Paulusma, O. Diner, B. Ries. "Contraction and Deletion Blockers for Perfect Graphs and H-free Graphs", Theoretical Computer Science, vol. 746, pp. 49-72, 2018
[CdP18] M.-C. Costa, D. de Werra, C. Picouleau. "Minimal graphs for matching extensions", Discrete Applied Math. , vol. 234, pp. 47-55, 2018, (doi:10.1016/j.dam.2015.11.007)

2017

Conférence Internationale avec comité de lecture

[PRP17] C. Picouleau, B. Ries, D. Paulusma. "Reducing the Chromatic Number by Vertex or Edge Deletions", LAGOS, September 2017, Vol. 62, pp.243-248, Series ENDM, France, (DOI: doi.org/10.1016/j.endm.2017.10.042)
[PPR17] C. Picouleau, D. Paulusma, B. Ries. "Blocking Independent Sets for H-free graphs via Edge Contractions and Vertex Deletions", Theory and Applications of Models of Computation 2017, April 2017, pp.00-00, Series LNCS, Bern, Suisse,

Conférence Nationale avec comité de lecture

[CCP17] G. CottÃ©, M.-C. Costa, C. Picouleau. "d-extensibles de stables dans les graphes bipartis", ROADEF, February 2017, pp.2 p., Metz, France,

2016

Conférence Internationale avec comité de lecture

[PRP16] C. Picouleau, B. Ries, D. Paulusma. "Reducing the clique and chromatic number via edge contractions and vertex deletions", ISCO 2016 - 4th International Symposium on Combinatorial Optimization, April 2016, pp.38-49, Series LNCS9849, Salerne, Italie,

Conférence Nationale avec comité de lecture

[Pic16] C. Picouleau. "d-contraction optimale d'arÃªtes d'un graphe", ROADEF 2016, February 2016, pp.1, CompiÃ¨gne, France,

2015

Revue Internationale avec comité de lecture

[BBP15] C. Bazgan, C. Bentz, C. Picouleau, B. Ries. "Blockers for the stability number and the chromatic number", Graphs and Combinatorics, vol. 31(1), pp. 73-90, 2015, (doi:10.1007/s00373-013-1380-2)

Conférence Internationale avec comité de lecture

[CCP15a] G. CottÃ©, M.-C. Costa, C. Picouleau. "A general framework for finding d-transversals in graphs", EURO, July 2015, pp.1, Glasgow, United Kingdom,
[Pic15a] C. Picouleau. "Contraction Blockers for Graphs with Forbidden Induced Sugraphs", EURO , July 2015, pp.1, U. K.,
[PRP15] C. Picouleau, B. Ries, D. Paulusma, O. Diner. "Contraction Blockers for Graphs with Forbidden Induced Paths", CIAC 2015, May 2015, Vol. LNCS(9079), pp.194-207, Paris, France,

Conférence Nationale avec comité de lecture

[CCP15] G. CottÃ©, M.-C. Costa, C. Picouleau. "d -extensibles de stables dans les graphes bipartis", 16Ã¨me congrÃ¨s annuel de la ROADEF, February 2015, pp.1, Marseille, France,

Directions d'ouvrages scientifiques

[PIC15] C. Picouleau. "Editorial Foreword of the eighth International Colloquium on Graphs and Optimization (GO VIII).", January 2015, Discrete Applied Math., pp. 1,

2014

Conférence Internationale avec comité de lecture

[CCP14] M.-C. Costa, G. CottÃ©, C. Picouleau. "d-extensible sets of stable sets in bipartite graphs.", GO IX, Ninth international colloquium on Graphs and Optimization, July 2014, pp.14,
[PDC14] C. Picouleau, D. de Werra, M.-C. Costa. "Minimum size extensible graphs for (near) perfect matchings", International Conference on Graph Theory, April 2014, pp.juin 2014, Grenoble, France,

2013

Conférence Internationale avec comité de lecture

[PF13] C. Picouleau, A. Frosini. "How to decompose a binary matrix into three hv-convex polyominoes", 17th IAPR International Conference on Discrete Geometry for Computer Imagery, March 2013, Vol. 7749, pp.311-322, Series LNCS, SÃ©ville, Espagne,
[PFR13] C. Picouleau, A. Frosini, S. Rinaldi. "On the degree sequences of uniform hypergraphs", 17th IAPR International Conference on Discrete Geometry for Computer Imagery, March 2013, Vol. 7749, pp.300-310, Series LNCS, SÃ©ville, Espagne,

Directions d'ouvrages scientifiques

[PDL13] C. Picouleau, M. Demange, V. Lozin, B. Ries. "GO VII Meeting, Ovronnaz (CH), June 13â€“17, 2010", January 2013, Discrete Applied Math.,

2012

Revue Internationale avec comité de lecture

[BCPa12] C. Bentz, M.-C. Costa, C. Picouleau, B. Ries, D. de Werra. "d-Transversals of Stable Sets and Vertex Covers in Weighted Bipartite Graphs", Journal of Discrete Algorithms, vol. 17, pp. 95-102, 2012, (doi:10.1016/j.jda.2012.06.002)
[JP12] F. Jarray, C. Picouleau. "Minimum decomposition into convex binary matrices", Discrete Applied Math. , vol. 160, pp. 1164-1175, 2012, (doi:doi:10.1016/j.dam.2012.01.013)
[LMM12] M. Lacroix, R. Mahjoub, S. Martin, C. Picouleau. "On the NP-Completeness of the Perfect Matching Free Subgraph Problem", Theoretical Computer Science, vol. 423, pp. 25-29, 2012, (doi:10.1016/j.tcs.2011.12.065)

2011

Revue Internationale avec comité de lecture

[CDP11] M.-C. Costa, D. de Werra, C. Picouleau. "Minimum d-blockers and d-transversals in graphs", J. of Combinatorial Optimization, vol. 22(4), pp. 857-872, 2011, (doi:10.1007/s10878-010-9334-6)

Conférence Internationale avec comité de lecture

[CDPb11] M.-C. Costa, D. de Werra, C. Picouleau, B. Ries, C. Bentz. "Minimum d-Transversals of Maximum-Weight Stable Sets in Trees", European conference on combinatorics, graph theory and applications EuroComb'11, Electronics Notes in Discrete Mathematics, August 2011, Vol. 38, pp.129-134, Bupapest, Hongrie, (DOI: 10.1016/j.endm.2011.09.022)

Conférences Internationales sans actes

[PIC11] C. Picouleau. "Minimum Transversals for the Maximum Stable Set Problem in Weighted Bipartite Graphs", DIMAP Workshop 2011, Warwick, England,

Chapitres de Livre

[CDPa11] M.-C. Costa, D. de Werra, C. Picouleau, B. Ries, C. Bentz. "Weighted Transversals and Blockers for Some Optimization Problems in Graphs", Titre du livre: "Progress in Combinatorial Optimization", November 2011, Wiley, pp. 203-222, (isbn: 978-1-84821-206-0)

2010

Revue Internationale avec comité de lecture

[RBP10] B. Ries, C. Bentz, C. Picouleau, D. de Werra, M.-C. Costa, R. Zenklusen. "Blockers and Transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid", Discrete Mathematics, vol. 310, pp. 132-146, 2010, (doi:10.1016/j.disc.2009.08.009)
[PIC10] C. Picouleau. "A note on a conjecture on maximum matching in almost regular graphs", Discrete Mathematics, vol. 310, pp. 3646-3647, 2010, (doi:10.1016/j.disc.2010.09.003)
[CDP10] M.-C. Costa, D. de Werra, C. Picouleau, B. Ries. "On the use of graphs in discrete tomography", Annals of Operations Research, vol. 175(1), pp. 287-307, 2010, (doi:10.1007/s10479-009-0649-6)

Conférence Internationale avec comité de lecture

[CDPb10] M.-C. Costa, D. de Werra, C. Picouleau. "Minimum d-blockers and d-transversals for the maximum stable set problem", European conference on operational research EURO 2010, July 11-14 Lisbonne, Portugal (and ROADEF 2010 24-26 fÃ©vrier Toulouse), January 2010, pp.70-70, Libonne, Portugal,
[CDPa10] M.-C. Costa, D. de Werra, C. Picouleau. "On matchings and stable sets in bipartite graphs", Graphs and Optimization VII, Ovronnaz, Suisse, January 2010, pp.8-10,

Conférences invitées

[PICa10] C. Picouleau. "Tomographie discrÃ¨te : aspects gÃ©omÃ©triques et aspects graphiques", Groupe de travail en GÃ©omÃ©trie DiscrÃ¨te - GDR IM Strasbourg DÃ©cembre 2010, January 2010, pp.1,

Livre

[BCH10] B. Baynat, P. Chretienne, C. Hanen, S. Kedad-Sidhoum, A. Munier, C. Picouleau. "Exercices et problÃ¨mes d'algorithmique - 3Ã¨me Ã©dition", January 2010, Dunod, pp. 480 pages, (isbn: 978-2100511853)

Chapitres de Livre

[CP10] P. Chretienne, C. Picouleau. "Scheduling Problems", Titre du livre: "Paradigms of Combinatorial Optimization", January 2010, Wiley, pp. 33-59, (isbn: 978-1-84821-148-3)

Rapport Scientifique

[CPT10] M.-C. Costa, C. Picouleau, H. Topart. "On hypochordal graphs", Date de dépot: 2010/01/01, (Tech. Rep.: CEDRIC-10-1886)

2009

Revue Internationale avec comité de lecture

[BP09] C. Bentz, C. Picouleau. "Locally bounded k-colorings of trees", RAIRO, vol. 43(1), pp. 27-33, 2009, (doi:10.1051/ro/2009003)
[ZRP09] R. Zenklusen, B. Ries, C. Picouleau, D. de Werra, M.-C. Costa, C. Bentz. "Blockers and Transversals", Discrete Mathematics, vol. 309(13), pp. 4306-4314, 2009, (doi:10.1016/j.disc.2009.01.006)
[DP09] N. Derhy, C. Picouleau. "Finding Induced Trees", Discrete Applied Mathematics, vol. 157, pp. 3552-3557, 2009, (doi:10.1016/j.dam.2009.02.009)
[CDP09] M.-C. Costa, D. de Werra, C. Picouleau, B. Ries. "Graph coloring with cardinality constraints on the neighborhoods", Discrete Optimization, vol. 6(4), pp. 362-369, 2009, (doi:10.1016/j.disopt.2009.04.005)
[BCP09] C. Bentz, M.-C. Costa, C. Picouleau, B. Ries, D. de Werra. "Degree-constrained edge partitioning in graphs arising from discrete tomography", J. of Graph Algorithms and Applications, vol. 13(2), pp. 99-118, 2009
[DPT09] N. Derhy, C. Picouleau, N. Trotignon. "The four-in-a-tree problem in triangle-free graphs", Graphs and Combinatorics, vol. 25(4), pp. 489-502, 2009, (doi:10.1007/s00373-009-0867-3)

Conférence Nationale avec comité de lecture

[BCD09] C. Bentz, M.-C. Costa, D. de Werra, C. Picouleau, B. Ries, R. Zenklusen. "d-bloqueurs et d-transversaux", Recherche opÃ©rationnelle et aide Ã la dÃ©cision. ROADEF'09 Nancy, February 2009, pp.316-317,
[CPT09] M.-C. Costa, C. Picouleau, H. Topart. "Une nouvelle classe de graphes : les hypotriangulÃ©s.", ConfÃ©rence ROADEF 2009, Nancy, February 2009, pp.2,

Livre

[FLP09] R. Faure, B. Lemaire, C. Picouleau. "PrÃ©cis de Recherche OpÃ©rationnelle", January 2009, Dunod, pp. 584 pages, (isbn: 9782100526529)

2008

Revue Internationale avec comité de lecture

[CJPa08] M.-C. Costa, F. Jarray, C. Picouleau. "Complexity results for the horizontal bar packing problem", Information Processing Letters, vol. 108(6), pp. 356-359, 2008, (doi:10.1016/j.ipl.2008.07.007)
[BFP08] S. Brocchi, A. Frosini, C. Picouleau. "Reconstruction of binary matrices under fixed size neighborhood constraints", Theoretical Computer Science, vol. 406, pp. 43-54, 2008, (doi:10.1016/j.tcs.2008.07.024)
[BCD08] C. Bentz, M.-C. Costa, D. de Werra, C. Picouleau, B. Ries. "On a graph coloring problem arising from discrete tomography", Networks, vol. 51(4), pp. 256-267, 2008, (doi:10.1002/net.20218)

Conférence Internationale avec comité de lecture

[FPR08] A. Frosini, C. Picouleau, S. Rinaldi. "Reconstructing binary matrices with neighborhood constraints: an NP-hard problem.", IAPR'08 14th Int. Conf. on Discrete Geometry for Computer Imagery, January 2008, pp.392-400, Series LNCS 4992,
[CJP08] M.-C. Costa, F. Jarray, C. Picouleau. "Approximating hv-convex binary matrices and images from discrete projections", IAPR'08 14th Int. Conf. on Discrete Geometry for Computer Imagery, January 2008, pp.413-422, Series LNCS 4992,

Conférence Nationale avec comité de lecture

[DP08] N. Derhy, C. Picouleau. "A la recherche d'un arbre induit : complexitÃ© et algorithmes", ROADEF'08, Clermont-Ferrand, fÃƒÂ©vrier, February 2008, pp.157-158,
[PBF08] C. Picouleau, S. Brocchi, A. Frosini. "Reconstructions tomographiques avec un nombre fixÃ© de lignes", ROADEF'08 - Clermont-Ferrand Ã‚Â– fÃƒÂ©vrier, January 2008, pp.365-366,

Chapitres de Livre

[PIC08] C. Picouleau. "Small perturbations on the data of NP-complete scheduling problems", Titre du livre: "Flexibility and Robustness in Scheduling", January 2008, pp. 327-340, (isbn: 9781848210547)

2007

Revue Internationale avec comité de lecture

[BCP07] C. Bentz, M.-C. Costa, C. Picouleau, M. Zrikem. "The shortest multipaths problem in a capacitated dense channel", European Journal of Operational Research, vol. 178(3), pp. 926-931, 2007, (doi:10.1016/j.ejor.2006.03.007)
[CDP07] M.-C. Costa, D. de Werra, C. Picouleau, B. Ries. "Bicolored matchings in some classes of graphs", Graphs and Combinatorics, vol. 23, pp. 47-60, 2007, (doi:10.1007/s00373-006-0686-8)

Conférence Internationale avec comité de lecture

[DP07] N. Derhy, C. Picouleau. "The Induced Steiner Tree Problem", Graphs and Optimization VI, Cademario, Switzerland, January 2007, pp.30,

Conférence Nationale avec comité de lecture

[CJP07] M.-C. Costa, F. Jarray, C. Picouleau. "Packing de barres horizontales", FRANCORO/ROADEF'07, Grenoble, fÃƒÂ©vrier, February 2007, pp.153-154,
[CDPa07] M.-C. Costa, D. de Werra, C. Picouleau, B. Ries. "Reconstruction de la coloration dÂ’un graphe Ã partir des projections des voisinages", FRANCORO/ROADEF'07, Grenoble, fÃƒÂ©vrier, February 2007, pp.155-156,
[BCD07] C. Bentz, M.-C. Costa, D. de Werra, C. Picouleau, B. Ries. "Reconstruction d'une coloration des arÃªtes dÂ’un graphe Ã partir des sÃ©quences de degrÃ©s", FRANCORO/ROADEF'07, Grenoble, fÃ©vrier, February 2007, pp.87-88,

Livre

[BCH07] B. Baynat, P. Chretienne, C. Hanen, S. Kedad-Sidhoum, A. Munier-Kordon, C. Picouleau. "Exercices et problÃ¨mes d'algorithmique-2e Ã©dition", January 2007, Dunod, pp. 480 pages, (isbn: 978-2100511853)

Chapitres de Livre

[BCF07] S. Brunetti, M.-C. Costa, A. Frosini, F. Jarray, C. Picouleau. "Reconstruction of binary matrices under adjacency constraints", Titre du livre: "Advances in Discrete Tomography and Its Applications", July 2007, Birkhauser/Gabor and Attila, pp. 125-150, (isbn: 978-0-8176-3614-2)
[CP07] P. Chretienne, C. Picouleau. "Ordonnancements", Titre du livre: "Optimisation Combinatoire", January 2007, pp. 61-87, (isbn: 978-2-7462-1180-3)

2006

Revue Internationale avec comité de lecture

[CDP06] M.-C. Costa, D. de Werra, C. Picouleau. "Using graphs for some discrete tomography problems", Discrete Applied Mathematics, vol. 154(1), pp. 35-46, 2006
[CJP06] M.-C. Costa, F. Jarray, C. Picouleau. "An acyclic days-off scheduling problem", 4'OR, A Quarterly Journal of Operations Research, vol. 4(1), pp. 73-85, 2006

Revue Nationale avec comité de lecture

[PIC06] C. Picouleau. "La tomographie discrÃ¨te : quid ?", Bulletin ROADEF, pp. 7-10, 2006

Conférence Internationale avec comité de lecture

[CDPa06] M.-C. Costa, D. de Werra, C. Picouleau, B. Ries. "Graph colouring with vertex neighbourhoods constraints", Sixth Czech-Slovak Int. Symposium on Combinatorics, Graph Theory, Algorithms and Application, January 2006,
[BCPa06] C. Bentz, M.-C. Costa, C. Picouleau, D. de Werra, B. Ries. "On a graph coloring problem arising from discrete tomography", Fifth International Colloquium on Graphs and Optimisation, Leukerbad, Switzerland, January 2006,

Conférence Nationale avec comité de lecture

[BCP06] C. Bentz, M.-C. Costa, C. Picouleau, B. Ries, D. de Werra. "Reconstruction de la coloration dÂ’un graphe Ã partir de projections de chaÃ®nes", ROADEF'06 7Ã¨me congrÃ¨s ROADEF - LILLE - FÃ©vrier, January 2006, pp.51,

Conférences Internationales sans actes

[BCD06] C. Bentz, M.-C. Costa, D. de Werra, C. Picouleau, B. Ries. "Discrete tomography and graph coloring", EURO XXI, Reykjavik, Iceland,

Rapport Scientifique

[BP06] C. Bentz, C. Picouleau. "Feasible node colorings of trees with cardinality constraints", Date de dépot: 2006/01/01, (Tech. Rep.: CEDRIC-06-987)

2005

Revue Internationale avec comité de lecture

[PIC05] C. Picouleau. "Reconstruction of Convex Polyominoes from Orthogonal Projections of their Contours", Theoretical Computer Science, vol. 346(2), pp. 439-454, 2005
[CDP05] M.-C. Costa, D. de Werra, C. Picouleau, D. Schindl. "A solvable case of image reconstruction in discrete tomography", Discrete Applied Mathematics, vol. 148(3), pp. 240-245, 2005

Conférence Internationale avec comité de lecture

[PBF05] C. Picouleau, S. Brunetti, A. Frosini. "Reconstructing a binary matrix under timetabling constraints", Workshop on Discrete Tomography and Its Applications New-York, ENDM, January 2005, Vol. 20, pp.99-112,
[CJP05] M.-C. Costa, F. Jarray, C. Picouleau. "Reconstruction of binary matrices under adjacency constraints", ENDM pp 281-297 Workshop on Discrete Tomography and Its Applications - New-York, USA, January 2005,
[CDPa05] M.-C. Costa, D. de Werra, C. Picouleau, B. Ries. "Bicolored matchings in some classes of graphs", Int. Conf. in Graph Theory, HyÃƒÂ¨res, France, January 2005,
[CJPa05] M.-C. Costa, F. Jarray, C. Picouleau. "Reconstructing an alternate periodical binary matrix from its orthogonal projections", ICTCS 2005, Sienne, LNCS, January 2005, pp.173-181, Series LNCS 3701,
[BCP05] C. Bentz, M.-C. Costa, C. Picouleau, M. Zrikem. "The shortest multipaths problem in a capacitated dense channel", ALIO/EURO'05 5th Conf. on Combinatorial Optimization, ENST, Paris, France, January 2005, pp.31,

Chapitres de Livre

[PICa05] C. Picouleau. "Petites perturbations sur les donnÃ©es de problÃ¨mes d'ordonnancement NP-complets", Titre du livre: "FlexibilitÃ© et Robustesse en Ordonnancem", January 2005, pp. 309-323,

2004

Conférence Internationale avec comité de lecture

[CDP04] M.-C. Costa, D. de Werra, C. Picouleau. "On a problem of coloured matching in regular bipartite graphs", Contributed talk, Proceedings of Graph Theory Paris, January 2004, pp.63,

Chapitres de Livre

[GP04] G. Gotha, C. Picouleau. "ModÃ¨les et Algorithmes en Ordonnancement", January 2004, pp. 228,

2003

Conférence Nationale avec comité de lecture

[CJP03] M.-C. Costa, F. Jarray, C. Picouleau. "Quelques problÃ¨mes de tomographie discrÃ¨te", Ecole d'automne de recherche opÃƒÂ©rationnelle Tours, January 2003,

Livre

[BCH03] B. Baynat, P. Chretienne, C. Hanen, S. Kedad-Sidhoum, A. Munier-Kordon, C. Picouleau. "EXERCICES ET PROBLEMES D'ALGORITHMIQUES", January 2003, DUNOD,

Chapitres de Livre

[PIC03] C. Picouleau. "UET-UCT sur deux processeurs avec contraintes de capacitÃ©", Titre du livre: "Ordonnancement pour l'informatique paral", January 2003, pp. 41-50,

2002

Conférence Internationale avec comité de lecture

[CPZ02] M.-C. Costa, C. Picouleau, M. Zrikem. "Solving the shortest multipaths problem on grids", CIRO Marrakech, Maroc, January 2002,
[CDP02] M.-C. Costa, D. de Werra, C. Picouleau. " On some special cases of an image reconstruction problem", ECCO, Lugano, January 2002,

Conférence Nationale avec comité de lecture

[PIC02] C. Picouleau. "Stabilite des problemes NP-complets", roadef 2002, January 2002,

2001

Revue Internationale avec comité de lecture

[PIC01] C. Picouleau. "Reconstruction of domino tiling from its two orthogonal projections", Theoretical Computer Science, vol. 255(1), 2001

2000

Conférence Nationale avec comité de lecture

[PICc00] C. Picouleau. "Tomographie DiscrÃ¨te et Ordonnancement", January 2000,

Livre

Mémoire de HDR

Rapport Scientifique

[PIC00] C. Picouleau. "Reconstruction of a coloured domino tiling from its projections", Date de dépot: 2000/01/01, (Tech. Rep.: CEDRIC-00-166)
[PICb00] C. Picouleau. "Small perturbations on some NP-complete scheduling problems", Date de dépot: 2000/01/01, (Tech. Rep.: CEDRIC-00-167)