Election and Local Computations on Edges. - Jérémie Chalopin; Yves Métivier (FoSSaCS, 2004)

Election, Naming and Cellular Edge Local Computations. - Jérémie Chalopin; Yves Métivier; Wieslaw Zielonka (ICGT, 2004)

On factorization forests of finite height. - Jérémie Chalopin; Hing Leung (Theor. Comput. Sci., 2004)

A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. - Jérémie Chalopin; Yves Métivier (MFCS, 2005)

Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem. - Jérémie Chalopin (SOFSEM, 2005)

Local Computation in Graphs: The Case of Cellular Edge Local Computations. - Jérémie Chalopin; Yves Métivier; Wieslaw Zielonka (Bull. EATCS, 2005)

Mobile Agent Algorithms Versus Message Passing Algorithms. - Jérémie Chalopin; Emmanuel Godard; Yves Métivier; Rodrigue Ossamy (OPODIS, 2006)

Election in the Qualitative World. - Jérémie Chalopin (SIROCCO, 2006)

Groupings and Pairings in Anonymous Networks. - Jérémie Chalopin; Shantanu Das 001; Nicola Santoro (DISC, 2006)

Graph Labelings Derived from Models in Distributed Computing. - Jérémie Chalopin; Daniël Paulusma (WG, 2006)

Local Computations in Graphs: The Case of Cellular Edge Local Computations. - Jérémie Chalopin; Yves Métivier; Wieslaw Zielonka (Fundam. Informaticae, 2006)

Planar graphs are in 1-STRING. - Jérémie Chalopin; Daniel Gonçalves 001; Pascal Ochem (SODA, 2007)

About the Termination Detection in the Asynchronous Message Passing Model. - Jérémie Chalopin; Emmanuel Godard; Yves Métivier; Gerard Tel (SOFSEM (1), 2007)

Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links. - Jérémie Chalopin; Shantanu Das 001; Nicola Santoro (DISC, 2007)

Dejean's conjecture and letter frequency. - Jérémie Chalopin; Pascal Ochem (Electron. Notes Discret. Math., 2007)

An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm. - Jérémie Chalopin; Yves Métivier (Fundam. Informaticae, 2007)

Labelled (Hyper)Graphs, Negotiations and the Naming Problem. - Jérémie Chalopin; Antoni W. Mazurkiewicz; Yves Métivier (ICGT, 2008)

Local Terminations and Distributed Computability in Anonymous Networks. - Jérémie Chalopin; Emmanuel Godard; Yves Métivier (DISC, 2008)

Playing With Population Protocols - Olivier Bournez; Jérémie Chalopin; Johanne Cohen; Xavier Koegler (CSP, 2008)

Election and rendezvous with incomparable labels. - Jérémie Chalopin (Theor. Comput. Sci., 2008)

Every planar graph is the intersection graph of segments in the plane: extended abstract. - Jérémie Chalopin; Daniel Gonçalves 001 (STOC, 2009)

Population Protocols that Correspond to Symmetric Games - Olivier Bournez; Jérémie Chalopin; Johanne Cohen; Xavier Koegler (CoRR, 2009)

How Simple Robots Benefit from Looking Back. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (CIAC, 2010)

Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. - Jérémie Chalopin; Daniël Paulusma (CIAC, 2010)

Rendezvous of Mobile Agents without Agreement on Local Orientation. - Jérémie Chalopin; Shantanu Das 001 (ICALP (2), 2010)

Constructing a Map of an Anonymous Graph: Applications of Universal Sequences. - Jérémie Chalopin; Shantanu Das 001; Adrian Kosowski (OPODIS, 2010)

Rendezvous of Mobile Agents in Directed Graphs. - Jérémie Chalopin; Shantanu Das 001; Peter Widmayer (DISC, 2010)

Network Exploration by Silent and Oblivious Robots. - Jérémie Chalopin; Paola Flocchini; Bernard Mans; Nicola Santoro (WG, 2010)

On the power of synchronization between two adjacent processes. - Jérémie Chalopin; Yves Métivier (Distributed Comput., 2010)

Planar Graphs Have 1-string Representations. - Jérémie Chalopin; Daniel Gonçalves 001; Pascal Ochem (Discret. Comput. Geom., 2010)

Computing with Pavlovian Populations. - Olivier Bournez; Jérémie Chalopin; Johanne Cohen; Xavier Koegler; Mikaël Rabie (OPODIS, 2011)

Tight Bounds for Scattered Black Hole Search in a Ring. - Jérémie Chalopin; Shantanu Das 001; Arnaud Labourel; Euripides Markou (SIROCCO, 2011)

Telling convex from reflex allows to map a polygon. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (STACS, 2011)

Black Hole Search with Finite Automata Scattered in a Synchronous Torus. - Jérémie Chalopin; Shantanu Das 001; Arnaud Labourel; Euripides Markou (DISC, 2011)

Asymetric Pavlovian Populations - Olivier Bournez; Jérémie Chalopin; Johanne Cohen; Xavier Koegler; Mikaël Rabie (CoRR, 2011)

Graph labelings derived from models in distributed computing: A complete complexity classification. - Jérémie Chalopin; Daniël Paulusma (Networks, 2011)

Cop and Robber Games When the Robber Can Hide and Ride. - Jérémie Chalopin; Victor Chepoi; Nicolas Nisse; Yann Vaxès (SIAM J. Discret. Math., 2011)

On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract). - Jérémie Chalopin; Yves Métivier; Thomas Morsellino (SIROCCO, 2012)

Collecting Information by Power-Aware Mobile Agents. - Julian Anaya; Jérémie Chalopin; Jurek Czyzowicz; Arnaud Labourel; Andrzej Pelc; Yann Vaxès (DISC, 2012)

Proof of two Maurer's conjectures on basis graphs of matroids - Jérémie Chalopin; Victor Chepoi; Damian Osajda (CoRR, 2012)

Election in partially anonymous networks with arbitrary knowledge in message passing systems. - Jérémie Chalopin; Emmanuel Godard; Yves Métivier (Distributed Comput., 2012)

Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks. - Jérémie Chalopin; Yves Métivier; Thomas Morsellino (Fundam. Informaticae, 2012)

Data Delivery by Energy-Constrained Mobile Agents. - Jérémie Chalopin; Shantanu Das 001; Matús Mihalák; Paolo Penna; Peter Widmayer (ALGOSENSORS, 2013)

Mapping Simple Polygons: How Robots Benefit from Looking Back. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (Algorithmica, 2013)

Simple agents learn to find their way: An introduction on mapping polygons. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (Discret. Appl. Math., 2013)

Population Protocols that Correspond to Symmetric Games. - Olivier Bournez; Jérémie Chalopin; Johanne Cohen; Xavier Koegler; Mikaël Rabie (Int. J. Unconv. Comput., 2013)

Retracts of Products of Chordal Graphs. - Bostjan Bresar; Jérémie Chalopin; Victor Chepoi; Matjaz Kovse; Arnaud Labourel; Yann Vaxès (J. Graph Theory, 2013)

Tight bounds for black hole search with scattered agents in synchronous rings. - Jérémie Chalopin; Shantanu Das 001; Arnaud Labourel; Euripides Markou (Theor. Comput. Sci., 2013)

Fault-Tolerant Rendezvous in Networks. - Jérémie Chalopin; Yoann Dieudonné; Arnaud Labourel; Andrzej Pelc (ICALP (2), 2014)

Data Delivery by Energy-Constrained Mobile Agents on a Line. - Jérémie Chalopin; Riko Jacob; Matús Mihalák; Peter Widmayer (ICALP (2), 2014)

What Do We Need to Know to Elect in Networks with Unknown Participants? - Jérémie Chalopin; Emmanuel Godard; Antoine Naudin (SIROCCO, 2014)

Lock-in Problem for Parallel Rotor-router Walks. - Jérémie Chalopin; Shantanu Das 001; Pawel Gawrychowski; Adrian Kosowski; Arnaud Labourel; Przemyslaw Uznanski (CoRR, 2014)

Cop and Robber Game and Hyperbolicity. - Jérémie Chalopin; Victor Chepoi; Panos Papasoglu; Timothée Pecatte (SIAM J. Discret. Math., 2014)

Limit Behavior of the Multi-agent Rotor-Router System. - Jérémie Chalopin; Shantanu Das 001; Pawel Gawrychowski; Adrian Kosowski; Arnaud Labourel; Przemyslaw Uznanski (DISC, 2015)

Anonymous Graph Exploration with Binoculars. - Jérémie Chalopin; Emmanuel Godard; Antoine Naudin (DISC, 2015)

Isometric Embedding of Busemann Surfaces into L1. - Jérémie Chalopin; Victor Chepoi; Guyslain Naves (Discret. Comput. Geom., 2015)

On two conjectures of Maurer concerning basis graphs of matroids. - Jérémie Chalopin; Victor Chepoi; Damian Osajda (J. Comb. Theory B, 2015)

Mapping Simple Polygons: The Power of Telling Convex from Reflex. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Matús Mihalák; Peter Widmayer (ACM Trans. Algorithms, 2015)

Collaborative Delivery with Energy-Constrained Mobile Robots. - Andreas Bärtschi; Jérémie Chalopin; Shantanu Das 001; Yann Disser; Barbara Geissmann; Daniel Graf 001; Arnaud Labourel; Matús Mihalák (SIROCCO, 2016)

Sequence Hypergraphs. - Katerina Böhmová; Jérémie Chalopin; Matús Mihalák; Guido Proietti; Peter Widmayer (WG, 2016)

Convergecast and Broadcast by Power-Aware Mobile Agents. - Julian Anaya; Jérémie Chalopin; Jurek Czyzowicz; Arnaud Labourel; Andrzej Pelc; Yann Vaxès (Algorithmica, 2016)

Restricted Frame Graphs and a Conjecture of Scott. - Jérémie Chalopin; Louis Esperet; Zhentao Li; Patrice Ossona de Mendez (Electron. J. Comb., 2016)

A counterexample to Thiagarajan's conjecture. - Jérémie Chalopin; Victor Chepoi (CoRR, 2016)

Using Binoculars for Fast Exploration and Map Construction in Chordal Graphs and Extensions. - Jérémie Chalopin; Emmanuel Godard; Antoine Naudin (CoRR, 2016)

Rendezvous in networks in spite of delay faults. - Jérémie Chalopin; Yoann Dieudonné; Arnaud Labourel; Andrzej Pelc (Distributed Comput., 2016)

A Counterexample to Thiagarajan's Conjecture on Regular Event Structures. - Jérémie Chalopin; Victor Chepoi (ICALP, 2017)

Energy-Efficient Delivery by Heterogeneous Mobile Agents. - Andreas Bärtschi; Jérémie Chalopin; Shantanu Das 001; Yann Disser; Daniel Graf 001; Jan Hackfeld; Paolo Penna (STACS, 2017)

Sequence Hypergraphs: Paths, Flows, and Cuts. - Katerina Böhmová; Jérémie Chalopin; Matús Mihalák; Guido Proietti; Peter Widmayer (Adventures Between Lower Bounds and Higher Altitudes, 2018)

Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. - Jérémie Chalopin; Victor Chepoi; Feodor F. Dragan; Guillaume Ducoffe; Abdulhakeem Mohammed; Yann Vaxès (SoCG, 2018)

Maximal Exploration of Trees with Energy-Constrained Agents. - Evangelos Bampas; Jérémie Chalopin; Shantanu Das 001; Jan Hackfeld; Christina Karousatou (CoRR, 2018)

Unlabeled Sample Compression Schemes and Corner Peelings for Ample and Maximum Classes. - Jérémie Chalopin; Victor Chepoi; Shay Moran; Manfred K. Warmuth (ICALP, 2019)

Near-Gathering of Energy-Constrained Mobile Agents. - Andreas Bärtschi; Evangelos Bampas; Jérémie Chalopin; Shantanu Das 001; Christina Karousatou; Matús Mihalák (SIROCCO, 2019)

Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents. - Jérémie Chalopin; Shantanu Das 001; Yann Disser; Arnaud Labourel; Matús Mihalák (SIROCCO, 2019)

Medians in median graphs in linear time. - Laurine Bénéteau; Jérémie Chalopin; Victor Chepoi; Yann Vaxès (CoRR, 2019)

1-Safe Petri Nets and Special Cube Complexes: Equivalence and Applications. - Jérémie Chalopin; Victor Chepoi (ACM Trans. Comput. Log., 2019)

Medians in Median Graphs and Their Cube Complexes in Linear Time. - Laurine Bénéteau; Jérémie Chalopin; Victor Chepoi; Yann Vaxès (ICALP, 2020)

Sample Compression Schemes for Balls in Graphs. - Jérémie Chalopin; Victor Chepoi; Fionn Mc Inerney; Sébastien Ratel; Yann Vaxès (MFCS, 2022)

Graphs with convex balls. - Jérémie Chalopin; Victor Chepoi; Ugo Giocanti (CoRR, 2022)

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G2-connected medians. - Laurine Bénéteau; Jérémie Chalopin; Victor Chepoi; Yann Vaxès (CoRR, 2022)

Isometric Path Complexity of Graphs. - Dibyayan Chakraborty; Jérémie Chalopin; Florent Foucaud; Yann Vaxès (MFCS, 2023)

Boundary rigidity of finite CAT(0) cube complexes. - Jérémie Chalopin; Victor Chepoi (CoRR, 2023)

Non-Clashing Teaching Maps for Balls in Graphs. - Jérémie Chalopin; Victor Chepoi; Fionn Mc Inerney; Sébastien Ratel (COLT, 2024)

Deterministic Leader Election for Stationary Programmable Matter with Common Direction. - Jérémie Chalopin; Shantanu Das 001; Maria Kokkou (SIROCCO, 2024)

Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory. - Jérémie Chalopin; Shantanu Das 001; Maria Kokkou (DISC, 2024)

ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G2-connected medians. - Laurine Bénéteau; Jérémie Chalopin; Victor Chepoi; Yann Vaxès (Discret. Appl. Math., 2024)

Boundary rigidity of CAT(0) cube complexes. - Jérémie Chalopin; Victor Chepoi (J. Comb. Theory B, 2024)

First-order logic axiomatization of metric graph theory. - Jérémie Chalopin; Manoj Changat; Victor Chepoi; Jeny Jacob (Theor. Comput. Sci., 2024)

Graphs with Gp-connected medians. - Laurine Bénéteau; Jérémie Chalopin; Victor Chepoi; Yann Vaxès (Math. Program., 2024)

Content-Oblivious Leader Election in 2-Edge-Connected Networks. - Jérémie Chalopin; Yi-Jun Chang; Lyuting Chen; Giuseppe Antonio Di Luna; Haoran Zhou (DISC, 2025)

Brief Announcement: Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings. - Jérémie Chalopin; Yi-Jun Chang; Lyuting Chen; Giuseppe Antonio Di Luna; Haoran Zhou (DISC, 2025)

On Gp-unimodality of radius functions in graphs: structure and algorithms. - Jérémie Chalopin; Victor Chepoi; Feodor F. Dragan; Guillaume Ducoffe; Yann Vaxès (CoRR, 2025)

Silent Self-Stabilising Leader Election in Programmable Matter Systems with Holes. - Jérémie Chalopin; Shantanu Das 001; Maria Kokkou (CoRR, 2025)

Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings. - Jérémie Chalopin; Yi-Jun Chang; Lyuting Chen; Giuseppe Antonio Di Luna; Haoran Zhou (CoRR, 2025)