Jérémie Chalopin
Jérémie Chalopin
LIS, CNRS & Aix-Marseille Université
Потвърден имейл адрес: lis-lab.fr
Заглавие
Позовавания
Позовавания
Година
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
942009
Rendezvous of mobile agents in unknown graphs with faulty links
J Chalopin, S Das, N Santoro
International Symposium on Distributed Computing, 108-122, 2007
552007
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
522010
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
502006
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
482010
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
402011
An efficient message passing election algorithm based on Mazurkiewicz's algorithm
J Chalopin, Y Métivier
Fundamenta Informaticae 80 (1-3), 221-246, 2007
352007
Planar graphs have 1-string representations
J Chalopin, D Gonçalves, P Ochem
Discrete & Computational Geometry 43 (3), 626-647, 2010
282010
Weakly modular graphs and nonpositive curvature
J Chalopin, V Chepoi, H Hirai, D Osajda
arXiv preprint arXiv:1409.3892, 2014
262014
Planar graphs are in 1-STRING
J Chalopin, D Gonçalves, P Ochem
Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007
262007
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
252011
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, 2017
242017
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
232013
Algorithmique distribuée, calculs locaux et homomorphismes de graphes
J Chalopin
Bordeaux 1, 2006
232006
A bridge between the asynchronous message passing model and local computations in graphs
J Chalopin, Y Métivier
International Symposium on Mathematical Foundations of Computer Science, 212-223, 2005
232005
Election, naming and cellular edge local computations
J Chalopin, Y Métivier, W Zielonka
International Conference on Graph Transformation, 242-256, 2004
232004
Election and local computations on edges
J Chalopin, Y Métivier
International Conference on Foundations of Software Science and Computation …, 2004
232004
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
222014
Local terminations and distributed computability in anonymous networks
J Chalopin, E Godard, Y Métivier
International Symposium on Distributed Computing, 47-62, 2008
222008
Rendezvous in networks in spite of delay faults
J Chalopin, Y Dieudonné, A Labourel, A Pelc
Distributed Computing 29 (3), 187-205, 2016
21*2016
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20