Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. - Cristina Bazgan; Bruno Escoffier; Vangelis Th. Paschos (ISAAC, 2004)

Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. - Jérôme Monnot; Vangelis Th. Paschos; Dominique de Werra; Marc Demange; Bruno Escoffier (ISAAC, 2004)

Probabilistic Coloring of Bipartite and Split Graphs. - Federico Della Croce; Bruno Escoffier; Cécile Murat; Vangelis Th. Paschos (ICCSA (4), 2005)

Differential Approximation of min sat, max sat and Related Problems. - Bruno Escoffier; Vangelis Th. Paschos (ICCSA (4), 2005)

Proving completeness by logic. - Bruno Escoffier; Vangelis Th. Paschos (Int. J. Comput. Math., 2005)

Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. - Cristina Bazgan; Bruno Escoffier; Vangelis Th. Paschos (Theor. Comput. Sci., 2005)

Weighted Coloring: further complexity and approximability results. - Bruno Escoffier; Jérôme Monnot; Vangelis Th. Paschos (Inf. Process. Lett., 2006)

On-line models and algorithms for max independent set. - Bruno Escoffier; Vangelis Th. Paschos (RAIRO Oper. Res., 2006)

Completeness in approximation classes beyond APX. - Bruno Escoffier; Vangelis Th. Paschos (Theor. Comput. Sci., 2006)

Complexity and Approximation Results for the Connected Vertex Cover Problem. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot (WG, 2007)

Polynomial approximation: a structural and operational study. - Bruno Escoffier (4OR, 2007)

Approximation of the Quadratic Set Covering problem. - Bruno Escoffier; Peter L. Hammer (Discret. Optim., 2007)

Differential approximation of min sat. - Bruno Escoffier; Vangelis Th. Paschos (Eur. J. Oper. Res., 2007)

Improved worst-case complexity for the MIN 3-SET COVERING problem. - Federico Della Croce; Bruno Escoffier; Vangelis Th. Paschos (Oper. Res. Lett., 2007)

Single-peaked consistency and its complexity. - Bruno Escoffier; Jérôme Lang; Meltem Öztürk (ECAI, 2008)

An O*(1.0977n) Exact Algorithm for max independent set in Sparse Graphs. - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos (IWPEC, 2008)

Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. - Bruno Escoffier; Jérôme Monnot; Olivier Spanjaard (SOFSEM, 2008)

Some tractable instances of interval data minmax regret problems. - Bruno Escoffier; Jérôme Monnot; Olivier Spanjaard (Oper. Res. Lett., 2008)

A better differential approximation ratio for symmetric TSP. - Bruno Escoffier; Jérôme Monnot (Theor. Comput. Sci., 2008)

Exact Algorithms for Dominating Clique Problems. - Nicolas Bourgeois; Federico Della Croce; Bruno Escoffier; Vangelis Th. Paschos (ISAAC, 2009)

Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos (WADS, 2009)

Simple and Fast Reoptimizations for the Steiner Tree Problem. - Bruno Escoffier; Martin Milanic; Vangelis Th. Paschos (Algorithmic Oper. Res., 2009)

Fast Algorithms for Max Independent Set in Graphs of Small Average Degree - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos; Johan M. M. van Rooij (CoRR, 2009)

Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. - Dominique de Werra; Marc Demange; Bruno Escoffier; Jérôme Monnot; Vangelis Th. Paschos (Discret. Appl. Math., 2009)

Approximation of min coloring by moderately exponential algorithms. - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos (Inf. Process. Lett., 2009)

Probabilistic graph-coloring in bipartite and split graphs. - Nicolas Bourgeois; Federico Della Croce; Bruno Escoffier; Cécile Murat; Vangelis Th. Paschos (J. Comb. Optim., 2009)

Reoptimization of minimum and maximum traveling salesman's tours. - Giorgio Ausiello; Bruno Escoffier; Jérôme Monnot; Vangelis Th. Paschos (J. Discrete Algorithms, 2009)

Efficient approximation of min set cover by moderately exponential algorithms. - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos (Theor. Comput. Sci., 2009)

Fast Algorithms for min independent dominating set. - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos (SIROCCO, 2010)

On the Impact of Local Taxes in a Set Cover Game. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot (SIROCCO, 2010)

A Bottom-Up Method and Fast Algorithms for max independent set. - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos; Johan M. M. van Rooij (SWAT, 2010)

Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n){ mathcal O}(1.08537^n). - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos; Johan M. M. van Rooij (TAMC, 2010)

Minimum regulation of uncoordinated matchings - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot (CoRR, 2010)

A survey on the structure of approximation classes. - Bruno Escoffier; Vangelis Th. Paschos (Comput. Sci. Rev., 2010)

Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot; Olivier Spanjaard (Eur. J. Oper. Res., 2010)

Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot (J. Discrete Algorithms, 2010)

Adapting parallel algorithms to the W-Stream model, with applications to graph problems. - Camil Demetrescu; Bruno Escoffier; Gabriel Moruz; Andrea Ribichini (Theor. Comput. Sci., 2010)

Strategy-Proof Mechanisms for Facility Location Games with Many Facilities. - Bruno Escoffier; Laurent Gourvès; Kim Thang Nguyen; Fanny Pascual; Olivier Spanjaard (ADT, 2011)

The Price of Optimum in a Matching Game. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot (SAGT, 2011)

Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos (Discret. Appl. Math., 2011)

New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set. - Bruno Escoffier; Jérôme Monnot; Vangelis Th. Paschos; Mingyu Xiao 001 (IPEC, 2012)

Cost allocation protocols for network formation on connection situations. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot; Stefano Moretti 001 (VALUETOOLS, 2012)

Fast Algorithms for max independent set. - Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos; Johan M. M. van Rooij (Algorithmica, 2012)

Subexponential and FPT-time Inapproximability of Independent Set and Related Problems - Bruno Escoffier; Eun Jung Kim 002; Vangelis Th. Paschos (CoRR, 2012)

Strategic Coloring of a Graph. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot (Internet Math., 2012)

Algorithms for dominating clique problems. - Nicolas Bourgeois; Federico Della Croce; Bruno Escoffier; Vangelis Th. Paschos (Theor. Comput. Sci., 2012)

Truthful Many-to-Many Assignment with Private Weights. - Bruno Escoffier; Jérôme Monnot; Fanny Pascual; Olivier Spanjaard (CIAC, 2013)

Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization. - Edouard Bonnet; Bruno Escoffier; Vangelis Th. Paschos; Emeric Tourniaire (IPEC, 2013)

Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games. - Bruno Escoffier; Diodato Ferraioli; Laurent Gourvès; Stefano Moretti 001 (SAGT, 2013)

Fair solutions for some multiagent optimization problems. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot (Auton. Agents Multi Agent Syst., 2013)

Fast algorithms for min independent dominating set. - Nicolas Bourgeois; Federico Della Croce; Bruno Escoffier; Vangelis Th. Paschos (Discret. Appl. Math., 2013)

Exponential approximation schemata for some network design problems. - Nicolas Boria; Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos (J. Discrete Algorithms, 2013)

On the approximation of maximum $k$-vertex cover in bipartite graphs. - Edouard Bonnet; Bruno Escoffier; Vangelis Th. Paschos; Georgios Stamoulis (CoRR, 2014)

Approximating MAX SAT by moderately exponential and parameterized algorithms. - Bruno Escoffier; Vangelis Th. Paschos; Emeric Tourniaire (Theor. Comput. Sci., 2014)

On Subexponential and FPT-Time Inapproximability. - Edouard Bonnet; Bruno Escoffier; Eun Jung Kim 002; Vangelis Th. Paschos (Algorithmica, 2015)

Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization. - Edouard Bonnet; Bruno Escoffier; Vangelis Th. Paschos; Emeric Tourniaire (Algorithmica, 2015)

New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set. - Bruno Escoffier; Jérôme Monnot; Vangelis Th. Paschos; Mingyu Xiao 001 (Theory Comput. Syst., 2015)

A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. - Édouard Bonnet; Bruno Escoffier; Vangelis Th. Paschos; Georgios Stamoulis (LATIN, 2016)

Super-polynomial approximation branching algorithms. - Bruno Escoffier; Vangelis Th. Paschos; Emeric Tourniaire (RAIRO Oper. Res., 2016)

The Price of Optimum: Complexity and Approximation for a Matching Game. - Bruno Escoffier; Laurent Gourvès; Jérôme Monnot (Algorithmica, 2017)

Fair Resource Allocation Over Time. - Evripidis Bampis; Bruno Escoffier; Sasa Mladenovic (AAMAS, 2018)

Multistage Matchings. - Evripidis Bampis; Bruno Escoffier; Michael Lampis; Vangelis Th. Paschos (SWAT, 2018)

The Convergence of Iterative Delegations in Liquid Democracy. - Bruno Escoffier; Hugo Gilbert; Adèle Pass-Lanneau (CoRR, 2018)

Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs. - Édouard Bonnet; Bruno Escoffier; Vangelis Th. Paschos; Georgios Stamoulis (Discret. Optim., 2018)

Parameterized Power Vertex Cover. - Eric Angel; Evripidis Bampis; Bruno Escoffier; Michael Lampis (Discret. Math. Theor. Comput. Sci., 2018)

The Convergence of Iterative Delegations in Liquid Democracy in a Social Network. - Bruno Escoffier; Hugo Gilbert; Adèle Pass-Lanneau (SAGT, 2019)

Saving colors and Max Coloring: Some fixed-parameter tractability results. - Bruno Escoffier (Theor. Comput. Sci., 2019)

Iterative Delegations in Liquid Democracy with Restricted Preferences. - Bruno Escoffier; Hugo Gilbert; Adèle Pass-Lanneau (AAAI, 2020)

Social Ranking Manipulability for the CP-Majority, Banzhaf and Lexicographic Excellence Solutions. - Tahar Allouche; Bruno Escoffier; Stefano Moretti 001; Meltem Öztürk (IJCAI, 2020)

LP-Based Algorithms for Multistage Minimization Problems. - Evripidis Bampis; Bruno Escoffier; Alexander V. Kononov (WAOA, 2020)

Measuring Nearly Single-Peakedness of an Electorate: Some New Insights. - Bruno Escoffier; Olivier Spanjaard; Magdaléna Tydrichová (ADT, 2021)

Online Multistage Subset Maximization Problems. - Evripidis Bampis; Bruno Escoffier; Kevin Schewior; Alexandre Teiller (Algorithmica, 2021)

Kemeny ranking is NP-hard for 2-dimensional Euclidean preferences. - Bruno Escoffier; Olivier Spanjaard; Magdaléna Tydrichová (CoRR, 2021)

Canadian Traveller Problem with Predictions. - Evripidis Bampis; Bruno Escoffier; Michalis Xefteris (WAOA, 2022)

Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences. - Bruno Escoffier; Olivier Spanjaard; Magdaléna Tydrichová (Discret. Appl. Math., 2022)

Multistage knapsack. - Evripidis Bampis; Bruno Escoffier; Alexandre Teiller (J. Comput. Syst. Sci., 2022)

A simple rounding scheme for multistage optimization. - Evripidis Bampis; Dimitris Christou; Bruno Escoffier; Alexander V. Kononov; Kim Thang Nguyen (Theor. Comput. Sci., 2022)

Online learning for min-max discrete problems. - Evripidis Bampis; Dimitris Christou; Bruno Escoffier; Kim Thang Nguyen (Theor. Comput. Sci., 2022)

In memory of Jérôme Monnot. - Bruno Escoffier; Laurent Gourvès; Vangelis Th. Paschos (Theor. Comput. Sci., 2022)

Algorithmic Recognition of 2-Euclidean Preferences. - Bruno Escoffier; Olivier Spanjaard; Magdaléna Tydrichová (ECAI, 2023)

Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else. - Evripidis Bampis; Bruno Escoffier; Themis Gouleakis; Niklas Hahn 001; Kostas Lakis; Golnoosh Shahkarami; Michalis Xefteris (ESA, 2023)

Restless Exploration of Periodic Temporal Graphs. - Thomas Bellitto; Cyril Conchon-Kerjan; Bruno Escoffier (SAND, 2023)

Online TSP with Known Locations. - Evripidis Bampis; Bruno Escoffier; Niklas Hahn 001; Michalis Xefteris (WADS, 2023)

Target-based computer-assisted orchestration: Complexity and approximation algorithms. - Evripidis Bampis; Carmine-Emanuele Cella; Bruno Escoffier; Mila Rocco; Alexandre Teiller (Eur. J. Oper. Res., 2023)

Online 2-stage stable matching. - Evripidis Bampis; Bruno Escoffier; Paul Youssef (Discret. Appl. Math., 2023)

Parsimonious Learning-Augmented Approximations for Dense Instances of NP-hard Problems. - Evripidis Bampis; Bruno Escoffier; Michalis Xefteris (ICML, 2024)

Resource Leveling: Complexity of a UET two-processor scheduling variant and related problems. - Pascale Bendotti; Luca Brunod-Indrigo; Philippe Chrétienne; Bruno Escoffier (CoRR, 2024)

Improved FPT Approximation for Non-metric TSP. - Evripidis Bampis; Bruno Escoffier; Michalis Xefteris (CoRR, 2024)

Canadian Traveller Problems in Temporal Graphs. - Thomas Bellitto; Johanne Cohen; Bruno Escoffier; Minh-Hang Nguyen; Mikaël Rabie (CoRR, 2024)

Recognizing single-peaked preferences on an arbitrary graph: Complexity and algorithms. - Bruno Escoffier; Olivier Spanjaard; Magdaléna Tydrichová (Discret. Appl. Math., 2024)

Anchor-robust project scheduling with non-availability periods. - Pascale Bendotti; Luca Brunod-Indrigo; Philippe Chrétienne; Bruno Escoffier (Discret. Optim., 2024)

Anchored rescheduling problem with non-availability periods. - Pascale Bendotti; Luca Brunod-Indrigo; Philippe Chrétienne; Bruno Escoffier (Oper. Res. Lett., 2024)

Euclidean preferences in the plane under $ varvec{ ell _1},$$ varvec{ ell _2}$ and $ varvec{ ell _ infty }$ norms. - Bruno Escoffier; Olivier Spanjaard; Magdaléna Tydrichová (Soc. Choice Welf., 2024)

Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems. - Pascale Bendotti; Luca Brunod-Indrigo; Philippe Chrétienne; Bruno Escoffier (J. Sched., 2024)

Estimating the Electoral Consequences of Legislative Redistricting in France. - Evripidis Bampis; Thomas Ehrhard; Bruno Escoffier; Claire Mathieu; Fanny Pascual; David Saulpic (FAccT, 2025)

Temporal Connectivity Augmentation. - Thomas Bellitto; Jules Bouton Popper; Bruno Escoffier (SAND, 2025)

Approximation results on resource leveling problems. - Pascale Bendotti; Luca Brunod-Indrigo; Philippe Chrétienne; Bruno Escoffier (Theor. Comput. Sci., 2025)

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems. - Evripidis Bampis; Bruno Escoffier; Dimitris Fotakis 001; Panagiotis Patsilinakos; Michalis Xefteris (CoRR, 2025)