Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jérémie Chalopin
2010 – today
- 2013
[j17]Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer: Mapping Simple Polygons: How Robots Benefit from Looking Back. Algorithmica 65(1): 43-59 (2013)- [j16]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. Discrete Applied Mathematics 161(10-11): 1287-1307 (2013)
- [j15]Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie: Population Protocols that Correspond to Symmetric Games. IJUC 9(1-2): 5-36 (2013)
- [j14]Bostjan Bresar, Jérémie Chalopin, Victor Chepoi, Matjaz Kovse, Arnaud Labourel, Yann Vaxès: Retracts of Products of Chordal Graphs. Journal of Graph Theory 73(2): 161-180 (2013)
- 2012
- [j13]Jérémie Chalopin, Emmanuel Godard, Yves Métivier: Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distributed Computing 25(4): 297-311 (2012)
- [j12]Jérémie Chalopin, Yves Métivier, Thomas Morsellino: Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks. Fundam. Inform. 120(1): 1-27 (2012)
- [c27]Jérémie Chalopin, Yves Métivier, Thomas Morsellino: On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract). SIROCCO 2012: 207-218
- [c26]Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès: Collecting Information by Power-Aware Mobile Agents. DISC 2012: 46-60
- [i7]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)
- [i6]Jérémie Chalopin, Victor Chepoi, Damian Osajda: Proof of two Maurer's conjectures on basis graphs of matroids. CoRR abs/1212.6879 (2012)
- 2011
- [j11]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)
- [j10]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)
- [c25]Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie: Computing with Pavlovian Populations. OPODIS 2011: 409-420
- [c24]Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou: Tight Bounds for Scattered Black Hole Search in a Ring. SIROCCO 2011: 186-197
- [c23]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
- [c22]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
- [i5]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)
- [i4]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)
- [i3]Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie: Asymetric Pavlovian Populations. CoRR abs/1109.4433 (2011)
- 2010
- [j9]Jérémie Chalopin, Yves Métivier: On the power of synchronization between two adjacent processes. Distributed Computing 23(3): 177-196 (2010)
- [j8]Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem: Planar Graphs Have 1-string Representations. Discrete & Computational Geometry 43(3): 626-647 (2010)
- [c21]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
- [c20]Jérémie Chalopin, Daniël Paulusma: Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. CIAC 2010: 276-287
- [c19]Jérémie Chalopin, Shantanu Das: Rendezvous of Mobile Agents without Agreement on Local Orientation. ICALP (2) 2010: 515-526
- [c18]Jérémie Chalopin, Shantanu Das, Adrian Kosowski: Constructing a Map of an Anonymous Graph: Applications of Universal Sequences. OPODIS 2010: 119-134
- [c17]Jérémie Chalopin, Shantanu Das, Peter Widmayer: Rendezvous of Mobile Agents in Directed Graphs. DISC 2010: 282-296
- [c16]Jérémie Chalopin, Paola Flocchini, Bernard Mans, Nicola Santoro: Network Exploration by Silent and Oblivious Robots. WG 2010: 208-219
- [i2]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)
2000 – 2009
- 2009
- [c15]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
- [i1]Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler: Population Protocols that Correspond to Symmetric Games. CoRR abs/0907.3126 (2009)
- 2008
- [j7]
- [j6]Jérémie Chalopin: Election and rendezvous with incomparable labels. Theor. Comput. Sci. 399(1-2): 54-70 (2008)
- [c14]Jérémie Chalopin, Antoni W. Mazurkiewicz, Yves Métivier: Labelled (Hyper)Graphs, Negotiations and the Naming Problem. ICGT 2008: 54-68
- [c13]Jérémie Chalopin, Emmanuel Godard, Yves Métivier: Local Terminations and Distributed Computability in Anonymous Networks. DISC 2008: 47-62
- [c12]Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler: Playing With Population Protocols. CSP 2008: 3-15
- 2007
- [j5]Jérémie Chalopin, Pascal Ochem: Dejean's conjecture and letter frequency. Electronic Notes in Discrete Mathematics 28: 501-505 (2007)
- [j4]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)
- [c11]
- [c10]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
- [c9]Jérémie Chalopin, Shantanu Das, Nicola Santoro: Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links. DISC 2007: 108-122
- 2006
- [j3]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)
- [c8]Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Rodrigue Ossamy: Mobile Agent Algorithms Versus Message Passing Algorithms. OPODIS 2006: 187-201
- [c7]
- [c6]Jérémie Chalopin, Shantanu Das, Nicola Santoro: Groupings and Pairings in Anonymous Networks. DISC 2006: 105-119
- [c5]Jérémie Chalopin, Daniël Paulusma: Graph Labelings Derived from Models in Distributed Computing. WG 2006: 301-312
- 2005
- [j2]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)
- [c4]Jérémie Chalopin, Yves Métivier: A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. MFCS 2005: 212-223
- [c3]Jérémie Chalopin: Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem. SOFSEM 2005: 82-91
- 2004
- [j1]Jérémie Chalopin, Hing Leung: On factorization forests of finite height. Theor. Comput. Sci. 310(1-3): 489-499 (2004)
- [c2]
- [c1]Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka: Election, Naming and Cellular Edge Local Computations. ICGT 2004: 242-256
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-05 20:48 CEST by the dblp team