Travelled to:1 × Denmark
1 × France
1 × Italy
1 × Spain
1 × USA
1 × United Kingdom
Collaborated with:Y.Métivier S.Das D.Gonçalves A.W.Mazurkiewicz W.Zielonka Y.Dieudonné A.Labourel A.Pelc R.Jacob M.Mihalák P.Widmayer
Talks about:local (3) graph (3) rendezv (2) comput (2) mobil (2) elect (2) agent (2) name (2) edg (2) intersect (1)
Person: Jérémie Chalopin
DBLP: Chalopin:J=eacute=r=eacute=mie
Contributed to:
20142010
2009
2008
20042004Wrote 7 papers:
- ICALP-v2-2014-ChalopinDLP #fault tolerance #network
- Fault-Tolerant Rendezvous in Networks (JC, YD, AL, AP), pp. 411–422.
- ICALP-v2-2014-ChalopinJMW #energy #mobile
- Data Delivery by Energy-Constrained Mobile Agents on a Line (JC, RJ, MM, PW), pp. 423–434.
- ICALP-v2-2010-ChalopinD #mobile
- Rendezvous of Mobile Agents without Agreement on Local Orientation (JC, SD), pp. 515–526.
- STOC-2009-ChalopinG #graph
- Every planar graph is the intersection graph of segments in the plane: extended abstract (JC, DG), pp. 631–638.
- ICGT-2008-ChalopinMM #graph #problem
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem (JC, AWM, YM), pp. 54–68.
- FoSSaCS-2004-ChalopinM
- Election and Local Computations on Edges (JC, YM), pp. 90–104.
- ICGT-2004-ChalopinMZ
- Election, Naming and Cellular Edge Local Computations (JC, YM, WZ), pp. 242–256.