Current teams :	ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MLIA MOCAH MoVe NPA PEQUAN Phare PolSys QI RO SMA SYEL Whisper
Former teams :	AnimatLab MALIRE REGAL SALSA SPI SPIRAL
Former research topics :	ANP APA ASIM CALFOR OASIS RP SPI SRC SYSDEF

Publications RO	2014	2015	2016	2017	2018	2019	Total
Books	0	0	1	0	0	1	2
Edited books	2	2	0	0	0	0	4
Journal articles	17	16	16	13	13	17	92
Book chapters	4	0	1	0	3	0	8
Conference papers	20	17	25	18	30	34	144
Habilitations	0	0	0	0	1	0	1
Theses	3	0	0	1	1	0	5

LIP6

• 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, (ISBN: 0377-2217) [Absi 2013b]
• S. Angelopoulos, P. Schweitzer : “Paging and list update under bijective analysis”, Journal of the ACM (JACM), vol. 60 (2), pp. 7, (ISBN: 0004-5411) [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 [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 [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 [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, (ISBN: 0304-3975) [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, (ISBN: 0304-3975) [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, (ISBN: 0178-4617) [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, (ISBN: 0399-0559) [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, (ISBN: 1094-6136) [Seddik 2013c]
• Ó. Vásquez Pérez, 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, (ISBN: 1841-9836) [Vásquez Pérez 2013]
• C. Winzen : “Direction-reversing quasi-random rumor spreading with restarts”, Information Processing Letters, vol. 113, pp. 921-926, (Elsevier) [Winzen 2013]