| Current teams : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Publications RO | 2023 | 2024 | 2025 | Total |
|---|---|---|---|---|
| Books | 0 | 0 | 0 | 0 |
| Edited books | 0 | 0 | 0 | 0 |
| Journal articles | 14 | 16 | 0 | 30 |
| Book chapters | 0 | 0 | 0 | 0 |
| Conference papers | 34 | 14 | 0 | 48 |
| Habilitations | 0 | 0 | 0 | 0 |
| Thesis | 2 | 3 | 0 | 5 |
- P. Afshani, M. Agrawal, B. Doerr, C. Doerr, K. Larsen, K. Mehlhorn : “The query complexity of a permutation-based variant of Mastermind”, Discrete Applied Mathematics, (Elsevier) [Afshani 2019]
- S. Angelopoulos : “Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems”, Theory of Computing Systems, vol. 63 (6), pp. 1413-1447, (Springer Verlag) [Angelopoulos 2019a]
- S. Angelopoulos, Ch. Dürr, Th. Lidbetter : “The expanding search ratio of a graph”, Discrete Applied Mathematics, vol. 260, pp. 51-65, (Elsevier) [Angelopoulos 2019c]
- S. Angelopoulos, G. Lucarelli, K. Nguyen : “Primal–Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems”, Algorithmica, vol. 81 (9), pp. 3391-3421, (Springer Verlag) [Angelopoulos 2019d]
- S. Angelopoulos, N. Nisse, Dimitrios M. Thilikos : “Preface to special issue on Theory and Applications of Graph Searching”, Theoretical Computer Science, vol. 794, pp. 1-2, (Elsevier) [Angelopoulos 2019e]
- S. Angelopoulos, R. Dorrigiv, A. López‑Ortiz : “On the Separation and Equivalence of Paging Strategies and Other Online Algorithms”, Algorithmica, vol. 81 (3), pp. 1152-1179, (Springer Verlag) [Angelopoulos 2019f]
- P. Bendotti, P. Fouilhoux, C. Rottner : “On the complexity of the Unit Commitment Problem”, Annals of Operations Research, vol. 274 (1-2), pp. 119-130, (Springer Verlag) [Bendotti 2019b]
- P. Bendotti, Ph. Chrétienne, P. Fouilhoux, A. Pass‑Lanneau : “The Anchor-Robust Project Scheduling Problem”, Operations Research, (INFORMS) [Bendotti 2019e]
- K. Bülbül, S. Kedad‑Sidhoum, H. Şen : “Single-machine common due date total earliness/tardiness scheduling with machine unavailability”, Journal of Scheduling, vol. 22 (5), pp. 543-565, (Springer Verlag) [Bülbül 2019]
- V. Cohen‑Addad, Ph. Klein, C. Mathieu : “Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics”, SIAM Journal on Computing, vol. 48 (2), pp. 644-667, (Society for Industrial and Applied Mathematics) [Cohen-Addad 2019j]
- V. Cohen‑Addad, V. Kanade, F. Mallmann‑Trenn, C. Mathieu : “Hierarchical Clustering”, Journal of the ACM (JACM), vol. 66 (4), pp. 1-42, (Association for Computing Machinery) [Cohen-Addad 2019k]
- C. Doerr, D. Sudholt : “Preface to the Special Issue on Theory of Genetic and Evolutionary Computation”, Algorithmica, vol. 81 (2), pp. 589-592, (Springer Verlag) [Doerr 2019c]
- B. Doerr, C. Doerr, T. Kötzing : “Solving Problems with Unknown Solution Length at Almost No Extra Cost”, Algorithmica, vol. 81, pp. 703-748, (Springer Verlag) [Doerr 2019c]
- B. Escoffier : “Saving colors and Max Coloring: some fixed-parameter tractability results”, Theoretical Computer Science, vol. 758, pp. 30-41, (Elsevier) [Escoffier 2019a]
- V. Grollemund, P.‑F. Pradat, G. Querin, F. Delbot, G. Le Chat, J.‑F. Pradat‑Peyre, P. Bede : “Machine Learning in Amyotrophic Lateral Sclerosis: Achievements, Pitfalls, and Future Directions”, Frontiers in Neuroscience, vol. 13, pp. 135, (Frontiers) [Grollemund 2019]
- F. Pascual, K. Rzadca : “Optimizing egalitarian performance when colocating tasks with types for cloud data center resource management”, IEEE Transactions on Parallel and Distributed Systems, (Institute of Electrical and Electronics Engineers) [Pascual 2019]