Picouleau

Christophe Picouleau

Professeur des Universités
Bureau : 31.1.81

Principaux thèmes de recherche : théorie des graphes, algorithmes

Publications

2021

Articles de revue

  1. Bouquet, V.; Delbot, F. c. and Picouleau, C. On the vertices belonging to all, some, none minimum dominating set. In Discrete Applied Mathematics, 288: 9-19, 2021. doi  www 

2020

Articles de revue

  1. Picouleau, C. Minimal graphs for hamiltonian extension. In Open Journal of Discrete Applied Mathematics, 2020. doi  www 
  1. Costa, M.-C.; de Werra, D. and Picouleau, C. Minimal graphs for 2-factor extension. In Discrete Applied Mathematics, 2020. doi  www 

Non publié

  1. Bouquet, V. and Picouleau, C. The Minimum Dominating Set problem is polynomial for (claw, P8)-free graphs. , working paper or preprint. www 
  1. Bouquet, V.; Delbot, F. c. and Picouleau, C. Partition of graphs with maximum degree ratio. , working paper or preprint. www 
  1. Ridremont, T.; Watel, D.; Poirion, P-L. and Picouleau, C. Adaptive network flow with $k$-Arc Destruction. , working paper or preprint. www 
  1. Frosini, A.; Picouleau, C. and Rinaldi, S. Characterization of the degree sequences of (quasi) regular uniform hypergraphs. , working paper or preprint. www 
  1. Kim, E. J.; Milanic, M.; Monnot, J. and Picouleau, C. Complexity and algorithms for constant diameter augmentation problems. , working paper or preprint. www 
  1. Bouquet, V.; Delbot, F. c.; Picouleau, C. and Rovedakis, S. On Minimum Dominating Sets in cubic and (claw,H)-free graphs. , working paper or preprint. www 

2019

Articles de revue

  1. Hertz, A. and Picouleau, C. On graceful difference labelings of disjoint unions of circuits. In Open Journal of Discrete Applied Mathematics, 2 (3): 38-55, 2019. doi  www 
  1. Paulusma, D.; Picouleau, C. and Ries, B. Critical vertices and edges in H-free graphs. In Discrete Applied Mathematics, 257: 361-367, 2019. doi  www 

Articles de conférence

  1. Milliet de Faverges, M.; Picouleau, C.; Russolillo, G.; Merabet, B. and Houzel, B. Impact of calibration of perturbations in simulation: the case of robustness evaluation at a station. In RailNorrk"oping 2019. 8th International Conference on Railway Operations Modelling and Analysis (ICROMA), Norrk"oping, Sweden, 2019. www 

2018

Articles de revue

  1. Diner, ". Y. s.; Paulusma, D.; Picouleau, C. and Ries, B. Contraction and deletion blockers for perfect graphs and H-free graphs. In Theoretical Computer Science, 746: 49-72, 2018. doi  www 
  1. Costa, M-C.; de Werra, D. and Picouleau, C. Minimal graphs for matching extension. In Discrete Applied Mathematics, 234: 47-55, 2018. doi  www 
  1. Costa, M-C.; De Werra, D. and Picouleau, C Minimal graphs for matching extensions. In Discrete Applied Mathematics, 234: 47-55, 2018. doi  www 

Articles de conférence

  1. Milliet de Faverges, M.; Russolillo, G.; Picouleau, C.; Merabet, B. and Houzel, B. Modelling passenger train arrival delays with Generalized Linear Models and its perspective for scheduling at main stations. In 8th International Conference on Railway Engineering (ICRE 2018), IET, London, United Kingdom, 2018. doi  www 
  1. Milliet de Faverges, M.; Russolillo, G.; Picouleau, C.; Merabet, B. and Houzel, B. Estimating long-term delay risk with Generalized Linear Models. In 2018 21st International Conference on Intelligent Transportation Systems (ITSC), pages 2911-2916, IEEE, Maui, France, 2018. doi  www 
  1. Costa, M-C.; De Werra, D and Picouleau, C. Extenseurs hamiltoniens minimaux. In ROADEF, Lorient, France, 2018. www 

2017

Articles de conférence

  1. Cotté, G.; Costa, M-C. and Picouleau, C. d-extensibles de stables dans les graphes bipartis. In ROADEF2017. 18ème congrès annuel de la Société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision, Metz, France, 2017. www 

2015

Articles de revue

  1. Bazgan, C.; Bentz, C.; Picouleau, C. and Ries, B. Blockers for the stability number and the chromatic number. In Graphs and Combinatorics, 31 (1), 2015. doi  www 
  1. Bazgan, C.; Bentz, C.; Picouleau, C. and Ries, B. Blockers for the stability number and the chromatic number. In AKCE International Journal of Graphs and Combinatorics, 31: 73-90, 2015. www 

Livres

  1. Picouleau, C. Editorial Foreword of the eighth International Colloquium on Graphs and Optimization (GO VIII). , 2015. www 

Articles de conférence

  1. Ries, B.; Picouleau, C.; Paulusma, D. and Diner, ". Contraction Blockers for Graphs with Forbidden Induced Paths. In Algorithms and Complexity; 9th International Conference, CIAC 2015, pages 194-207, Paris, France, 2015. doi  www 
  1. Picouleau, C.; Ries, B.; Paulusma, D. and Diner, O. Contraction Blockers for Graphs with Forbidden Induced Paths. In CIAC 2015, pages Accepté, X, France, 2015. www 

2014

Articles de conférence

  1. Picouleau, C.; de Werra, D. and Costa, M-C. Minimum size extensible graphs for (near) perfect matchings. In International Conference on Graph Theory, pages juin 2014, Grenoble, France, 2014. www 
  1. Costa, M-C.; Cotté, G. and Picouleau, C. d-extensible sets of stable sets in bipartite graphs. In GO IX, Ninth international colloquium on Graphs and Optimization, pages 14, X, France, 2014. www 

2013

Livres

  1. Picouleau, C.; Demange, M.; Lozin, V. and Ries, B. GO VII Meeting, Ovronnaz (CH), June 13?17, 2010. , 2013. www 

Articles de conférence

  1. Picouleau, C. and Frosini, A. How to decompose a binary matrix into three hv-convex polyominoes. In 17th IAPR International Conference on Discrete Geometry for Computer Imagery, pages 311-322, Séville, Spain, LNCS 7749, 2013. www 
  1. Picouleau, C.; Frosini, A. and Rinaldi, S. On the degree sequences of uniform hypergraphs. In 17th IAPR International Conference on Discrete Geometry for Computer Imagery, pages 300-310, Séville, Spain, LNCS 7749, 2013. www 

2012

Articles de revue

  1. Jarray, F. and Picouleau, C. Minimum decomposition into convex binary matrices. In Discrete Applied Mathematics, 160 (7-8): 1164-1175, 2012. doi  www 
  1. Bentz, C.; Costa, M-C.; Picouleau, C.; Ries, B. and De Werra, D. d-Transversals of Stable Sets and Vertex Covers in Weighted Bipartite Graphs. In Journal of Discrete Algorithms, 17: 95-102, 2012. doi  www 
  1. Lacroix, M.; Mahjoub, A. R.; Martin, S. and Picouleau, C. On the NP-completeness of the perfect matching free subgraph problem. In Theoretical Computer Science, 423, 2012. doi  www 
  1. Lacroix, M.; Mahjoub, R.; Martin, S. and Picouleau, C. On the NP-Completeness of the Perfect Matching Free Subgraph Problem. In Theoretical Computer Science, 423: 25-29, 2012. www 

2011

Articles de revue

  1. Costa, M-C.; De Werra, D. and Picouleau, C. Minimum d-blockers and d-transversals in graphs. In Journal of Combinatorial Optimization, 22 (4): 857-872, 2011. doi  www 

Chapitres d'ouvrage

  1. Costa, M-C.; de Werra, D.; Picouleau, C.; Ries, B. and Bentz, C. Weighted Transversals and Blockers for Some Optimization Problems in Graphs. In Progress in Combinatorial Optimization, pages 203-222, 2011. www 

Articles de conférence

  1. Picouleau, C. Minimum Transversals for the Maximum Stable Set Problem in Weighted Bipartite Graphs. In DIMAP Workshop 2011, Warwick, United Kingdom, 2011. www 
  1. Costa, M-C.; de Werra, D.; Picouleau, C.; Ries, B. and Bentz, C. Minimum d-Transversals of Maximum-Weight Stable Sets in Trees. In European conference on combinatorics, graph theory and applications EuroComb'11, Electronics Notes in Discrete Mathematics, pages 129-134, Bupapest, Hungary, 2011. www 

Non publié

  1. Lacroix, M.; Mahjoub, R.; Martin, S. and Picouleau, C. On the NP-Completeness of the Perfect Perfect Matching Free Subgraph Problem. , working paper or preprint. www 

2010

Articles de revue

  1. Picouleau, C. A note on a conjecture on maximum matching in almost regular graphs. In Annals of Discrete Mathematics, 310: 3646-3647, 2010. www 
  1. Ries, B.; Bentz, C.; De Werra, D.; Costa, M-C.; Zenklusen, R. and Picouleau, C. Blockers and Transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid. In Discrete Mathematics, 310: 132-146, 2010. doi  www 
  1. De Werra, D.; Costa, M-C.; Picouleau, C. and Ries, B. On the use of graphs in discrete tomography. In Annals of Operations Research, 175: 287-307, 2010. doi  www 

Livres

  1. Baynat, B.; Chretienne, Ph.; Hanen, C.; Kedad-Sidhoum, S.; Munier, A. and Picouleau, C. Exercices et problèmes d'algorithmique - 3ème édition. , 2010. www 

Articles de conférence

  1. Costa, M-C.; de Werra, D. and Picouleau, C. On matchings and stable sets in bipartite graphs. In Graphs and Optimization VII, Ovronnaz, Suisse, pages 8-10, X, France, 2010. www 
  1. Costa, M-C.; de Werra, D. and Picouleau, C. Minimum d-blockers and d-transversals for the maximum stable set problem. In European conference on operational research EURO 2010, July 11-14 Lisbonne, Portugal (and ROADEF 2010 24-26 f?vrier Toulouse), pages 70-70, Libonne, Portugal, 2010. www 
  1. Picouleau, C. Tomographie discrète : aspects géométriques et aspects graphiques. In Groupe de travail en G?om?trie Discr?te - GDR IM Strasbourg D?cembre 2010, pages 1, X, France, 2010. www 

Rapports

  1. Costa, M-C.; Picouleau, C. and Topart, H. On hypochordal graphs. Technical Report CEDRIC-10-1886, CEDRIC Lab/CNAM, 2010.

2009

Articles de revue

  1. Bentz, C. and Picouleau, C. Locally bounded k -colorings of trees. In RAIRO - Operations Research, 43 (1): 27-33, 2009. doi  www 
  1. Zenklusen, R.; Ries, B.; Picouleau, C.; De Werra, D.; Costa, M-C. and Bentz, C. Blockers and Transversals. In Discrete Mathematics, 13: 4306-4314, 2009. doi  www 
  1. Derhy, N. and Picouleau, C. Finding Induced Trees. In Discrete Applied Mathematics, 157: 3552-3557, 2009. www 
  1. Costa, M-C.; De Werra, D.; Picouleau, C. and Ries, B. Graph coloring with cardinality constraints on the neighborhoods. In Discrete Optimization, 6 (4): 362-369, 2009. doi  www 
  1. Bentz, C.; Costa, M-C.; Picouleau, C.; Ries, B. and De Werra, D. Degree-constrained edge partitioning in graphs arising from discrete tomography. In Journal of Graph Algorithms and Applications, 13 (2): 99-118, 2009. doi  www 
  1. Trotignon, N.; Picouleau, C. and Derhy, N. The four-in-a-tree problem for triangle-free graphs. In Graphs and Combinatorics, 25: 489-502, 2009. www 

Livres

  1. Faure, R.; Lemaire, B. and Picouleau, C. Précis de Recherche Opérationnelle. , 2009. www 

Articles de conférence

  1. Costa, M-C.; Picouleau, C. and Topart, H. Une nouvelle classe de graphes : les hypotriangulés. In Conf?rence ROADEF 2009, Nancy, pages 2, X, France, 2009. www 
  1. Bentz, C.; Costa, M-C.; de Werra, D.; Picouleau, C.; Ries, B. and Zenklusen, R. d-bloqueurs et d-transversaux. In Recherche op?rationnelle et aide ? la d?cision. ROADEF'09 Nancy, pages 316-317, X, France, 2009. www 

2008

Articles de revue

  1. Costa, M-C.; Jarray, F. and Picouleau, C. Complexity results for the horizontal bar packing problem. In Information Processing Letters, 108 (6): 356-359, 2008. doi  www 
  1. Bentz, C.; Costa, M-C.; De Werra, D.; Picouleau, C. and Ries, B. On a graph coloring problem arising from discrete tomography. In Networks, 51 (4): 256-267, 2008. doi  www 
  1. Costa, M-C.; de Werra, D.; Picouleau, C. and Ries, B. Addendum to ``Bicolored Matchings in Some Classes of Graphs''. In Graphs and Combinatorics, 24 (2): 127-128, 2008. doi  www 
  1. Brocchi, S.; Frosini, A. and Picouleau, C. Reconstruction of binary matrices under fixed size neighborhood constraints. In Theoretical Computer Science, 406: 43-54, 2008. www 

Chapitres d'ouvrage

  1. Picouleau, C. Small perturbations on the data of NP-complete scheduling problems. In Flexibility and Robustness in Scheduling, pages 327-340, 2008. www 

Articles de conférence

  1. Frosini, A.; Picouleau, C. and Rinaldi, S. Reconstructing binary matrices with neighborhood constraints: an NP-hard problem. In IAPR'08 14th Int. Conf. on Discrete Geometry for Computer Imagery, pages 392-400, X, France, LNCS 4992 , 2008. www 
  1. Derhy, N. and Picouleau, C. A la recherche d'un arbre induit : complexité et algorithmes. In ROADEF'08, Clermont-Ferrand, février, pages 157-158, X, France, 2008. www 
  1. Picouleau, C.; Brocchi, S. and Frosini, A. Reconstructions tomographiques avec un nombre fixé de lignes. In ROADEF'08 - Clermont-Ferrand – février, pages 365-366, X, France, 2008. www 
  1. Costa, M-C.; Jarray, F. and Picouleau, C. Approximating hv-convex binary matrices and images from discrete projections. In IAPR'08 14th Int. Conf. on Discrete Geometry for Computer Imagery, pages 413-422, X, France, LNCS 4992 , 2008. www 

Divers

  1. Derhy, N.; Picouleau, C. and Trotignon, N. The four-in-a-tree problem in triangle-free graphs. , Documents de travail du Centre d'Economie de la Sorbonne 2008.23 - ISSN : 1955-611X. www 

2007

Articles de revue

  1. Costa, M-C.; de Werra, D.; Picouleau, C. and Ries, B. Bicolored matchings in some classes of graphs. In AKCE International Journal of Graphs and Combinatorics, 23: 47-60, 2007. www 
  1. Bentz, C.; Costa, M-C.; Picouleau, C. and Zrikem, M. The shortest multipaths problem in a capacitated dense channel. In European Journal of Operational Research, 178: 926-931, 2007. www 

Livres

  1. Baynat, B.; Chretienne, Ph.; Hanen, C.; Kedad-Sidhoum, S.; Munier-Kordon, A. and Picouleau, C. Exercices et problèmes d'algorithmique-2e édition. , 2007. www 
  1. Baynat, B.; Chrétienne, P.; Hanen, C.; Kedad-Sidhoum, S.; Munier-Kordon, A. and Picouleau, C. Exercices et problèmes d'algorithmique. Dunod, 2007. www 

Chapitres d'ouvrage

  1. Brunetti, S.; Costa, M-C.; Frosini, A.; Jarray, F. and Picouleau, C. Reconstruction of binary matrices under adjacency constraints. In Advances in Discrete Tomography and Its Applications, pages 125-150, 2007. www 

Articles de conférence

  1. Derhy, N. and Picouleau, C. The Induced Steiner Tree Problem. In Graphs and Optimization VI, Cademario, Switzerland, pages 30, X, France, 2007. www 
  1. Costa, M-C.; Jarray, F. and Picouleau, C. Packing de barres horizontales. In FRANCORO/ROADEF'07, Grenoble, février, pages 153-154, X, France, 2007. www 
  1. Costa, M-C.; de Werra, D.; Picouleau, C. and Ries, B. Reconstruction de la coloration d’un graphe `a partir des projections des voisinages. In FRANCORO/ROADEF'07, Grenoble, février, pages 155-156, X, France, 2007. www 
  1. Bentz, C.; Costa, M-C.; de Werra, D.; Picouleau, C. and Ries, B. Reconstruction d'une coloration des arêtes d’un graphe `a partir des séquences de degrés. In FRANCORO/ROADEF'07, Grenoble, f?vrier, pages 87-88, X, France, 2007. www 

2006

Articles de revue

  1. Picouleau, C. La tomographie discrète : quid ?. In Bulletin de la ROADEF: 7-10, 2006. www 
  1. Costa, M-C.; de Werra, D. and Picouleau, C. Using graphs for some discrete tomography problems. In Discrete Applied Mathematics, 154: 35-46, 2006. www 
  1. Costa, M-C.; Jarray, F. and Picouleau, C. An acyclic days-off scheduling problem. In 4OR: A Quarterly Journal of Operations Research, 4: 73-85, 2006. www 

Chapitres d'ouvrage

  1. Chrétienne, P. and Picouleau, C. Ordonnancement. In Optimisation combinatoire 4 : problèmes paradigmatiques, Hermès, 2006. www 

Articles de conférence

  1. Bentz, C.; Costa, M-C.; Picouleau, C.; Ries, B. and de Werra, D. Reconstruction de la coloration d’un graphe `a partir de projections de cha^ines. In ROADEF'06 7ème congrès ROADEF - Février, pages 51, Lille, France, 2006. www 
  1. Costa, M-C.; de Werra, D.; Picouleau, C. and Ries, B. Graph colouring with vertex neighbourhoods constraints. In Sixth Czech-Slovak Int. Symposium on Combinatorics, Graph Theory, Algorithms and Application, X, France, 2006. www 
  1. Bentz, C.; Costa, M-C.; de Werra, D.; Picouleau, C. and Ries, B. Discrete tomography and graph coloring. In EURO XXI, Reykjavik, Iceland, X, France, 2006. www 

Rapports

  1. Bentz, C. and Picouleau, C. Feasible node colorings of trees with cardinality constraints. Technical Report CEDRIC-06-987, CEDRIC Lab/CNAM, 2006.

2005

Articles de revue

  1. Costa, M-C.; de Werra, D.; Picouleau, C. and Schindl, D. A solvable case of image reconstruction in discrete tomography. In Discrete Applied Mathematics, 148: 240-245, 2005. www 
  1. Picouleau, C. Reconstruction of Convex Polyominoes from Orthogonal Projections of their Contours. In Theoretical Computer Science, 346: 439-454, 2005. www 

Chapitres d'ouvrage

  1. Picouleau, C. Petites perturbations sur les données de problèmes d'ordonnancement NP-complets. In Flexibilité et Robustesse en Ordonnancem, pages 309-323, 2005. www 

Articles de conférence

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

2004

Livres

  1. Artigues, C.; Baptiste, P.; Carlier, J.; Chrétienne, P.; Guéret, C.; Hanen, C. C.; Kedad-Sidhoum, S.; Lahlou, C.; Lenté, C.; Munier-Kordon, A.; Neron, E.; Picouleau, C.; Pinson, E.; Portmann, M-C.; Prins, C.; Proust, C.; Rivreau, D. and Sourd, F. Modèles et Algorithmes en Ordonnancement: Exercices et Problèmes Corrigés. Ellipses, 2004. www 

Chapitres d'ouvrage

  1. Gotha, G. and Picouleau, C. Modèles et Algorithmes en Ordonnancement. In Modèles et Algorithmes en Ordonnancement, pages 228, 2004. www 

Articles de conférence

  1. Costa, M-C.; de Werra, D. and Picouleau, C. On a problem of coloured matching in regular bipartite graphs. In Contributed talk, Proceedings of Graph Theory Paris, pages 63, X, France, 2004. www 

2003

Livres

  1. Baynat, B.; Chretienne, Ph.; Hanen, C.; Kedad-Sidhoum, S.; Munier-Kordon, A. and Picouleau, C. EXERCICES ET PROBLEMES D'ALGORITHMIQUES. , 2003. www 
  1. Baynat, B.; Chrétienne, P.; Hanen, C.; Kedad-Sidhoum, S.; Munier, A. and Picouleau, C. Exercices et Problèmes d'Algorithmique. Dunod, 2003. www 

Chapitres d'ouvrage

  1. Picouleau, C. UET-UCT sur deux processeurs avec contraintes de capacité. In Ordonnancement pour l'informatique paral, pages 41-50, 2003. www 

Articles de conférence

  1. Costa, M-C.; Jarray, F. and Picouleau, C. Quelques problèmes de tomographie discrète. In Ecole d'automne de recherche opérationnelle Tours, X, France, 2003. www 

2002

Articles de revue

  1. Aloulou, M. A.; Sevaux, M.; Rossi, A.; Espinouse, M-L.; Moukrim, A.; Vignier, A.; Penz, B.; Esswein, C.; Artigues, C.; Picouleau, C.; Thomas, C.; Dauzere-Peres, S.; Trystram, D.; Neron, E.; Poder, E.; Sanlaville, E.; Sourd, F.; Portmann, M-C. and Billaut, J-C. Flexibilité et Robustesse en Ordonnancement. In Bulletin de la ROADEF (8): 3 p, 2002. www 

Articles de conférence

  1. Costa, M-C.; de Werra, D. and Picouleau, C. On some special cases of an image reconstruction problem. In ECCO, Lugano, X, France, 2002. www 
  1. Picouleau, C. Stabilite des problemes NP-complets. In roadef 2002, X, France, 2002. www 
  1. Costa, M-C.; Picouleau, C. and Zrikem, M. Solving the shortest multipaths problem on grids. In CIRO Marrakech, Maroc, X, France, 2002. www 

2001

Articles de revue

  1. Picouleau, C. Reconstruction of domino tiling from its two orthogonal projections. In Theoretical Computer Science, 255 (1-2): 437-447, 2001. doi  www 

2000

Livres

  1. Faure, R.; Lemaire, B. and Picouleau, C. Précis de Recherche Opérationnelle. , 2000. www 

Rapports

  1. Picouleau, C. Reconstruction of a coloured domino tiling from its projections. Technical Report CEDRIC-00-166, CEDRIC Lab/CNAM, 2000.
  1. Picouleau, C. Small perturbations on some NP-complete scheduling problems. Technical Report CEDRIC-00-167, CEDRIC Lab/CNAM, 2000.

1996

Articles de revue

  1. Picouleau, C. Worst-case analysis of fast heuristics for packing squares into a square. In Theoretical Computer Science, 164 (1-2): 59-72, 1996. doi  www 

1995

Articles de revue

  1. Picouleau, C. New complexity results on scheduling with small communication delays. In Discrete Applied Mathematics, 60 (1-3): 331-342, 1995. doi  www 

1994

Articles de revue

  1. Picouleau, C. Complexity of the hamiltonian cycle in regular graph problem. In Theoretical Computer Science, 131 (2): 463-473, 1994. doi  www 
Haut