RO - Conférences

Équipes actuelles :

ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL

Publications RO	2023	2024	Total
Livres	0	0	0
Éditions de livres	0	0	0
Articles de revues	14	16	30
Chapitres de livres	0	0	0
Conférences	34	14	48
Habilitations	0	0	0
Soutenances de thèse	2	3	5

LIP6

S. Angelopoulos : “Online Search With a Hint”, 12^th Innovations in Theoretical Computer Science Conference (ITCS 2021), vol. 185, Leibniz International Proceedings in Informatics (LIPIcs), Online Event, United States, pp. 51:1-51:16, (Schloss Dagstuhl--Leibniz-Zentrum für Informatik) [Angelopoulos 2021b]
S. Angelopoulos, M. Voss : “Online Search with Maximum Clearance”, 35^th AAAI Conference on Artificial Intelligence (AAAI), vol. 35 (5), Online Conference, United States, pp. 3642-3650, (AAAI Press) [Angelopoulos 2021d]
S. Angelopoulos, Sh. Kamali : “Contract Scheduling With Predictions”, Proceedings of the 35^th AAAI Conference on Artificial Intelligence (AAAI), vol. 35 (13), Proceedings of the AAAI Conference on Artificial Intelligence, Online Conference, United States, pp. 11726-11733, (AAAI Press) [Angelopoulos 2021f]
K. Antonov, M. Buzdalov, A. Buzdalova, C. Doerr : “Blending Dynamic Programming with Monte Carlo Simulation for Bounding the Running Time of Evolutionary Algorithms”, IEEE Congress on Evolutionary Computation (CEC'21), Krakow, Poland [Antonov 2021]
A. Aziz‑Alaoui, C. Doerr, J. Dréo : “Towards Large Scale Automated Algorithm Design by Integrating Modular Benchmarking Frameworks”, Proc. of Genetic and Evolutionary Computation Conference (GECCO 2021, Companion Material, Workshop paper), Lille, France [Aziz-Alaoui 2021]
E. Bampis, Ch. Dürr, Th. Erlebach, M. Santos De Lima, N. Megow, J. Schlöter : “Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty”, 29^th Annual European Symposium on Algorithms (ESA 2021), vol. 204, Leibniz International Proceedings in Informatics (LIPIcs), Lisboa, Portugal, pp. 10:1-10:18, (Schloss Dagstuhl -- Leibniz-Zentrum für Informatik) [Bampis 2021b]
E. Bampis, K. Dogeas, A. Kononov, G. Lucarelli, F. Pascual : “Speed Scaling with Explorable Uncertainty”, SPAA '21: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, virtual conference, United States, pp. 83-93, (ACM) [Bampis 2021c]
Th. Bläsius, T. Friedrich, M. Krejca, L. Molitor : “The Impact of Geometry on Monochrome Regions in the Flip Schelling Process”, The 32^nd International Symposium on Algorithms and Computation (ISAAC 2021), Fukuoka, Japan, pp. 29:1-29:17 [Bläsius 2021]
M. Böther, L. Schiller, Ph. Fischbeck, L. Molitor, M. Krejca, T. Friedrich : “Evolutionary Minimization of Traffic Congestion”, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), Lille (en ligne), France, pp. 937-945, (Association for Computing Machinery) [Böther 2021]
M. Buzdalov, C. Doerr : “Optimal Static Mutation Strength Distributions for the (1 + λ) Evolutionary Algorithm on OneMax”, Proc. of Genetic and Evolutionary Computation Conference (GECCO 2021), Lille, France, pp. 660-668, (Association for Computing Machinery) [Buzdalov 2021]
V. Cohen‑Addad, B. Guedj, V. Kanade, G. Rom : “Online $k$-means Clustering”, AISTATS 2021 - The 24^th International Conference on Artificial Intelligence and Statistics, Virtual, France [Cohen-Addad 2021b]
V. Cohen‑Addad, D. Saulpic, Ch. Schwiegelshohn : “A new coreset framework for clustering”, STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, Rome ( Virtual ), Italy, pp. 169-182, (ACM) [Cohen-Addad 2021c]
V. Cohen‑Addad, D. Saulpic, Ch. Schwiegelshohn : “Improved Coresets and Sublinear Algorithms for Power Means in Euclidean Spaces”, Advances in Neural Information Processing Systems, vol. 34, Virtual, France, pp. 21085-21098, (Curran Associates, Inc.), (ISBN: 9781713845393) [Cohen-Addad 2021d]
J. De Nobel, D. Vermetten, H. Wang, C. Doerr, Th. Bäck : “Tuning as a Means of Assessing the Benefits of New Ideas in Interplay with Existing Algorithmic Modules”, Genetic and Evolutionary Computation Conference (GECCO 2021, Companion Material, Workshop), Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2021, Companion Material, Workshop Paper), Lille (en ligne), France [De Nobel 2021]
M. Durand, F. Pascual : “Efficiency and Equity in the Multiple Organization Scheduling Problem”, International Workshop on Project Management and Scheduling, Toulouse, France [Durand 2021b]
Ch. Dürr, K. Nguyen, A. Srivastav, L. Tible : “Non-monotone DR-submodular Maximization over General Convex Sets”, Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}, Yokohama, Japan, pp. 2148-2154, (International Joint Conferences on Artificial Intelligence Organization) [Dürr 2021b]
T. Eftimov, A. Janković, G. Popovski, C. Doerr, P. Korosec : “Personalizing Performance Regression Models to Black-Box Optimization Problems”, Genetic and Evolutionary Computation Conference (GECCO 2021), Proc. of Genetic and Evolutionary Computation Conference (GECCO 2021), Lille, France [Eftimov 2021]
M. El Yafrani, M. Scoczynski, I. Sung, M. Wagner, C. Doerr, P. Nielsen : “MATE: A Model-based Algorithm Tuning Engine - A proof of concept towards transparent feature-dependent parameter tuning using symbolic regression”, Evolutionary Computation in Combinatorial Optimization 21^st European Conference, EvoCOP 2021, Held as Part of EvoStar 2021, Virtual Event, April 7–9, 2021, Proceedings, vol. 12692, Lecture Notes in Computer Science, Sevilla (on line), Spain, pp. 51-67, (Springer) [El Yafrani 2021]
B. Escoffier, O. Spanjaard, M. Tydrichová : “Measuring Nearly Single-Peakedness of an Electorate: Some New Insights”, Algorithmic Decision Theory 7^th International Conference, ADT 2021, Toulouse, France, November 3–5, 2021, Proceedings, vol. 13023, Lecture Notes in Computer Science, Toulouse, France, pp. 19-34, (Springer) [Escoffier 2021]
T. Friedrich, A. Göbel, M. Krejca, M. Pappik : “A spectral independence view on hard spheres via block dynamics”, Proceedings of the International Colloquium on Automata, Languages and Programming 2021, vol. 198, Glasgow, United Kingdom, pp. 66:1-66:15 [Friedrich 2021]
C. Hanen : “Scheduling tasks with precedence constraint, release times and due dates on parallel processors: Bounds and approximations”, ROADEF 2021, Mulhouse (FR), France [Hanen 2021a]
C. Hanen, A. Munier Kordon, Th. Pedersen : “Two Deadline Reduction Algorithms for Scheduling Dependent Tasks on Parallel Processors”, Integration of Constraint Programming, Artificial Intelligence, and Operations Research, vol. 12735, Lecture Notes in Computer Science, Vienne, Austria, pp. 214-230, (Springer International Publishing) [Hanen 2021c]
A. Janković, G. Popovski, T. Eftimov, C. Doerr : “The Impact of Hyper-Parameter Tuning for Landscape-Aware Performance Regression and Algorithm Selection”, Genetic and Evolutionary Computation Conference (GECCO 2021), Lille, France, pp. 687-696, (Association for Computing Machinery) [Janković 2021a]
A. Janković, T. Eftimov, C. Doerr : “Towards Feature-Based Performance Regression Using Trajectory Data”, Applications of Evolutionary Computation 24^th International Conference, EvoApplications 2021, Held as Part of EvoStar 2021, Virtual Event, April 7–9, 2021, Proceedings, vol. 12694, Lecture Notes in Computer Science, Sevilla (on line), Spain, pp. 601-617, (Springer) [Janković 2021b]
A. Kostovska, D. Vermetten, C. Doerr, S. Dzeroski, P. Panov, T. Eftimov : “OPTION: OPTImization Algorithm Benchmarking ONtology”, Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2021, Companion Material), Lille (on line), France [Kostovska 2021]
F. Quezada, C. Gicquel, S. Kedad‑Sidhoum : “A partial nested decomposition approach for remanufacturing planning under uncertainty”, IFIP Advances in Information and Communication Technology, vol. AICT-631 (Part II), Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, Nantes, France, pp. 663-672, (Springer International Publishing), (ISBN: 978-3-030-85901-5) [Quezada 2021a]
F. Quezada, C. Gicquel, S. Kedad‑Sidhoum : “New valid inequalities for a multi-echelon multi-item lot-sizing problem with returns and lost sales”, ICCL 2021: International Conference on Computational Logistics, vol. 13004, Lecture Notes in Computer Science, Enschede (online), Netherlands, pp. 192-207, (Springer) [Quezada 2021b]
F. Quezada, C. Gicquel, S. Kedad‑Sidhoum : “New valid inequalities for a multi-item multi-echelon lot-sizing problem with returns and lost sales”, IWLS 2021 - International Workshop on Lot-Sizing, online streaming, France [Quezada 2021c]
F. Quezada, E. Hyon : “A practical assessment of MDP and Stochastic Programming approach on the Stochastic Uncapacitated Lot-Sizing problem”, ROADEF2021, 22ème congrès annuel de la société Française de Recherche Opérationnelle et d’Aide à la Décision, Mulhouse (en ligne), France [Quezada 2021d]
Q. Renau, J. Dréo, C. Doerr, B. Doerr : “Towards Explainable Exploratory Landscape Analysis: Extreme Feature Selection for Classifying BBOB Functions”, Applications of Evolutionary Computation 24^th International Conference, EvoApplications 2021, Held as Part of EvoStar 2021, Virtual Event, April 7–9, 2021, Proceedings, vol. 12694, Lecture Notes in Computer Science, Sevilla (Virtual), Spain, pp. 17-33 [Renau 2021]
Th. Tournaire, J. Barthélemy, H. Castel‑Taleb, E. Hyon : “Reinforcement learning with model-based approaches for dynamic resource allocation in a tandem queue”, ASMTA 2021: Performance Engineering and Stochastic Modeling 17^th European Workshop, EPEW 2021, and 26^th International Conference, ASMTA 2021, vol. 13104, Lecture Notes in Computer Science, Tsukuba, Japan, pp. 243-263, (Springer Cham), (ISBN: 978-3-030-91824-8) [Tournaire 2021]
F. Ye, C. Doerr, Th. Bäck : “Leveraging Benchmarking Data for Informed One-Shot Dynamic Algorithm Selection”, Proc. of Genetic and Evolutionary Computation Conference (GECCO 2021, Companion Material), Lille, France [Ye 2021]