Follow
Christophe Picouleau
Christophe Picouleau
Professeur Cedric-CNAM
Verified email at cnam.fr
Title
Cited by
Cited by
Year
Scheduling theory and its applications
P Chretienne, EG Coffman Jr, JK Lenstra, Z Liu
Journal of the Operational Research Society 48 (7), 764-765, 1997
3481997
Scheduling with communication delays: a survey
P Chrétienne, C Picouleau
Scheduling theory and its applications, 65-90, 1995
1061995
Précis de recherche opérationnelle
R Faure, B Lemaire, C Picouleau
Précis de Recherche Opérationnelle, 584 pages, 2009
87*2009
Blockers and transversals
R Zenklusen, B Ries, C Picouleau, D De Werra, MC Costa, C Bentz
Discrete Mathematics 309 (13), 4306-4314, 2009
782009
Etude de problèmes d'optimisation dans les systèmes distribués
C Picouleau
Paris 6, 1992
651992
Précis de recherche opérationnelle-7e éd.: Méthodes et exercices d'application
R Faure, B Lemaire, C Picouleau
Dunod, 2014
562014
Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
B Ries, C Bentz, C Picouleau, D de Werra, MC Costa, R Zenklusen
Discrete Mathematics 310 (1), 132-146, 2010
452010
Task scheduling with interprocessor communication delays
P Chretienne
European Journal of Operational Research 57 (3), 348-354, 1992
431992
Minimum d-blockers and d-transversals in graphs
MC Costa, D de Werra, C Picouleau
Journal of Combinatorial Optimization 22, 857-872, 2011
372011
New complexity results on scheduling with small communication delays
C Picouleau
Discrete Applied Mathematics 60 (1-3), 331-342, 1995
351995
Finding induced trees
N Derhy, C Picouleau
Discrete Applied Mathematics 157 (17), 3552-3557, 2009
322009
Two new NP-complete scheduling problems with communication delays and unlimited number of processors
C Picouleau
Inst. Blaise Pascal, Univ., 1991
301991
An acyclic days-off scheduling problem
MC Costa, F Jarray, C Picouleau
4OR 4, 73-85, 2006
292006
Complexity of the Hamiltonian cycle in regular graph problem
C Picouleau
Theoretical computer science 131 (2), 463-473, 1994
281994
Reconstruction of domino tiling from its two orthogonal projections
C Picouleau
Theoretical computer science 255 (1-2), 437-447, 2001
262001
Reducing the clique and chromatic number via edge contractions and vertex deletions
D Paulusma, C Picouleau, B Ries
Combinatorial Optimization: 4th International Symposium, ISCO 2016, Vietri …, 2016
232016
A solvable case of image reconstruction in discrete tomography
MC Costa, D de Werra, C Picouleau, D Schindl
Discrete Applied Mathematics 148 (3), 240-245, 2005
232005
Using graphs for some discrete tomography problems
MC Costa, D de Werra, C Picouleau
Discrete Applied Mathematics 154 (1), 35-46, 2006
222006
Blockers for the stability number and the chromatic number
C Bazgan, C Bentz, C Picouleau, B Ries
Graphs and Combinatorics 31, 73-90, 2015
202015
On the NP-completeness of the perfect matching free subgraph problem
M Lacroix, AR Mahjoub, S Martin, C Picouleau
Theoretical Computer Science 423, 25-29, 2012
192012
The system can't perform the operation now. Try again later.
Articles 1–20