Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Christophe Picouleau
2010 – today
- 2013
[j33]Marc Demange, Vadim V. Lozin, Christophe Picouleau, Bernard Ries: GO VII Meeting, Ovronnaz (CH), June 13-17, 2010. Discrete Applied Mathematics 161(4-5): 453 (2013)
[c5]Andrea Frosini, Christophe Picouleau, Simone Rinaldi: On the Degree Sequences of Uniform Hypergraphs. DGCI 2013: 300-310
[c4]Andrea Frosini, Christophe Picouleau: How to Decompose a Binary Matrix into Three hv-convex Polyominoes. DGCI 2013: 311-322- 2012
[j32]Fethi Jarray, Christophe Picouleau: Minimum decomposition into convex binary matrices. Discrete Applied Mathematics 160(7-8): 1164-1175 (2012)
[j31]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: 95-102 (2012)
[j30]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: 25-29 (2012)- 2011
[j29]Cédric Bentz, Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries: Minimum d-Transversals of Maximum-Weight Stable Sets in Trees. Electronic Notes in Discrete Mathematics 38: 129-134 (2011)
[j28]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau: Minimum d-blockers and d-transversals in graphs. J. Comb. Optim. 22(4): 857-872 (2011)- 2010
[j27]Dominique de Werra, Marie-Christine Costa, Christophe Picouleau, Bernard Ries: On the use of graphs in discrete tomography. Annals OR 175(1): 287-307 (2010)
[j26]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. Discrete Mathematics 310(1): 132-146 (2010)
[j25]Christophe Picouleau: A note on a conjecture on maximum matching in almost regular graphs. Discrete Mathematics 310(24): 3646-3647 (2010)
2000 – 2009
- 2009
[j24]Nicolas Derhy, Christophe Picouleau: Finding induced trees. Discrete Applied Mathematics 157(17): 3552-3557 (2009)
[j23]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries: Graph coloring with cardinality constraints on the neighborhoods. Discrete Optimization 6(4): 362-369 (2009)
[j22]Rico Zenklusen, Bernard Ries, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Cédric Bentz: Blockers and transversals. Discrete Mathematics 309(13): 4306-4314 (2009)
[j21]Nicolas Derhy, Christophe Picouleau, Nicolas Trotignon: The Four-in-a-Tree Problem in Triangle-Free Graphs. Graphs and Combinatorics 25(4): 489-502 (2009)
[j20]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): 99-118 (2009)
[j19]Cédric Bentz, Christophe Picouleau: Locally bounded k-colorings of trees. RAIRO - Operations Research 43(1): 27-33 (2009)- 2008
[j18]Dominique de Werra, Marie-Christine Costa, Christophe Picouleau, Bernard Ries: On the use of graphs in discrete tomography. 4OR 6(2): 101-123 (2008)
[j17]M. C. Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries: Addendum to "Bicolored Matchings in Some Classes of Graphs". Graphs and Combinatorics 24(2): 127-128 (2008)
[j16]Fethi Jarray, Marie-Christine Costa, Christophe Picouleau: Complexity results for the horizontal bar packing problem. Inf. Process. Lett. 108(6): 356-359 (2008)
[j15]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): 256-267 (2008)
[j14]Stefano Brocchi, Andrea Frosini, Christophe Picouleau: Reconstruction of binary matrices under fixed size neighborhood constraints. Theor. Comput. Sci. 406(1-2): 43-54 (2008)
[c3]Andrea Frosini, Christophe Picouleau, Simone Rinaldi: Reconstructing Binary Matrices with Neighborhood Constraints: An NP-hard Problem. DGCI 2008: 392-400
[c2]Fethi Jarray, Marie-Christine Costa, Christophe Picouleau: Approximating hv-Convex Binary Matrices and Images from Discrete Projections. DGCI 2008: 413-422- 2007
[j13]Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Maria Zrikem: The shortest multipaths problem in a capacitated dense channel. European Journal of Operational Research 178(3): 926-931 (2007)
[j12]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries: Bicolored Matchings in Some Classes of Graphs. Graphs and Combinatorics 23(1): 47-60 (2007)- 2006
[j11]Marie-Christine Costa, Fethi Jarray, Christophe Picouleau: An acyclic days-off scheduling problem. 4OR 4(1): 73-85 (2006)
[j10]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau: Using graphs for some discrete tomography problems. Discrete Applied Mathematics 154(1): 35-46 (2006)- 2005
[j9]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, David Schindl: A solvable case of image reconstruction in discrete tomography. Discrete Applied Mathematics 148(3): 240-245 (2005)
[j8]Christophe Picouleau, Sara Brunetti, Andrea Frosini: Reconstructing a binary matrix under timetabling constraints. Electronic Notes in Discrete Mathematics 20: 99-112 (2005)
[j7]Marie-Christine Costa, Fethi Jarray, Christophe Picouleau: Reconstruction of binary matrices under adjacency constraints. Electronic Notes in Discrete Mathematics 20: 281-297 (2005)
[j6]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries: Bicolored matchings in some classes of graphs. Electronic Notes in Discrete Mathematics 22: 207-211 (2005)
[j5]Christophe Picouleau: Reconstruction of convex polyominoes from orthogonal projections of their contours. Theor. Comput. Sci. 346(2-3): 439-454 (2005)
[c1]Marie-Christine Costa, Fethi Jarray, Christophe Picouleau: Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections. ICTCS 2005: 173-181- 2001
[j4]Christophe Picouleau: Reconstruction of domino tiling from its two orthogonal projections. Theor. Comput. Sci. 255(1-2): 437-447 (2001)
1990 – 1999
- 1996
[j3]Christophe Picouleau: Worst-Case Analysis of Fast Heuristics for Packing Squares into a Square. Theor. Comput. Sci. 164(1&2): 59-72 (1996)- 1995
[j2]Christophe Picouleau: New Complexity Results on Scheduling with Small Communication Delays. Discrete Applied Mathematics 60(1-3): 331-342 (1995)- 1994
[j1]Christophe Picouleau: Complexity of the Hamiltonian Cycle in Regular Graph Problem. Theor. Comput. Sci. 131(2): 463-473 (1994)- 1992
[b1]Christophe Picouleau: Etude de problemes d'optimisation dans les systemes distribues. Université Paris 1992, pp. 1-80
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-03-19 13:18 CET by the dblp team



