| 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. Aboulker, Th. Bellitto, F. Havet, C. Rambaud : “On the minimum number of arcs in $k$-dicritical oriented graphs”, SIAM Journal on Discrete Mathematics, vol. 38 (2), pp. 1863-1901, (Society for Industrial and Applied Mathematics) [Aboulker 2024]
- S. Angelopoulos, Ch. Dürr, Sh. Jin, Sh. Kamali, M. Renault : “Online Computation with Untrusted Advice”, Journal of Computer and System Sciences, vol. 144, pp. 103545, (Elsevier) [Angelopoulos 2024c]
- Th. Bellitto, N. Bousquet, A. Kabela, Th. Pierron : “The smallest 5-chromatic tournament”, Mathematics of Computation, vol. 93 (345), pp. 443-458, (American Mathematical Society) [Bellitto 2024b]
- V. Bouquet, F. Delbot, Ch. Picouleau, S. Rovedakis : “On the complexity of Dominating Set for graphs with fixed diameter”, Theoretical Computer Science, pp. 114561, (Elsevier) [Bouquet 2024]
- J. Carlier, C. Hanen : “Measuring the slack between lower bounds for scheduling on parallel machines”, Annals of Operations Research, vol. 338, pp. 347–377, (Springer Verlag) [Carlier 2024]
- F. Clément, C. Doerr, L. Paquete : “Heuristic approaches to obtain low-discrepancy point sets via subset selection”, Journal of Complexity, vol. 83, pp. 101852, (Elsevier) [Clément 2024]
- V. Cohen‑Addad, S. Gavva, C. Karthik, C. Mathieu, N. Namrata : “Fairness of linear regression in decision making”, International Journal of Data Science and Analytics, vol. 18 (3), pp. 337-347, (Springer Verlag) [Cohen-Addad 2024]
- J. De Nobel, F. Ye, D. Vermetten, H. Wang, C. Doerr, Th. Bäck : “IOHexperimenter: Benchmarking Platform for Iterative Optimization Heuristics”, Evolutionary Computation, pp. 1-6, (Massachusetts Institute of Technology Press (MIT Press)) [De Nobel 2024]
- C. Doerr, D. Janett, J. Lengler : “Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions”, Algorithmica, vol. 86 (10), pp. 3115-3152, (Springer Verlag) [Doerr 2024]
- B. Escoffier, O. Spanjaard, M. Tydrichová : “Euclidean preferences in the plane under $\ell_1$, $\ell_2$ and $\ell_\infty$ norms”, Social Choice and Welfare, (Springer Verlag) [Escoffier 2024a]
- B. Escoffier, O. Spanjaard, M. Tydrichová : “Recognizing single-peaked preferences on an arbitrary graph: Complexity and algorithms”, Discrete Applied Mathematics, vol. 348, pp. 301-319, (Elsevier) [Escoffier 2024b]
- A. Kostovska, D. Vermetten, P. Korosec, S. Dzeroski, C. Doerr, T. Eftimov : “Using Machine Learning Methods to Assess Module Performance Contribution in Modular Optimization Frameworks”, Evolutionary Computation, pp. 1-28, (Massachusetts Institute of Technology Press (MIT Press)) [Kostovska 2024]
- M. López‑Ibañez, D. Vermetten, J. Dréo, C. Doerr : “Using the Empirical Attainment Function for Analyzing Single-objective Black-box Optimization Algorithms”, IEEE Transactions on Evolutionary Computation, (Institute of Electrical and Electronics Engineers) [López-Ibañez 2024]
- A. Pass‑Lanneau, P. Bendotti, L. Brunod‑Indrigo : “Exact and heuristic methods for Anchor-Robust and Adjustable-Robust RCPSP”, Annals of Operations Research, vol. 337 (2), pp. 649-682, (Springer Verlag) [Pass-Lanneau 2024]
- M. Santoni, E. Raponi, R. De Leone, C. Doerr : “Comparison of High-Dimensional Bayesian Optimization Algorithms on BBOB”, ACM Transactions on Evolutionary Learning and Optimization, vol. 4 (3), (ACM) [Santoni 2024]
- D. Vermetten, F. Ye, Th. Bäck, C. Doerr : “MA-BBOB: A Problem Generator for Black-Box Optimization Using Affine Combinations and Shifts”, ACM Transactions on Evolutionary Learning and Optimization, (ACM) [Vermetten 2024b]