Jean-Luc Baril

463 total citations
34 papers, 126 citations indexed

About

Jean-Luc Baril is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Jean-Luc Baril has authored 34 papers receiving a total of 126 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Discrete Mathematics and Combinatorics, 17 papers in Computational Theory and Mathematics and 16 papers in Artificial Intelligence. Recurrent topics in Jean-Luc Baril's work include Advanced Combinatorial Mathematics (26 papers), semigroups and automata theory (8 papers) and Advanced Mathematical Identities (7 papers). Jean-Luc Baril is often cited by papers focused on Advanced Combinatorial Mathematics (26 papers), semigroups and automata theory (8 papers) and Advanced Mathematical Identities (7 papers). Jean-Luc Baril collaborates with scholars based in France, Colombia and Ireland. Jean-Luc Baril's co-authors include Vincent Vajnovszki, Olivier Togni, Hamamache Kheddouci, Jósé L. Ramírez, Jean Marcel Pallo, Paul Barry, Cyril Banderier and Toufik Mansour and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Discrete Applied Mathematics.

In The Last Decade

Jean-Luc Baril

29 papers receiving 114 citations

Peers

Jean-Luc Baril
Rudi Pendavingh Netherlands
Kevin O’Bryant United States
Hunter S. Snevily United States
Steve Linton United Kingdom
Alex Fink United States
Alexander Burstein United States
Bartosz Walczak Poland
Dirk Hachenberger Germany
Horacio Tapia-Recillas Mexico
Mathilde Bouvel France
Rudi Pendavingh Netherlands
Jean-Luc Baril
Citations per year, relative to Jean-Luc Baril Jean-Luc Baril (= 1×) peers Rudi Pendavingh

Countries citing papers authored by Jean-Luc Baril

Since Specialization
Citations

This map shows the geographic impact of Jean-Luc Baril'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 Jean-Luc Baril with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jean-Luc Baril more than expected).

Fields of papers citing papers by Jean-Luc Baril

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jean-Luc Baril. 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 Jean-Luc Baril. The network helps show where Jean-Luc Baril may publish in the future.

Co-authorship network of co-authors of Jean-Luc Baril

This figure shows the co-authorship network connecting the top 25 collaborators of Jean-Luc Baril. A scholar is included among the top collaborators of Jean-Luc Baril 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 Jean-Luc Baril. Jean-Luc Baril 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.
Baril, Jean-Luc, et al.. (2024). Consecutive pattern-avoidance in Catalan words according to the last symbol. SPIRE - Sciences Po Institutional REpository. 58. 1–1. 1 indexed citations
2.
Baril, Jean-Luc, et al.. (2024). Last Symbol Distribution in Pattern Avoiding Catalan Words. Mathematics in Computer Science. 18(1). 1 indexed citations
3.
Baril, Jean-Luc, et al.. (2024). The combinatorics of Motzkin polyominoes. Discrete Applied Mathematics. 364. 1–15. 1 indexed citations
4.
Baril, Jean-Luc & Jósé L. Ramírez. (2024). Partial Motzkin paths with air pockets of the first kind avoiding peaks, valleys or double rises. Discrete Mathematics Algorithms and Applications. 17(5).
5.
Baril, Jean-Luc, et al.. (2023). Grand Dyck paths with air pockets. 7(1). #P1.07–#P1.07. 2 indexed citations
6.
Baril, Jean-Luc & Paul Barry. (2023). Two kinds of partial Motzkin paths with air pockets. Ars Mathematica Contemporanea. 24(3). #P3.08–#P3.08. 1 indexed citations
7.
Baril, Jean-Luc, et al.. (2021). Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths. SHILAP Revista de lepidopterología. 7. 5–10. 1 indexed citations
8.
Baril, Jean-Luc, et al.. (2018). Dyck paths with a first return decomposition constrained by height. Discrete Mathematics. 341(6). 1620–1628. 2 indexed citations
9.
Baril, Jean-Luc, et al.. (2018). Enumeration of Łukasiewicz paths modulo some patterns. Discrete Mathematics. 342(4). 997–1005. 4 indexed citations
10.
Baril, Jean-Luc, et al.. (2017). Patterns in treeshelves. Discrete Mathematics. 340(12). 2946–2954.
11.
Baril, Jean-Luc, et al.. (2017). The pure descent statistic on permutations. Discrete Mathematics. 340(10). 2550–2558. 1 indexed citations
12.
Baril, Jean-Luc, et al.. (2014). Equivalence classes of Dyck paths modulo some statistics. Discrete Mathematics. 338(4). 655–660. 5 indexed citations
13.
Baril, Jean-Luc & Jean Marcel Pallo. (2013). Motzkin subposets and Motzkin geodesics in Tamari lattices. Information Processing Letters. 114(1-2). 31–37. 3 indexed citations
14.
Baril, Jean-Luc & Jean Marcel Pallo. (2008). The pruning-grafting lattice of binary trees. Theoretical Computer Science. 409(3). 382–393. 1 indexed citations
15.
Baril, Jean-Luc, Hamamache Kheddouci, & Olivier Togni. (2006). Adjacent vertex distinguishing edge-colorings of meshes.. Australas. J Comb.. 35. 89–102. 8 indexed citations
16.
Baril, Jean-Luc, et al.. (2006). Efficient lower and upper bounds of the diagonal-flip distance between triangulations. Information Processing Letters. 100(4). 131–136. 9 indexed citations
17.
Baril, Jean-Luc. (2006). Gray code for permutations with a fixed number of cycles. Discrete Mathematics. 307(13). 1559–1571. 15 indexed citations
18.
Baril, Jean-Luc & Vincent Vajnovszki. (2005). Minimal change list for Lucas strings and some graph theoretic consequences. Theoretical Computer Science. 346(2-3). 189–199. 11 indexed citations
19.
Baril, Jean-Luc, et al.. (2005). The irregularity strength of circulant graphs. Discrete Mathematics. 304(1-3). 1–10. 6 indexed citations
20.
Baril, Jean-Luc, et al.. (2003). Gray code for derangements. Discrete Applied Mathematics. 140(1-3). 207–221. 21 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 Kevin O’Bryant Breakdown of academic impact, for papers by Hunter S. Snevily Breakdown of academic impact, for papers by Steve Linton Breakdown of academic impact, for papers by Alex Fink Breakdown of academic impact, for papers by Alexander Burstein Breakdown of academic impact, for papers by Bartosz Walczak Breakdown of academic impact, for papers by Dirk Hachenberger Breakdown of academic impact, for papers by Horacio Tapia-Recillas Breakdown of academic impact, for papers by Mathilde Bouvel
Rankless by CCL
2026