Équipes actuelles :	ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MLIA MOCAH MoVe NPA PEQUAN Phare PolSys QI RO SMA SYEL Whisper
Anciennes équipes :	AnimatLab MALIRE REGAL SALSA SPI SPIRAL
Anciens thèmes :	ANP APA ASIM CALFOR OASIS RP SPI SRC SYSDEF

Publications RO	2015	2016	2017	2018	2019	2020	Total
Livres	0	1	0	0	1	0	2
Éditions de livres	2	0	0	0	0	0	2
Articles de revues	16	16	13	13	17	0	75
Chapitres de livres	0	1	0	1	3	0	5
Conférences	17	25	18	30	38	0	128
Habilitations	0	0	0	1	0	0	1
Thèses	0	0	1	1	0	0	2

LIP6

• N. Absi, S. Dauzère‑Pérès, S. Kedad‑Sidhoum, B. Penz, Ch. Rapine : “The Single-Item Green Lot-Sizing Problem with Fixed Carbon Emissions”, European Journal of Operational Research, vol. 248 (3), pp. 849-855, (ISBN: 0377-2217) [Absi 2016]
• H. Murat Afsar, Ch. Artigues, E. Bourreau, S. Kedad‑Sidhoum : “Machine reassignment problem: the ROADEF/EURO challenge 2012”, Annals of Operations Research, vol. 242 (1), pp. 1-17, (Springer Verlag) [Afsar 2016]
• F. AIT SALAHT, H. Castel‑Taleb, J.‑M. Fourneau, N. Pekergin : “Performance analysis of a queue by combining stochastic bounds, real traffic traces and histograms”, The Computer Journal, vol.  59 (12), pp. 1817-1830, (Oxford University Press (UK)) [AIT SALAHT 2016d]
• E. Angel, E. Bampis, D. Paparas, E. Pountourakis, V. Zissimopoulos : “Clustering on kk-edge-colored graphs”, Discrete Applied Mathematics, vol. 211, pp. 15-22, (Elsevier) [Angel 2016b]
• E. Angel, E. Bampis, V. Chau, D. Letsios : “Throughput maximization for speed scaling with agreeable deadlines”, Journal of Scheduling, vol. 19 (6), pp. 619-625, (Springer Verlag) [Angel 2016d]
• E. Angel, E. Bampis, V. Chau, K. Nguyen : “Throughput maximization in multiprocessor speed-scaling”, Theoretical Computer Science, vol. 630, pp. 1-12, (Elsevier) [Angel 2016e]
• S. Angelopoulos, A. López‑Ortiz : “Optimal scheduling of contract algorithms with soft deadlines”, Journal of Scheduling, (Springer Verlag) [Angelopoulos 2016b]
• S. Angelopoulos, D. Arsenio, Ch. Dürr, A. López‑Ortiz : “Multi-processor Search and Scheduling Problems with Setup Cost”, Theory of Computing Systems, (Springer Verlag) [Angelopoulos 2016d]
• E. Bampis, D. Letsios, I. Milis, G. Zois : “Speed Scaling for Maximum Lateness”, Theory of Computing Systems, vol. 58 (2), pp. 304-321, (Springer Verlag) [Bampis 2016b]
• P. Bendotti, P. Fouilhoux : “Feasibility recovery for the Unit-capacity Constrained Permutation Problem”, Discrete Optimization, vol. Volume 22, Part A, pp. 66-86, (Elsevier) [Bendotti 2016]
• A. Clementi, P. Crescenzi, C. Doerr, P. Fraigniaud, F. Pasquale, R. Silvestri : “Rumor Spreading in Random Evolving Graphs.”, Random Structures and Algorithms, vol. 48 (2), pp. 290-312, (Wiley) [Clementi 2016]
• C. Doerr, B. Doerr : “The Impact of Random Initialization on the Runtime of Randomized Search Heuristics”, Algorithmica, vol. 75, pp. 529-553, (Springer Verlag) [Doerr 2016a]
• C. Doerr, J. Lengler : “Introducing Elitist Black-Box Models: When Does Elitist Behavior Weaken the Performance of Evolutionary Algorithms?”, Evolutionary Computation, (Massachusetts Institute of Technology Press (MIT Press)) [Doerr 2016c]
• B. Doerr, C. Doerr, R. Spoehel, H. Thomas : “Playing Mastermind with Many Colors”, Journal of the ACM (JACM), vol. 63, (ACM) [Doerr 2016d]
• B. Doerr, C. Doerr, Sh. Moran, Sh. Moran : “Simple and optimal randomized fault-tolerant rumor spreading”, Distributed Computing, vol. 29 (2), pp. 89-104, (Springer Verlag) [Doerr 2016e]
• B. Escoffier, Vangelis Th. Paschos, É. Tourniaire : “Super-polynomial approximation branching algorithms”, RAIRO - Operations Research, vol. 50 (4-5), pp. 979-994, (EDP Sciences) [Escoffier 2016b]