RO - Documentos de conferencias

equipos actuales :	ACASA ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MLIA MOCAH MoVe NPA PEQUAN Phare PolSys QI RO SMA SYEL Whisper
Antiguos equipos :	AnimatLab MALIRE REGAL SALSA SPI SPIRAL
Antiguos temas de investigación :	ANP APA ASIM CALFOR OASIS RP SPI SRC SYSDEF

Publicaciones RO	2015	2016	2017	2018	2019	2020	Total
Libros	0	1	0	0	1	0	2
Libros editados	2	0	0	0	0	0	2
Artículos de revistas	16	16	13	13	16	2	76
Capítulos de libros	0	1	0	1	3	0	5
Documentos de conferencias	17	25	18	30	42	2	134
Habilitaciones	0	0	0	1	0	0	1
Tesis	0	0	1	1	0	0	2

LIP6

A. Ahmad, Z. Hanzalek, C. Hanen : “A polynomial scheduling algorithm for IEEE 802.15. 4/ZigBee cluster tree WSN with one collision domain and period crossing constraint”, Emerging Technology and Factory Automation (ETFA), 2014 IEEE, Barcelona, Spain, pp. 1-8, (IEEE) [Ahmad 2014]
E. Angel, E. Bampis, V. Chau : “Throughput maximization in the speed-scaling setting”, 31^st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), vol. 25, Lyon, France, pp. 53-62 [Angel 2014d]
E. Angel, E. Bampis, V. Chau, K. Nguyen : “Throughput maximization in multiprocessor speed-scaling”, ISAAC 2014 - 25^th International Symposium on Algorithms and Computation, vol. 8889, Lecture Notes in Computer Science, Jeonju, South Korea, pp. 247-258, (Springer) [Angel 2014e]
E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, M. Sviridenko : “Energy Efficient Scheduling and Routing via Randomized Rounding”, ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Bordeaux, France [Bampis 2014a]
E. Bampis, D. Letsios, G. Lucarelli : “A note on multiprocessor speed scaling with precedence constraints”, 26^th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2014), Prague, Czech Republic, pp. 138-142, (ACM) [Bampis 2014c]
E. Bampis, D. Letsios, G. Lucarelli : “Speed-Scaling with No Preemptions”, 25^th International Symposium, ISAAC , vol. 8889, Lecture Notes in Computer Science, Jeonju, South Korea, pp. 259-269 [Bampis 2014d]
E. Bampis, V. Chau, D. Letsios, G. Lucarelli, I. Milis, G. Zois : “Energy efficient scheduling of MapReduce jobs.”, 20^th International Conference on Parallel Processing (Euro-Par 2014), vol. 8632, Lecture Notes in Computer Science, Porto, Portugal, pp. 198-209, (Springer) [Bampis 2014e]
P. Bendotti, P. Fouilhoux : “An integer formulation based on common supersequences to solve the Permutation Problem using a Unit-Capacity Robot”, International Symposium on Combinatorial Optimization (ISCO 2014), Lisboa, Portugal [Bendotti 2014]
S. Borne, P. Fouilhoux, R. Grappe, M. Lacroix, P. Pesneau : “Branch-and-Cut algorithm for the connected-cut problem”, ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Bordeaux, France [Borne 2014a]
S. Borne, P. Fouilhoux, R. Grappe, M. Lacroix, P. Pesneau : “Circuit and bond polytopes in series-parallel graphs”, ISCO 2014 - 3rd International Symposium on Combinatorial Optimization, Lisbon, Portugal [Borne 2014b]
V. Chau, E. Angel, E. Bampis : “Maximisation de profit dans les systèmes informatiques sous contraintes énergétiques”, ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Bordeaux, France [Chau 2014]
F. Delbot, Ch. Laforest, S. Rovedakis : “Self-stabilizing Algorithms for Connected Vertex Cover and Clique Decomposition Problems”, 18^th International Conference on Principles of Distributed Systems, OPODIS 2014, vol. 8878, Lecture Notes in Computer Science, Marcos K. Aguilera, L. Querzoni, M. Shapiro (Eds.), Cortina d’Ampezzo, Italy, pp. 307-322, (Springer), (ISBN: 978-3-319-14471-9) [Delbot 2014b]
B. Doerr, C. Doerr : “The impact of random initialization on the runtime of randomized search heuristics”, GECCO '14 - Conference on Genetic and Evolutionary Computation, Vancouver, Canada, pp. 1375-1382, (ACM) [Doerr 2014e]
B. Doerr, C. Doerr, T. Koetzing : “Unbiased black-box complexities of jump functions: how to cross large plateaus”, GECCO '14 - Conference on Genetic and Evolutionary Computation, Vancouver, Canada, pp. 769-776, (ACM) [Doerr 2014f]
Ch. Dürr : “Tutoriel : Gestion de tampon en ligne”, ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Bordeaux, France [Dürr 2014a]
Ch. Dürr, Ó. Vásquez Pérez : “Order constraints for single machine scheduling with non-linear cost”, 16^th Workshop on Algorithm Engineering and Experiments (ALENEX 2014), Catherine C. McGeoch, U. Meyer (Eds.), Portland, USA, pp. 98-111, (SIAM) [Dürr 2014b]
P. Fouilhoux, A. Questel : “Branch-and-Cut-and-Price using Stable Set polytope inequalities for the Capacitated- Ring-Star Problem”, International Symposium on Combinatorial Optimization (ISCO 2014), Lisbon, Portugal [Fouilhoux 2014b]
A. Ismaili, E. Bampis, N. Maudet, P. Perny : “How the Number of Strategies Impacts the Likelihood of Equilibria in Random Graphical Games”, 13^th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014, Paris, France, pp. 285-292 [Ismaili 2014]
S. Kedad‑Sidhoum, F. Mendonca, F. Monna, G. Mounié, D. Trystram : “Fast Biological Sequence Comparison on Hybrid Platforms”, 43rd International Conference on Parallel Processing, ICPP 2014, Minneapolis, USA, pp. 501-509, (IEEE) [Kedad-Sidhoum 2014]
S. Talebi, E. Bampis, G. Lucarelli, I. Katib, G. Rouskas : “The spectrum assigment (SA) problem in optical networks: A multiprocesor scheduling perspective”, 18^th Conference on Optical Network Design and Modeling (ONDM 2014), Stockholm, Sweden, pp. 55-60, (IEEE) [Talebi 2014]