Bruno Escoffier

885 total citations
21 papers, 214 citations indexed

About

Bruno Escoffier is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Bruno Escoffier has authored 21 papers receiving a total of 214 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Computational Theory and Mathematics, 7 papers in Computer Networks and Communications and 7 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Bruno Escoffier's work include Complexity and Algorithms in Graphs (18 papers), Advanced Graph Theory Research (14 papers) and Computational Geometry and Mesh Generation (7 papers). Bruno Escoffier is often cited by papers focused on Complexity and Algorithms in Graphs (18 papers), Advanced Graph Theory Research (14 papers) and Computational Geometry and Mesh Generation (7 papers). Bruno Escoffier collaborates with scholars based in France, Italy and Netherlands. Bruno Escoffier's co-authors include Vangélis Th. Paschos, Jérôme Monnot, Nicolas Bourgeois, Laurent Gourvès, Johan M. M. van Rooij, Cristina Bazgan, Olivier Spanjaard, Giorgio Ausiello, Peter L. Hammer and Édouard Bonnet and has published in prestigious journals such as European Journal of Operational Research, Theoretical Computer Science and Discrete Applied Mathematics.

In The Last Decade

Bruno Escoffier

20 papers receiving 203 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Bruno Escoffier France 9 144 91 36 32 29 21 214
Stanislav Živný United Kingdom 10 254 1.8× 182 2.0× 15 0.4× 29 0.9× 67 2.3× 53 294
Parinya Chalermsook Germany 7 70 0.5× 53 0.6× 12 0.3× 50 1.6× 20 0.7× 22 128
Rishi Saket United States 9 183 1.3× 84 0.9× 13 0.4× 39 1.2× 89 3.1× 29 272
Sundar Vishwanathan India 10 186 1.3× 156 1.7× 34 0.9× 16 0.5× 38 1.3× 30 282
Lorant Porkolab Germany 9 104 0.7× 128 1.4× 119 3.3× 24 0.8× 32 1.1× 14 267
A. V. Karzanov Russia 7 143 1.0× 68 0.7× 26 0.7× 22 0.7× 31 1.1× 19 213
Sambuddha Roy India 9 90 0.6× 85 0.9× 6 0.2× 13 0.4× 73 2.5× 24 191
Stefan Schamberger Germany 8 52 0.4× 128 1.4× 13 0.4× 13 0.4× 47 1.6× 12 204
Oded Lachish United Kingdom 8 112 0.8× 44 0.5× 13 0.4× 7 0.2× 79 2.7× 26 164
Eyal Ackerman Israel 9 89 0.6× 27 0.3× 15 0.4× 92 2.9× 13 0.4× 26 229

Countries citing papers authored by Bruno Escoffier

Since Specialization
Citations

This map shows the geographic impact of Bruno Escoffier's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Bruno Escoffier with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bruno Escoffier more than expected).

Fields of papers citing papers by Bruno Escoffier

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Bruno Escoffier. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Bruno Escoffier. The network helps show where Bruno Escoffier may publish in the future.

Co-authorship network of co-authors of Bruno Escoffier

This figure shows the co-authorship network connecting the top 25 collaborators of Bruno Escoffier. A scholar is included among the top collaborators of Bruno Escoffier based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Bruno Escoffier. Bruno Escoffier is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Escoffier, Bruno, et al.. (2014). Approximating MAX SAT by moderately exponential and parameterized algorithms. Theoretical Computer Science. 560. 147–157. 2 indexed citations
2.
Bonnet, Édouard, et al.. (2014). Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization. Algorithmica. 71(3). 566–580. 7 indexed citations
3.
Escoffier, Bruno, Jérôme Monnot, Vangélis Th. Paschos, & Mingyu Xiao. (2014). New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set. Theory of Computing Systems. 56(2). 330–346. 5 indexed citations
4.
Bourgeois, Nicolas, et al.. (2013). Exponential approximation schemata for some network design problems. Journal of Discrete Algorithms. 22. 43–52. 2 indexed citations
5.
Escoffier, Bruno, Laurent Gourvès, & Jérôme Monnot. (2012). Fair solutions for some multiagent optimization problems. Autonomous Agents and Multi-Agent Systems. 26(2). 184–201. 12 indexed citations
6.
Escoffier, Bruno, Laurent Gourvès, & Jérôme Monnot. (2012). Strategic Coloring of a Graph. Internet Mathematics. 8(4). 424–455. 1 indexed citations
7.
Bourgeois, Nicolas, Bruno Escoffier, & Vangélis Th. Paschos. (2011). Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discrete Applied Mathematics. 159(17). 1954–1970. 26 indexed citations
8.
Bourgeois, Nicolas, Bruno Escoffier, Vangélis Th. Paschos, & Johan M. M. van Rooij. (2010). Fast Algorithms for max independent set. Algorithmica. 62(1-2). 382–415. 37 indexed citations
9.
Demetrescu, Camil, et al.. (2010). Adapting parallel algorithms to the W-Stream model, with applications to graph problems. Theoretical Computer Science. 411(44-46). 3994–4004. 5 indexed citations
10.
Escoffier, Bruno, Laurent Gourvès, & Jérôme Monnot. (2009). Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. Journal of Discrete Algorithms. 8(1). 36–49. 27 indexed citations
11.
Bourgeois, Nicolas, Bruno Escoffier, & Vangélis Th. Paschos. (2009). Approximation of min coloring by moderately exponential algorithms. Information Processing Letters. 109(16). 950–954. 8 indexed citations
12.
Escoffier, Bruno, Laurent Gourvès, Jérôme Monnot, & Olivier Spanjaard. (2009). Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximation. European Journal of Operational Research. 205(1). 19–30. 10 indexed citations
13.
Escoffier, Bruno & Jérôme Monnot. (2008). A better differential approximation ratio for symmetric TSP. Theoretical Computer Science. 396(1-3). 63–70. 4 indexed citations
14.
Ausiello, Giorgio, Bruno Escoffier, Jérôme Monnot, & Vangélis Th. Paschos. (2008). Reoptimization of minimum and maximum traveling salesman's tours. Journal of Discrete Algorithms. 7(4). 453–463. 14 indexed citations
15.
Escoffier, Bruno, Jérôme Monnot, & Olivier Spanjaard. (2008). Some tractable instances of interval data minmax regret problems. Operations Research Letters. 36(4). 424–429. 4 indexed citations
16.
Escoffier, Bruno & Peter L. Hammer. (2007). Approximation of the Quadratic Set Covering problem. Discrete Optimization. 4(3-4). 378–386. 6 indexed citations
17.
Escoffier, Bruno & Vangélis Th. Paschos. (2006). Completeness in approximation classes beyond APX. Theoretical Computer Science. 359(1-3). 369–377. 9 indexed citations
18.
Croce, Federico Della, Bruno Escoffier, & Vangélis Th. Paschos. (2006). Improved worst-case complexity for the MIN 3-SET COVERING problem. Operations Research Letters. 35(2). 205–210.
19.
Bazgan, Cristina, Bruno Escoffier, & Vangélis Th. Paschos. (2005). Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. Theoretical Computer Science. 339(2-3). 272–292. 27 indexed citations
20.
Escoffier, Bruno & Vangélis Th. Paschos. (2004). Proving completeness by logic. International Journal of Computer Mathematics. 82(2). 151–161. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Stanislav Živný Breakdown of academic impact, for papers by Parinya Chalermsook Breakdown of academic impact, for papers by Rishi Saket Breakdown of academic impact, for papers by Sundar Vishwanathan Breakdown of academic impact, for papers by Lorant Porkolab Breakdown of academic impact, for papers by A. V. Karzanov Breakdown of academic impact, for papers by Sambuddha Roy Breakdown of academic impact, for papers by Stefan Schamberger Breakdown of academic impact, for papers by Oded Lachish Breakdown of academic impact, for papers by Eyal Ackerman
Rankless by CCL
2026