| Every planar graph is the intersection graph of segments in the plane J Chalopin, D Gonçalves Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 123 | 2009 |
| Weakly modular graphs and nonpositive curvature J Chalopin, V Chepoi, H Hirai, D Osajda American Mathematical Society 268 (1309), 2020 | 86 | 2020 |
| Constructing a map of an anonymous graph: Applications of universal sequences J Chalopin, S Das, A Kosowski International Conference On Principles Of Distributed Systems, 119-134, 2010 | 72 | 2010 |
| Rendezvous of mobile agents in unknown graphs with faulty links J Chalopin, S Das, N Santoro International Symposium on Distributed Computing, 108-122, 2007 | 72 | 2007 |
| Helly groups J Chalopin, V Chepoi, A Genevois, H Hirai, D Osajda Geometry & Topology 29 (1), 1-70, 2025 | 71 | 2025 |
| Network exploration by silent and oblivious robots J Chalopin, P Flocchini, B Mans, N Santoro International Workshop on Graph-Theoretic Concepts in Computer Science, 208-219, 2010 | 70 | 2010 |
| Cop and robber games when the robber can hide and ride J Chalopin, V Chepoi, N Nisse, Y Vaxès SIAM Journal on Discrete Mathematics 25 (1), 333-359, 2011 | 65 | 2011 |
| Mobile agent algorithms versus message passing algorithms J Chalopin, E Godard, Y Métivier, R Ossamy International Conference On Principles Of Distributed Systems, 187-201, 2006 | 60 | 2006 |
| Data delivery by energy-constrained mobile agents on a line J Chalopin, R Jacob, M Mihalák, P Widmayer International Colloquium on Automata, Languages, and Programming, 423-434, 2014 | 44 | 2014 |
| Unlabeled sample compression schemes and corner peelings for ample and maximum classes J Chalopin, V Chepoi, S Moran, MK Warmuth Journal of Computer and System Sciences 127, 1-28, 2022 | 43 | 2022 |
| Data delivery by energy-constrained mobile agents J Chalopin, S Das, M Mihal’ák, P Penna, P Widmayer International Symposium on Algorithms and Experiments for Sensor Systems …, 2013 | 43 | 2013 |
| Black hole search with finite automata scattered in a synchronous torus J Chalopin, S Das, A Labourel, E Markou International Symposium on Distributed Computing, 432-446, 2011 | 43 | 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 | 39 | 2020 |
| Bucolic complexes B Brešar, J Chalopin, V Chepoi, T Gologranc, D Osajda Advances in mathematics 243, 127-167, 2013 | 38 | 2013 |
| An efficient message passing election algorithm based on Mazurkiewicz's algorithm J Chalopin, Y Métivier Fundamenta Informaticae 80 (1-3), 221-246, 2007 | 38 | 2007 |
| Energy-efficient delivery by heterogeneous mobile agents A Bärtschi, J Chalopin, S Das, Y Disser, D Graf, J Hackfeld, P Penna arXiv preprint arXiv:1610.02361, 2016 | 36 | 2016 |
| Restricted frame graphs and a conjecture of Scott J Chalopin, L Esperet, Z Li, PO de Mendez arXiv preprint arXiv:1406.0338, 2014 | 36 | 2014 |
| Planar graphs have 1-string representations J Chalopin, D Gonçalves, P Ochem Discrete & Computational Geometry 43 (3), 626, 2010 | 35 | 2010 |
| Local computations in graphs: the case of cellular edge local computations J Chalopin, Y Métivier, W Zielonka Fundamenta Informaticae 74 (1), 85-114, 2006 | 33 | 2006 |
| Rendezvous in networks in spite of delay faults J Chalopin, Y Dieudonné, A Labourel, A Pelc Distributed Computing 29 (3), 187-205, 2016 | 30* | 2016 |
Shantanu DasAix-Marseille University, FranceVerified email at lif.univ-mrs.fr
