Jérémie Chalopin
Jérémie Chalopin
LIS, CNRS & Aix-Marseille Université
Verified email at
Cited by
Cited by
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
Weakly modular graphs and nonpositive curvature
J Chalopin, V Chepoi, H Hirai, D Osajda
American Mathematical Society 268 (1309), 2020
Rendezvous of mobile agents in unknown graphs with faulty links
J Chalopin, S Das, N Santoro
International Symposium on Distributed Computing, 108-122, 2007
Constructing a map of an anonymous graph: Applications of universal sequences
J Chalopin, S Das, A Kosowski
Principles of Distributed Systems: 14th International Conference, OPODIS …, 2010
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
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
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
Helly groups
J Chalopin, V Chepoi, A Genevois, H Hirai, D Osajda
arXiv preprint arXiv:2002.06895, 2020
Data delivery by energy-constrained mobile agents on a line
J Chalopin, R Jacob, M Mihalák, P Widmayer
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
Data delivery by energy-constrained mobile agents
J Chalopin, S Das, M Mihal’ák, P Penna, P Widmayer
Algorithms for Sensor Systems: 9th International Symposium on Algorithms and …, 2014
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
An efficient message passing election algorithm based on Mazurkiewicz's algorithm
J Chalopin, Y Métivier
Fundamenta Informaticae 80 (1-3), 221-246, 2007
Bucolic complexes
B Brešar, J Chalopin, V Chepoi, T Gologranc, D Osajda
Advances in mathematics 243, 127-167, 2013
Planar graphs have 1-string representations
J Chalopin, D Gonçalves, P Ochem
Discrete & Computational Geometry 43 (3), 626, 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
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
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
Local terminations and distributed computability in anonymous networks
J Chalopin, E Godard, Y Métivier
International Symposium on Distributed Computing, 47-62, 2008
Rendezvous in networks in spite of delay faults
J Chalopin, Y Dieudonné, A Labourel, A Pelc
Distributed Computing 29, 187-205, 2016
Restricted frame graphs and a conjecture of Scott
J Chalopin, L Esperet, Z Li, PO de Mendez
arXiv preprint arXiv:1406.0338, 2014
The system can't perform the operation now. Try again later.
Articles 1–20