| 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 |
- E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, I. Nemparis : “From preemptive to non-preemptive speed-scaling scheduling”, Discrete Applied Mathematics, vol. 181, pp. 11-20, (Elsevier) [Bampis 2015b]
- E. Bampis, D. Letsios, G. Lucarelli : “Green scheduling, flows and matchings”, Theoretical Computer Science, vol. 579, pp. 126–136, (Elsevier) [Bampis 2015c]
- O. Bellenguez‑Morineau, M. Chrobak, Ch. Dürr, D. Prot : “A Note on NP-Hardness of Preemptive Mean Flow-Time Scheduling for Parallel Machines”, Journal of Scheduling, vol. 18 (3), pp. 299-304, (Springer Verlag) [Bellenguez-Morineau 2015]
- R. Bleuse, S. Kedad‑Sidhoum, F. Monna, G. Mounié, D. Trystram : “Scheduling independent tasks on multi-cores with GPU accelerators”, Concurrency and Computation: Practice and Experience, vol. 27 (6), pp. 1625-1638, (Wiley) [Bleuse 2015]
- A. Blogowski, Ph. Chrétienne, F. Pascual : “Network sharing by two mobile operators: beyond competition, cooperation”, RAIRO - Operations Research, (EDP Sciences) [Blogowski 2015]
- É. Bonnet, B. Escoffier, E. Kim, V. Paschos : “On Subexponential and FPT-Time Inapproximability”, Algorithmica, vol. 71 (3), pp. 541-565, (Springer Verlag) [Bonnet 2015a]
- É. Bonnet, B. Escoffier, V. Paschos, E. Tourniaire : “Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization”, Algorithmica, vol. 71 (3), pp. 566-580, (Springer Verlag) [Bonnet 2015b]
- S. Borne, P. Fouilhoux, R. Grappe, M. Lacroix, P. Pesneau : “Circuit and bond polytopes on series–parallel graphs”, Discrete Optimization, vol. 17, pp. 55–68, (Elsevier) [Borne 2015]
- N. Brahimi, N. Absi, S. Dauzère‑Pérès, S. Kedad‑Sidhoum : “Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory”, OR Spectrum, vol. 37 (4), pp. 983-1006, (Springer Verlag) [Brahimi 2015]
- J. Błażewicz, S. Kedad‑Sidhoum, F. Monna, G. Mounié, D. Trystram : “A study of scheduling problems with preemptions on multi-core computers with GPU accelerators”, Discrete Applied Mathematics, vol. 196, pp. 72-82, (Elsevier) [Błażewicz 2015]
- B. Doerr, C. Doerr, F. Ebel : “From black-box complexity to designing new genetic algorithms”, Theoretical Computer Science, vol. 567, pp. 87-104, (Elsevier) [Doerr 2015c]
- B. Doerr, C. Doerr, T. Kötzing : “Unbiased Black-Box Complexities of Jump Functions (Journal version)”, Evolutionary Computation, vol. 23 (4), pp. 641-670, (Massachusetts Institute of Technology Press (MIT Press)) [Doerr 2015e]
- Ch. Dürr, Ł. Jeż, O. Vasquez Perez : “Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption”, Discrete Applied Mathematics, vol. 196, pp. 20-27, (Elsevier) [Dürr 2015]
- B. Escoffier, J. Monnot, Vangelis Th. Paschos, M. Xiao : “New results on polynomial inapproximability and fixed parameter approximability of edge dominating set”, Theory of Computing Systems, vol. 56 (2), pp. 330-346, (Springer Verlag) [Escoffier 2015]
- Z. Hanzalek, C. Hanen : “The impact of core precedences in a cyclic RCPSP with precedence delays”, Journal of Scheduling, vol. 18 (3), pp. 275-284, (Springer Verlag) [Hanzalek 2015]
- Y. Seddik, Ch. Gonzales, S. Kedad‑Sidhoum : “Performance guarantees for a scheduling problem with common stepwise job payoffs”, Theoretical Computer Science, vol. 562, pp. 377-394, (Elsevier) [Seddik 2015]