Christophe Picouleau

ORCID

Publication Activity (10 Years)

Years Active: 1994-2023
Publications (10 Years): 21

Top Venues

Université Paris (PHD)

Education History

Université Paris

PHD

Publications

Valentin Bouquet, François Delbot, Christophe Picouleau, Stéphane Rovedakis
On the complexity of Dominating Set for graphs with fixed diameter. CoRR (2023)
Eun Jung Kim, Martin Milanic, Jérôme Monnot, Christophe Picouleau
Complexity and algorithms for constant diameter augmentation problems. Theor. Comput. Sci. 904 (2022)
Valentin Bouquet, François Delbot, Christophe Picouleau
On the vertices belonging to all, some, none minimum dominating set. Discret. Appl. Math. 288 (2021)
Andrea Frosini, Christophe Picouleau, Simone Rinaldi
New sufficient conditions on the degree sequences of uniform hypergraphs. Theor. Comput. Sci. 868 (2021)
Marie-Christine Costa, Dominique de Werra, Christophe Picouleau
Minimal graphs for 2-factor extension. Discret. Appl. Math. 282 (2020)
Valentin Bouquet, François Delbot, Christophe Picouleau, Stéphane Rovedakis
On Minimum Dominating Sets in cubic and (claw, H)-free graphs. CoRR (2020)
Andrea Frosini, Christophe Picouleau
On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition. DGCI (2019)
Daniël Paulusma, Christophe Picouleau, Bernard Ries
Critical vertices and edges in H-free graphs. Discret. Appl. Math. 257 (2019)
Valentin Bouquet, François Delbot, Christophe Picouleau
On the vertices belonging to all, some, none minimum dominating set. CoRR (2019)
Marie-Christine Costa, Dominique de Werra, Christophe Picouleau
Minimal graphs for matching extensions. Discret. Appl. Math. 234 (2018)
Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries
-free graphs. Theor. Comput. Sci. 746 (2018)
Marie Milliet de Faverges, Giorgio Russolillo, Christophe Picouleau, Boubekeur Merabet, Bertrand Houzel
Estimating Long-Term Delay Risk with Generalized Linear Models. ITSC (2018)
Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries
Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs. CoRR (2017)
Christophe Picouleau, Daniël Paulusma, Bernard Ries
Reducing the Chromatic Number by Vertex or Edge Deletions. Electron. Notes Discret. Math. 62 (2017)
Daniël Paulusma, Christophe Picouleau, Bernard Ries
Critical Vertices and Edges in $H$-free Graphs. CoRR (2017)
Thomas Ridremont, Dimitri Watel, Pierre-Louis Poirion, Christophe Picouleau
Adaptive Network Flow with k-Arc Destruction. CoRR (2017)
Daniël Paulusma, Christophe Picouleau, Bernard Ries
Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions. TAMC (2017)
Daniël Paulusma, Christophe Picouleau, Bernard Ries
Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions. ISCO (2016)
Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries
Contraction Blockers for Graphs with Forbidden Induced Paths. CIAC (2015)
Cristina Bazgan, Cédric Bentz, Christophe Picouleau, Bernard Ries
Blockers for the Stability Number and the Chromatic Number. Graphs Comb. 31 (1) (2015)
Jacek Blazewicz, Alain Hertz, Christophe Picouleau, Marino Widmer
Foreword. Discret. Appl. Math. 182 (2015)
Nicolas Derhy, Christophe Picouleau, Nicolas Trotignon
The four-in-a-tree problem in triangle-free graphs. CoRR (2013)
Marc Demange, Vadim V. Lozin, Christophe Picouleau, Bernard Ries
GO VII Meeting, Ovronnaz (CH), June 13-17, 2010. Discret. Appl. Math. 161 (4-5) (2013)
Andrea Frosini, Christophe Picouleau
How to Decompose a Binary Matrix into Three hv-convex Polyominoes. DGCI (2013)
Andrea Frosini, Christophe Picouleau, Simone Rinaldi
On the Degree Sequences of Uniform Hypergraphs. DGCI (2013)
Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Bernard Ries, Dominique de Werra
d-Transversals of stable sets and vertex covers in weighted bipartite graphs. J. Discrete Algorithms 17 (2012)
Fethi Jarray, Christophe Picouleau
Minimum decomposition into convex binary matrices. Discret. Appl. Math. 160 (7-8) (2012)
Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin, Christophe Picouleau
On the NP-completeness of the perfect matching free subgraph problem. Theor. Comput. Sci. 423 (2012)
Cédric Bentz, Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
Minimum d-Transversals of Maximum-Weight Stable Sets in Trees. Electron. Notes Discret. Math. 38 (2011)
Marie-Christine Costa, Dominique de Werra, Christophe Picouleau
Minimum d-blockers and d-transversals in graphs. J. Comb. Optim. 22 (4) (2011)
Bernard Ries, Cédric Bentz, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Rico Zenklusen
Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. Discret. Math. 310 (1) (2010)
Dominique de Werra, Marie-Christine Costa, Christophe Picouleau, Bernard Ries
On the use of graphs in discrete tomography. Ann. Oper. Res. 175 (1) (2010)
Christophe Picouleau
A note on a conjecture on maximum matching in almost regular graphs. Discret. Math. 310 (24) (2010)
Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Bernard Ries, Dominique de Werra
Degree-constrained edge partitioning in graphs arising from discrete tomography. J. Graph Algorithms Appl. 13 (2) (2009)
Nicolas Derhy, Christophe Picouleau
Finding induced trees. Discret. Appl. Math. 157 (17) (2009)
Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
Graph coloring with cardinality constraints on the neighborhoods. Discret. Optim. 6 (4) (2009)
Nicolas Derhy, Christophe Picouleau, Nicolas Trotignon
The Four-in-a-Tree Problem in Triangle-Free Graphs. Graphs Comb. 25 (4) (2009)
Rico Zenklusen, Bernard Ries, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Cédric Bentz
Blockers and transversals. Discret. Math. 309 (13) (2009)
Cédric Bentz, Christophe Picouleau
-colorings of trees. RAIRO Oper. Res. 43 (1) (2009)
Stefano Brocchi, Andrea Frosini, Christophe Picouleau
Reconstruction of binary matrices under fixed size neighborhood constraints. Theor. Comput. Sci. 406 (1-2) (2008)
Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
Addendum to "Bicolored Matchings in Some Classes of Graphs". Graphs Comb. 24 (2) (2008)
Fethi Jarray, Marie-Christine Costa, Christophe Picouleau
Complexity results for the horizontal bar packing problem. Inf. Process. Lett. 108 (6) (2008)
Dominique de Werra, Marie-Christine Costa, Christophe Picouleau, Bernard Ries
On the use of graphs in discrete tomography. 4OR 6 (2) (2008)
Cédric Bentz, Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
On a graph coloring problem arising from discrete tomography. Networks 51 (4) (2008)
Andrea Frosini, Christophe Picouleau, Simone Rinaldi
Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem. DGCI (2008)
Fethi Jarray, Marie-Christine Costa, Christophe Picouleau
Approximating hv-Convex Binary Matrices and Images from Discrete Projections. DGCI (2008)
Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
Bicolored Matchings in Some Classes of Graphs. Graphs Comb. 23 (1) (2007)
Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Maria Zrikem
The shortest multipaths problem in a capacitated dense channel. Eur. J. Oper. Res. 178 (3) (2007)
Marie-Christine Costa, Dominique de Werra, Christophe Picouleau
Using graphs for some discrete tomography problems. Discret. Appl. Math. 154 (1) (2006)
Marie-Christine Costa, Fethi Jarray, Christophe Picouleau
An acyclic days-off scheduling problem. 4OR 4 (1) (2006)
Christophe Picouleau
Reconstruction of convex polyominoes from orthogonal projections of their contours. Theor. Comput. Sci. 346 (2-3) (2005)
Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, David Schindl
A solvable case of image reconstruction in discrete tomography. Discret. Appl. Math. 148 (3) (2005)
Marie-Christine Costa, Fethi Jarray, Christophe Picouleau
Reconstruction of binary matrices under adjacency constraints. Electron. Notes Discret. Math. 20 (2005)
Christophe Picouleau, Sara Brunetti, Andrea Frosini
Reconstructing a binary matrix under timetabling constraints. Electron. Notes Discret. Math. 20 (2005)
Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
Bicolored matchings in some classes of graphs. Electron. Notes Discret. Math. 22 (2005)
Marie-Christine Costa, Fethi Jarray, Christophe Picouleau
Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections. ICTCS (2005)
Christophe Picouleau
Reconstruction of domino tiling from its two orthogonal projections. Theor. Comput. Sci. 255 (1-2) (2001)
Christophe Picouleau
Worst-Case Analysis of Fast Heuristics for Packing Squares into a Square. Theor. Comput. Sci. 164 (1&2) (1996)
Christophe Picouleau
New Complexity Results on Scheduling with Small Communication Delays. Discret. Appl. Math. 60 (1-3) (1995)
Christophe Picouleau
Complexity of the Hamiltonian Cycle in Regular Graph Problem. Theor. Comput. Sci. 131 (2) (1994)

Christophe Picouleau.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christophe Picouleau