Bruno Escoffier
- Computational Theory and Mathematics
- Molecular Biology
- Computer Networks and Communications
- Genetics
- Electrical and Electronic Engineering
- Co-authors
- Jérôme MonnotGilbert LanéelleMarie‐Claude TrombeVangélis Th. PaschosEun Jung KimÉdouard BonnetGeorgios StamoulisEvripidis Bampis
- Topics
- Advanced Graph Theory Research (6 papers)Complexity and Algorithms in Graphs (4 papers)Optimization and Search Problems (2 papers)
- Cited by
- Computational Theory and MathematicsComputer Graphics and Computer-Aided DesignDiscrete Mathematics and Combinatorics
- Partner nations
- FranceUnited StatesNetherlands
In The Last Decade
Bruno Escoffier
11 papers receiving 79 citations
Peers
Comparison fields: 5 of 38
- Computational Theory and Mathematics 34
- Molecular Biology 24
- Computer Networks and Communications 19
- Genetics 9
- Electrical and Electronic Engineering 9
Countries citing papers authored by Bruno Escoffier
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 0 | |
| 3 | 1 | |
| 4 | 1 | |
| 5 | 0 | |
| 6 | 2 | |
| 7 | 2 | |
| 8 | 1 | |
| 9 | 1 | |
| 10 | 10 | |
| 11 | Reoptimization of minimum and maximum traveling salesman’s tours | 0 |
| 12 | 5 | |
| 13 | 2 | |
| 14 | 26 | |
| 15 | 30 |
About Bruno Escoffier
Bruno Escoffier is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Management Science and Operations Research, having authored 15 papers that have together received 81 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (6 papers), Complexity and Algorithms in Graphs (4 papers) and Optimization and Search Problems (2 papers). The work is most often cited by research in Computational Theory and Mathematics (34 citations), Computer Graphics and Computer-Aided Design (6 citations) and Discrete Mathematics and Combinatorics (5 citations). Bruno Escoffier has collaborated with scholars based in France, United States and Netherlands. Frequent co-authors include Jérôme Monnot, Gilbert Lanéelle, Marie‐Claude Trombe, Vangélis Th. Paschos, Eun Jung Kim, Édouard Bonnet, Georgios Stamoulis, Evripidis Bampis, Olivier Spanjaard and Laurent Gourvès. Their work appears in journals such as European Journal of Operational Research, Microbiology and Theoretical Computer Science.
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.