RO - Conference papers

Current teams :

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

Publications RO	2023	2024	Total
Books	0	0	0
Edited books	0	0	0
Journal articles	14	16	30
Book chapters	0	0	0
Conference papers	34	14	48
Habilitations	0	0	0
Thesis	2	3	5

LIP6

N. Absi, S. Dauzère‑Pérès, S. Kedad‑Sidhoum, B. Penz, Ch. Rapine : “Green Lot-Sizing Problem with Fixed Carbon Emissions”, Roadef 2013, Troyes, France [Absi 2013a]
E. Angel, E. Bampis, A. Kononov, D. Paparas, E. Pountourakis, V. Zissimopoulos : “Clustering on k-edge-colored graphs”, 38^th international Symposium on Mathematical Foundations of Computer Science, vol. 8087, Lecture Notes in Computer Science, Klosterneuburg, Austria, pp. 50-61 [Angel 2013a]
E. Angel, E. Bampis, V. Chau, D. Letsios : “Throughput Maximization for Speed-Scaling with Agreeable Deadlines”, 10^th annual conference on Theory and Applications of Models of Computation (TAMC 2013), vol. 7876, Lecture Notes in Computer Science, Hong Kong, China, pp. 10-19 [Angel 2013b]
E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, I. Nemparis : “From Preemptive to Non-preemptive Speed-Scaling Scheduling”, 19^th Annual International Computing and Combinatorics Conference (COCOON 2013), vol. 7936, Lecture Notes in Computer Science, Hangzhou, China, pp. 134-146 [Bampis 2013a]
E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, M. Sviridenko : “Energy efficient scheduling and routing via randomized rounding”, 33rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), vol. 24, Leibniz International Proceedings in Informatics (LIPIcs), Guwahati, India, pp. 449-460 [Bampis 2013b]
E. Bampis, V. Chau, D. Letsios, G. Lucarelli, I. Milis : “Energy Minimization via a Primal-Dual Algorithm for a Convex Program”, 12^th International Symposium on Experimental Algorithms (SEA 2013), vol. 7933, Lecture Notes in Computer Science, Rome, Italy, pp. 366-377 [Bampis 2013d]
J. Blazewicz, S. Kedad‑Sidhoum, F. Monna, G. Mounié, D. Trystram : “Preemptive scheduling of independent tasks on multi-cores with GPU”, ECCO XXVI: the 26^th European Chapter on Combinatorial Optimization, Paris, France [Blazewicz 2013]
J. Bollati, A. Busic, E. Hyon : “Calcul effectif des niveaux critiques dans un modèle de gestion de stock stochastique”, ROADEF 2013 - 14ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Troyes, France [Bollati 2013]
S. Borne, P. Fouilhoux, R. Grappe, M. Lacroix, P. Pesneau : “Circuit and bond polytopes in series-parallel graphs”, JPOC8 - 8èmes Journées Polyèdres et Optimisation Combinatoire, Clermont-Ferrand, France [Borne 2013]
N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, Vangelis Th. Paschos : “Exact and approximation algorithms for DENSEST k-SUBGRAPH”, 7^th International Workshop on Algorithms and Computation (WALCOM 2013), vol. 7748, Lecture Notes in Computer Science, Kharagpur, India, pp. 114-125, (Springer) [Bourgeois 2013]
Ph. Chrétienne, S. Deleplanque, A. Quilliot : “A Multi-Machine Scheduling Problem with Global Non Idling Constraint”, 7^th IFAC Conference on Manufacturing Modelling, Management, and Control, vol. 46 (9), IFAC Proceedings Volumes, Saint Petersburg, Russian Federation, pp. 1262-1267, (Elsevier) [Chrétienne 2013]
A. Clementi, P. Crescenzi, C. Doerr, P. Fraigniaud, M. Isopi, A. Panconesi, F. Pasquale, R. Silvestri : “Rumor Spreading in Random Evolving Graphs”, Algorithms – ESA 2013, vol. 8125, Lecture Notes in Computer Science, Sophia Antipolis, France, pp. 325-336, (Springer) [Clementi 2013]
P. COUCHENEY, E. Hyon, J.‑M. Kelif : “Mobile Association Problem in Heterogenous Wireless Networks with mobility”, IEEE 24^th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2013, London, United Kingdom, pp. 3129-3133, (IEEE) [COUCHENEY 2013]
F. Delbot, Ch. Laforest, R. Phan : “New Approximation Algorithms for the Vertex Cover Problem”, 24^th International Workshop, IWOCA 2013, vol. 8288, Lecture Notes in Computer Science, Rouen, France, pp. 438-442, (Springer Berlin Heidelberg) [Delbot 2013]
C. Doerr, Jens M. Schmidt, G. Ramakrishna : “Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time”, Graph-Theoretic Concepts in Computer Science, 39^th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, vol. 8165, Lecture Notes in Computer Science, Luebeck, Germany, pp. 225-236 [Doerr 2013]
Ch. Dürr, F. Guíñez : “The Wide Partition Conjecture and the Atom Problem in Discrete Tomography”, The VII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), vol. 44, Electronic Notes in Discrete Mathematics, Playa del Carmen, Mexico, pp. 351-356 [Dürr 2013a]
Ch. Dürr, Ł. Jeż, O. Vasquez Perez : “Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling”, WINE 2013: The 9^th Conference on Web and Internet Economics, vol. 8289, Lecture Notes in Computer Science, Cambridge, MA, United States, pp. 134-145, (Springer) [Dürr 2013c]
B. Escoffier, J. Monnot, F. Pascual, O. Spanjaard : “Algorithmes à véracité garantie pour des problèmes de b-couplage dans un graphe biparti”, 14ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, ROADEF 2013, Troyes, France [Escoffier 2013a]
B. Escoffier, J. Monnot, F. Pascual, O. Spanjaard : “Truthful many-to-many assignment with private weights”, 8^th International Conference on Algorithms and Complexity (CIAC 2013), vol. 7878, Lecture Notes in Computer Science, Barcelona, Spain, pp. 209-220, (Springer) [Escoffier 2013b]
P. Fouilhoux, A. Questel : “Générer des colonnes par Branch-and-Cut: application au problème de couverture d'un graphe par des anneaux-étoiles”, Journées Polyèdres et Optimisation Combinatoire, JPOC8, Clermont-Ferrand, France [Fouilhoux 2013a]
P. Fouilhoux, A. Questel, S. Loyal : “Générer des colonnes par un algorithme de branch‐and‐cut : application au problème de couverture par des anneaux‐étoiles multi‐dépôts”, 14ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2013), Troyes, France [Fouilhoux 2013b]
O. Hazir, S. Kedad‑Sidhoum : “Batch Sizing and Just-In-Time Scheduling: Analysis of Some Special Cases”, 6^th Multidisciplinary International Scheduling Conference: Theory and Applications, MISTA 2013, Ghent, Belgium, pp. 757-761 [Hazir 2013]
A. Ismaili, E. Bampis, N. Maudet, P. Perny : “A study on the stability and efficiency of graphical games with unbounded treewidth”, Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems, Saint Paul, MN, United States, pp. 263-270 [Ismaili 2013]
V. Jeauneau, Ph. Chrétienne : “Minimizing the number of late jobs on parallel machines with alpha time windows”, 6^th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2013), Gent, Belgium [Jeauneau 2013]
S. Kedad‑Sidhoum, F. Monna, G. Mounié, D. Trystram : “Approximation Algorithms for a Scheduling Problem on Multi-Cores with GPUs”, 11^th workshop on Models and Algorithms for Planning and Scheduling Problems MAPSP, Pont-à-Mousson, France [Kedad-Sidhoum 2013]
Y. Seddik, Ch. Gonzales, S. Kedad‑Sidhoum : “A polynomial time OPT-1 algorithm for a scheduling problem with two delivery dates and cumulative payoffs”, 6^th Multidisciplinary International Scheduling Conference: Theory and Applications, MISTA 2013, Gent, Belgium, pp. 268-289 [Seddik 2013a]
Y. Seddik, Ch. Gonzales, S. Kedad‑Sidhoum : “An absolute approximation algorithm for a scheduling problem with cumulative payoffs”, 26^th European Conference on Operational Research, Rome, Italy [Seddik 2013b]
Y. Seddik, Ch. Gonzales, S. Kedad‑Sidhoum : “Un algorithme avec garantie de performance pour un problème d'ordonnancement avec dates de livraison et gains cumulatifs”, Congres de la Societe Francaise de Recherche Operationnelle et d'Aide a la Decision, ROADEF 2013, Troyes, France [Seddik 2013d]