Arnaud Labourel
Impact in
-
- Optimization and Search Problems
- Mobile Agent-Based Network Management
- Distributed Control Multi-Agent Systems
- Distributed systems and fault tolerance
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
Papers in
-
- Optimization and Search Problems 13
- Distributed Control Multi-Agent Systems 3
- Distributed systems and fault tolerance 3
-
- Advanced Graph Theory Research 7
- Graph Labeling and Dimension Problems 2
- Co-authors
- Jurek Czyzowicz (7 shared papers)Andrzej Pelc (6 shared papers)Louis Esperet (3 shared papers)David Ilcinkas (3 shared papers)Pascal Ochem (1 shared paper)Jérémie Chalopin (4 shared papers)Andrzej Pelc (2 shared papers)Jérémie Chalopin (2 shared papers)
In The Last Decade
Arnaud Labourel
18 papers receiving 109 citations
Peers
Comparison fields: 5 of 21
- Computer Networks and Communications 85
- Computational Theory and Mathematics 26
- Discrete Mathematics and Combinatorics 4
- Computer Graphics and Computer-Aided Design 4
- Management Science and Operations Research 11
Countries citing papers authored by Arnaud Labourel
This map shows the geographic impact of Arnaud Labourel'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 Arnaud Labourel with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Arnaud Labourel more than expected).
Fields of papers citing papers by Arnaud Labourel
This network shows the impact of papers produced by Arnaud Labourel. 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 Arnaud Labourel. The network helps show where Arnaud Labourel may publish in the future.
Co-authors
The 25 scholars most cited alongside Arnaud Labourel, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | How to meet asynchronously (almost) everywhere | 2012 | 44 |
| 2 | 2008 | 10 | |
| 3 | 2017 | 9 | |
| 4 | 2013 | 8 | |
| 5 | 2011 | 7 | |
| 6 | 2013 | 6 | |
| 7 | 2007 | 6 | |
| 8 | 2014 | 5 | |
| 9 | 2015 | 3 | |
| 10 | 2018 | 3 | |
| 11 | 2018 | 2 | |
| 12 | 2009 | 1 | |
| 13 | 2016 | 1 | |
| 14 | 2023 | 1 | |
| 15 | 2020 | 1 | |
| 16 | 2012 | 1 | |
| 17 | 2005 | 1 | |
| 18 | Edge-disjoint Spanning Trees in Triangulated Graphs on Surfaces and application to node labeling 1 | 2006 | 1 |
| 19 | 2021 | 0 | |
| 20 | 2010 | 0 |
About Arnaud Labourel
Arnaud Labourel is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Mechanical Engineering and Geometry and Topology, having authored 20 papers that have together received 110 indexed citations. Recurring topics across this work include Optimization and Search Problems (13 papers), Advanced Graph Theory Research (7 papers), Computational Geometry and Mesh Generation (6 papers), Modular Robots and Swarm Intelligence (4 papers), Distributed Control Multi-Agent Systems (3 papers), Distributed systems and fault tolerance (3 papers), Graph theory and applications (2 papers) and Graph Labeling and Dimension Problems (2 papers). The work is most often cited by research in Computer Networks and Communications (85 citations), Computational Theory and Mathematics (26 citations), Discrete Mathematics and Combinatorics (4 citations), Computer Graphics and Computer-Aided Design (4 citations) and Management Science and Operations Research (11 citations). Arnaud Labourel has collaborated with scholars based in France, Canada and Germany. Frequent co-authors include Jurek Czyzowicz, Andrzej Pelc, Louis Esperet, David Ilcinkas, Pascal Ochem, Jérémie Chalopin, Andrzej Pelc, Jérémie Chalopin, Ευριπίδης Μάρκου and Cyril Gavoille. Their work appears in journals such as Theoretical Computer Science, Information and Computation, Algorithmica, The Electronic Journal of Combinatorics and Journal of Graph Theory.
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.