| How to meet asynchronously (almost) everywhere J Czyzowicz, A Pelc, A Labourel ACM Transactions on Algorithms (TALG) 8 (4), 1-14, 2012 | 128 | 2012 |
| Almost optimal asynchronous rendezvous in infinite multidimensional grids E Bampas, J Czyzowicz, L Gąsieniec, D Ilcinkas, A Labourel Distributed Computing: 24th International Symposium, DISC 2010, Cambridge …, 2010 | 89 | 2010 |
| Tell Me Where I Am So I Can Meet You Sooner: (Asynchronous Rendezvous with Location Information) A Collins, J Czyzowicz, L Gąsieniec, A Labourel Automata, Languages and Programming: 37th International Colloquium, ICALP …, 2010 | 53 | 2010 |
| Shorter implicit representation for planar graphs and bounded treewidth graphs C Gavoille, A Labourel Algorithms–ESA 2007: 15th Annual European Symposium, Eilat, Israel, October …, 2007 | 45 | 2007 |
| Black hole search with finite automata scattered in a synchronous torus J Chalopin, S Das, A Labourel, E Markou Distributed Computing: 25th International Symposium, DISC 2011, Rome, Italy …, 2011 | 36 | 2011 |
| Collaborative delivery with energy-constrained mobile robots A Bärtschi, J Chalopin, S Das, Y Disser, B Geissmann, D Graf, A Labourel, ... Theoretical Computer Science 810, 2-14, 2020 | 30 | 2020 |
| On induced-universal graphs for the class of bounded-degree graphs L Esperet, A Labourel, P Ochem Information Processing Letters 108 (5), 255-260, 2008 | 27 | 2008 |
| Rendezvous in networks in spite of delay faults J Chalopin, Y Dieudonné, A Labourel, A Pelc Distributed Computing 29, 187-205, 2016 | 24 | 2016 |
| Tight bounds for scattered black hole search in a ring J Chalopin, S Das, A Labourel, E Markou Structural Information and Communication Complexity: 18th International …, 2011 | 22 | 2011 |
| Convergecast and broadcast by power-aware mobile agents J Anaya, J Chalopin, J Czyzowicz, A Labourel, A Pelc, Y Vaxès Algorithmica 74 (1), 117-155, 2016 | 19 | 2016 |
| Tight bounds for black hole search with scattered agents in synchronous rings J Chalopin, S Das, A Labourel, E Markou Theoretical Computer Science 509, 70-85, 2013 | 19 | 2013 |
| Worst-case optimal exploration of terrains with obstacles J Czyzowicz, D Ilcinkas, A Labourel, A Pelc Information and Computation 225, 16-28, 2013 | 18 | 2013 |
| Collecting information by power-aware mobile agents J Anaya, J Chalopin, J Czyzowicz, A Labourel, A Pelc, Y Vaxès Distributed Computing: 26th International Symposium, DISC 2012, Salvador …, 2012 | 18 | 2012 |
| Short labels by traversal and jumping N Bonichon, C Gavoille, A Labourel Electronic Notes in Discrete Mathematics 28, 153-160, 2007 | 18 | 2007 |
| Asynchronous deterministic rendezvous in bounded terrains J Czyzowicz, D Ilcinkas, A Labourel, A Pelc Theoretical computer science 412 (50), 6926-6937, 2011 | 15 | 2011 |
| Short labels by traversal and jumping N Bonichon, C Gavoille, A Labourel Structural Information and Communication Complexity: 13th International …, 2006 | 15 | 2006 |
| Distributed relationship schemes for trees C Gavoille, A Labourel Algorithms and Computation: 18th International Symposium, ISAAC 2007, Sendai …, 2007 | 14 | 2007 |
| Distance labeling schemes for cube-free median graphs V Chepoi, A Labourel, S Ratel 44th International Symposium on Mathematical Foundations of Computer Science …, 2019 | 13* | 2019 |
| Limit behavior of the multi-agent rotor-router system J Chalopin, S Das, P Gawrychowski, A Kosowski, A Labourel, P Uznański International Symposium on Distributed Computing, 123-139, 2015 | 13 | 2015 |
| Optimal exploration of terrains with obstacles J Czyzowicz, D Ilcinkas, A Labourel, A Pelc Scandinavian Workshop on Algorithm Theory, 1-12, 2010 | 10 | 2010 |
