| Équipes actuelles : | ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Ancienne équipe : | Phare |
| Publications RO | 2017 | 2018 | 2019 | 2020 | 2021 | 2022 | 2023 | Total |
|---|---|---|---|---|---|---|---|---|
| Livres | 0 | 1 | 2 | 0 | 1 | 0 | 0 | 4 |
| Éditions de livres | 0 | 0 | 0 | 3 | 1 | 0 | 0 | 4 |
| Articles de revues | 14 | 15 | 16 | 16 | 19 | 17 | 3 | 100 |
| Chapitres de livres | 0 | 1 | 3 | 0 | 0 | 0 | 0 | 4 |
| Conférences | 18 | 33 | 48 | 31 | 31 | 38 | 5 | 204 |
| Habilitations | 0 | 1 | 1 | 2 | 0 | 0 | 0 | 4 |
| Thèses | 1 | 1 | 0 | 3 | 3 | 2 | 0 | 10 |
- S. Albers, E. Bampis, D. Letsios, G. Lucarelli, R. Stotz : “Scheduling on power-heterogeneous processors”, Information and Computation, vol. 257, pp. 22-33, (Elsevier) [Albers 2017]
- S. Angelopoulos, D. Arsenio, Ch. Dürr : “Infinite linear programming and online searching with turn cost”, Theoretical Computer Science, (Elsevier) [Angelopoulos 2017a]
- N. Bansal, Ch. Dürr, N. Thang, O. Vasquez Perez : “The local–global conjecture for scheduling with non-linear cost”, Journal of Scheduling, vol. 20 (3), pp. 239-254, (Springer Verlag) [Bansal 2017]
- P. Bendotti, Ph. Chrétienne, P. Fouilhoux, A. Quilliot : “Anchored reactive and proactive solutions to the CPM-scheduling problem”, European Journal of Operational Research, vol. 261 (1), pp. 67–74, (Elsevier) [Bendotti 2017c]
- R. Bleuse, S. Hunold, S. Kedad‑Sidhoum, F. Monna, G. Mounié, D. Trystram : “Scheduling Independent Moldable Tasks on Multi-Cores with GPUs”, IEEE Transactions on Parallel and Distributed Systems, pp. 14, (Institute of Electrical and Electronics Engineers) [Bleuse 2017]
- A. Carlier, C. Hanen, A. Munier‑Kordon : “The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays”, Journal of Scheduling, pp. 1-9, (Springer Verlag) [Carlier 2017]
- C. Doerr, Ch. Igel, L. Thiele, X. Yao : “Theory of Randomized Optimization Heuristics (Dagstuhl Seminar 17191)”, Dagstuhl Reports, vol. 7 (5), pp. 22-55, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) [Doerr 2017b]
- C. Doerr, F. Chicano : “Preface to the Special Issue on Theory of Genetic and Evolutionary Computation”, Algorithmica, vol. 78 (2), pp. 558-560, (Springer Verlag) [Doerr 2017d]
- C. Doerr, J. Lengler : “Introducing Elitist Black-Box Models: When Does Elitist Behavior Weaken the Performance of Evolutionary Algorithms?”, Evolutionary Computation, vol. 25 (4), pp. 587-606, (Massachusetts Institute of Technology Press (MIT Press)) [Doerr 2017e]
- C. Doerr, J. Lengler : “OneMax in Black-Box Models with Several Restrictions”, Algorithmica, vol. 78, pp. 610-640, (Springer Verlag) [Doerr 2017f]
- Ch. Dürr, Z. Hanzalek, Ch. Konrad, Y. Seddik, R. Sitters, O. Vasquez Perez, Gerhard J. Woeginger : “The triangle scheduling problem”, Journal of Scheduling, (Springer Verlag) [Dürr 2017b]
- Ch. Dürr, Ł. Jeż, Ó. Vásquez : “Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling”, Theoretical Computer Science, vol. 695, pp. 28-41, (Elsevier) [Dürr 2017c]
- B. Escoffier, L. Gourvès, J. Monnot : “The Price of Optimum: Complexity and Approximation for a Matching Game”, Algorithmica, vol. 77 (3), pp. 836-866, (Springer Verlag) [Escoffier 2017]
- L. Gourvès, J. Monnot, F. Pascual, D. Vanderpooten : “Bi-objective matchings with the triangle inequality”, Theoretical Computer Science, vol. 670, pp. 1-10, (Elsevier) [Gourvès 2017]