Arnaud Labourel

583 total citations
20 papers, 107 citations indexed

About

Arnaud Labourel is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Arnaud Labourel has authored 20 papers receiving a total of 107 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computer Networks and Communications, 7 papers in Computational Theory and Mathematics and 6 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Arnaud Labourel's work include Optimization and Search Problems (13 papers), Advanced Graph Theory Research (7 papers) and Computational Geometry and Mesh Generation (6 papers). Arnaud Labourel is often cited by papers focused on Optimization and Search Problems (13 papers), Advanced Graph Theory Research (7 papers) and Computational Geometry and Mesh Generation (6 papers). Arnaud Labourel collaborates with scholars based in France, Canada and Netherlands. Arnaud Labourel's co-authors include Jurek Czyzowicz, Andrzej Pelc, David Ilcinkas, Louis Esperet, Pascal Ochem, Jérémie Chalopin, Andrzej Pelc, Nicolas Bonichon, Ευριπίδης Μάρκου and Jérémie Chalopin and has published in prestigious journals such as Theoretical Computer Science, Algorithmica and Information and Computation.

In The Last Decade

Arnaud Labourel

18 papers receiving 107 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Arnaud Labourel France	6	84	25	22	11	10	20	107
Jérémie Chalopin France	5	47 0.6×	15 0.6×	12 0.5×	5 0.5×	8 0.8×	13	54
Ευριπίδης Μάρκου Greece	8	186 2.2×	10 0.4×	56 2.5×	24 2.2×	5 0.5×	19	195
Dominik Pająk Poland	6	64 0.8×	11 0.4×	17 0.8×	5 0.5×	8 0.8×	18	90
Ghassan A. Abed Malaysia	9	115 1.4×	16 0.6×	7 0.3×		6 0.6×	27	188
Andrew Schwerin United States	6	227 2.7×	6 0.2×	5 0.2×	3 0.3×	5 0.5×	10	267
U. Nageldinger Germany	9	143 1.7×	13 0.5×	17 0.8×		2 0.2×	19	207
Igor Pavlov Russia	5	24 0.3×	4 0.2×	6 0.3×	14 1.3×	2 0.2×	19	107
Colette Johnen France	8	125 1.5×	32 1.3×	6 0.3×		3 0.3×	21	137
Johannes Hölzl Germany	6	15 0.2×	23 0.9×	21 1.0×	1 0.1×	5 0.5×	20	94
Damien Hardy France	9	123 1.5×	10 0.4×	3 0.1×		7 0.7×	12	208

Countries citing papers authored by Arnaud Labourel

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Arnaud Labourel

This figure shows the co-authorship network connecting the top 25 collaborators of Arnaud Labourel. A scholar is included among the top collaborators of Arnaud Labourel 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 Arnaud Labourel. Arnaud Labourel is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Dieudonné, Yoann, et al.. (2023). Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs. ACM Transactions on Algorithms. 19(3). 1–32. 1 indexed citations

Chalopin, Jérémie, Shantanu Das, Yann Disser, Arnaud Labourel, & Matúš Mihaľák. (2021). Collaborative delivery on a fixed path with homogeneous energy-constrained agents. Theoretical Computer Science. 868. 87–96.

Dieudonné, Yoann, et al.. (2020). Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Blin, Lélia, Jurek Czyzowicz, David Ilcinkas, et al.. (2018). On asynchronous rendezvous in general graphs. Theoretical Computer Science. 753. 80–90. 2 indexed citations

Czyzowicz, Jurek, et al.. (2018). Group search of the plane with faulty robots. Theoretical Computer Science. 792. 69–84. 3 indexed citations

Bärtschi, Andreas, Jérémie Chalopin, Shantanu Das, et al.. (2017). Collaborative delivery with energy-constrained mobile robots. Theoretical Computer Science. 810. 2–14. 8 indexed citations

Esperet, Louis, Daniel Gonçalves, & Arnaud Labourel. (2016). Coloring Non-Crossing Strings. The Electronic Journal of Combinatorics. 23(4). 1 indexed citations

Chalopin, Jérémie, Yoann Dieudonné, Arnaud Labourel, & Andrzej Pelc. (2015). Rendezvous in networks in spite of delay faults. Distributed Computing. 29(3). 187–205. 3 indexed citations

Anaya, J., Jérémie Chalopin, Jurek Czyzowicz, et al.. (2014). Convergecast and Broadcast by Power-Aware Mobile Agents. Algorithmica. 74(1). 117–155. 5 indexed citations

10.

Czyzowicz, Jurek, David Ilcinkas, Arnaud Labourel, & Andrzej Pelc. (2013). Worst-case optimal exploration of terrains with obstacles. Information and Computation. 225. 16–28. 6 indexed citations

11.

Chalopin, Jérémie, et al.. (2013). Tight bounds for black hole search with scattered agents in synchronous rings. Theoretical Computer Science. 509. 70–85. 7 indexed citations

12.

Czyzowicz, Jurek, Arnaud Labourel, & Andrzej Pelc. (2012). How to meet asynchronously (almost) everywhere. HAL AMU. 44 indexed citations

13.

Brešar, Boštjan, et al.. (2012). Retracts of Products of Chordal Graphs. Journal of Graph Theory. 73(2). 161–180. 1 indexed citations

14.

Czyzowicz, Jurek, David Ilcinkas, Arnaud Labourel, & Andrzej Pelc. (2011). Asynchronous deterministic rendezvous in bounded terrains. Theoretical Computer Science. 412(50). 6926–6937. 7 indexed citations

15.

Czyzowicz, Jurek, Arnaud Labourel, & Andrzej Pelc. (2010). Optimality and competitiveness of exploring polygons by mobile robots. Information and Computation. 209(1). 74–88.

16.

Esperet, Louis, Daniel Gonçalves, & Arnaud Labourel. (2009). Coloring a set of touching strings. Electronic Notes in Discrete Mathematics. 34. 213–217. 1 indexed citations

17.

Esperet, Louis, Arnaud Labourel, & Pascal Ochem. (2008). On induced-universal graphs for the class of bounded-degree graphs. Information Processing Letters. 108(5). 255–260. 10 indexed citations

18.

Bonichon, Nicolas, Cyril Gavoille, & Arnaud Labourel. (2007). Short Labels by Traversal and Jumping. Electronic Notes in Discrete Mathematics. 28. 153–160. 5 indexed citations

19.

Labourel, Arnaud. (2006). Edge-disjoint Spanning Trees in Triangulated Graphs on Surfaces and application to node labeling 1. 1 indexed citations

20.

Bonichon, Nicolas, Cyril Gavoille, & Arnaud Labourel. (2005). Edge Partition of Toroidal Graphs into Forests in Linear Time. Electronic Notes in Discrete Mathematics. 22. 421–425. 1 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