 | 2012 |
| 42 |  | Jérémie Chalopin,
Shantanu Das,
Yann Disser,
Matús Mihalák,
Peter Widmayer:
Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons
CoRR abs/1204.3850: (2012) |
| 2011 |
| 41 |  | Jérémie Chalopin,
Shantanu Das,
Arnaud Labourel,
Euripides Markou:
Black Hole Search with Finite Automata Scattered in a Synchronous Torus.
DISC 2011: 432-446 |
| 40 |  | Olivier Bournez,
Jérémie Chalopin,
Johanne Cohen,
Xavier Koegler,
Mikaël Rabie:
Computing with Pavlovian Populations.
OPODIS 2011: 409-420 |
| 39 |  | Jérémie Chalopin,
Shantanu Das,
Arnaud Labourel,
Euripides Markou:
Tight Bounds for Scattered Black Hole Search in a Ring.
SIROCCO 2011: 186-197 |
| 38 |  | Jérémie Chalopin,
Shantanu Das,
Yann Disser,
Matús Mihalák,
Peter Widmayer:
Telling convex from reflex allows to map a polygon.
STACS 2011: 153-164 |
| 37 |  | Jérémie Chalopin,
Shantanu Das,
Arnaud Labourel,
Euripides Markou:
Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings
CoRR abs/1104.5076: (2011) |
| 36 |  | Jérémie Chalopin,
Shantanu Das,
Arnaud Labourel,
Euripides Markou:
Black Hole Search with Finite Automata Scattered in a Synchronous Torus
CoRR abs/1106.6037: (2011) |
| 35 |  | Olivier Bournez,
Jérémie Chalopin,
Johanne Cohen,
Xavier Koegler,
Mikaël Rabie:
Asymetric Pavlovian Populations
CoRR abs/1109.4433: (2011) |
| 34 |  | Jérémie Chalopin,
Daniël Paulusma:
Graph labelings derived from models in distributed computing: A complete complexity classification.
Networks 58(3): 207-231 (2011) |
| 33 |  | Jérémie Chalopin,
Victor Chepoi,
Nicolas Nisse,
Yann Vaxès:
Cop and Robber Games When the Robber Can Hide and Ride.
SIAM J. Discrete Math. 25(1): 333-359 (2011) |
| 2010 |
| 32 |  | Jérémie Chalopin,
Shantanu Das,
Yann Disser,
Matús Mihalák,
Peter Widmayer:
How Simple Robots Benefit from Looking Back.
CIAC 2010: 229-239 |
| 31 |  | Jérémie Chalopin,
Daniël Paulusma:
Packing Bipartite Graphs with Covers of Complete Bipartite Graphs.
CIAC 2010: 276-287 |
| 30 |  | Jérémie Chalopin,
Shantanu Das,
Peter Widmayer:
Rendezvous of Mobile Agents in Directed Graphs.
DISC 2010: 282-296 |
| 29 |  | Jérémie Chalopin,
Shantanu Das:
Rendezvous of Mobile Agents without Agreement on Local Orientation.
ICALP (2) 2010: 515-526 |
| 28 |  | Jérémie Chalopin,
Shantanu Das,
Adrian Kosowski:
Constructing a Map of an Anonymous Graph: Applications of Universal Sequences.
OPODIS 2010: 119-134 |
| 27 |  | Jérémie Chalopin,
Paola Flocchini,
Bernard Mans,
Nicola Santoro:
Network Exploration by Silent and Oblivious Robots.
WG 2010: 208-219 |
| 26 |  | Jérémie Chalopin,
Victor Chepoi,
Nicolas Nisse,
Yann Vaxès:
Cop and robber games when the robber can hide and ride
CoRR abs/1001.4457: (2010) |
| 25 |  | Jérémie Chalopin,
Daniel Gonçalves,
Pascal Ochem:
Planar Graphs Have 1-string Representations.
Discrete & Computational Geometry 43(3): 626-647 (2010) |
| 24 |  | Jérémie Chalopin,
Yves Métivier:
On the power of synchronization between two adjacent processes.
Distributed Computing 23(3): 177-196 (2010) |
| 2009 |
| 23 |  | Jérémie Chalopin,
Daniel Gonçalves:
Every planar graph is the intersection graph of segments in the plane: extended abstract.
STOC 2009: 631-638 |
| 22 |  | Olivier Bournez,
Jérémie Chalopin,
Johanne Cohen,
Xavier Koegler:
Population Protocols that Correspond to Symmetric Games
CoRR abs/0907.3126: (2009) |
| 2008 |
| 21 |  | Olivier Bournez,
Jérémie Chalopin,
Johanne Cohen,
Xavier Koegler:
Playing With Population Protocols
CSP 2008: 3-15 |
| 20 |  | Jérémie Chalopin,
Emmanuel Godard,
Yves Métivier:
Local Terminations and Distributed Computability in Anonymous Networks.
DISC 2008: 47-62 |
| 19 |  | Jérémie Chalopin,
Antoni W. Mazurkiewicz,
Yves Métivier:
Labelled (Hyper)Graphs, Negotiations and the Naming Problem.
ICGT 2008: 54-68 |
| 18 |  | Jérémie Chalopin,
Pascal Ochem:
Dejean's conjecture and letter frequency.
ITA 42(3): 477-480 (2008) |
| 17 |  | Jérémie Chalopin:
Election and rendezvous with incomparable labels.
Theor. Comput. Sci. 399(1-2): 54-70 (2008) |
| 2007 |
| 16 |  | Jérémie Chalopin,
Shantanu Das,
Nicola Santoro:
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links.
DISC 2007: 108-122 |
| 15 |  | Jérémie Chalopin,
Daniel Gonçalves,
Pascal Ochem:
Planar graphs are in 1-STRING.
SODA 2007: 609-617 |
| 14 |  | Jérémie Chalopin,
Emmanuel Godard,
Yves Métivier,
Gerard Tel:
About the Termination Detection in the Asynchronous Message Passing Model.
SOFSEM (1) 2007: 200-211 |
| 13 |  | Jérémie Chalopin,
Pascal Ochem:
Dejean's conjecture and letter frequency.
Electronic Notes in Discrete Mathematics 28: 501-505 (2007) |
| 12 |  | Jérémie Chalopin,
Yves Métivier:
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm.
Fundam. Inform. 80(1-3): 221-246 (2007) |
| 2006 |
| 11 |  | Jérémie Chalopin,
Shantanu Das,
Nicola Santoro:
Groupings and Pairings in Anonymous Networks.
DISC 2006: 105-119 |
| 10 |  | Jérémie Chalopin,
Emmanuel Godard,
Yves Métivier,
Rodrigue Ossamy:
Mobile Agent Algorithms Versus Message Passing Algorithms.
OPODIS 2006: 187-201 |
| 9 |  | Jérémie Chalopin:
Election in the Qualitative World.
SIROCCO 2006: 85-99 |
| 8 |  | Jérémie Chalopin,
Daniël Paulusma:
Graph Labelings Derived from Models in Distributed Computing.
WG 2006: 301-312 |
| 7 |  | Jérémie Chalopin,
Yves Métivier,
Wieslaw Zielonka:
Local Computations in Graphs: The Case of Cellular Edge Local Computations.
Fundam. Inform. 74(1): 85-114 (2006) |
| 2005 |
| 6 |  | Jérémie Chalopin,
Yves Métivier:
A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs.
MFCS 2005: 212-223 |
| 5 |  | Jérémie Chalopin:
Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem.
SOFSEM 2005: 82-91 |
| 4 |  | Jérémie Chalopin,
Yves Métivier,
Wieslaw Zielonka:
Local Computation in Graphs: The Case of Cellular Edge Local Computations.
Bulletin of the EATCS 85: 105-109 (2005) |
| 2004 |
| 3 |  | Jérémie Chalopin,
Yves Métivier:
Election and Local Computations on Edges.
FoSSaCS 2004: 90-104 |
| 2 |  | Jérémie Chalopin,
Yves Métivier,
Wieslaw Zielonka:
Election, Naming and Cellular Edge Local Computations.
ICGT 2004: 242-256 |
| 1 |  | Jérémie Chalopin,
Hing Leung:
On factorization forests of finite height.
Theor. Comput. Sci. 310(1-3): 489-499 (2004) |