| 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 | 16 | 19 | 17 | 3 | 100 |
| Book chapters | 0 | 1 | 3 | 0 | 0 | 0 | 0 | 4 |
| Conference papers | 18 | 33 | 48 | 31 | 31 | 38 | 5 | 204 |
| Habilitations | 0 | 1 | 1 | 2 | 0 | 0 | 0 | 4 |
| Theses | 1 | 1 | 0 | 3 | 3 | 2 | 0 | 10 |
- N. Absi, S. Dauzère‑Pérès, S. Kedad‑Sidhoum, B. Penz, Ch. Rapine : “Lot sizing with carbon emission constraints”, European Journal of Operational Research, vol. 227 (1), pp. 55-61, (Elsevier) [Absi 2013b]
- S. Angelopoulos, P. Schweitzer : “Paging and list update under bijective analysis”, Journal of the ACM (JACM), vol. 60 (2), pp. 7, (Association for Computing Machinery) [Angelopoulos 2013]
- M. Ayala, A. Benabid, Ch. Artigues, C. Hanen : “The resource-constrained modulo scheduling problem: an experimental study”, Computational Optimization and Applications, vol. 54 (3), pp. 645-673, (Springer Verlag) [Ayala 2013]
- E. Bampis, D. Letsios, G. Lucarelli, E. Markakis, I. Milis : “On multiprocessor temperature-aware scheduling problems”, Journal of Scheduling, vol. 16 (5), pp. 529-538, (Springer Verlag) [Bampis 2013c]
- N. Barcelo, Daniel G. Cole, D. Letsios, M. Nugent, Kirk R. Pruhs : “Optimal energy trade-off schedules”, Sustainable Computing : Informatics and Systems, vol. 3 (3), pp. 207-217, (Elsevier) [Barcelo 2013]
- C. Bazgan, L. Gourvès, J. Monnot, F. Pascual : “Single approximation for Biobjective Max TSP”, Theoretical Computer Science, vol. 478, pp. 41-50, (Elsevier) [Bazgan 2013]
- M. Bienkowski, M. Chrobak, Ch. Dürr, M. Hurand, A. Jeż, Ł. Jeż, G. Stachowiak : “A $\Phi$-Competitive Algorithm for Collecting Items with Increasing Weights from a Dynamic Queue”, Theoretical Computer Science, vol. 475, pp. 92-102, (Elsevier) [Bienkowski 2013a]
- M. Bienkowski, M. Chrobak, Ch. Dürr, M. Hurand, A. Jeż, Ł. Jeż, G. Stachowiak : “Collecting Weighted Items from a Dynamic Queue”, Algorithmica, vol. 65 (1), pp. 60-94, (Springer Verlag) [Bienkowski 2013b]
- S. Deleplanque, S. Kedad‑Sidhoum, A. Quilliot : “Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities”, RAIRO - Operations Research, vol. 47 (04), pp. 429-443, (EDP Sciences) [Deleplanque 2013]
- A. Quilliot, Ph. Chrétienne : “Homogeneously non-idling schedules of unit-time jobs on identical parallel machines”, Discrete Applied Mathematics, vol. 161, pp. 1586–1597, (Elsevier) [Quilliot 2013a]
- Y. Seddik, Ch. Gonzales, S. Kedad‑Sidhoum : “Single machine scheduling with delivery dates and cumulative payoffs”, Journal of Scheduling, vol. 16 (3), pp. 313-329, (Springer Verlag) [Seddik 2013c]
- O. Vasquez Perez, J. M. Sepúlveda, Miguel D. Alfaro, L. Osorio‑Valenzuela : “Disaster Response Project Scheduling Problem: A Resolution Method based on a Game-Theoretical Model”, International Journal of Computers, Communications and Control, vol. 8 (2), pp. 334-345, (Agora University of Oradea) [Vasquez Perez 2013]
- C. Winzen : “Direction-reversing quasi-random rumor spreading with restarts”, Information Processing Letters, vol. 113, pp. 921-926, (Elsevier) [Winzen 2013]