Jérémie Chalopin

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 54

Top Venues

CoRR

SIROCCO

Theor. Comput. Sci.

J. Comput. Syst. Sci.

Publications

Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G2-connected medians. Discret. Appl. Math. 359 (2024)
Jérémie Chalopin, Victor Chepoi
Boundary rigidity of CAT(0) cube complexes. J. Comb. Theory B 169 (2024)
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
-connected medians. Math. Program. 203 (1) (2024)
Jérémie Chalopin, Manoj Changat, Victor Chepoi, Jeny Jacob
First-order logic axiomatization of metric graph theory. Theor. Comput. Sci. 993 (2024)
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel
Non-Clashing Teaching Maps for Balls in Graphs. COLT (2024)
Jérémie Chalopin, Shantanu Das, Maria Kokkou
Deterministic Leader Election for Stationary Programmable Matter with Common Direction. SIROCCO (2024)
Jérémie Chalopin, Shantanu Das, Maria Kokkou
Deterministic Leader Election for Stationary Programmable Matter with Common Direction. CoRR (2024)
Jérémie Chalopin, Victor Chepoi
Boundary rigidity of finite CAT(0) cube complexes. CoRR (2023)
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel
Non-Clashing Teaching Maps for Balls in Graphs. CoRR (2023)
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès
Sample Compression Schemes for Balls in Graphs. SIAM J. Discret. Math. 37 (4) (2023)
Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès
Isometric Path Complexity of Graphs. MFCS (2023)
Jérémie Chalopin, Manoj Changat, Victor Chepoi, Jeny Jacob
First-order logic axiomatization of metric graph theory. CoRR (2022)
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
-connected medians. CoRR (2022)
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès
Sample Compression Schemes for Balls in Graphs. MFCS (2022)
Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès
Sample compression schemes for balls in graphs. CoRR (2022)
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
-connected medians. CoRR (2022)
Jérémie Chalopin, Victor Chepoi, Ugo Giocanti
Graphs with convex balls. CoRR (2022)
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
Medians in median graphs and their cube complexes in linear time. J. Comput. Syst. Sci. 126 (2022)
Jérémie Chalopin, Victor Chepoi, Shay Moran, Manfred K. Warmuth
Unlabeled sample compression schemes and corner peelings for ample and maximum classes. J. Comput. Syst. Sci. 127 (2022)
Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák
Collaborative delivery on a fixed path with homogeneous energy-constrained agents. Theor. Comput. Sci. 868 (2021)
Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. Discret. Comput. Geom. 65 (3) (2021)
Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, Matús Mihalák
Near-gathering of energy-constrained mobile agents. Theor. Comput. Sci. 849 (2021)
Jérémie Chalopin, Victor Chepoi
A counterexample to Thiagarajan's conjecture on regular event structures. J. Comput. Syst. Sci. 113 (2020)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
Collaborative delivery with energy-constrained mobile robots. Theor. Comput. Sci. 810 (2020)
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
Medians in Median Graphs and Their Cube Complexes in Linear Time. ICALP (2020)
Jérémie Chalopin, Victor Chepoi
1-Safe Petri Nets and Special Cube Complexes: Equivalence and Applications. ACM Trans. Comput. Log. 20 (3) (2019)
Laurine Bénéteau, Jérémie Chalopin, Victor Chepoi, Yann Vaxès
Medians in median graphs in linear time. CoRR (2019)
Jérémie Chalopin, Victor Chepoi, Shay Moran, Manfred K. Warmuth
Unlabeled Sample Compression Schemes and Corner Peelings for Ample and Maximum Classes. ICALP (2019)
Andreas Bärtschi, Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Christina Karousatou, Matús Mihalák
Near-Gathering of Energy-Constrained Mobile Agents. SIROCCO (2019)
Jérémie Chalopin, Shantanu Das, Yann Disser, Arnaud Labourel, Matús Mihalák
Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents. SIROCCO (2019)
Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
Fast approximation and exact computation of negative curvature parameters of graphs. CoRR (2018)
Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer
Sequence Hypergraphs: Paths, Flows, and Cuts. Adventures Between Lower Bounds and Higher Altitudes (2018)
Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, Yann Vaxès
Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. SoCG (2018)
Jérémie Chalopin, Victor Chepoi, Shay Moran, Manfred K. Warmuth
Unlabeled sample compression schemes and corner peelings for ample and maximum classes. CoRR (2018)
Evangelos Bampas, Jérémie Chalopin, Shantanu Das, Jan Hackfeld, Christina Karousatou
Maximal Exploration of Trees with Energy-Constrained Agents. CoRR (2018)
Jérémie Chalopin, Victor Chepoi
1-Safe Petri nets and special cube complexes: equivalence and applications. CoRR (2018)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna
Energy-Efficient Delivery by Heterogeneous Mobile Agents. STACS (2017)
Jérémie Chalopin, Victor Chepoi
A Counterexample to Thiagarajan's Conjecture on Regular Event Structures. ICALP (2017)
Jérémie Chalopin, Louis Esperet, Zhentao Li, Patrice Ossona de Mendez
Restricted Frame Graphs and a Conjecture of Scott. Electron. J. Comb. 23 (1) (2016)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
Collaborative Delivery with Energy-Constrained Mobile Robots. SIROCCO (2016)
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
Using Binoculars for Fast Exploration and Map Construction in Chordal Graphs and Extensions. CoRR (2016)
Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
Convergecast and Broadcast by Power-Aware Mobile Agents. CoRR (2016)
Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
Convergecast and Broadcast by Power-Aware Mobile Agents. Algorithmica 74 (1) (2016)
Jérémie Chalopin, Victor Chepoi
A counterexample to Thiagarajan's conjecture. CoRR (2016)
Katerina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer
Sequence Hypergraphs. WG (2016)
Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
Rendezvous in networks in spite of delay faults. Distributed Comput. 29 (3) (2016)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna
Energy-efficient Delivery by Heterogeneous Mobile Agents. CoRR (2016)
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
Collaborative Delivery with Energy-Constrained Mobile Robots. CoRR (2016)
Jérémie Chalopin, Victor Chepoi, Damian Osajda
On two conjectures of Maurer concerning basis graphs of matroids. J. Comb. Theory, Ser. B 114 (2015)
Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski
Limit Behavior of the Multi-agent Rotor-Router System. DISC (2015)
Jérémie Chalopin, Victor Chepoi, Guyslain Naves
. Discret. Comput. Geom. 53 (1) (2015)
Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
Mapping Simple Polygons: The Power of Telling Convex from Reflex. ACM Trans. Algorithms 11 (4) (2015)
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
Anonymous Graph Exploration with Binoculars. DISC (2015)
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
Anonymous Graph Exploration with Binoculars. CoRR (2015)
Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
Fault-Tolerant Rendezvous in Networks. CoRR (2014)
Jérémie Chalopin, Victor Chepoi, Panos Papasoglu, Timothée Pecatte
Cop and Robber Game and Hyperbolicity. SIAM J. Discret. Math. 28 (4) (2014)
Jérémie Chalopin, Shantanu Das, Pawel Gawrychowski, Adrian Kosowski, Arnaud Labourel, Przemyslaw Uznanski
Lock-in Problem for Parallel Rotor-router Walks. CoRR (2014)
Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc
Fault-Tolerant Rendezvous in Networks. ICALP (2) (2014)
Jérémie Chalopin, Riko Jacob, Matús Mihalák, Peter Widmayer
Data Delivery by Energy-Constrained Mobile Agents on a Line. ICALP (2) (2014)
Jérémie Chalopin, Daniël Paulusma
Packing bipartite graphs with covers of complete bipartite graphs. Discret. Appl. Math. 168 (2014)
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
What Do We Need to Know to Elect in Networks with Unknown Participants? SIROCCO (2014)
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) (2013)
Jérémie Chalopin, Victor Chepoi, Panos Papasoglu, Timothée Pecatte
Cop and robber game and hyperbolicity. CoRR (2013)
Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
Tight bounds for black hole search with scattered agents in synchronous rings. Theor. Comput. Sci. 509 (2013)
Jérémie Chalopin, Shantanu Das, Matús Mihalák, Paolo Penna, Peter Widmayer
Data Delivery by Energy-Constrained Mobile Agents. ALGOSENSORS (2013)
Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie
Population Protocols that Correspond to Symmetric Games. Int. J. Unconv. Comput. 9 (1-2) (2013)
Bostjan Bresar, Jérémie Chalopin, Victor Chepoi, Matjaz Kovse, Arnaud Labourel, Yann Vaxès
Retracts of Products of Chordal Graphs. J. Graph Theory 73 (2) (2013)
Jérémie Chalopin, Victor Chepoi, Guyslain Naves
. CoRR (2013)
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. Discret. Appl. Math. 161 (10-11) (2013)
Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès
Collecting Information by Power-Aware Mobile Agents. DISC (2012)
Jérémie Chalopin, Yves Métivier, Thomas Morsellino
On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract). SIROCCO (2012)
Jérémie Chalopin, Victor Chepoi, Damian Osajda
Proof of two Maurer's conjectures on basis graphs of matroids CoRR (2012)
Jérémie Chalopin, Emmanuel Godard, Yves Métivier
Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distributed Comput. 25 (4) (2012)
Jérémie Chalopin, Yves Métivier, Thomas Morsellino
Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks. Fundam. Informaticae 120 (1) (2012)
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 (2012)
Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie
Asymetric Pavlovian Populations CoRR (2011)
Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings CoRR (2011)
Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès
Cop and Robber Games When the Robber Can Hide and Ride. SIAM J. Discret. Math. 25 (1) (2011)
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)
Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie
Computing with Pavlovian Populations. OPODIS (2011)
Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
Tight Bounds for Scattered Black Hole Search in a Ring. SIROCCO (2011)
Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
Black Hole Search with Finite Automata Scattered in a Synchronous Torus. DISC (2011)
Jérémie Chalopin, Daniël Paulusma
Graph labelings derived from models in distributed computing: A complete complexity classification. Networks 58 (3) (2011)
Jérémie Chalopin, Shantanu Das, Arnaud Labourel, Euripides Markou
Black Hole Search with Finite Automata Scattered in a Synchronous Torus CoRR (2011)
Jérémie Chalopin, Shantanu Das
Rendezvous of Mobile Agents without Agreement on Local Orientation. ICALP (2) (2010)
Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem
Planar Graphs Have 1-string Representations. Discret. Comput. Geom. 43 (3) (2010)
Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer
How Simple Robots Benefit from Looking Back. CIAC (2010)
Jérémie Chalopin, Shantanu Das, Adrian Kosowski
Constructing a Map of an Anonymous Graph: Applications of Universal Sequences. OPODIS (2010)
Jérémie Chalopin, Paola Flocchini, Bernard Mans, Nicola Santoro
Network Exploration by Silent and Oblivious Robots. WG (2010)
Jérémie Chalopin, Yves Métivier
On the power of synchronization between two adjacent processes. Distributed Comput. 23 (3) (2010)
Jérémie Chalopin, Victor Chepoi, Nicolas Nisse, Yann Vaxès
Cop and robber games when the robber can hide and ride CoRR (2010)
Jérémie Chalopin, Daniël Paulusma
Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. CIAC (2010)
Jérémie Chalopin, Shantanu Das, Peter Widmayer
Rendezvous of Mobile Agents in Directed Graphs. DISC (2010)
Jérémie Chalopin, Daniel Gonçalves
Every planar graph is the intersection graph of segments in the plane: extended abstract. STOC (2009)
Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler
Population Protocols that Correspond to Symmetric Games CoRR (2009)
Jérémie Chalopin, Emmanuel Godard, Yves Métivier
Local Terminations and Distributed Computability in Anonymous Networks. DISC (2008)
Jérémie Chalopin, Pascal Ochem
Dejean's conjecture and letter frequency. RAIRO Theor. Informatics Appl. 42 (3) (2008)
Jérémie Chalopin
Election and rendezvous with incomparable labels. Theor. Comput. Sci. 399 (1-2) (2008)
Jérémie Chalopin, Antoni W. Mazurkiewicz, Yves Métivier
Labelled (Hyper)Graphs, Negotiations and the Naming Problem. ICGT (2008)
Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler
Playing With Population Protocols CSP (2008)

Jérémie Chalopin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jérémie Chalopin