| Current teams : | ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Former team : | Phare |
| Publications RO | 2017 | 2018 | 2019 | 2020 | 2021 | 2022 | 2023 | Total |
|---|---|---|---|---|---|---|---|---|
| Books | 0 | 1 | 2 | 0 | 1 | 0 | 0 | 4 |
| Edited books | 0 | 0 | 0 | 3 | 1 | 0 | 0 | 4 |
| Journal articles | 14 | 15 | 16 | 15 | 19 | 17 | 12 | 108 |
| Book chapters | 0 | 1 | 3 | 0 | 0 | 0 | 0 | 4 |
| Conference papers | 18 | 33 | 48 | 31 | 31 | 38 | 27 | 226 |
| Habilitations | 0 | 1 | 1 | 2 | 0 | 0 | 0 | 4 |
| Theses | 1 | 1 | 0 | 3 | 3 | 2 | 1 | 11 |
- G. Dequen, O. Dubois : “An efficient approach to solving random k-SAT problems”, Journal of Automated Reasoning, vol. 37 (4), pp. 261-276, (Springer Verlag) [Dequen 2006]
- P. Fouilhoux, A. Ridha Mahjoub : “Polyhedral results for the bipartite induced subgraph problem”, Discrete Applied Mathematics, vol. 154 (15), pp. 2128-2149, (Elsevier) [Fouilhoux 2006a]
- B. Gaujal, E. Hyon, A. Jean‑Marie : “Optimal routing in two parallel Queues with Exponential service times”, Discrete Event Dynamic Systems, vol. 16 (1), pp. 71-107, (Springer Verlag) [Gaujal 2006]
- Y. Hendel, F. Sourd : “Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem”, European Journal of Operational Research, vol. 173 (1), pp. 108-119, (Elsevier) [Hendel 2006]
- F. Sourd : “Dynasearch neighborhood for the earliness-tardiness scheduling problem with release dates and setup constraints”, Operations Research Letters, vol. 34 (5), pp. 591-598, (Elsevier) [Sourd 2006b]
- F. Sourd : “Preemptive scheduling with position costs”, Algorithmic Operations Research, vol. 1 (2), pp. 79-93, (Preeminent Academic Facets) [Sourd 2006c]