| 2025 | ICML | Polynomial Time Learning Augmented Algorithms for NP-hard Permutation Problems. | Evripidis Bampis, Bruno Escoffier, Dimitris Fotakis, Panagiotis Patsilinakos, Michalis Xefteris |
| 2025 | WG | Canadian Traveler Problems in Temporal Graphs. | Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Minh-Hang Nguyen, Mikal Rabie |
| 2024 | ICML | Parsimonious Learning-Augmented Approximations for Dense Instances of NP-hard Problems. | Evripidis Bampis, Bruno Escoffier, Michalis Xefteris |
| 2023 | ECAI | Algorithmic Recognition of 2-Euclidean Preferences. | Bruno Escoffier, Olivier Spanjaard, Magdalna Tydrichov |
| 2023 | ESA | Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else. | Evripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn, Kostas Lakis, Golnoosh Shahkarami, Michalis Xefteris |
| 2023 | WADS | Online TSP with Known Locations. | Evripidis Bampis, Bruno Escoffier, Niklas Hahn, Michalis Xefteris |
| 2022 | WAOA | Canadian Traveller Problem with Predictions. | Evripidis Bampis, Bruno Escoffier, Michalis Xefteris |
| 2020 | AAAI | Iterative Delegations in Liquid Democracy with Restricted Preferences. | Bruno Escoffier, Hugo Gilbert, Adle Pass-Lanneau |
| 2020 | IJCAI | Social Ranking Manipulability for the CP-Majority, Banzhaf and Lexicographic Excellence Solutions. | Tahar Allouche, Bruno Escoffier, Stefano Moretti, Meltem ztrk |
| 2020 | SAGT | Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms. | Bruno Escoffier, Olivier Spanjaard, Magdalna Tydrichov |
| 2020 | WAOA | LP-Based Algorithms for Multistage Minimization Problems. | Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov |
| 2019 | ESA | Online Multistage Subset Maximization Problems. | Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller |
| 2019 | MFCS | Multistage Knapsack. | Evripidis Bampis, Bruno Escoffier, Alexandre Teiller |
| 2019 | SAGT | The Convergence of Iterative Delegations in Liquid Democracy in a Social Network. | Bruno Escoffier, Hugo Gilbert, Adle Pass-Lanneau |
| 2016 | LATIN | A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. | douard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis |
| 2016 | WG | Parameterized Power Vertex Cover. | Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis |
| 2016 | WG | Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results. | Bruno Escoffier |
| 2013 | CIAC | Truthful Many-to-Many Assignment with Private Weights. | Bruno Escoffier, Jrme Monnot, Fanny Pascual, Olivier Spanjaard |
| 2013 | SAGT | Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games. | Bruno Escoffier, Diodato Ferraioli, Laurent Gourvs, Stefano Moretti |
| 2012 | TAMC | Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms. | Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire |
| 2011 | SAGT | The Price of Optimum in a Matching Game. | Bruno Escoffier, Laurent Gourvs, Jrme Monnot |
| 2010 | CIAC | Strategic Coloring of a Graph. | Bruno Escoffier, Laurent Gourvs, Jrme Monnot |
| 2010 | SIROCCO | Fast Algorithms for min independent dominating set. | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
| 2010 | SIROCCO | On the Impact of Local Taxes in a Set Cover Game. | Bruno Escoffier, Laurent Gourvs, Jrme Monnot |
| 2010 | TAMC | Maximum Independent Set in Graphs of Average Degree at Most Three in | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij |
| 2009 | ISAAC | Exact Algorithms for Dominating Clique Problems. | Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos |
| 2009 | WADS | Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
| 2008 | ECAI | Single-peaked consistency and its complexity. | Bruno Escoffier, Jrme Lang, Meltem ztrk |
| 2008 | SOFSEM | Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. | Bruno Escoffier, Jrme Monnot, Olivier Spanjaard |
| 2007 | MFCS | Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems. | Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini |
| 2007 | WG | Complexity and Approximation Results for the Connected Vertex Cover Problem. | Bruno Escoffier, Laurent Gourvs, Jrme Monnot |
| 2005 | ICCSA | Probabilistic Coloring of Bipartite and Split Graphs. | Federico Della Croce, Bruno Escoffier, Ccile Murat, Vangelis Th. Paschos |
| 2005 | ICCSA | Differential Approximation of min sat, max sat and Related Problems. | Bruno Escoffier, Vangelis Th. Paschos |
| 2004 | ISAAC | Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. | Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos |
| 2004 | ISAAC | Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. | Jrme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier |