Bruno Escoffier

127 papers A* 4A 6B 24C 4Journal 76Unranked 13

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Approximation results on resource leveling problems. Theor. Comput. Sci. Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier
2025	B	`conf`	Canadian Traveler Problems in Temporal Graphs. WG Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Minh-Hang Nguyen, Mikaël Rabie
2025	—	`conf`	Estimating the Electoral Consequences of Legislative Redistricting in France. FAccT Evripidis Bampis, Thomas Ehrhard, Bruno Escoffier, Claire Mathieu, Fanny Pascual, David Saulpic
2025	A*	`conf`	Polynomial Time Learning Augmented Algorithms for NP-hard Permutation Problems. ICML Evripidis Bampis, Bruno Escoffier, Dimitris Fotakis, Panagiotis Patsilinakos, Michalis Xefteris
2025	J	`jnl`	Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems. CoRR Evripidis Bampis, Bruno Escoffier, Dimitris Fotakis, Panagiotis Patsilinakos, Michalis Xefteris
2025	—	`conf`	Temporal Connectivity Augmentation. SAND Thomas Bellitto, Jules Bouton Popper, Bruno Escoffier
2025	J	`jnl`	Temporal Connectivity Augmentation. CoRR Thomas Bellitto, Jules Bouton Popper, Bruno Escoffier
2024	J	`jnl`	Anchor-robust project scheduling with non-availability periods. Discret. Optim. Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier
2024	J	`jnl`	Anchored rescheduling problem with non-availability periods. Oper. Res. Lett. Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier
2024	J	`jnl`	Canadian Traveller Problems in Temporal Graphs. CoRR Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Minh-Hang Nguyen, Mikaël Rabie
2024	J	`jnl`	Euclidean preferences in the plane under $\varvec{\ell _1},$$\varvec{\ell _2}$ and $\varvec{\ell _\infty }$ norms. Soc. Choice Welf. Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
2024	J	`jnl`	Improved FPT Approximation for Non-metric TSP. CoRR Evripidis Bampis, Bruno Escoffier, Michalis Xefteris
2024	A*	`conf`	Parsimonious Learning-Augmented Approximations for Dense Instances of NP-hard Problems. ICML Evripidis Bampis, Bruno Escoffier, Michalis Xefteris
2024	J	`jnl`	Parsimonious Learning-Augmented Approximations for Dense Instances of NP-hard Problems. CoRR Evripidis Bampis, Bruno Escoffier, Michalis Xefteris
2024	J	`jnl`	Recognizing single-peaked preferences on an arbitrary graph: Complexity and algorithms. Discret. Appl. Math. Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
2024	J	`jnl`	Resource Leveling: Complexity of a UET two-processor scheduling variant and related problems. CoRR Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier
2024	J	`jnl`	Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems. J. Sched. Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier
2023	A	`conf`	Algorithmic Recognition of 2-Euclidean Preferences. ECAI Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
2023	A	`conf`	Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else. ESA Evripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn, Kostas Lakis, Golnoosh Shahkarami, Michalis Xefteris
2023	J	`jnl`	Learning-Augmented Online TSP on Rings, Trees, Flowers and (almost) Everywhere Else. CoRR Evripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn, Kostas Lakis, Golnoosh Shahkarami, Michalis Xefteris
2023	A	`conf`	Online 2-stage Stable Matching. AAMAS Evripidis Bampis, Bruno Escoffier, Paul Youssef
2023	J	`jnl`	Online 2-stage stable matching. Discret. Appl. Math. Evripidis Bampis, Bruno Escoffier, Paul Youssef
2023	B	`conf`	Online TSP with Known Locations. WADS Evripidis Bampis, Bruno Escoffier, Niklas Hahn, Michalis Xefteris
2023	—	`conf`	Restless Exploration of Periodic Temporal Graphs. SAND Thomas Bellitto, Cyril Conchon-Kerjan, Bruno Escoffier
2023	J	`jnl`	Target-based computer-assisted orchestration: Complexity and approximation algorithms. Eur. J. Oper. Res. Evripidis Bampis, Carmine-Emanuele Cella, Bruno Escoffier, Mila Rocco, Alexandre Teiller
2022	J	`jnl`	A simple rounding scheme for multistage optimization. Theor. Comput. Sci. Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Alexander V. Kononov, Kim Thang Nguyen
2022	B	`conf`	Canadian Traveller Problem with Predictions. WAOA Evripidis Bampis, Bruno Escoffier, Michalis Xefteris
2022	J	`jnl`	Canadian Traveller Problem with Predictions. CoRR Evripidis Bampis, Bruno Escoffier, Michalis Xefteris
2022	J	`jnl`	In memory of Jérôme Monnot. Theor. Comput. Sci. Bruno Escoffier, Laurent Gourvès, Vangelis Th. Paschos
2022	J	`jnl`	Multistage knapsack. J. Comput. Syst. Sci. Evripidis Bampis, Bruno Escoffier, Alexandre Teiller
2022	J	`jnl`	Online 2-stage Stable Matching. CoRR Evripidis Bampis, Bruno Escoffier, Paul Youssef
2022	J	`jnl`	Online TSP with Known Locations. CoRR Evripidis Bampis, Bruno Escoffier, Niklas Hahn, Michalis Xefteris
2022	J	`jnl`	Online learning for min-max discrete problems. Theor. Comput. Sci. Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Kim Thang Nguyen
2022	J	`jnl`	Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences. Discret. Appl. Math. Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
2021	J	`jnl`	Kemeny ranking is NP-hard for 2-dimensional Euclidean preferences. CoRR Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
2021	—	`conf`	Measuring Nearly Single-Peakedness of an Electorate: Some New Insights. ADT Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
2021	J	`jnl`	Online Multistage Subset Maximization Problems. Algorithmica Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller
2020	A*	`conf`	Iterative Delegations in Liquid Democracy with Restricted Preferences. AAAI Bruno Escoffier, Hugo Gilbert, Adèle Pass-Lanneau
2020	B	`conf`	LP-Based Algorithms for Multistage Minimization Problems. WAOA Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov
2020	B	`conf`	Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms. SAGT Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
2020	J	`jnl`	Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms. CoRR Bruno Escoffier, Olivier Spanjaard, Magdaléna Tydrichová
2020	A*	`conf`	Social Ranking Manipulability for the CP-Majority, Banzhaf and Lexicographic Excellence Solutions. IJCAI Tahar Allouche, Bruno Escoffier, Stefano Moretti, Meltem Öztürk
2019	J	`jnl`	LP-based algorithms for multistage minimization problems. CoRR Evripidis Bampis, Bruno Escoffier, Alexander V. Kononov
2019	B	`conf`	Multistage Knapsack. MFCS Evripidis Bampis, Bruno Escoffier, Alexandre Teiller
2019	J	`jnl`	Multistage Knapsack. CoRR Evripidis Bampis, Bruno Escoffier, Alexandre Teiller
2019	A	`conf`	Online Multistage Subset Maximization Problems. ESA Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller
2019	J	`jnl`	Online Multistage Subset Maximization Problems. CoRR Evripidis Bampis, Bruno Escoffier, Kevin Schewior, Alexandre Teiller
2019	J	`jnl`	Online-Learning for min-max discrete problems. CoRR Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Kim Thang Nguyen
2019	J	`jnl`	Saving colors and Max Coloring: Some fixed-parameter tractability results. Theor. Comput. Sci. Bruno Escoffier
2019	B	`conf`	The Convergence of Iterative Delegations in Liquid Democracy in a Social Network. SAGT Bruno Escoffier, Hugo Gilbert, Adèle Pass-Lanneau
2019	J	`jnl`	The Convergence of Iterative Delegations in Liquid Democracy in a Social Network. CoRR Bruno Escoffier, Hugo Gilbert, Adèle Pass-Lanneau
2018	A	`conf`	Fair Resource Allocation Over Time. AAMAS Evripidis Bampis, Bruno Escoffier, Sasa Mladenovic
2018	—	`conf`	Multistage Matchings. SWAT Evripidis Bampis, Bruno Escoffier, Michael Lampis, Vangelis Th. Paschos
2018	J	`jnl`	Parameterized Power Vertex Cover. CoRR Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis
2018	J	`jnl`	Parameterized Power Vertex Cover. Discret. Math. Theor. Comput. Sci. Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis
2018	J	`jnl`	Purely combinatorial approximation algorithms for maximum k-vertex cover in bipartite graphs. Discret. Optim. Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
2018	J	`jnl`	The Convergence of Iterative Delegations in Liquid Democracy. CoRR Bruno Escoffier, Hugo Gilbert, Adèle Pass-Lanneau
2017	J	`jnl`	The Price of Optimum: Complexity and Approximation for a Matching Game. Algorithmica Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2016	B	`conf`	A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs. LATIN Édouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
2016	B	`conf`	Parameterized Power Vertex Cover. WG Eric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis
2016	B	`conf`	Saving Colors and Max Coloring: Some Fixed-Parameter Tractability Results. WG Bruno Escoffier
2016	J	`jnl`	Super-polynomial approximation branching algorithms. RAIRO Oper. Res. Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
2015	J	`jnl`	Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization. Algorithmica Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
2015	J	`jnl`	New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set. Theory Comput. Syst. Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao
2015	J	`jnl`	On Subexponential and FPT-Time Inapproximability. Algorithmica Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
2014	J	`jnl`	Approximating MAX SAT by moderately exponential and parameterized algorithms. Theor. Comput. Sci. Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
2014	J	`jnl`	On the approximation of maximum $k$-vertex cover in bipartite graphs. CoRR Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Georgios Stamoulis
2013	B	`conf`	Designing Budget-Balanced Best-Response Mechanisms for Network Coordination Games. SAGT Bruno Escoffier, Diodato Ferraioli, Laurent Gourvès, Stefano Moretti
2013	J	`jnl`	Exponential approximation schemata for some network design problems. J. Discrete Algorithms Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2013	J	`jnl`	Fair solutions for some multiagent optimization problems. Auton. Agents Multi Agent Syst. Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2013	J	`jnl`	Fast algorithms for min independent dominating set. Discret. Appl. Math. Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
2013	B	`conf`	Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization. IPEC Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
2013	J	`jnl`	Multi-parameter complexity analysis for constrained size graph problems: using greediness for parameterization. CoRR Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
2013	B	`conf`	On Subexponential and FPT-Time Inapproximability. IPEC Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
2013	C	`conf`	Truthful Many-to-Many Assignment with Private Weights. CIAC Bruno Escoffier, Jérôme Monnot, Fanny Pascual, Olivier Spanjaard
2012	J	`jnl`	Algorithms for dominating clique problems. Theor. Comput. Sci. Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
2012	C	`conf`	Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms. TAMC Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire
2012	—	`conf`	Cost allocation protocols for network formation on connection situations. VALUETOOLS Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Stefano Moretti
2012	J	`jnl`	Fast Algorithms for max independent set. Algorithmica Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
2012	B	`conf`	New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set. IPEC Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao
2012	J	`jnl`	Strategic Coloring of a Graph. Internet Math. Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2012	J	`jnl`	Subexponential and FPT-time Inapproximability of Independent Set and Related Problems CoRR Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos
2011	J	`jnl`	Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discret. Appl. Math. Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2011	—	`conf`	Strategy-Proof Mechanisms for Facility Location Games with Many Facilities. ADT Bruno Escoffier, Laurent Gourvès, Kim Thang Nguyen, Fanny Pascual, Olivier Spanjaard
2011	B	`conf`	The Price of Optimum in a Matching Game. SAGT Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2010	—	`conf`	A Bottom-Up Method and Fast Algorithms for max independent set. SWAT Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
2010	J	`jnl`	A survey on the structure of approximation classes. Comput. Sci. Rev. Bruno Escoffier, Vangelis Th. Paschos
2010	J	`jnl`	Adapting parallel algorithms to the W-Stream model, with applications to graph problems. Theor. Comput. Sci. Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini
2010	J	`jnl`	Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. J. Discrete Algorithms Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2010	B	`conf`	Fast Algorithms for min independent dominating set. SIROCCO Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2010	C	`conf`	Maximum Independent Set in Graphs of Average Degree at Most Three in TAMC Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
2010	J	`jnl`	Minimum regulation of uncoordinated matchings CoRR Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2010	B	`conf`	On the Impact of Local Taxes in a Set Cover Game. SIROCCO Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2010	C	`conf`	Strategic Coloring of a Graph. CIAC Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2010	J	`jnl`	Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation. Eur. J. Oper. Res. Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Olivier Spanjaard
2009	J	`jnl`	Approximation of min coloring by moderately exponential algorithms. Inf. Process. Lett. Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2009	B	`conf`	Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. WADS Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2009	J	`jnl`	Efficient approximation of min set cover by moderately exponential algorithms. Theor. Comput. Sci. Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2009	B	`conf`	Exact Algorithms for Dominating Clique Problems. ISAAC Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
2009	J	`jnl`	Fast Algorithms for Max Independent Set in Graphs of Small Average Degree CoRR Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij
2009	J	`jnl`	Fast algorithms for min independent dominating set CoRR Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2009	J	`jnl`	Probabilistic graph-coloring in bipartite and split graphs. J. Comb. Optim. Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos
2009	J	`jnl`	Reoptimization of minimum and maximum traveling salesman's tours. J. Discrete Algorithms Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
2009	J	`jnl`	Simple and Fast Reoptimizations for the Steiner Tree Problem. Algorithmic Oper. Res. Bruno Escoffier, Martin Milanic, Vangelis Th. Paschos
2009	J	`jnl`	Weighted coloring on planar, bipartite and split graphs: Complexity and approximation. Discret. Appl. Math. Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
2008	J	`jnl`	A better differential approximation ratio for symmetric TSP. Theor. Comput. Sci. Bruno Escoffier, Jérôme Monnot
2008	—	`conf`	An O*(1.0977 IWPEC Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
2008	A	`conf`	Single-peaked consistency and its complexity. ECAI Bruno Escoffier, Jérôme Lang, Meltem Öztürk
2008	B	`conf`	Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. SOFSEM Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard
2008	J	`jnl`	Some tractable instances of interval data minmax regret problems. Oper. Res. Lett. Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard
2007	B	`conf`	Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems. MFCS Camil Demetrescu, Bruno Escoffier, Gabriel Moruz, Andrea Ribichini
2007	J	`jnl`	Approximation of the Quadratic Set Covering problem. Discret. Optim. Bruno Escoffier, Peter L. Hammer
2007	B	`conf`	Complexity and Approximation Results for the Connected Vertex Cover Problem. WG Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
2007	J	`jnl`	Differential approximation of min sat. Eur. J. Oper. Res. Bruno Escoffier, Vangelis Th. Paschos
2007	J	`jnl`	Improved worst-case complexity for the MIN 3-SET COVERING problem. Oper. Res. Lett. Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos
2007	J	`jnl`	Polynomial approximation: a structural and operational study. 4OR Bruno Escoffier
2006	J	`jnl`	Completeness in approximation classes beyond APX. Theor. Comput. Sci. Bruno Escoffier, Vangelis Th. Paschos
2006	J	`jnl`	On-line models and algorithms for max independent set. RAIRO Oper. Res. Bruno Escoffier, Vangelis Th. Paschos
2006	—	`conf`	Reoptimization of Minimum and Maximum Traveling Salesman's Tours. SWAT Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
2006	J	`jnl`	Weighted Coloring: further complexity and approximability results. Inf. Process. Lett. Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
2005	J	`jnl`	Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. Theor. Comput. Sci. Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos
2005	—	`conf`	Differential Approximation of min sat, max sat and Related Problems. ICCSA (4) Bruno Escoffier, Vangelis Th. Paschos
2005	—	`conf`	Probabilistic Coloring of Bipartite and Split Graphs. ICCSA (4) Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos
2005	J	`jnl`	Proving completeness by logic. Int. J. Comput. Math. Bruno Escoffier, Vangelis Th. Paschos
2005	—	`conf`	Weighted Coloring: Further Complexity and Approximability Results. ICTCS Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
2004	B	`conf`	Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. ISAAC Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos
2004	B	`conf`	Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. ISAAC Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier