JCJérémie Chalopin

Jérémie Chalopin

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Jérémie Chalopin has a total of 42 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

    • 9 January 2024
    • Published by HAL in HAL
    Open Access

    Rendezvous in networks in spite of delay faults

    by Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc

    Two mobile agents, starting from different nodes of an unknown network, have to meet at a node. Agents move in synchronous rounds using a deterministic algorithm. Each agent has a different label, which it can use in the execution of the algorithm, but it does not know the label of the other agent. Agents do not know any bound on the size of the network. In each round an agent decides if it remains idle or if it wants to move to one of the adjacent nodes. Agents are subject to delay faults: if an agent incurs a fault in a given round, it remains in the current node, regardless of its decision. If it planned to move and the fault happened, the agent is aware of it. We consider three scenarios of fault distribution: random (independently in each round and for each agent with constant probability 0 < p < 1), unbounded adversarial (the adversary can delay an agent for an arbitrary finite number of consecutive rounds) and bounded adversarial (the adversary can delay an agent for at most c consecutive rounds, where c is unknown to the agents). The quality measure of a rendezvous algorithm is its cost, which is the total number of edge traversals. For random faults, we show an algorithm with cost polynomial in the size n of the network and polylogarithmic in the larger label L, which achieves rendezvous with very high probability in arbitrary networks. By contrast, for unbounded adversarial faults we show that rendezvous is not possible, even in the class of rings. Under this scenario we give a rendezvous algorithm with cost O(nℓ), where ℓ is the smaller label, working in arbitrary trees, and we show that Ω(ℓ) is the lower bound on rendezvous cost, even for the two-node tree. For bounded adversarial faults, we give a rendezvous algorithm working for arbitrary networks, with cost polynomial in n, and logarithmic in the bound c and in the larger label L.

    • 6 October 2023
    • Published by HAL in HAL
    Open Access

    Isometric Embedding of Busemann Surfaces into $L_1$

    by Jérémie Chalopin, Victor Chepoi, Guyslain Naves

    In this paper, we prove that any non-positively curved 2-dimensional surface (alias, Busemann surface) is isometrically embeddable into L1. As a corollary, we obtain that all planar graphs which are 1-skeletons of planar non-positively curved complexes with regular Euclidean polygons as cells are L1-embeddable with distortion at most 2. Our results significantly improve and simplify the results of the recent paper by A. Sidiropoulos (Non-positive curvature and the planar embedding conjecture, FOCS (2013)).

  • Open Access

    A counterexample to Thiagarajan's conjecture on regular event structures

    by Jérémie Chalopin, Victor Chepoi

    We provide a counterexample to a conjecture by Thiagarajan (1996 and 2002) that regular prime event structures correspond exactly to finite 1-safe Petri nets. The same counterexample is used to disprove a closely related conjecture by Badouel, Darondeau, and Raoult (1999) that domains of regular event structures with bounded $\natural$-cliques are recognizable by finite trace automata. Event structures, trace automata, and Petri nets are fundamental models in concurrency theory. There exist nice interpretations of these structures as combinatorial and geometric objects and both conjectures can be reformulated in this framework. Namely, from a graph theoretical point of view, the domains of prime event structures correspond exactly to median graphs; from a geometric point of view, these domains are in bijection with CAT(0) cube complexes. A necessary condition for both conjectures to be true is that domains of respective regular event structures admit a regular nice labeling (which corresponds to a special coloring of the hyperplanes of the associated CAT(0) cube complex). To disprove these conjectures, we describe a regular event domain (with bounded $\natural$-cliques) that does not admit a regular nice labeling. Our counterexample is derived from an example by Wise (1996 and 2007) of a nonpositively curved square complex ${\bf X}$ with six squares, whose edges are colored in five colors, and whose universal cover $\widetilde{\bf X}$ is a CAT(0) square complex containing a particular plane with an aperiodic tiling.

  • Open Access

    Collaborative Delivery with Energy-Constrained Mobile Robots

    by Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matúš Mihalák

    We consider the problem of collectively delivering some message from a specified source to a designated target location in a graph, using multiple mobile agents. Each agent has a limited energy which constrains the distance it can move. Hence multiple agents need to collaborate to move the message, each agent handing over the message to the next agent to carry it forward. Given the positions of the agents in the graph and their respective budgets, the problem of finding a feasible movement schedule for the agents can be challenging. We consider two variants of the problem: in non-returning delivery, the agents can stop anywhere; whereas in returning delivery, each agent needs to return to its starting location, a variant which has not been studied before. We first provide a polynomial-time algorithm for returning delivery on trees, which is in contrast to the known (weak) NP-hardness of the non-returning version. In addition, we give resource-augmented algorithms for returning delivery in general graphs. Finally, we give tight lower bounds on the required resource augmentation for both variants of the problem. In this sense, our results close the gap left by previous research.

  • Open Access

    Convergecast and Broadcast by Power-Aware Mobile Agents

    by Julian Anaya, Jérémie Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès

    A set of identical, mobile agents is deployed in a weighted network. Each agent has a battery -- a power source allowing it to move along network edges. An agent uses its battery proportionally to the distance traveled. We consider two tasks : convergecast, in which at the beginning, each agent has some initial piece of information, and information of all agents has to be collected by some agent; and broadcast in which information of one specified agent has to be made available to all other agents. In both tasks, the agents exchange the currently possessed information when they meet. The objective of this paper is to investigate what is the minimal value of power, initially available to all agents, so that convergecast or broadcast can be achieved. We study this question in the centralized and the distributed settings. In the centralized setting, there is a central monitor that schedules the moves of all agents. In the distributed setting every agent has to perform an algorithm being unaware of the network. In the centralized setting, we give a linear-time algorithm to compute the optimal battery power and the strategy using it, both for convergecast and for broadcast, when agents are on the line. We also show that finding the optimal battery power for convergecast or for broadcast is NP-hard for the class of trees. On the other hand, we give a polynomial algorithm that finds a 2-approximation for convergecast and a 4-approximation for broadcast, for arbitrary graphs. In the distributed setting, we give a 2-competitive algorithm for convergecast in trees and a 4-competitive algorithm for broadcast in trees. The competitive ratio of 2 is proved to be the best for the problem of convergecast, even if we only consider line networks. Indeed, we show that there is no (2 -- $\epsilon$)-competitive algorithm for convergecast or for broadcast in the class of lines, for any $\epsilon$ \textgreater{} 0.

  • Open Access

    Restricted Frame Graphs and a Conjecture of Scott

    by Jérémie Chalopin, Louis Esperet, Zhentao Li, Patrice Ossona de Mendez

    Scott proved in 1997 that for any tree $T$, every graph with bounded clique number which does not contain any subdivision of $T$ as an induced subgraph has bounded chromatic number. Scott also conjectured that the same should hold if $T$ is replaced by any graph $H$. Pawlik et al. recently constructed a family of triangle-free intersection graphs of segments in the plane with unbounded chromatic number (thereby disproving an old conjecture of Erdős). This shows that Scott's conjecture is false whenever $H$ is obtained from a non-planar graph by subdividing every edge at least once.It remains interesting to decide which graphs $H$ satisfy Scott's conjecture and which do not. In this paper, we study the construction of Pawlik et al. in more details to extract more counterexamples to Scott's conjecture. For example, we show that Scott's conjecture is false for any graph obtained from $K_4$ by subdividing every edge at least once. We also prove that if $G$ is a 2-connected multigraph with no vertex contained in every cycle of $G$, then any graph obtained from $G$ by subdividing every edge at least twice is a counterexample to Scott's conjecture.


  • Rendezvous in networks in spite of delay faults

    by Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc


  • Open Access

    Rendezvous in Networks in Spite of Delay Faults

    by Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc

    Two mobile agents, starting from different nodes of an unknown network, have to meet at the same node. Agents move in synchronous rounds using a deterministic algorithm. Each agent has a different label, which it can use in the execution of the algorithm, but it does not know the label of the other agent. Agents do not know any bound on the size of the network. In each round an agent decides if it remains idle or if it wants to move to one of the adjacent nodes. Agents are subject to delay faults: if an agent incurs a fault in a given round, it remains in the current node, regardless of its decision. If it planned to move and the fault happened, the agent is aware of it. We consider three scenarios of fault distribution: random (independently in each round and for each agent with constant probability 0 < p < 1), unbounded adver- sarial (the adversary can delay an agent for an arbitrary finite number of consecutive rounds) and bounded adversarial (the adversary can delay an agent for at most c consecutive rounds, where c is unknown to the agents). The quality measure of a rendezvous algorithm is its cost, which is the total number of edge traversals. For random faults, we show an algorithm with cost polynomial in the size n of the network and polylogarithmic in the larger label L, which achieves rendezvous with very high probability in arbitrary networks. By contrast, for unbounded adversarial faults we show that rendezvous is not feasible, even in the class of rings. Under this scenario we give a rendezvous algorithm with cost O(nl), where l is the smaller label, working in arbitrary trees, and we show that \Omega(l) is the lower bound on rendezvous cost, even for the two-node tree. For bounded adversarial faults, we give a rendezvous algorithm working for arbitrary networks, with cost polynomial in n, and logarithmic in the bound c and in the larger label L.

  • Open Access

    On two conjectures of Maurer concerning basis graphs of matroids

    by Jérémie Chalopin, Victor Chepoi, Damian Osajda

    We characterize 2-dimensional complexes associated canonically with basis graphs of matroids as simply connected triangle-square complexes satisfying some local conditions. This proves a version of a (disproved) conjecture by Stephen Maurer (Conjecture 3 of S. Maurer, Matroid basis graphs I, JCTB 14 (1973), 216-240). We also establish Conjecture 1 from the same paper about the redundancy of the conditions in the characterization of basis graphs. We indicate positive-curvature-like aspects of the local properties of the studied complexes. We characterize similarly the corresponding 2-dimensional complexes of even $\Delta$-matroids.