| Current teams : | ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN Phare PolSys QI RO SMA SYEL |
| Former team : | MLIA |
| Publications RO | 2017 | 2018 | 2019 | 2020 | 2021 | 2022 | Total |
|---|---|---|---|---|---|---|---|
| Books | 0 | 1 | 2 | 1 | 0 | 0 | 4 |
| Edited books | 0 | 0 | 0 | 3 | 1 | 0 | 4 |
| Journal articles | 14 | 15 | 15 | 17 | 17 | 6 | 84 |
| Book chapters | 0 | 1 | 3 | 0 | 0 | 0 | 4 |
| Conference papers | 18 | 33 | 48 | 31 | 28 | 8 | 166 |
| Habilitations | 0 | 1 | 1 | 2 | 0 | 0 | 4 |
| Theses | 1 | 1 | 0 | 3 | 3 | 1 | 9 |
- S. Angelopoulos, D. Arsenio, Sh. Kamali : “Competitive Sequencing with Noisy Advice”, [Angelopoulos 2021c]
- S. Angelopoulos, Sh. Kamali, K. Shadkami : “Online Bin Packing with Predictions”, [Angelopoulos 2021g]
- P. Bendotti, Ph. Chrétienne, P. Fouilhoux, A. Pass‑Lanneau : “Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem”, [Bendotti 2021]
- A.‑E. Falq, P. Fouilhoux, S. Kedad‑Sidhoum : “Dominance inequalities for scheduling around an unrestrictive common due date”, [Falq 2021a]
- C. Hanen, A. Munier Kordon, Th. Pedersen : “Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors (extended version)”, [Hanen 2021b]