| Current teams : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Former team : | ACASA |
| Publications RO | 2023 | 2024 | Total |
|---|---|---|---|
| Books | 0 | 0 | 0 |
| Edited books | 0 | 0 | 0 |
| Journal articles | 15 | 9 | 24 |
| Book chapters | 0 | 0 | 0 |
| Conference papers | 34 | 8 | 42 |
| Habilitations | 0 | 0 | 0 |
| Thesis | 2 | 1 | 3 |
- E. Angel, E. Bampis, N. Thibault : “Randomized truthful algorithms for scheduling selfish tasks on parallel machines”, Theoretical Computer Science, vol. 414 (1), pp. 1-8, (Elsevier) [Angel 2012d]
- G. Ausiello, N. Boria, A. Giannakos, G. Lucarelli, Vangelis Th. Paschos : “Online maximum k-coverage”, Discrete Applied Mathematics, vol. 160 (13-14), pp. 1901-1913, (Elsevier) [Ausiello 2012]
- E. Bampis, Ch. Dürr, F. Kacem, Ioannis Z. Milis : “Speed scaling with power down scheduling for agreeable deadlines”, Sustainable Computing : Informatics and Systems, vol. 2 (4), pp. 184-189, (Elsevier) [Bampis 2012a]
- Ph. Baptiste, M. Chrobak, Ch. Dürr : “Polynomial Time Algorithms for Minimum Energy Scheduling”, ACM Transactions on Algorithms, vol. 8 (3), pp. 26, (Association for Computing Machinery) [Baptiste 2012]
- A. Benabid, C. Hanen, O. Marchetti, A. Munier‑Kordon : “Periodic schedules for bounded timed weighted event graphs”, IEEE Transactions on Automatic Control, vol. 57 (5), pp. 1222-1232, (Institute of Electrical and Electronics Engineers) [Benabid 2012]
- N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, Vangelis Th. Paschos, O. Pottié : “The max quasi-independent set problem”, Journal of Combinatorial Optimization, vol. 23, pp. 94-117, (Springer Verlag) [Bourgeois 2012b]
- M. Chrobak, Ch. Dürr, F. Guíñez, A. Lozano, N. Thang : “Tile Packing Tomography is {NP}-hard”, Algorithmica, vol. 64 (2), pp. 267-278, (Springer Verlag) [Chrobak 2012]
- Ch. Dürr, F. Guíñez, M. Matamala : “Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography”, SIAM Journal on Discrete Mathematics, vol. 26 (1), pp. 330-352, (Society for Industrial and Applied Mathematics) [Dürr 2012a]
- Ch. Dürr, M. Queyranne, Frits C. R. Spieksma, F. Nobibon, Gerhard J. Woeginger : “The interval ordering problem”, Discrete Applied Mathematics, vol. 160 (7-8), pp. 1094-1103, (Elsevier) [Dürr 2012c]
- Ch. Dürr, Ł. Jeż, N. Thang : “Online Scheduling of Bounded Length Jobs to Maximize Throughput”, Journal of Scheduling, vol. 15 (5), pp. 653-664, (Springer Verlag) [Dürr 2012e]
- P. Fouilhoux, A. Ridha Mahjoub : “Solving VLSI Design and DNA Sequencing Problems using Bipartization of Graphs”, Computational Optimization and Applications, vol. 51 (2), pp. 749-781, (Springer Verlag) [Fouilhoux 2012d]
- P. Fouilhoux, O. Karasan, A. Ridha Mahjoub, O. Ozkok, H. Yaman : “Survivability in Hierarchical Telecommunications Networks”, Networks, vol. 59 (1), pp. 37-58, (Wiley) [Fouilhoux 2012e]
- L. Gourvès, J. Monnot, F. Pascual : “Cooperation in Multiorganization Matching”, Algorithmic Operations Research, vol. 7 (2), pp. 111-124, (Preeminent Academic Facets) [Gourvès 2012]
- E. Hyon, A. Jean‑Marie : “Scheduling Services in a Queuing System with Impatience and Setup Costs”, The Computer Journal, vol. 55 (5), Special Focus on Probability Models in Performance Analysis, pp. 553-563, (Oxford University Press (UK)) [Hyon 2012]