default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristophe Picouleau
Person information
- affiliation: CNAM-Laboratoire Cédric, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j45]Niccolò Di Marco, Andrea Frosini, Christophe Picouleau
:
The complexity of 2-intersection graphs of 3-hypergraphs recognition for claw-free graphs and triangulated claw-free graphs. Discret. Appl. Math. 355: 232-246 (2024)- [j44]Valentin Bouquet, François Delbot, Christophe Picouleau, Stéphane Rovedakis:
On the complexity of Dominating Set for graphs with fixed diameter. Theor. Comput. Sci. 1001: 114561 (2024) - 2023
- [i7]Valentin Bouquet, François Delbot, Christophe Picouleau, Stéphane Rovedakis:
On the complexity of Dominating Set for graphs with fixed diameter. CoRR abs/2304.09701 (2023) - 2022
- [j43]Eun Jung Kim, Martin Milanic, Jérôme Monnot, Christophe Picouleau:
Complexity and algorithms for constant diameter augmentation problems. Theor. Comput. Sci. 904: 15-26 (2022) - 2021
- [j42]Valentin Bouquet, François Delbot, Christophe Picouleau:
On the vertices belonging to all, some, none minimum dominating set. Discret. Appl. Math. 288: 9-19 (2021) - [j41]Andrea Frosini, Christophe Picouleau, Simone Rinaldi:
New sufficient conditions on the degree sequences of uniform hypergraphs. Theor. Comput. Sci. 868: 97-111 (2021) - 2020
- [j40]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau:
Minimal graphs for 2-factor extension. Discret. Appl. Math. 282: 65-79 (2020) - [i6]Valentin Bouquet, François Delbot, Christophe Picouleau, Stéphane Rovedakis:
On Minimum Dominating Sets in cubic and (claw, H)-free graphs. CoRR abs/2002.12232 (2020)
2010 – 2019
- 2019
- [j39]Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Critical vertices and edges in H-free graphs. Discret. Appl. Math. 257: 361-367 (2019) - [c10]Andrea Frosini, Christophe Picouleau:
On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition. DGCI 2019: 195-205 - [i5]Valentin Bouquet, François Delbot, Christophe Picouleau:
On the vertices belonging to all, some, none minimum dominating set. CoRR abs/1909.02843 (2019) - 2018
- [j38]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau:
Minimal graphs for matching extensions. Discret. Appl. Math. 234: 47-55 (2018) - [j37]Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Contraction and deletion blockers for perfect graphs and H-free graphs. Theor. Comput. Sci. 746: 49-72 (2018) - [c9]Marie Milliet de Faverges, Giorgio Russolillo, Christophe Picouleau, Boubekeur Merabet, Bertrand Houzel:
Estimating Long-Term Delay Risk with Generalized Linear Models. ITSC 2018: 2911-2916 - 2017
- [j36]Christophe Picouleau, Daniël Paulusma, Bernard Ries:
Reducing the Chromatic Number by Vertex or Edge Deletions. Electron. Notes Discret. Math. 62: 243-248 (2017) - [c8]Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions. TAMC 2017: 470-483 - [i4]Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Critical Vertices and Edges in $H$-free Graphs. CoRR abs/1706.09043 (2017) - [i3]Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs. CoRR abs/1706.09052 (2017) - [i2]Thomas Ridremont, Dimitri Watel, Pierre-Louis Poirion, Christophe Picouleau:
Adaptive Network Flow with k-Arc Destruction. CoRR abs/1711.00831 (2017) - 2016
- [c7]Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions. ISCO 2016: 38-49 - 2015
- [j35]Jacek Blazewicz, Alain Hertz, Christophe Picouleau, Marino Widmer:
Foreword. Discret. Appl. Math. 182: 1 (2015) - [j34]Cristina Bazgan, Cédric Bentz, Christophe Picouleau, Bernard Ries:
Blockers for the Stability Number and the Chromatic Number. Graphs Comb. 31(1): 73-90 (2015) - [c6]Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Contraction Blockers for Graphs with Forbidden Induced Paths. CIAC 2015: 194-207 - 2013
- [j33]Marc Demange, Vadim V. Lozin, Christophe Picouleau, Bernard Ries:
GO VII Meeting, Ovronnaz (CH), June 13-17, 2010. Discret. Appl. Math. 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 - [i1]Nicolas Derhy, Christophe Picouleau, Nicolas Trotignon:
The four-in-a-tree problem in triangle-free graphs. CoRR abs/1309.0978 (2013) - 2012
- [j32]Fethi Jarray, Christophe Picouleau:
Minimum decomposition into convex binary matrices. Discret. Appl. Math. 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. Electron. Notes Discret. Math. 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. Ann. Oper. Res. 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. Discret. Math. 310(1): 132-146 (2010) - [j25]Christophe Picouleau:
A note on a conjecture on maximum matching in almost regular graphs. Discret. Math. 310(24): 3646-3647 (2010)
2000 – 2009
- 2009
- [j24]Nicolas Derhy, Christophe Picouleau:
Finding induced trees. Discret. Appl. Math. 157(17): 3552-3557 (2009) - [j23]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Graph coloring with cardinality constraints on the neighborhoods. Discret. Optim. 6(4): 362-369 (2009) - [j22]Rico Zenklusen, Bernard Ries, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Cédric Bentz:
Blockers and transversals. Discret. Math. 309(13): 4306-4314 (2009) - [j21]Nicolas Derhy, Christophe Picouleau, Nicolas Trotignon:
The Four-in-a-Tree Problem in Triangle-Free Graphs. Graphs Comb. 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 Oper. Res. 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]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Addendum to "Bicolored Matchings in Some Classes of Graphs". Graphs Comb. 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. Eur. J. Oper. Res. 178(3): 926-931 (2007) - [j12]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Bicolored Matchings in Some Classes of Graphs. Graphs Comb. 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. Discret. Appl. Math. 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. Discret. Appl. Math. 148(3): 240-245 (2005) - [j8]Christophe Picouleau, Sara Brunetti, Andrea Frosini:
Reconstructing a binary matrix under timetabling constraints. Electron. Notes Discret. Math. 20: 99-112 (2005) - [j7]Marie-Christine Costa, Fethi Jarray, Christophe Picouleau:
Reconstruction of binary matrices under adjacency constraints. Electron. Notes Discret. Math. 20: 281-297 (2005) - [j6]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries:
Bicolored matchings in some classes of graphs. Electron. Notes Discret. Math. 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. Discret. Appl. Math. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
