RO - Articoli su atti di conferenza

Gruppi di ricerca attuali :	ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MLIA MOCAH MoVe NPA PEQUAN Phare PolSys QI RO SMA SYEL
Gruppi precedenti :	AnimatLab MALIRE REGAL SALSA SPI SPIRAL Whisper
Argomenti di ricerca precedenti :	ANP APA ASIM CALFOR OASIS RP SPI SRC SYSDEF

Pubblicazioni RO	2016	2017	2018	2019	2020	2021	Total
Libri	1	0	0	1	0	0	2
Curatele di libri	0	0	0	0	3	0	3
Articoli su rivista	15	14	15	15	15	1	75
Capitoli di libri	1	0	1	3	0	0	5
Articoli su atti di conferenza	25	18	33	46	27	1	150
Abilitazioni	0	0	1	1	2	0	4
Tesi	0	1	1	0	0	0	2

LIP6

F. AIT SALAHT, E. Hyon, H. Castel‑Taleb : “Politique optimale d'activation et désactivation des serveurs dans un modèle de cloud computing.”, 17ème congrès annuel de la Société française de recherche opérationnelle et d’aide à la décision (ROADEF), Compiègne, France [AIT SALAHT 2016a]
F. AIT SALAHT, H. Castel‑Taleb : “Bounding aggregations on phase-type arrivals for performance analysis of clouds”, Proceedings MASCOTS 2016 : 24^th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, London, United Kingdom, pp. 319-324, (IEEE Computer Society) [AIT SALAHT 2016b]
F. AIT SALAHT, H. Castel‑Taleb : “Performance analysis of clouds with phase-type arrivals”, CoRes 2016, Bayonne, France [AIT SALAHT 2016c]
F. AIT SALAHT, H. Castel‑Taleb, J.‑M. Fourneau, N. Pekergin : “Stochastic bounds and histograms for active queues management and networks analysis”, Proceedings ASMTA 2016 : 23rd International Conference on Analytical and Stochastic Modelling Techniques and Applications, Cardiff, United Kingdom, pp. 1-16, (Springer) [AIT SALAHT 2016e]
S. Albers, E. Bampis, D. Letsios, G. Lucarelli, S. Richard : “Scheduling on Power-Heterogeneous Processors”, LATIN 2016: Theoretical Informatics, vol. 9644, Lecture Notes in Computer Science, Ensenada, Mexico, pp. 41-54 [Albers 2016]
E. Angel, E. Bampis, B. Escoffier, M. Lampis : “Parameterized Power Vertex Cover”, Graph-Theoretic Concepts in Computer Science, vol. 9941, Lecture Notes in Computer Science, Istanbul, Turkey, pp. 97-108, (Springer) [Angel 2016a]
E. Angel, E. Bampis, F. Pascual, N. Thibault : “Truthfulness for the Sum of Weighted Completion Times”, Computing and Combinatorics, vol. 9797, Lecture Notes in Computer Science, Ho Chi Minh City, Viet Nam, pp. 15-26, (Springer Verlag) [Angel 2016c]
S. Angelopoulos, Ch. Dürr, Th. Lidbetter : “The expanding search ratio of a graph”, Proc. of the 33rd Symposium on Theoretical Aspects of Computer Science (STACS), vol. 47, Leibniz International Proceedings in Informatics (LIPIcs), Orléans, France, pp. 4:1-9:14, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) [Angelopoulos 2016c]
E. Bampis : “Algorithmic Issues in Energy-Efficient Computation”, Discrete Optimization and Operations Research - 9^th International Conference, (DOOR), vol. 9869, Lecture Notes in Computer Science, Vladivostok, Russian Federation, pp. 3-14, (Springer Verlag) [Bampis 2016a]
M. Bienkowski, M. Böhm, J. Byrka, M. Chrobak, Ch. Dürr, L. Folwarczný, Ł. Jeż, J. Sgall, K. Nguyen, P. Veselý : “Online Algorithms for Multi-Level Aggregation”, Proc. of the 24^th European Symposium on Algorithms (ESA), Aarhus, Denmark [Bienkowski 2016]
É. Bonnet, B. Escoffier, V. Paschos, G. Stamoulis : “A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs”, LATIN 2016: Theoretical Informatics - 12^th Latin American Symposium, vol. 9644, Lecture Notes in Computer Science, Ensenada, Mexico, pp. 235-248, (Springer) [Bonnet 2016]
Ph. Chrétienne, P. Fouilhoux, P. Bendotti : “PERT, recherche d'ordonnancements stables en présence de durées incertaines”, Congrès annuel de la société Française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF), Compiègne, France [Chrétienne 2016]
B. Doerr, C. Doerr, J. Yang : “$k$-Bit Mutation with Self-Adjusting $k$ Outperforms Standard Bit Mutation”, Parallel Problem Solving from Nature – PPSN XIV, vol. 9921, Lecture Notes in Computer Science, Edinburgh, United Kingdom, pp. 824-834 [Doerr 2016b]
B. Doerr, C. Doerr, J. Yang : “Optimal Parameter Choices via Precise Black-Box Analysis”, GECCO 2016 - Genetic and Evolutionary Computation Conference, Denver, United States, pp. 1123-1130, (ACM) [Doerr 2016c]
C. Doerr, J. Lengler : “The (1+1) Elitist Black-Box Complexity of LeadingOnes”, GECCO 2016 - Genetic and Evolutionary Computation Conference, Denver, United States, pp. 1131-1138, (ACM) [Doerr 2016c]
C. Doerr, N. Bredèche, E. Alba, Th. Bartz‑Beielstein, D. Brockhoff, B. Doerr, G. Eiben, Michael G. Epitropakis, Carlos M. Fonseca, A. Guerreiro, E. Haasdijk, J. Heinerman, J. Hubert, P. Lehre, L. Malago, J. J. Merelo, J. Miller, B. Naujoks, P. Oliveto, S. Picek, N. Pillay, M. Preuss, P. Ryser‑Welch, G. Squillero, J. Stork, D. Sudholt, A. Tonda, D. Whitley, M. Zaefferer : “Tutorials at PPSN 2016”, 14^th International Conference on Parallel Problem Solving from Nature, vol. 9921, Lecture Notes in Computer Science, Edinburgh, United Kingdom, pp. 1012-1022, (SPRINGER INT PUBLISHING AG) [Doerr 2016d]
B. Doerr, C. Doerr, T. Kötzing : “Provably Optimal Self-Adjusting Step Sizes for Multi-Valued Decision Variables”, Parallel Problem Solving from Nature – PPSN XIV, vol. 9921, Lecture Notes in Computer Science, Edinburgh, United Kingdom, pp. 782-791 [Doerr 2016f]
B. Doerr, C. Doerr, T. Kötzing : “The Right Mutation Strength for Multi-Valued Decision Variables”, GECCO 2016 - Genetic and Evolutionary Computation Conference, Denver, United States, pp. 1115-1122, (ACM) [Doerr 2016g]
Ch. Dürr, Ch. Konrad, M. Renault : “On the Power of Advice and Randomization for Online Bipartite Matching”, Proc. of the 24^th European Symposium on Algorithms (ESA), Aarhus, Denmark [Dürr 2016a]
B. Escoffier : “Saving colors and Max Coloring: some fixed-parameter tractability results”, Proceedings of WG 2016, 42^nd International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Istanbul, Turkey [Escoffier 2016a]
C. Gicquel, S. Kedad‑Sidhoum, D. Quadri : “Remanufacturing planning under uncertainty: a two-stage stochastic programming approach”, International Conference on Informations Systems, Logistics and Supply chain ILS2016, Bordeaux, France [Gicquel 2016a]
C. Gicquel, S. Kedad‑Sidhoum, Q. VU : “Stochastic lot-sizing for a multi-echelon remanufacturing system”, International Workshop on Lot-Sizing, Hanovre, Germany [Gicquel 2016b]
F. Pascual, O. Spanjaard : “Deux approches pour l'identification d'un axe politique gauche-droite à partir de données de votes par approbation”, 17ème congrès annuel de la Société française de recherche opérationnelle et d’aide à la décision (ROADEF), Compiègne, France [Pascual 2016]
S.‑L. Phouratsamay, S. Kedad‑Sidhoum, F. Pascual : “Designing contracts in a two-level supply chain with asymmetric information”, IWLS - International Workshop on Lot Sizing, Hanovre, Germany [Phouratsamay 2016a]
S.‑L. Phouratsamay, S. Kedad‑Sidhoum, F. Pascual : “Two-level supply chain coordination under complete or asymmetric information”, ISCO - 4^th International Symposium on Combinatorial Optimization, Salerne, Italy [Phouratsamay 2016b]