Publicaciones 2006-2026

• 2026
  • E. Angel, E. Bampas, E. Bampis, V. Chau, J. Cohen, A. Kononov, Y. Zhang : “Emergency Vertex Cover”, (2026)
• 2025
  • E. Bampis, B. Escoffier, D. Fotakis, P. Patsilinakos, M. Xefteris : “Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems”, Proceedings of the 42 nd International Conference on Machine Learning, vol. 267, Vancouver, Canada, pp. 2790-2800, (PMLR) (2025)
  • E. Bampis, Th. Ehrhard, B. Escoffier, C. Mathieu, F. Pascual, D. Saulpic : “Estimating the Electoral Consequences of Legislative Redistricting in France”, FAccT '25: Proceedings of the 2025 ACM Conference on Fairness, Accountability, and Transparency, Athens, Greece, pp. 1664-1676, (ACM), (ISBN: 979-8-4007-1482-5) (2025)
• 2024
  • E. Bampis, B. Escoffier, M. Xefteris : “Parsimonious Learning-Augmented Approximations for Dense Instances of NP-hard Problems”, ICML 2024, Forty-first International Conference on Machine Learning, vol. 235, Proceedings of Machine Learning Research, Vienna, Austria, pp. 2700-2714, (PMLR) (2024)
• 2023
  • E. Bampis, B. Escoffier, P. Youssef : “Online 2-stage stable matching”, Discrete Applied Mathematics, vol. 341, pp. 394-405, (Elsevier) (2023)
  • E. Bampis, B. Escoffier, N. Hahn, M. Xefteris : “Online TSP with Known Locations”, Algorithms and Data Structures Symposium (WADS), vol. 14079, Lecture Notes in Computer Science, Montreal, Canada, pp. 65-78, (Springer Nature Switzerland) (2023)
  • E. Bampis, C.‑E. Cella, B. Escoffier, M. Rocco, A. Teiller : “Target-based computer-assisted orchestration: Complexity and approximation algorithms”, European Journal of Operational Research, vol. 304 (3), pp. 926-938, (Elsevier) (2023)
  • E. Bampis, A. Kononov, G. Lucarelli, F. Pascual : “Non-Clairvoyant Makespan Minimization Scheduling with Predictions”, 34^th International Symposium on Algorithms and Computation (ISAAC 2023), vol. 283, Leibniz International Proceedings in Informatics (LIPIcs), Kyoto, Japan, pp. 9:1-9:15, (Schloss Dagstuhl – Leibniz-Zentrum für Informatik) (2023)
  • E. Bampis, B. Escoffier, Th. Gouleakis, N. Hahn, K. Lakis, G. Shahkarami, M. Xefteris : “Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else”, 31^st Annual European Symposium on Algorithms (ESA 2023), vol. 274, Leibniz International Proceedings in Informatics (LIPIcs), Amsterdam, Netherlands, pp. 12:1-12:17, (Schloss Dagstuhl - Leibniz-Zentrum für Informatik) (2023)
  • E. Bampis, B. Escoffier, P. Youssef : “Online 2-stage Stable Matching”, AAMAS 2023, 2023 International Conference on Autonomous Agents and Multiagent Systems, Londres, United Kingdom, pp. 2475-2477, (International Foundation for Autonomous Agents and Multiagent Systems) (2023)
• 2022
  • Th. Ehrhard, S. Attias, E. Bampis, V. Cohen‑Addad, B. Escoffier, C. Mathieu, F. Pascual, A. Pass‑Lanneau, D. Saulpic : “Découpage électoral des circonscriptions législatives en France: déséquilibres démographiques et contraintes territoriales”, Revue Française de Science Politique, vol. Vol. 72 (3), pp. 333-364, (Presses de Sciences Po) (2022)
  • E. Bampis, B. Escoffier, M. Xefteris : “Canadian Traveller Problem with Predictions”, 20^th International Workshop on Approximation and Online Algorithms, WAOA 2022, vol. 13538, Lecture Notes in Computer Science, Potsdam, Germany, pp. 116-133 (2022)
  • E. Bampis, D. Christou, B. Escoffier, N. Thắng : “Online learning for min-max discrete problems”, Theoretical Computer Science, vol. 930, pp. 209-217, (Elsevier) (2022)
  • E. Bampis, K. Dogeas, A. Kononov, G. Lucarelli, F. Pascual : “Scheduling with Untrusted Predictions”, Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}, Vienna, Austria, pp. 4581-4587, (International Joint Conferences on Artificial Intelligence Organization) (2022)
  • E. Bampis, B. Escoffier, A. Teiller : “Multistage knapsack”, Journal of Computer and System Sciences, vol. 126, pp. 106-118, (Elsevier) (2022)
  • E. Bampis, D. Christou, B. Escoffier, A. Kononov, N. Thắng : “A simple rounding scheme for multistage optimization”, Theoretical Computer Science, vol. 907, pp. 1-10, (Elsevier) (2022)
• 2021
  • E. Angel, E. Bampis, V. Chau, V. Zissimopoulos : “Calibrations scheduling with arbitrary lengths and activation length”, Journal of Scheduling, vol. 24, pp. 459-467, (Springer Verlag) (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) (2021)
  • E. Bampis, B. Escoffier, K. Schewior, A. Teiller : “Online Multistage Subset Maximization Problems”, Algorithmica, vol. 83 (8), pp. 2374-2399, (Springer Verlag) (2021)
  • E. Bampis, K. Dogeas, A. Kononov, G. Lucarelli, F. Pascual : “Speed Scaling with Explorable Uncertainty”, SPAA '21: Proceedings of the 33^rd ACM Symposium on Parallelism in Algorithms and Architectures, virtual conference, United States, pp. 83-93, (ACM) (2021)
• 2020
  • B. Escoffier, E. Bampis, A. Kononov : “LP-Based Algorithms for Multistage Minimization Problems”, Approximation and Online Algorithms, WAOA 2020, vol. 12806, Lecture Notes in Computer Science, Pisa, Italy, pp. 1-15, (Springer) (2020)
  • E. Bampis, K. Dogeas, A. Kononov, G. Lucarelli, F. Pascual : “Scheduling Malleable Jobs Under Topological Constraints”, 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), New Orleans, LA, United States, pp. 316-325, (IEEE) (2020)
• 2019
  • 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) (2019)
  • 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) (2019)
• 2018
  • E. Angel, E. Bampis, B. Escoffier, M. Lampis : “Parameterized Power Vertex Cover”, Discrete Mathematics and Theoretical Computer Science, vol. 20 (2), (DMTCS) (2018)
  • E. Bampis, B. Escoffier, S. Mladenovic : “Fair resource allocation over time”, AAMAS 2018 - 17^th International Conference on Autonomous Agents and MultiAgent Systems, Stockholm, Sweden, pp. 766-773, (International Foundation for Autonomous Agents and Multiagent Systems) (2018)
  • L. Arantes, E. Bampis, A. Kononov, M. Letsios, G. Lucarelli, P. Sens : “Scheduling under Uncertainty: A Query-based Approach”, IJCAI 2018 - 27^th International Joint Conference on Artificial Intelligence, Stockholm, Sweden, pp. 4646-4652 (2018)
  • E. Bampis, B. Escoffier, M. Lampis, Vangelis Th. Paschos : “Multistage Matchings”, 16^th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), vol. 101, Leibniz International Proceedings in Informatics (LIPIcs), Malmo, Sweden, pp. 7:1-7:13 (2018)
  • E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, M. Sviridenko : “Energy Efficient Scheduling and Routing via Randomized Rounding”, Journal of Scheduling, vol. 21 (1), pp. 35-51, (Springer Verlag) (2018)
• 2017
  • S. Albers, E. Bampis, D. Letsios, G. Lucarelli, R. Stotz : “Scheduling on power-heterogeneous processors”, Information and Computation, vol. 257, pp. 22-33, (Elsevier) (2017)
  • E. Angel, E. Bampis, V. Chau, V. Zissimopoulos : “On the complexity of minimizing the total calibration cost”, 11^th International Frontiers of Algorithmics Workshop (FAW 2017), vol. 10336, Lecture Notes in Computer Science, Chengdu, China, pp. 1-12 (2017)
• 2016
  • E. Angel, E. Bampis, V. Chau, D. Letsios : “Throughput maximization for speed scaling with agreeable deadlines”, Journal of Scheduling, vol. 19 (6), pp. 619-625, (Springer Verlag) (2016)
  • E. Angel, E. Bampis, D. Paparas, E. Pountourakis, V. Zissimopoulos : “Clustering on kk-edge-colored graphs”, Discrete Applied Mathematics, vol. 211, pp. 15-22, (Elsevier) (2016)
  • 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) (2016)
  • 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) (2016)
  • E. Angel, E. Bampis, V. Chau, N. Thắng : “Throughput maximization in multiprocessor speed-scaling”, Theoretical Computer Science, vol. 630, pp. 1-12, (Elsevier) (2016)
  • 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 (2016)
  • E. Bampis, D. Letsios, I. Milis, G. Zois : “Speed Scaling for Maximum Lateness”, Theory of Computing Systems, vol. 58 (2), pp. 304-321, (Springer Verlag) (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, Türkiye, pp. 97-108, (Springer) (2016)
• 2015
  • E. Angel, E. Bampis, V. Chau, A. Kononov : “Min-Power Covering Problems”, 26^th International Symposium (ISAAC 2015), vol. 9472, Lecture Notes in Computer Science, Nagoya, Japan, pp. 367-377 (2015)
  • E. Angel, E. Bampis, V. Chau, N. Thắng : “Non-preemptive throughput maximization for speed-scaling with power-down”, 21^st International Conference on Parallel and Distributed Computing (Euro-Par 2015), vol. 9233, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vienna, Austria, pp. 171-182 (2015)
  • E. Bampis, D. Letsios, G. Lucarelli : “Green scheduling, flows and matchings”, Theoretical Computer Science, vol. 579, pp. 126–136, (Elsevier) (2015)
  • E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, I. Nemparis : “From preemptive to non-preemptive speed-scaling scheduling”, Discrete Applied Mathematics, vol. 181, pp. 11-20, (Elsevier) (2015)
  • E. Bampis : “Experimental Algorithms: 14^th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings”, SEA 2015 - 14^th International Symposium on Experimental Algorithms, vol. 9125, Lecture Notes in Computer Science, Paris, France, (Springer Verlag), (ISBN: 978-3-319-20085-9) (2015)
  • E. Bampis, O. Svensson : “Approximation and Online Algorithms: 12^th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers”, WAOA 2014 - 12^th International Workshop on Approximation and Online Algorithms, vol. 8952, Lecture Notes in Computer Science, Wrocław, Poland, (Springer Verlag), (ISBN: 978-3-319-18262-9) (2015)
• 2014
  • E. Bampis, D. Letsios, G. Lucarelli : “Speed-Scaling with No Preemptions”, 25^th International Symposium, ISAAC, vol. 8889, Lecture Notes in Computer Science, Jeonju, Korea, Republic of, pp. 259-269 (2014)
  • E. Angel, E. Bampis, V. Chau, N. Thắng : “Throughput maximization in multiprocessor speed-scaling”, Proc. of the 25^th International Symposium on Algorithms and Computation (ISAAC 2014), vol. 8889, Lecture Notes in Computer Science, Jeonju, Korea, Republic of, pp. 247-258, (Springer) (2014)
  • E. Angel, E. Bampis, V. Chau : “Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines”, Discrete Applied Mathematics, vol. 175, pp. 1-10, (Elsevier) (2014)
  • E. Angel, E. Bampis, L. Gourvès : “Polynomial Approximation for Multicriteria Combinatorial Optimization Problems”, chapter in Paradigms of Combinatorial Optimization: Problems and New Approaches: 2^nd Edition, pp. 511-545, (John Wiley & Sons), (ISBN: 978-184821148-3) (2014)
  • 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) (2014)
  • E. Angel, E. Bampis, Gerasimos G. Pollatos, V. Zissimopoulos : “Optimal data placement on networks with a constant number of clients”, Theoretical Computer Science, vol. 540-541, pp. 82-88, (Elsevier) (2014)
  • 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, Czechia, pp. 138-142, (ACM) (2014)
  • 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 (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) (2014)
  • E. Bampis, A. Kononov, G. Lucarelli, I. Milis : “Bounded max-colorings of graphs”, Journal of Discrete Algorithms, vol. 26, pp. 56-68, (Elsevier) (2014)
  • E. Angel, E. Bampis, V. Chau : “Throughput maximization in the speed-scaling setting”, Leibniz International Proceedings in Informatics, LIPIcs, vol. 25, Lyon, France, pp. 53-62 (2014)
  • E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, M. Sviridenko : “Energy Efficient Scheduling and Routing via Randomized Rounding”, ROADEF - 15^e congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Bordeaux, France (2014)
  • V. Chau, E. Angel, E. Bampis : “Maximisation de profit dans les systèmes informatiques sous contraintes énergétiques”, ROADEF - 15^e congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Bordeaux, France (2014)
• 2013
  • E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, M. Sviridenko : “Energy efficient scheduling and routing via randomized rounding”, 33^rd 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 (2013)
  • 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 (2013)
  • 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 (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 (2013)
  • E. Bampis, D. Letsios, G. Lucarelli, E. Markakis, I. Milis : “On multiprocessor temperature-aware scheduling problems”, Journal of Scheduling, vol. 16 (5), pp. 529-538, (Springer Verlag) (2013)
  • 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 (2013)
  • 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 (2013)
• 2012
  • E. Bampis, Ch. Dürr, F. Kacem, Ioannis Z. Milis : “Speed scaling with power down scheduling for agreeable deadlines”, Sustainable Computing : Informatics and Systems, vol. 2 (4), pp. 184-189, (Elsevier) (2012)
  • E. Angel, E. Bampis, F. Kacem, D. Letsios : “Speed Scaling on Parallel Processors with Migration”, 18^th International Conference on Parallel Processing (Euro-Par 2012), vol. 7484, Lecture Notes in Computer Science, Rhodes Island, Greece, pp. 128-140 (2012)
  • E. Angel, E. Bampis, V. Chau : “Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines”, Proc. of the 10^th Latin American Symposium (LATIN 2012), vol. 7256, Lecture Notes in Computer Science, Arequipa, Peru, pp. 13-24 (2012)
  • E. Angel, E. Bampis, V. Chau : “Algorithmes d’ordonnancement de faible complexité pour minimiser l’énergie consommée des instances agréables”, Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2012), Angers, France (2012)
  • E. Angel, E. Bampis, F. Kacem, D. Letsios : “Ordonnancement des tâches avec migration et minimisation de l’énergie consommée”, Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2012), Angers, France (2012)
  • E. Angel, E. Bampis, N. Thibault : “Randomized truthful algorithms for scheduling selfish tasks on parallel machines”, Theoretical Computer Science, vol. 414 (1), pp. 1-8, (Elsevier) (2012)
  • E. Bampis, D. Letsios, G. Lucarelli : “Green scheduling, flows and matchings”, 23^rd International Symposium on Algorithms and Computation (ISAAC 2012), vol. 7676, Lecture Notes in Computer Science, Taipei, Taiwan, Province of China, pp. 106-115 (2012)
  • E. Angel, E. Bampis, F. Kacem : “Energy Aware Scheduling for Unrelated Parallel Machines”, IEEE International Conference on Green Computing and Communications (GreenCom 2012), Besançon, France, pp. 533-540 (2012)
  • E. Bampis, D. Letsios, Ioannis Z. Milis, G. Zois : “Speed scaling for maximum lateness”, 18^th Annual International Computing and Combinatorics Conference (COCOON 2012), vol. 7434, Lecture Notes in Computer Science, Sydney, Australia, pp. 25-36 (2012)
  • E. Bampis, D. Letsios, G. Lucarelli, E. Markakis, Ioannis Z. Milis : “On multiprocessor temperature-aware scheduling problems”, 6^th International Frontiers of Algorithmics Workshop (FAW 2012) and 8^th International Conference on Algorithmic Aspects of Information and Management (AAIM 2012), vol. 7285, Lecture Notes in Computer Science, Beijing, China, pp. 149-160 (2012)
• 2011
  • E. Bampis, D. Letsios, G. Lucarelli, E. Markakis, I. Milis : “On Multiprocessor Temperature-Aware Scheduling Problems”, (2011)
  • E. Angel, E. Bampis, F. Kacem : “Algorithme approché probabiliste pour le problème Q||sum wi Ci en tenant compte de l’énergie consommée”, 12^e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2011), Saint-Étienne, France (2011)
  • E. Angel, E. Bampis, F. Kacem, D. Letsios : “Speed Scaling on Parallel Processors with Migration”, (2011)
  • E. Bampis, Ch. Dürr, F. Kacem, I. Milis : “Speed scaling with power down scheduling for agreeable deadlines”, (2011)
• 2010
  • E. Bampis, A. Kononov, G. Lucarelli, I. Milis : “Bounded max-colorings of graphs”, 21^st International Symposium on Algorithms and Computation (ISAAC 2010), vol. 6506, Lecture Notes in Computer Science, Jeju Island, Korea, Republic of, pp. 353-365, (Springer) (2010)
  • E. Angel, E. Bampis, Gerasimos G. Pollatos, V. Zissimopoulos : “Optimal Data Placement on Networks With Constant Number of Clients”, (2010)
• 2009
  • E. Angel, E. Bampis, F. Pascual, A.‑A. Tchetgnia : “On truthfulness and approximation for scheduling selfish tasks”, Journal of Scheduling, vol. 12 (5), pp. 437-445, (Springer Verlag) (2009)
• 2008
  • E. Angel, E. Bampis, F. Pascual : “How good are SPT schedules for fair optimality criteria”, Annals of Operations Research, vol. 159 (1), pp. 53-64, (Springer Verlag) (2008)
  • E. Angel, E. Bampis, F. Pascual : “An exponential (matching based) neighborhood for the vehicle routing problem”, Journal of Combinatorial Optimization, vol. 15 (2), pp. 179-190, (Springer Verlag) (2008)
  • E. Angel, E. Bampis, F. Pascual : “The impact of local policies on the quality of packet routing in paths, trees, and rings”, Journal of Scheduling, vol. 11 (5), pp. 311-322, (Springer Verlag) (2008)
• 2007
  • E. Angel, E. Bampis, F. Pascual : “Algorithmic game theory and scheduling”, chapter in Handbook of Approximation algorithms and metaheuristics, pp. 1299-1318, (Chapman and Hall/CRC), (ISBN: 978-1584885504) (2007)
• 2006
  • E. Angel, E. Bampis, L. Blin, L. Gourvès : “Fair cost-sharing methods for the minimum spanning tree game”, Information Processing Letters, vol. 100, pp. 29-35, (Elsevier) (2006)