Jérémie Chalopin

540 total citations
31 papers, 134 citations indexed

About

Jérémie Chalopin is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Computer Networks and Communications. According to data from OpenAlex, Jérémie Chalopin has authored 31 papers receiving a total of 134 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 12 papers in Geometry and Topology and 7 papers in Computer Networks and Communications. Recurrent topics in Jérémie Chalopin's work include Advanced Graph Theory Research (13 papers), Geometric and Algebraic Topology (7 papers) and semigroups and automata theory (6 papers). Jérémie Chalopin is often cited by papers focused on Advanced Graph Theory Research (13 papers), Geometric and Algebraic Topology (7 papers) and semigroups and automata theory (6 papers). Jérémie Chalopin collaborates with scholars based in France, United States and Poland. Jérémie Chalopin's co-authors include Victor Chepoi, Daniel Gonçalves, Damian Osajda, Yann Vaxès, Hing Leung, Hiroshi Hirai, Yves Métivier, Nicolas Nisse, Panos Papasoglu and Patrice Ossona de Mendez and has published in prestigious journals such as Advances in Mathematics, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Jérémie Chalopin

23 papers receiving 126 citations

Peers

Jérémie Chalopin
Rudi Pendavingh Netherlands
Xavier Pérez‐Giménez Canada
Rudini Sampaio Brazil
Bartosz Walczak Poland
Dimitrios M. Thilikos France
Gábor Braun United States
Jean-Xavier Rampon France
Michał Adamaszek United Kingdom
Norbert Polat France
Robert Cowen United States
Rudi Pendavingh Netherlands
Jérémie Chalopin
Citations per year, relative to Jérémie Chalopin Jérémie Chalopin (= 1×) peers Rudi Pendavingh

Countries citing papers authored by Jérémie Chalopin

Since Specialization
Citations

This map shows the geographic impact of Jérémie Chalopin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jérémie Chalopin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jérémie Chalopin more than expected).

Fields of papers citing papers by Jérémie Chalopin

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jérémie Chalopin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jérémie Chalopin. The network helps show where Jérémie Chalopin may publish in the future.

Co-authorship network of co-authors of Jérémie Chalopin

This figure shows the co-authorship network connecting the top 25 collaborators of Jérémie Chalopin. A scholar is included among the top collaborators of Jérémie Chalopin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jérémie Chalopin. Jérémie Chalopin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Chalopin, Jérémie, et al.. (2025). Helly groups. Geometry & Topology. 29(1). 1–70.
2.
Chalopin, Jérémie & Victor Chepoi. (2024). Boundary rigidity of CAT(0) cube complexes. Journal of Combinatorial Theory Series B. 169. 352–366.
3.
Chalopin, Jérémie, et al.. (2024). ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G2-connected medians. Discrete Applied Mathematics. 359. 55–74.
4.
Chalopin, Jérémie, et al.. (2022). Medians in median graphs and their cube complexes in linear time. Journal of Computer and System Sciences. 126. 80–105. 5 indexed citations
5.
Chalopin, Jérémie, Victor Chepoi, Shay Moran, & Manfred K. Warmuth. (2022). Unlabeled sample compression schemes and corner peelings for ample and maximum classes. Journal of Computer and System Sciences. 127. 1–28. 6 indexed citations
6.
Bärtschi, Andreas, et al.. (2020). Near-gathering of energy-constrained mobile agents. Theoretical Computer Science. 849. 35–46.
7.
Chalopin, Jérémie, et al.. (2019). Unlabeled Sample Compression Schemes and Corner Peelings for Ample and Maximum Classes. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
8.
Chalopin, Jérémie, et al.. (2019). Medians in median graphs in linear time.. arXiv (Cornell University). 1 indexed citations
9.
Chalopin, Jérémie & Victor Chepoi. (2019). 1-Safe Petri Nets and Special Cube Complexes. ACM Transactions on Computational Logic. 20(3). 1–49. 1 indexed citations
10.
Chalopin, Jérémie, et al.. (2014). Cop and Robber Game and Hyperbolicity. SIAM Journal on Discrete Mathematics. 28(4). 1987–2007. 12 indexed citations
11.
Brešar, Boštjan, et al.. (2013). Bucolic complexes. Advances in Mathematics. 243. 127–167. 11 indexed citations
12.
Chalopin, Jérémie, et al.. (2013). Tight bounds for black hole search with scattered agents in synchronous rings. Theoretical Computer Science. 509. 70–85. 7 indexed citations
13.
Chalopin, Jérémie, Emmanuel Godard, & Yves Métivier. (2012). Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distributed Computing. 25(4). 297–311. 5 indexed citations
14.
Chalopin, Jérémie & Daniël Paulusma. (2012). Packing bipartite graphs with covers of complete bipartite graphs. Discrete Applied Mathematics. 168. 40–50. 2 indexed citations
15.
Chalopin, Jérémie & Daniël Paulusma. (2011). Graph labelings derived from models in distributed computing: A complete complexity classification. Networks. 58(3). 207–231. 2 indexed citations
16.
Chalopin, Jérémie & Yves Métivier. (2010). On the power of synchronization between two adjacent processes. Distributed Computing. 23(3). 177–196. 4 indexed citations
17.
Chalopin, Jérémie & Pascal Ochem. (2008). Dejean's conjecture and letter frequency. RAIRO - Theoretical Informatics and Applications. 42(3). 477–480. 2 indexed citations
18.
Chalopin, Jérémie. (2005). Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem (Extended Abstract). 2 indexed citations
19.
Chalopin, Jérémie, Yves Métivier, & Wiesław Zielonka. (2004). Election, Naming and Cellular Edge Local Computations (Extended Abstract). Lecture notes in computer science. 242–256. 1 indexed citations
20.
Chalopin, Jérémie & Hing Leung. (2003). On factorization forests of finite height. Theoretical Computer Science. 310(1-3). 489–499. 8 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Rudi Pendavingh Breakdown of academic impact, for papers by Xavier Pérez‐Giménez Breakdown of academic impact, for papers by Rudini Sampaio Breakdown of academic impact, for papers by Bartosz Walczak Breakdown of academic impact, for papers by Dimitrios M. Thilikos Breakdown of academic impact, for papers by Gábor Braun Breakdown of academic impact, for papers by Jean-Xavier Rampon Breakdown of academic impact, for papers by Michał Adamaszek Breakdown of academic impact, for papers by Norbert Polat Breakdown of academic impact, for papers by Robert Cowen
Rankless by CCL
2026