Etude de problemes d'optimisation dans les systemes distribues. - Christophe Picouleau (1992)

Complexity of the Hamiltonian Cycle in Regular Graph Problem. - Christophe Picouleau (Theor. Comput. Sci., 1994)

New Complexity Results on Scheduling with Small Communication Delays. - Christophe Picouleau (Discret. Appl. Math., 1995)

Worst-Case Analysis of Fast Heuristics for Packing Squares into a Square. - Christophe Picouleau (Theor. Comput. Sci., 1996)

Reconstruction of domino tiling from its two orthogonal projections. - Christophe Picouleau (Theor. Comput. Sci., 2001)

Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections. - Marie-Christine Costa; Fethi Jarray; Christophe Picouleau (ICTCS, 2005)

A solvable case of image reconstruction in discrete tomography. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; David Schindl (Discret. Appl. Math., 2005)

Reconstruction of binary matrices under adjacency constraints. - Marie-Christine Costa; Fethi Jarray; Christophe Picouleau (Electron. Notes Discret. Math., 2005)

Bicolored matchings in some classes of graphs. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Electron. Notes Discret. Math., 2005)

Reconstructing a binary matrix under timetabling constraints. - Christophe Picouleau; Sara Brunetti; Andrea Frosini (Electron. Notes Discret. Math., 2005)

Reconstruction of convex polyominoes from orthogonal projections of their contours. - Christophe Picouleau (Theor. Comput. Sci., 2005)

An acyclic days-off scheduling problem. - Marie-Christine Costa; Fethi Jarray; Christophe Picouleau (4OR, 2006)

Using graphs for some discrete tomography problems. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau (Discret. Appl. Math., 2006)

The shortest multipaths problem in a capacitated dense channel. - Cédric Bentz; Marie-Christine Costa; Christophe Picouleau; Maria Zrikem (Eur. J. Oper. Res., 2007)

Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem. - Andrea Frosini; Christophe Picouleau; Simone Rinaldi (DGCI, 2008)

Approximating hv-Convex Binary Matrices and Images from Discrete Projections. - Fethi Jarray; Marie-Christine Costa; Christophe Picouleau (DGCI, 2008)

On the use of graphs in discrete tomography. - Dominique de Werra; Marie-Christine Costa; Christophe Picouleau; Bernard Ries (4OR, 2008)

Addendum to "Bicolored Matchings in Some Classes of Graphs". - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Graphs Comb., 2008)

Complexity results for the horizontal bar packing problem. - Fethi Jarray; Marie-Christine Costa; Christophe Picouleau (Inf. Process. Lett., 2008)

On a graph coloring problem arising from discrete tomography. - Cédric Bentz; Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Networks, 2008)

Reconstruction of binary matrices under fixed size neighborhood constraints. - Stefano Brocchi; Andrea Frosini; Christophe Picouleau (Theor. Comput. Sci., 2008)

Finding induced trees. - Nicolas Derhy; Christophe Picouleau (Discret. Appl. Math., 2009)

Graph coloring with cardinality constraints on the neighborhoods. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Discret. Optim., 2009)

Blockers and transversals. - Rico Zenklusen; Bernard Ries; Christophe Picouleau; Dominique de Werra; Marie-Christine Costa; Cédric Bentz (Discret. Math., 2009)

The Four-in-a-Tree Problem in Triangle-Free Graphs. - Nicolas Derhy; Christophe Picouleau; Nicolas Trotignon (Graphs Comb., 2009)

Degree-constrained edge partitioning in graphs arising from discrete tomography. - Cédric Bentz; Marie-Christine Costa; Christophe Picouleau; Bernard Ries; Dominique de Werra (J. Graph Algorithms Appl., 2009)

Locally bounded k-colorings of trees. - Cédric Bentz; Christophe Picouleau (RAIRO Oper. Res., 2009)

A note on a conjecture on maximum matching in almost regular graphs. - Christophe Picouleau (Discret. Math., 2010)

Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. - Bernard Ries; Cédric Bentz; Christophe Picouleau; Dominique de Werra; Marie-Christine Costa; Rico Zenklusen (Discret. Math., 2010)

Minimum d-Transversals of Maximum-Weight Stable Sets in Trees. - Cédric Bentz; Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Electron. Notes Discret. Math., 2011)

Minimum d-blockers and d-transversals in graphs. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau (J. Comb. Optim., 2011)

Minimum decomposition into convex binary matrices. - Fethi Jarray; Christophe Picouleau (Discret. Appl. Math., 2012)

d-Transversals of stable sets and vertex covers in weighted bipartite graphs. - Cédric Bentz; Marie-Christine Costa; Christophe Picouleau; Bernard Ries; Dominique de Werra (J. Discrete Algorithms, 2012)

On the NP-completeness of the perfect matching free subgraph problem. - Mathieu Lacroix 001; Ali Ridha Mahjoub; Sébastien Martin; Christophe Picouleau (Theor. Comput. Sci., 2012)

How to Decompose a Binary Matrix into Three hv-convex Polyominoes. - Andrea Frosini; Christophe Picouleau (DGCI, 2013)

On the Degree Sequences of Uniform Hypergraphs. - Andrea Frosini; Christophe Picouleau; Simone Rinaldi (DGCI, 2013)

GO VII Meeting, Ovronnaz (CH), June 13-17, 2010. - Marc Demange; Vadim V. Lozin; Christophe Picouleau; Bernard Ries (Discret. Appl. Math., 2013)

Contraction Blockers for Graphs with Forbidden Induced Paths. - Öznur Yasar Diner; Daniël Paulusma; Christophe Picouleau; Bernard Ries (CIAC, 2015)

Foreword. - Jacek Blazewicz; Alain Hertz; Christophe Picouleau; Marino Widmer (Discret. Appl. Math., 2015)

Blockers for the Stability Number and the Chromatic Number. - Cristina Bazgan; Cédric Bentz; Christophe Picouleau; Bernard Ries (Graphs Comb., 2015)

Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions. - Daniël Paulusma; Christophe Picouleau; Bernard Ries (ISCO, 2016)

Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions. - Daniël Paulusma; Christophe Picouleau; Bernard Ries (TAMC, 2017)

Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs. - Öznur Yasar Diner; Daniël Paulusma; Christophe Picouleau; Bernard Ries (CoRR, 2017)

Adaptive Network Flow with k-Arc Destruction. - Thomas Ridremont; Dimitri Watel; Pierre-Louis Poirion; Christophe Picouleau (CoRR, 2017)

Reducing the Chromatic Number by Vertex or Edge Deletions. - Christophe Picouleau; Daniël Paulusma; Bernard Ries (Electron. Notes Discret. Math., 2017)

Estimating Long-Term Delay Risk with Generalized Linear Models. - Marie Milliet de Faverges; Giorgio Russolillo; Christophe Picouleau; Boubekeur Merabet; Bertrand Houzel (ITSC, 2018)

Minimal graphs for matching extensions. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau (Discret. Appl. Math., 2018)

Contraction and deletion blockers for perfect graphs and H-free graphs. - Öznur Yasar Diner; Daniël Paulusma; Christophe Picouleau; Bernard Ries (Theor. Comput. Sci., 2018)

On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition. - Andrea Frosini; Christophe Picouleau (DGCI, 2019)

Critical vertices and edges in H-free graphs. - Daniël Paulusma; Christophe Picouleau; Bernard Ries (Discret. Appl. Math., 2019)

On Minimum Dominating Sets in cubic and (claw, H)-free graphs. - Valentin Bouquet; François Delbot; Christophe Picouleau; Stéphane Rovedakis (CoRR, 2020)

Minimal graphs for 2-factor extension. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau (Discret. Appl. Math., 2020)

On the vertices belonging to all, some, none minimum dominating set. - Valentin Bouquet; François Delbot; Christophe Picouleau (Discret. Appl. Math., 2021)

New sufficient conditions on the degree sequences of uniform hypergraphs. - Andrea Frosini; Christophe Picouleau; Simone Rinaldi (Theor. Comput. Sci., 2021)

Complexity and algorithms for constant diameter augmentation problems. - Eun Jung Kim 002; Martin Milanic; Jérôme Monnot; Christophe Picouleau (Theor. Comput. Sci., 2022)

The complexity of 2-intersection graphs of 3-hypergraphs recognition for claw-free graphs and triangulated claw-free graphs. - Niccolò Di Marco; Andrea Frosini; Christophe Picouleau (Discret. Appl. Math., 2024)

On the complexity of Dominating Set for graphs with fixed diameter. - Valentin Bouquet; François Delbot; Christophe Picouleau; Stéphane Rovedakis (Theor. Comput. Sci., 2024)

The complexity of the perfect matching-cut problem. - Valentin Bouquet; Christophe Picouleau (J. Graph Theory, 2025)

Partition of graphs with maximum degree ratio. - Valentin Bouquet; François Delbot; Christophe Picouleau (Ann. Oper. Res., 2025)