E. Bampis, B. Escoffier, P. Youssef : “Online 2-stage stable matching”, Discrete Applied Mathematics, vol. 341, pp. 394-405, (Elsevier) (2023)
B. Escoffier, O. Spanjaard, M. Tydrichová : “Algorithmic Recognition of 2-Euclidean Preferences”, Proceedings of ECAI 2023, vol. 372, Frontiers in Artificial Intelligence and Applications, Krakow (Cracovie), Poland, pp. 637-644, (IOS Press), (ISBN: 978-1-64368-437-6) (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, B. Escoffier, Th. Gouleakis, N. Hahn, K. Lakis, G. Shahkarami, M. Xefteris : “Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else”, 31st 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)
Th. Bellitto, C. Conchon‑Kerjan, B. Escoffier : “Restless Exploration of Periodic Temporal Graphs”, 2nd Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2023), vol. 257, Leibniz International Proceedings in Informatics (LIPIcs), Pise, Italy, pp. 13:1-13:15, (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)
E. Bampis, B. Escoffier, M. Xefteris : “Canadian Traveller Problem with Predictions”, 20th International Workshop on Approximation and Online Algorithms, WAOA 2022, vol. 13538, Lecture Notes in Computer Science, Potsdam, Germany, pp. 116-133 (2022)
B. Escoffier, O. Spanjaard, M. Tydrichová : “Measuring Nearly Single-Peakedness of an Electorate: Some New Insights”, Algorithmic Decision Theory 7th International Conference, ADT 2021, Toulouse, France, November 3–5, 2021, Proceedings, vol. 13023, Lecture Notes in Computer Science, Toulouse, France, pp. 19-34, (Springer) (2021)
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, B. Escoffier, K. Schewior, A. Teiller : “Online Multistage Subset Maximization Problems”, 27th 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”, 44th 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 - 17th International Conference on Autonomous Agents and MultiAgent Systems, Stockholm, Sweden, pp. 766-773, (International Foundation for Autonomous Agents and Multiagent Systems) (2018)
E. Bampis, B. Escoffier, M. Lampis, Vangelis Th. Paschos : “Multistage Matchings”, 16th 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. 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)
B. Escoffier, J. Monnot, F. Pascual, O. Spanjaard : “Truthful many-to-many assignment with private weights”, 8th International Conference on Algorithms and Complexity (CIAC 2013), vol. 7878, Lecture Notes in Computer Science, Barcelona, Spain, pp. 209-220, (Springer) (2013)
B. Escoffier, E. Kim, V. Paschos, É. Bonnet : “On Subexponential and FPT-time Inapproximability”, Parameterized and Exact Computation8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, Nice, France, pp. 54-65 (2013)
N. Bourgeois, F. Della Croce, B. Escoffier, V. Paschos : “Fast algorithms for min independent dominating set”, Seventh International Conference on Graphs and Optimization 2010, vol. 161 (4-5), Ovronnaz, Switzerland, pp. 558-572 (2013)
B. Escoffier, V. Paschos, E. Tourniaire : “Approximating MAX SAT by moderately exponential algorithms”, Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings, Beijing, China, pp. 622 (2012)
N. Bourgeois, B. Escoffier, V. Paschos, J. Van Rooij : “Fast Algorithms for max independent set”, Algorithmica, vol. 62 (1), pp. 382-415, (Springer Verlag) (2012)
B. Escoffier, L. Gourvès, K. Nguyen, F. Pascual, O. Spanjaard : “Strategy-proof Mechanisms for Facility Location Games with Many Facilities”, 2nd International Conference on Algorithmic Decision Theory (ADT'11), vol. 6992, Lecture Notes in Artificial Intelligence, Piscataway, NJ, United States, pp. 67-81, (Springer) (2011)
B. Escoffier, O. Spanjaard : “Dynamic Programming”, chapter in Concepts of Combinatorial Optimization, pp. 71-98, (ISTE -- Wiley), (ISBN: 9781848211476) (2010)