Bruno Escoffier

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 54

Top Venues

Publications

Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier
Resource Leveling: Complexity of a UET two-processor scheduling variant and related problems. CoRR (2024)
Evripidis Bampis, Bruno Escoffier, Michalis Xefteris
Improved FPT Approximation for Non-metric TSP. CoRR (2024)
Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
Recognizing single-peaked preferences on an arbitrary graph: Complexity and algorithms. Discret. Appl. Math. 348 (2024)
Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
Euclidean preferences in the plane under $\varvec{\ell _1},$$\varvec{\ell _2}$ and $\varvec{\ell _\infty }$ norms. Soc. Choice Welf. 63 (1) (2024)
Evripidis Bampis, Bruno Escoffier, Michalis Xefteris
Parsimonious Learning-Augmented Approximations for Dense Instances of NP-hard Problems. CoRR (2024)
Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Minh-Hang Nguyen, Mikaël Rabie
Canadian Traveller Problems in Temporal Graphs. CoRR (2024)
Evripidis Bampis, Bruno Escoffier, Niklas Hahn, Michalis Xefteris
Online TSP with Known Locations. WADS (2023)
Evripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn, Kostas Lakis, Golnoosh Shahkarami, Michalis Xefteris
Learning-Augmented Online TSP on Rings, Trees, Flowers and (almost) Everywhere Else. CoRR (2023)
Evripidis Bampis, Carmine-Emanuele Cella, Bruno Escoffier, Mila Rocco, Alexandre Teiller
Target-based computer-assisted orchestration: Complexity and approximation algorithms. Eur. J. Oper. Res. 304 (3) (2023)
Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
Algorithmic Recognition of 2-Euclidean Preferences. ECAI (2023)
Evripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn, Kostas Lakis, Golnoosh Shahkarami, Michalis Xefteris
Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else. ESA (2023)
Evripidis Bampis, Bruno Escoffier, Paul Youssef
Online 2-stage stable matching. Discret. Appl. Math. 341 (2023)
Thomas Bellitto, Cyril Conchon-Kerjan, Bruno Escoffier
Restless Exploration of Periodic Temporal Graphs. SAND (2023)
Evripidis Bampis, Bruno Escoffier, Paul Youssef
Online 2-stage Stable Matching. AAMAS (2023)
Evripidis Bampis, Bruno Escoffier, Paul Youssef
Online 2-stage Stable Matching. CoRR (2022)
Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences. Discret. Appl. Math. 318 (2022)
Bruno Escoffier, Laurent Gourvès, Vangelis Th. Paschos
In memory of Jérôme Monnot. Theor. Comput. Sci. 921 (2022)
Evripidis Bampis, Bruno Escoffier, Alexandre Teiller
Multistage knapsack. J. Comput. Syst. Sci. 126 (2022)
Evripidis Bampis, Bruno Escoffier, Michalis Xefteris
Canadian Traveller Problem with Predictions. CoRR (2022)
Evripidis Bampis, Bruno Escoffier, Niklas Hahn, Michalis Xefteris
Online TSP with Known Locations. CoRR (2022)
Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Alexander V. Kononov, Kim Thang Nguyen
A simple rounding scheme for multistage optimization. Theor. Comput. Sci. 907 (2022)
Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Kim Thang Nguyen
Online learning for min-max discrete problems. Theor. Comput. Sci. 930 (2022)
Evripidis Bampis, Bruno Escoffier, Michalis Xefteris
Canadian Traveller Problem with Predictions. WAOA (2022)
Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller
Online Multistage Subset Maximization Problems. Algorithmica 83 (8) (2021)
Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
Kemeny ranking is NP-hard for 2-dimensional Euclidean preferences. CoRR (2021)
Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
Measuring Nearly Single-Peakedness of an Electorate: Some New Insights. ADT (2021)
Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov
LP-Based Algorithms for Multistage Minimization Problems. WAOA (2020)
Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms. SAGT (2020)
Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms. CoRR (2020)
Tahar Allouche, Bruno Escoffier, Stefano Moretti, Meltem Öztürk
Social Ranking Manipulability for the CP-Majority, Banzhaf and Lexicographic Excellence Solutions. IJCAI (2020)
Bruno Escoffier, Hugo Gilbert, Adèle Pass-Lanneau
Iterative Delegations in Liquid Democracy with Restricted Preferences. AAAI (2020)
Bruno Escoffier, Hugo Gilbert, Adèle Pass-Lanneau
The Convergence of Iterative Delegations in Liquid Democracy in a Social Network. SAGT (2019)
Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Kim Thang Nguyen
Online-Learning for min-max discrete problems. CoRR (2019)
Bruno Escoffier, Hugo Gilbert, Adèle Pass-Lanneau
The Convergence of Iterative Delegations in Liquid Democracy in a Social Network. CoRR (2019)
Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller
Online Multistage Subset Maximization Problems. ESA (2019)
Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov
LP-based algorithms for multistage minimization problems. CoRR (2019)
Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller
Online Multistage Subset Maximization Problems. CoRR (2019)
Bruno Escoffier
Saving colors and Max Coloring: Some fixed-parameter tractability results. Theor. Comput. Sci. 758 (2019)
Evripidis Bampis, Bruno Escoffier, Alexandre Teiller
Multistage Knapsack. CoRR (2019)
Evripidis Bampis, Bruno Escoffier, Alexandre Teiller
Multistage Knapsack. MFCS (2019)
Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs. Discret. Optim. 27 (2018)
Evripidis Bampis, Bruno Escoffier, Michael Lampis, Vangelis Th. Paschos
Multistage Matchings. SWAT (2018)
Evripidis Bampis, Bruno Escoffier, Sasa Mladenovic
Fair Resource Allocation Over Time. AAMAS (2018)
Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis
Parameterized Power Vertex Cover. CoRR (2018)
Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis
Parameterized Power Vertex Cover. Discret. Math. Theor. Comput. Sci. 20 (2) (2018)
Bruno Escoffier, Hugo Gilbert, Adèle Pass-Lanneau
The Convergence of Iterative Delegations in Liquid Democracy. CoRR (2018)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
The Price of Optimum: Complexity and Approximation for a Matching Game. Algorithmica 77 (3) (2017)
Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. LATIN (2016)
Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
Super-polynomial approximation branching algorithms. RAIRO Oper. Res. 50 (4-5) (2016)
Bruno Escoffier
Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results. WG (2016)
Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis
Parameterized Power Vertex Cover. WG (2016)
Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization. Algorithmica 71 (3) (2015)
Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao
New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set. Theory Comput. Syst. 56 (2) (2015)
Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
On Subexponential and FPT-Time Inapproximability. Algorithmica 71 (3) (2015)
Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
Approximating MAX SAT by moderately exponential and parameterized algorithms. Theor. Comput. Sci. 560 (2014)
Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
On the approximation of maximum $k$-vertex cover in bipartite graphs. CoRR (2014)
Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
Exponential approximation schemata for some network design problems. J. Discrete Algorithms 22 (2013)
Bruno Escoffier, Jérôme Monnot, Fanny Pascual, Olivier Spanjaard
Truthful Many-to-Many Assignment with Private Weights. CIAC (2013)
Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
Multi-parameter complexity analysis for constrained size graph problems: using greediness for parameterization. CoRR (2013)
Bruno Escoffier, Diodato Ferraioli, Laurent Gourvès, Stefano Moretti
Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games. SAGT (2013)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
Fair solutions for some multiagent optimization problems. Auton. Agents Multi Agent Syst. 26 (2) (2013)
Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
On Subexponential and FPT-Time Inapproximability. IPEC (2013)
Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization. IPEC (2013)
Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
Fast algorithms for min independent dominating set. Discret. Appl. Math. 161 (4-5) (2013)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
Fast Algorithms for max independent set. Algorithmica 62 (1-2) (2012)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
Strategic Coloring of a Graph. Internet Math. 8 (4) (2012)
Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
Subexponential and FPT-time Inapproximability of Independent Set and Related Problems CoRR (2012)
Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
Algorithms for dominating clique problems. Theor. Comput. Sci. 459 (2012)
Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms. TAMC (2012)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Stefano Moretti
Cost allocation protocols for network formation on connection situations. VALUETOOLS (2012)
Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao
New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set. IPEC (2012)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discret. Appl. Math. 159 (17) (2011)
Bruno Escoffier, Laurent Gourvès, Kim Thang Nguyen, Fanny Pascual, Olivier Spanjaard
Strategy-Proof Mechanisms for Facility Location Games with Many Facilities. ADT (2011)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
The Price of Optimum in a Matching Game. SAGT (2011)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
Fast Algorithms for min independent dominating set. SIROCCO (2010)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
Strategic Coloring of a Graph. CIAC (2010)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
Minimum regulation of uncoordinated matchings CoRR (2010)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
){\mathcal O}(1.08537^n). TAMC (2010)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. J. Discrete Algorithms 8 (1) (2010)
Bruno Escoffier, Vangelis Th. Paschos
A survey on the structure of approximation classes. Comput. Sci. Rev. 4 (1) (2010)
Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini
Adapting parallel algorithms to the W-Stream model, with applications to graph problems. Theor. Comput. Sci. 411 (44-46) (2010)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
A Bottom-Up Method and Fast Algorithms for max independent set. SWAT (2010)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
On the Impact of Local Taxes in a Set Cover Game. SIROCCO (2010)
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Olivier Spanjaard
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation. Eur. J. Oper. Res. 205 (1) (2010)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
Efficient approximation of min set cover by moderately exponential algorithms. Theor. Comput. Sci. 410 (21-23) (2009)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
Approximation of min coloring by moderately exponential algorithms. Inf. Process. Lett. 109 (16) (2009)
Bruno Escoffier, Martin Milanic, Vangelis Th. Paschos
Simple and Fast Reoptimizations for the Steiner Tree Problem. Algorithmic Oper. Res. 4 (2) (2009)
Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos
Probabilistic graph-coloring in bipartite and split graphs. J. Comb. Optim. 17 (3) (2009)
Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
Exact Algorithms for Dominating Clique Problems. ISAAC (2009)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
Fast Algorithms for Max Independent Set in Graphs of Small Average Degree CoRR (2009)
Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
Reoptimization of minimum and maximum traveling salesman's tours. J. Discrete Algorithms 7 (4) (2009)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. WADS (2009)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
Fast algorithms for min independent dominating set CoRR (2009)
Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discret. Appl. Math. 157 (4) (2009)
Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
) Exact Algorithm for max independent set in Sparse Graphs. IWPEC (2008)
Bruno Escoffier, Jérôme Lang, Meltem Öztürk
Single-peaked consistency and its complexity. ECAI (2008)
Bruno Escoffier, Jérôme Monnot
A better differential approximation ratio for symmetric TSP. Theor. Comput. Sci. 396 (1-3) (2008)
Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard
Some tractable instances of interval data minmax regret problems. Oper. Res. Lett. 36 (4) (2008)
Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. SOFSEM (2008)
Bruno Escoffier
Polynomial approximation: a structural and operational study. 4OR 5 (2) (2007)

Bruno Escoffier.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Bruno Escoffier