default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnaud Labourel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j24]Sébastien Bouchard
, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs. ACM Trans. Algorithms 19(3): 22:1-22:32 (2023)- 2022
- [j23]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
Distance labeling schemes for K4-free bridged graphs. Inf. Comput. 289(Part): 104959 (2022) - [j22]Sébastien Bouchard, Arnaud Labourel, Andrzej Pelc:
Impact of knowledge on the cost of treasure hunt in trees. Networks 80(1): 51-62 (2022) - [c22]Arnaud Casteigts, Timothée Corsini, Hervé Hocquard, Arnaud Labourel:
Robustness of Distances and Diameter in a Fragile Network. SAND 2022: 9:1-9:16 - 2021
- [j21]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
Distance and Routing Labeling Schemes for Cube-Free Median Graphs. Algorithmica 83(1): 252-296 (2021) - [j20]Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák:
Collaborative delivery on a fixed path with homogeneous energy-constrained agents. Theor. Comput. Sci. 868: 87-96 (2021) - [c21]Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. ICALP 2021: 36:1-36:20 - 2020
- [j19]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
On density of subgraphs of Cartesian products. J. Graph Theory 93(1): 64-87 (2020) - [j18]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák:
Collaborative delivery with energy-constrained mobile robots. Theor. Comput. Sci. 810: 2-14 (2020) - [c20]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
Distance Labeling Schemes for K4-Free Bridged Graphs. SIROCCO 2020: 310-327 - [i16]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
Distance labeling schemes for K4-free bridged graphs. CoRR abs/2007.14192 (2020) - [i15]Sébastien Bouchard, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs. CoRR abs/2010.14916 (2020)
2010 – 2019
- 2019
- [j17]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
On density of subgraphs of halved cubes. Eur. J. Comb. 80: 57-70 (2019) - [j16]Evangelos Bampas, Lélia Blin, Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Maria Potop-Butucaru, Sébastien Tixeuil:
On asynchronous rendezvous in general graphs. Theor. Comput. Sci. 753: 80-90 (2019) - [j15]Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis, Arnaud Labourel:
Group search of the plane with faulty robots. Theor. Comput. Sci. 792: 69-84 (2019) - [c19]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
Distance Labeling Schemes for Cube-Free Median Graphs. MFCS 2019: 15:1-15:14 - [c18]Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák:
Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents. SIROCCO 2019: 139-153 - 2018
- [c17]Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis, Arnaud Labourel, Euripides Markou:
Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots. SOFSEM 2018: 381-395 - [i14]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
Distance and routing labeling schemes for cube-free median graphs. CoRR abs/1809.10508 (2018) - 2017
- [i13]Jurek Czyzowicz, Maxime Godon, Evangelos Kranakis, Arnaud Labourel, Euripides Markou:
Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots. CoRR abs/1710.00775 (2017) - [i12]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
On density of subgraphs of halved cubes. CoRR abs/1711.11414 (2017) - [i11]Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
On density of subgraphs of Cartesian products. CoRR abs/1711.11485 (2017) - 2016
- [j14]Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès:
Convergecast and Broadcast by Power-Aware Mobile Agents. Algorithmica 74(1): 117-155 (2016) - [j13]Louis Esperet, Daniel Gonçalves, Arnaud Labourel:
Coloring Non-Crossing Strings. Electron. J. Comb. 23(4): 4 (2016) - [j12]Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Rendezvous in networks in spite of delay faults. Distributed Comput. 29(3): 187-205 (2016) - [c16]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák:
Collaborative Delivery with Energy-Constrained Mobile Robots. SIROCCO 2016: 258-274 - [i10]Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès:
Convergecast and Broadcast by Power-Aware Mobile Agents. CoRR abs/1603.04234 (2016) - [i9]Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák:
Collaborative Delivery with Energy-Constrained Mobile Robots. CoRR abs/1608.08500 (2016) - 2015
- [c15]Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski:
Limit Behavior of the Multi-agent Rotor-Router System. DISC 2015: 123-139 - [i8]Louis Esperet, Daniel Gonçalves, Arnaud Labourel:
Coloring non-crossing strings. CoRR abs/1511.03827 (2015) - 2014
- [c14]Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Fault-Tolerant Rendezvous in Networks. ICALP (2) 2014: 411-422 - [i7]Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc:
Fault-Tolerant Rendezvous in Networks. CoRR abs/1402.2760 (2014) - [i6]Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski:
Lock-in Problem for Parallel Rotor-router Walks. CoRR abs/1407.3200 (2014) - 2013
- [j11]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Worst-case optimal exploration of terrains with obstacles. Inf. Comput. 225: 16-28 (2013) - [j10]Bostjan Bresar, Jérémie Chalopin, Victor Chepoi, Matjaz Kovse, Arnaud Labourel, Yann Vaxès:
Retracts of Products of Chordal Graphs. J. Graph Theory 73(2): 161-180 (2013) - [j9]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Tight bounds for black hole search with scattered agents in synchronous rings. Theor. Comput. Sci. 509: 70-85 (2013) - 2012
- [j8]Jurek Czyzowicz, Andrzej Pelc, Arnaud Labourel:
How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8(4): 37:1-37:14 (2012) - [c13]Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès:
Collecting Information by Power-Aware Mobile Agents. DISC 2012: 46-60 - 2011
- [j7]Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc:
Optimality and competitiveness of exploring polygons by mobile robots. Inf. Comput. 209(1): 74-88 (2011) - [j6]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Asynchronous deterministic rendezvous in bounded terrains. Theor. Comput. Sci. 412(50): 6926-6937 (2011) - [c12]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Tight Bounds for Scattered Black Hole Search in a Ring. SIROCCO 2011: 186-197 - [c11]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Black Hole Search with Finite Automata Scattered in a Synchronous Torus. DISC 2011: 432-446 - [i5]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings. CoRR abs/1104.5076 (2011) - [i4]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou:
Black Hole Search with Finite Automata Scattered in a Synchronous Torus. CoRR abs/1106.6037 (2011) - 2010
- [c10]Andrew Collins, Jurek Czyzowicz, Leszek Gasieniec, Arnaud Labourel:
Tell Me Where I Am So I Can Meet You Sooner. ICALP (2) 2010: 502-514 - [c9]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Asynchronous Deterministic Rendezvous in Bounded Terrains. SIROCCO 2010: 72-85 - [c8]Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc:
How to Meet Asynchronously (Almost) Everywhere. SODA 2010: 22-30 - [c7]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Optimal Exploration of Terrains with Obstacles. SWAT 2010: 1-12 - [c6]Evangelos Bampas, Jurek Czyzowicz, Leszek Gasieniec, David Ilcinkas, Arnaud Labourel:
Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. DISC 2010: 297-311 - [i3]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Optimal Exploration of Terrains with Obstacles. CoRR abs/1001.0639 (2010) - [i2]Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Andrzej Pelc:
Asynchronous deterministic rendezvous in bounded terrains. CoRR abs/1001.0889 (2010) - [i1]Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc:
How to meet asynchronously (almost) everywhere. CoRR abs/1001.0890 (2010)
2000 – 2009
- 2009
- [j5]Louis Esperet, Daniel Gonçalves, Arnaud Labourel:
Coloring a set of touching strings. Electron. Notes Discret. Math. 34: 213-217 (2009) - [c5]Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc:
Optimality and Competitiveness of Exploring Polygons by Mobile Robots. ESA 2009: 263-274 - 2008
- [j4]Arnaud Labourel:
On Universal Graphs of Minor Closed Families. Electron. Notes Discret. Math. 31: 85-89 (2008) - [j3]Louis Esperet, Arnaud Labourel, Pascal Ochem:
On induced-universal graphs for the class of bounded-degree graphs. Inf. Process. Lett. 108(5): 255-260 (2008) - 2007
- [j2]Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel:
Short Labels by Traversal and Jumping. Electron. Notes Discret. Math. 28: 153-160 (2007) - [c4]Cyril Gavoille, Arnaud Labourel:
Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs. ESA 2007: 582-593 - [c3]Cyril Gavoille, Arnaud Labourel:
Distributed Relationship Schemes for Trees. ISAAC 2007: 728-738 - [c2]Cyril Gavoille, Arnaud Labourel:
On local representation of distances in trees. PODC 2007: 352-353 - 2006
- [c1]Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel:
Short Labels by Traversal and Jumping. SIROCCO 2006: 143-156 - 2005
- [j1]Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel:
Edge Partition of Toroidal Graphs into Forests in Linear Time. Electron. Notes Discret. Math. 22: 421-425 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
