RO - Conference papers

Current teams :	ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL
Former team :	Phare

Publications RO	2017	2018	2019	2020	2021	2022	2023	Total
Books	0	1	2	0	1	0	0	4
Edited books	0	0	0	3	1	0	0	4
Journal articles	14	15	16	16	19	17	3	100
Book chapters	0	1	3	0	0	0	0	4
Conference papers	18	33	48	31	31	38	5	204
Habilitations	0	1	1	2	0	0	0	4
Theses	1	1	0	3	3	2	0	10

LIP6

A. Abboud, V. Cohen‑Addad, H. Houdrougé : “Subquadratic High-Dimensional Hierarchical Clustering”, NeurIPS'19 - 33rd Conference on Neural Information Processing Systems, Vancouver, Canada [Abboud 2019]
S. Angelopoulos, Ch. Dürr, Sh. Jin : “Best-Of-Two-Worlds Analysis of Online Search”, 36^th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), vol. 126, Leibniz International Proceedings in Informatics (LIPIcs), Berlin, Germany, pp. 7:1-7:17, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) [Angelopoulos 2019b]
S. Angelopoulos, Sh. Jin : “Earliest-Completion Scheduling of Contract Algorithms with End Guarantees”, Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}, Macao, Macao, pp. 5493-5499, (International Joint Conferences on Artificial Intelligence Organization) [Angelopoulos 2019g]
E. Bampis, B. Escoffier, A. Teiller : “Multistage Knapsack”, 44^th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), vol. 138, Aachen, Germany, pp. 22:1-22:14, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) [Bampis 2019a]
E. Bampis, B. Escoffier, K. Schewior, A. Teiller : “Online Multistage Subset Maximization Problems”, 27^th Annual European Symposium on Algorithms (ESA 2019), vol. 144, Leibniz International Proceedings in Informatics (LIPIcs), Munich, Germany, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) [Bampis 2019b]
L. Becchetti, M. Bury, V. Cohen‑Addad, F. Grandoni, Ch. Schwiegelshohn : “Oblivious dimension reduction for k -means: beyond subspaces and the Johnson-Lindenstrauss lemma”, STOC 2019 - 51^st Annual ACM SIGACT Symposium on Theory of Computing, Phoenix, United States, pp. 1039-1050, (ACM Press) [Becchetti 2019]
P. Bendotti, L. Brunod‑Indrigo, Ph. Chrétienne, P. Fouilhoux, A. Pass‑Lanneau : “Anchor-Robust Solutions for the Resource-Constrained Project Scheduling Problem”, PGMO Days 2019, Palaiseau, France [Bendotti 2019a]
P. Bendotti, P. Fouilhoux, C. Rottner : “Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry”, Lecture Notes in Computer Science, vol. 11480, Lecture Notes in Computer Science, Ann Arbor, Michigan, United States, pp. 57-71, (Springer) [Bendotti 2019c]
P. Bendotti, Ph. Chrétienne, P. Fouilhoux, A. Pass‑Lanneau : “Stabilisation de solutions en optimisation combinatoire par des modèles d'ancrage; application à l'arbre couvrant”, ROADEF - 20ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Le Havre, France [Bendotti 2019d]
P. Bendotti, Ph. Chrétienne, P. Fouilhoux, A. Pass‑Lanneau : “The Anchor-Robust Project Scheduling Problem”, 14^th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), Renesse, Netherlands [Bendotti 2019f]
V. Bouquet, K. Christophe, F. Delbot, G. Chat, J.‑F. Pradat‑Peyre : “Minimum Dominating Set and Maximum Independent Set for Evaluation of EU Funding Polices in Collaboration Networks”, Operations Research Proceedings 2018, Operations Research Proceedings, Brussels, Belgium, pp. 243-249, (Springer International Publishing) [Bouquet 2019]
N. Buskulic, C. Doerr : “Maximizing drift is not optimal for solving OneMax”, Genetic and Evolutionary Computation Conference, Companion Material, Prague, Czechia, pp. 425-426, (ACM Press) [Buskulic 2019]
B. Calvo, O. Shir, J. Ceberio, C. Doerr, H. Wang, Th. Bäck, J. Lozano : “Bayesian performance analysis for black-box optimization benchmarking”, GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Prague, Czechia, pp. 1789-1797, (ACM Press) [Calvo 2019]
V. Cohen‑Addad, A. Feldmann, D. Saulpic : “Near-linear time approximations schemes for clustering in doubling metrics”, FOCS'19, Baltimore, United States [Cohen-Addad 2019a]
V. Cohen‑Addad, A. Gupta, A. Kumar, E. Lee, J. Li : “Tight FPT Approximations for k-Median and k-Means”, 46^th International Colloquium on Automata, Languages, and Programming (ICALP 2019), vol. 132, Leibniz International Proceedings in Informatics, Patras, Greece, pp. 42:1-42:14, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) [Cohen-Addad 2019b]
V. Cohen‑Addad, É. Colin de Verdière, D. Marx, A. De Mesmay : “Almost tight lower bounds for hard cutting problems in embedded graphs”, SoCG 2019 - 35^th International Symposium on Computational Geometry, Portland, OR, United States [Cohen-Addad 2019c]
V. Cohen‑Addad, J. Li : “On the Fixed-Parameter Tractability of Capacitated Clustering”, 46^th International Colloquium on Automata, Languages, and Programming (ICALP 2019), vol. 132, Leibniz International Proceedings in Informatics (LIPIcs), Patras, Greece, pp. 41:1-41:14, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) [Cohen-Addad 2019d]
V. Cohen‑Addad, K. Srikanta : “Inapproximability of Clustering in Lp-metrics”, FOCS'19 - 60^th Annual IEEE Symposium on Foundations of Computer Science, Baltimore, United States [Cohen-Addad 2019e]
V. Cohen‑Addad, L. Feuilloley, T. Starikovskaya : “Lower bounds for text indexing with mismatches and differences”, SODA 2019 - Symposium on Discrete Algorithms, San Diego, United States [Cohen-Addad 2019f]
V. Cohen‑Addad, M. Pilipczuk, M. Pilipczuk : “A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs”, FOCS'19, Baltimore, United States [Cohen-Addad 2019g]
V. Cohen‑Addad, M. Pilipczuk, M. Pilipczuk : “Efficient Approximation Schemes for Uniform-Cost Clustering Problems in Planar Graphs”, European Symposium on Algorithms, vol. 144, Leibniz International Proceedings in Informatics (LIPIcs), Munich, Germany, pp. 33:1-33:14, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) [Cohen-Addad 2019h]
V. Cohen‑Addad, N. Hjuler, N. Parotsidis, D. Saulpic, Ch. Schwiegelshohn : “Fully Dynamic Consistent Facility Location”, NeurIPS'19 - 33rd Conference on Neural Information Processing Systems, Vancouver, United States [Cohen-Addad 2019i]
N. Dang, C. Doerr : “Hyper-parameter tuning for the (1 + ( λ, λ )) GA”, GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference, Prague, Czechia, pp. 889-897, (ACM Press) [Dang 2019]
C. Doerr : “Dynamic parameter choices in evolutionary computation (tutorial at GECCO 2019)”, Genetic and Evolutionary Computation Conference, Companion Material, Prague, Czechia, pp. 890-922, (ACM Press) [Doerr 2019b]
B. Doerr, C. Doerr, F. Neumann : “Fast re-optimization via structural diversity”, The Genetic and Evolutionary Computation Conference, Proceedings of the Genetic and Evolutionary Computation Conference, Prague, Czechia, pp. 233-241, (ACM Press) [Doerr 2019b]
B. Doerr, C. Doerr, J. Lengler : “Self-adjusting mutation rates with provably optimal success rules”, GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference, Prague, Czechia, pp. 1479-1487, (ACM Press) [Doerr 2019c]
C. Doerr, F. Ye, N. Horesh, H. Wang, O. Shir, Th. Bäck : “Benchmarking discrete optimization heuristics with IOHprofiler”, GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Prague, Czechia, pp. 1798-1806, (ACM Press) [Doerr 2019d]
C. Doerr, J. Dréo, P. Kerschke : “Making a case for (Hyper-)parameter tuning as benchmark problems”, GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Prague, Czechia, pp. 1755-1764, (ACM Press) [Doerr 2019e]
J. Dréo, C. Doerr, Y. Semet : “Coupling the design of benchmark with algorithm in landscape-aware solver design”, GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Prague, Czechia, pp. 1419-1420, (ACM Press) [Dréo 2019]
B. Escoffier, H. Gilbert, A. Pass‑Lanneau : “The Convergence of Iterative Delegations in Liquid Democracy in a Social Network”, Lecture Notes in Computer Science, vol. 11801, Athènes, Greece, pp. 284-297 [Escoffier 2019b]
A.‑E. Falq, P. Fouilhoux, S. Kedad‑Sidhoum : “Inégalités linéaires de dominance pour l’ordonnancement juste-à-temps avec date d’échéance commune non restrictive”, JPOC11 : Journées Polyèdres et Optimisation Combinatoire, Metz, France [Falq 2019a]
A.‑E. Falq, P. Fouilhoux, S. Kedad‑Sidhoum : “MIP formulations for just-in-time scheduling around a common due-date”, 14^th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2019), Renesse, Netherlands [Falq 2019b]
I. Ignashov, A. Buzdalova, M. Buzdalov, C. Doerr : “Illustrating the trade-off between time, quality, and success probability in heuristic search”, GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Prague, Czechia, pp. 1807-1812, (ACM Press) [Ignashov 2019]
A. Janković, C. Doerr : “Adaptive landscape analysis (student workshop paper)”, Genetic and Evolutionary Computation Conference, Companion Material, Prague, Czechia, pp. 2032-2035, (ACM Press) [Janković 2019]
F. Quezada, C. Gicquel, S. Kedad‑Sidhoum : “A dynamic programming based decomposition approach for the stochastic uncapacitated single-item lot-sizing problem”, 10^th International Workshop on Lot sizing - IWLS 2019, Paris, France, pp. 73-77 [Quezada 2019a]
F. Quezada, C. Gicquel, S. Kedad‑Sidhoum : “A Stochastic Dual Dynamic Integer Programming for the Uncapacitated Lot-Sizing Problem with Uncertain Demand and Costs”, Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, Berkeley, United States, pp. 353-361, (AAAI Press) [Quezada 2019b]
F. Quezada, C. Gicquel, S. Kedad‑Sidhoum : “Stochastic dual dynamic integer programming for a multi-echelon lot-sizing problem with remanufacturing and lost sales”, IEEE International Conference on Control, Decision and Information Technologies CODIT 2019, Paris, France, pp. 1254-1259, (IEEE) [Quezada 2019c]
F. Quezada, C. Gicquel, S. Kedad‑Sidhoum : “Stochastic lot-sizing problem with remanufacturing: a dual dynamic decomposition approach”, PGMO Days, Paris, France [Quezada 2019d]
F. Quezada, C. Gicquel, S. Kedad‑Sidhoum : “Stochastic uncapacitated single-item lot-sizing problem: a dual dynamic decomposition approach”, Congrès de la société française de Recherche Opérationnelle et d'Aide à la décision ROADEF2019, Le Havre, France [Quezada 2019e]
Q. Renau, J. Dréo, C. Doerr, B. Doerr : “Expressiveness and robustness of landscape features (student workshop paper)”, GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Prague, Czechia, pp. 2048-2051, (ACM Press) [Renau 2019]
A. Rodionova, K. Antonov, A. Buzdalova, C. Doerr : “Offspring Population Size Matters when Comparing Evolutionary Algorithms with Self-Adjusting Mutation Rates”, Genetic and Evolutionary Computation Conference, Prague, Czechia, pp. 855-863, (ACM Press) [Rodionova 2019]
C. Rottner, P. Bendotti, P. Fouilhoux : “Breaking structured symmetries and sub-symmetries in Integer Linear Programming”, ROADEF 2019 - 20ème congrès annuel de la société Française de Recherche Opérationnelle et d’Aide à la Décision, Le Havre, France [Rottner 2019]
Th. Tournaire, H. Castel‑Taleb, E. Hyon : “Comparaisons de méthodes de calcul de seuils pour minimiser la consommation énergétique d’un cloud”, Congrès ROADEF 2019 Livre des Résumés, Le Havre, France, pp. 135 [Tournaire 2019a]
Th. Tournaire, H. Castel‑Taleb, E. Hyon, T. Hoche : “Generating optimal thresholds in a hysteresis queue: application to a cloud model”, MASCOTS 2019: 27^th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2019 IEEE 27^th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), Rennes, France, pp. 283-294, (IEEE Computer Society) [Tournaire 2019b]
Th. Tournaire, H. Castel‑Taleb, E. Hyon, T. Hoche : “Génération de seuils optimaux dans une file hystérésis : application à un modèle de cloud”, CORES 2019: Rencontres Francophones sur la Conception de Protocoles, l’Évaluation de Performance et l’Expérimentation des Réseaux de Communication, Saint Laurent de la Cabrerisse, France [Tournaire 2019c]
D. Vermetten, S. Van Rijn, Th. Bäck, C. Doerr : “Online selection of CMA-ES variants”, GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference, Prague, Czechia, pp. 951-959, (ACM Press) [Vermetten 2019]
D. Vinokurov, M. Buzdalov, A. Buzdalov, B. Doerr, C. Doerr : “Fixed-target runtime analysis of the (1 + 1) EA with resampling (student workshop paper)”, GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Prague, Czechia, pp. 2068-2071, (ACM Press) [Vinokurov 2019]
F. Ye, C. Doerr, Th. Bäck : “Interpolating Local and Global Search by Controlling the Variance of Standard Bit Mutation”, 2019 IEEE Congress on Evolutionary Computation (CEC), Wellington, New Zealand, pp. 2292-2299, (IEEE) [Ye 2019]

Mentions légales

Site map