| 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 | 355 | 1997 |
| Scheduling with communication delays: a survey P Chrétienne, C Picouleau Scheduling theory and its applications, 65-90, 1995 | 106 | 1995 |
| Précis de recherche opérationnelle R Faure, B Lemaire, C Picouleau Précis de Recherche Opérationnelle, 584 pages, 2009 | 80 | 2009 |
| Précis de recherche opérationnelle-7e éd.: Méthodes et exercices d'application R Faure, B Lemaire, C Picouleau Dunod, 2014 | 79 | 2014 |
| Blockers and transversals R Zenklusen, B Ries, C Picouleau, D De Werra, MC Costa, C Bentz Discrete Mathematics 309 (13), 4306-4314, 2009 | 79 | 2009 |
| Etude de problèmes d'optimisation dans les systèmes distribués C Picouleau Paris 6, 1992 | 64 | 1992 |
| 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 | 46 | 2010 |
| Task scheduling with interprocessor communication delays P Chretienne European Journal of Operational Research 57 (3), 348-354, 1992 | 43 | 1992 |
| Minimum d-blockers and d-transversals in graphs MC Costa, D de Werra, C Picouleau Journal of Combinatorial Optimization 22, 857-872, 2011 | 40 | 2011 |
| Finding induced trees N Derhy, C Picouleau Discrete Applied Mathematics 157 (17), 3552-3557, 2009 | 36 | 2009 |
| New complexity results on scheduling with small communication delays C Picouleau Discrete Applied Mathematics 60 (1-3), 331-342, 1995 | 35 | 1995 |
| An acyclic days-off scheduling problem MC Costa, F Jarray, C Picouleau 4OR 4, 73-85, 2006 | 29 | 2006 |
| Two new NP-complete scheduling problems with communication delays and unlimited number of processors C Picouleau Inst. Blaise Pascal, Univ., 1991 | 29 | 1991 |
| Complexity of the Hamiltonian cycle in regular graph problem C Picouleau Theoretical computer science 131 (2), 463-473, 1994 | 28 | 1994 |
| Reconstruction of domino tiling from its two orthogonal projections C Picouleau Theoretical computer science 255 (1-2), 437-447, 2001 | 27 | 2001 |
| 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 | 24 | 2016 |
| 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 | 24 | 2005 |
| Using graphs for some discrete tomography problems MC Costa, D de Werra, C Picouleau Discrete Applied Mathematics 154 (1), 35-46, 2006 | 23 | 2006 |
| Blockers for the stability number and the chromatic number C Bazgan, C Bentz, C Picouleau, B Ries Graphs and Combinatorics 31, 73-90, 2015 | 21 | 2015 |
| On the degree sequences of uniform hypergraphs A Frosini, C Picouleau, S Rinaldi International Conference on Discrete Geometry for Computer Imagery, 300-310, 2013 | 21 | 2013 |
Bernard RiesProfessor, University of FribourgZweryfikowany adres z unifr.ch
Andrea FrosiniRicercatore di Informatica, Università di FirenzeZweryfikowany adres z unifi.itDaniel PaulusmaDepartment of Computer Science, Durham UniversityZweryfikowany adres z durham.ac.uk
Rico ZenklusenETH ZurichZweryfikowany adres z math.ethz.ch
Sébastien martinChercheur chez HuaweiZweryfikowany adres z univ-lorraine.fr
Öznur YaşarKadir Has UniversityZweryfikowany adres z khas.edu.tr
