| Équipes actuelles : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Ancienne équipe : | ACASA |
| Publications RO | 2023 | 2024 | Total |
|---|---|---|---|
| Livres | 0 | 0 | 0 |
| Éditions de livres | 0 | 0 | 0 |
| Articles de revues | 15 | 9 | 24 |
| Chapitres de livres | 0 | 0 | 0 |
| Conférences | 34 | 8 | 42 |
| Habilitations | 0 | 0 | 0 |
| Thèses | 2 | 0 | 2 |
- E. Angel, E. Bampis, Gerasimos G. Pollatos, V. Zissimopoulos : “Optimal data placement on networks with a constant number of clients”, Theoretical Computer Science, vol. 540-541, pp. 82-88, (Elsevier) [Angel 2014a]
- E. Angel, E. Bampis, V. Chau : “Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines”, Discrete Applied Mathematics, vol. 175, pp. 1-10, (Elsevier) [Angel 2014c]
- S. Angelopoulos, A. López‑Ortiz, K. Panagiotou : “Multi-target ray searching problems”, Theoretical Computer Science, vol. 540-541, pp. 2-12, (Elsevier) [Angelopoulos 2014]
- E. Bampis, A. Kononov, G. Lucarelli, I. Milis : “Bounded max-colorings of graphs”, Journal of Discrete Algorithms, vol. 26, pp. 56-68, (Elsevier) [Bampis 2014b]
- X. Chen, B. Doerr, C. Doerr, X. Hu, M. Weidong, R. Van Stee : “The Price of Anarchy for Selfish Ring Routing is Two”, ACM Transactions on Economics and Computation, vol. 2, pp. 8, (Association for Computing Machinery (ACM)) [Chen 2014]
- Ph. Chrétienne : “A polynomial algorithm for the two-connections variant of the tree pp-median problem”, Discrete Optimization, vol. 14, pp. 1-16, (Elsevier) [Chrétienne 2014a]
- Ph. Chrétienne : “On scheduling with the non-idling constraint”, Annals of Operations Research, pp. 1-19, (Springer Verlag) [Chrétienne 2014b]
- Ph. Chrétienne, P. Fouilhoux, E. GOURDIN, J. Segura : “The Location-Dispatching Problem: polyhedral results and Content Delivery Network Design”, Discrete Applied Mathematics, vol. 164 (1), pp. 68-85, (Elsevier) [Chrétienne 2014c]
- C. Doerr, Jens M. Schmidt, G. Ramakrishna : “Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time”, Journal of Graph Algorithms and Applications, vol. 18, pp. 325-346, (Brown University) [Doerr 2014a]
- B. Doerr, C. Doerr : “Playing Mastermind with Constant-Size Memory”, Theory of Computing Systems, vol. 55, pp. 658-684, (Springer Verlag) [Doerr 2014b]
- B. Doerr, C. Doerr : “Ranking-Based Black-Box Complexity”, Algorithmica, vol. 68, pp. 571-609, (Springer Verlag) [Doerr 2014c]
- B. Doerr, C. Doerr : “Reducing the arity in unbiased black-box complexity”, Theoretical Computer Science, vol. 545, pp. 108-121, (Elsevier) [Doerr 2014d]
- B. Doerr, C. Doerr, T. Kötzing : “The unbiased black-box complexity of partition is polynomial”, Artificial Intelligence, vol. 216, pp. 12, (Elsevier) [Doerr 2014g]
- B. Escoffier, V. Paschos, E. Tourniaire : “Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms”, Theoretical Computer Science, vol. 560 (2), pp. 147-157, (Elsevier) [Escoffier 2014]
- P. Fouilhoux, A. Questel : “A Branch-and-Cut for the non-disjoint m-Ring-Star problem”, RAIRO - Operations Research, vol. 48 (2), pp. 167-188, (EDP Sciences) [Fouilhoux 2014a]
- O. Hazir, S. Kedad‑Sidhoum : “Batch Sizing and Just-In-Time Scheduling with Common Due Date”, Annals of Operations Research, vol. 213 (1), pp. 187-202, (Springer Verlag) [Hazir 2014]
- A. López‑Ortiz, S. Angelopoulos, A. Hamel : “Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving”, Journal of Artificial Intelligence Research, vol. 51, pp. 533-554, (Association for the Advancement of Artificial Intelligence) [López-Ortiz 2014]