| 2026 | MFCS | Generating Minimal Redundant and Maximal Irredundant Sets in Incidence Graphs. | Emanuel Elias Silva Castelo, Jrmie Chalopin, Oscar Defrain, Simon Vilmin |
| 2026 | PODC | Efficient Counting and Simulation in Content-Oblivious Rings. | Jrmie Chalopin, Yi-Jun Chang, Giuseppe Antonio Di Luna, Haoran Zhou |
| 2026 | SPAA | Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings. | Jrmie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe Antonio Di Luna, Haoran Zhou |
| 2026 | SIROCCO | Silent Self-stabilising Leader Election in Programmable Matter Systems with Holes. | Jrmie Chalopin, Shantanu Das, Maria Kokkou |
| 2026 | SIROCCO | Leveraging Structural Knowledge for Solving Election in Anonymous Networks with Shared Randomness. | Jrmie Chalopin, Emmanuel Godard |
| 2024 | COLT | Non-Clashing Teaching Maps for Balls in Graphs. | Jrmie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sbastien Ratel |
| 2024 | SIROCCO | Deterministic Leader Election for Stationary Programmable Matter with Common Direction. | Jrmie Chalopin, Shantanu Das, Maria Kokkou |
| 2023 | MFCS | Isometric Path Complexity of Graphs. | Dibyayan Chakraborty, Jrmie Chalopin, Florent Foucaud, Yann Vaxs |
| 2022 | MFCS | Sample Compression Schemes for Balls in Graphs. | Jrmie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sbastien Ratel, Yann Vaxs |
| 2020 | ICALP | Medians in Median Graphs and Their Cube Complexes in Linear Time. | Laurine Bnteau, Jrmie Chalopin, Victor Chepoi, Yann Vaxs |
| 2019 | ICALP | Unlabeled Sample Compression Schemes and Corner Peelings for Ample and Maximum Classes. | Jrmie Chalopin, Victor Chepoi, Shay Moran, Manfred K. Warmuth |
| 2019 | SIROCCO | Near-Gathering of Energy-Constrained Mobile Agents. | Andreas Brtschi, Evangelos Bampas, Jrmie Chalopin, Shantanu Das, Christina Karousatou, Mats Mihalk |
| 2019 | SIROCCO | Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents. | Jrmie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Mats Mihalk |
| 2017 | ICALP | A Counterexample to Thiagarajan's Conjecture on Regular Event Structures. | Jrmie Chalopin, Victor Chepoi |
| 2017 | STACS | Energy-Efficient Delivery by Heterogeneous Mobile Agents. | Andreas Brtschi, Jrmie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna |
| 2016 | SIROCCO | Collaborative Delivery with Energy-Constrained Mobile Robots. | Andreas Brtschi, Jrmie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Mats Mihalk |
| 2016 | WG | Sequence Hypergraphs. | Katerina Bhmov, Jrmie Chalopin, Mats Mihalk, Guido Proietti, Peter Widmayer |
| 2014 | ICALP | Fault-Tolerant Rendezvous in Networks. | Jrmie Chalopin, Yoann Dieudonn, Arnaud Labourel, Andrzej Pelc |
| 2014 | ICALP | Data Delivery by Energy-Constrained Mobile Agents on a Line. | Jrmie Chalopin, Riko Jacob, Mats Mihalk, Peter Widmayer |
| 2014 | SIROCCO | What Do We Need to Know to Elect in Networks with Unknown Participants? | Jrmie Chalopin, Emmanuel Godard, Antoine Naudin |
| 2013 | Algosensors | Data Delivery by Energy-Constrained Mobile Agents. | Jrmie Chalopin, Shantanu Das, Mats Mihalk, Paolo Penna, Peter Widmayer |
| 2012 | SIROCCO | On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract). | Jrmie Chalopin, Yves Mtivier, Thomas Morsellino |
| 2011 | OPODIS | Computing with Pavlovian Populations. | Olivier Bournez, Jrmie Chalopin, Johanne Cohen, Xavier Koegler, Mikal Rabie |
| 2011 | STACS | Telling convex from reflex allows to map a polygon. | Jrmie Chalopin, Shantanu Das, Yann Disser, Mats Mihalk, Peter Widmayer |
| 2011 | SIROCCO | Tight Bounds for Scattered Black Hole Search in a Ring. | Jrmie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou |
| 2010 | CIAC | How Simple Robots Benefit from Looking Back. | Jrmie Chalopin, Shantanu Das, Yann Disser, Mats Mihalk, Peter Widmayer |
| 2010 | CIAC | Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. | Jrmie Chalopin, Danil Paulusma |
| 2010 | ICALP | Rendezvous of Mobile Agents without Agreement on Local Orientation. | Jrmie Chalopin, Shantanu Das |
| 2010 | OPODIS | Constructing a Map of an Anonymous Graph: Applications of Universal Sequences. | Jrmie Chalopin, Shantanu Das, Adrian Kosowski |
| 2010 | WG | Network Exploration by Silent and Oblivious Robots. | Jrmie Chalopin, Paola Flocchini, Bernard Mans, Nicola Santoro |
| 2009 | STOC | Every planar graph is the intersection graph of segments in the plane: extended abstract. | Jrmie Chalopin, Daniel Gonalves |
| 2007 | SODA | Planar graphs are in 1-STRING. | Jrmie Chalopin, Daniel Gonalves, Pascal Ochem |
| 2007 | SOFSEM | About the Termination Detection in the Asynchronous Message Passing Model. | Jrmie Chalopin, Emmanuel Godard, Yves Mtivier, Gerard Tel |
| 2006 | OPODIS | Mobile Agent Algorithms Versus Message Passing Algorithms. | Jrmie Chalopin, Emmanuel Godard, Yves Mtivier, Rodrigue Ossamy |
| 2006 | SIROCCO | Election in the Qualitative World. | Jrmie Chalopin |
| 2006 | WG | Graph Labelings Derived from Models in Distributed Computing. | Jrmie Chalopin, Danil Paulusma |
| 2005 | MFCS | A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. | Jrmie Chalopin, Yves Mtivier |
| 2005 | SOFSEM | Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem. | Jrmie Chalopin |
| 2004 | FOSSACS | Election and Local Computations on Edges. | Jrmie Chalopin, Yves Mtivier |