Gray Code for Cayley Permutations. - Jean-Luc Baril (Comput. Sci. J. Moldova, 2003)

Matchings in Three Catalan Lattices. - Jean-Luc Baril; Jean Marcel Pallo (Int. J. Comput. Math., 2003)

Gray code for derangements. - Jean-Luc Baril; Vincent Vajnovszki (Discret. Appl. Math., 2004)

The irregularity strength of circulant graphs. - Jean-Luc Baril; Hamamache Kheddouci; Olivier Togni (Discret. Math., 2005)

Minimal change list for Lucas strings and some graph theoretic consequences. - Jean-Luc Baril; Vincent Vajnovszki (Theor. Comput. Sci., 2005)

Adjacent vertex distinguishing edge-colorings of meshes. - Jean-Luc Baril; Hamamache Kheddouci; Olivier Togni (Australas. J Comb., 2006)

Efficient lower and upper bounds of the diagonal-flip distance between triangulations. - Jean-Luc Baril; Jean Marcel Pallo (Inf. Process. Lett., 2006)

The Phagocyte Lattice of Dyck Words. - Jean-Luc Baril; Jean Marcel Pallo (Order, 2006)

Gray code for permutations with a fixed number of cycles. - Jean-Luc Baril (Discret. Math., 2007)

The pruning-grafting lattice of binary trees. - Jean-Luc Baril; Jean Marcel Pallo (Theor. Comput. Sci., 2008)

Neighbor-distinguishing k-tuple edge-colorings of graphs. - Jean-Luc Baril; Olivier Togni (Discret. Math., 2009)

More restrictive Gray codes for some classes of pattern avoiding permutations. - Jean-Luc Baril (Inf. Process. Lett., 2009)

Whole mirror duplication-random loss model and pattern avoiding permutations. - Jean-Luc Baril; Rémi Vernay (Inf. Process. Lett., 2010)

Classical Sequences Revisited with Permutations Avoiding Dotted Pattern. - Jean-Luc Baril (Electron. J. Comb., 2011)

Cyclic and lift closures for k...21-avoiding permutations. - Jean-Luc Baril (Discret. Math., 2011)

Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs. - Jean-Luc Baril; Hamamache Kheddouci; Olivier Togni (Ars Comb., 2012)

Gray code for permutations with a fixed number of left-to-right minima. - Jean-Luc Baril (Ars Comb., 2013)

ECO-generation for some restricted classes of compositions. - Jean-Luc Baril; Phan-Thuan Do (Comput. Sci. J. Moldova, 2013)

Statistics-preserving bijections between classical and cyclic permutations. - Jean-Luc Baril (Inf. Process. Lett., 2013)

Motzkin subposets and Motzkin geodesics in Tamari lattices. - Jean-Luc Baril; Jean Marcel Pallo (Inf. Process. Lett., 2014)

Equivalence classes of Dyck paths modulo some statistics. - Jean-Luc Baril; Armen Petrossian (Discret. Math., 2015)

A Motzkin filter in the Tamari lattice. - Jean-Luc Baril; Jean Marcel Pallo (Discret. Math., 2015)

Equivalence Classes of Motzkin Paths Modulo a Pattern of Length at Most Two. - Jean-Luc Baril; Armen Petrossian (J. Integer Seq., 2015)

Rooted planar maps modulo some patterns. - Jean-Luc Baril; Richard Genestier; Alain Giorgetti; Armen Petrossian (Discret. Math., 2016)

Right-jumps and pattern avoiding permutations. - Cyril Banderier; Jean-Luc Baril; Céline Moreira Dos Santos (Discret. Math. Theor. Comput. Sci., 2016)

Avoiding patterns in irreducible permutations. - Jean-Luc Baril (Discret. Math. Theor. Comput. Sci., 2016)

Completely independent spanning trees for enhancing the robustness in ad-hoc Networks. - Axel Moinet; Benoît Darties; Nicolas Gastineau; Jean-Luc Baril; Olivier Togni (WiMob, 2017)

Blockchain based trust & authentication for decentralized sensor networks. - Axel Moinet; Benoît Darties; Jean-Luc Baril (CoRR, 2017)

A permutation code preserving a double Eulerian bistatistic. - Jean-Luc Baril; Vincent Vajnovszki (Discret. Appl. Math., 2017)

The pure descent statistic on permutations. - Jean-Luc Baril; Sergey Kirgizov (Discret. Math., 2017)

Patterns in treeshelves. - Jean-Luc Baril; Sergey Kirgizov; Vincent Vajnovszki (Discret. Math., 2017)

BATMAN : plate-forme blockchain pour l'authentification et la confiance dans les WSNs. - Axel Moinet; Benoît Darties; Jean-Luc Baril (CoRR, 2018)

Dyck paths with a first return decomposition constrained by height. - Jean-Luc Baril; Sergey Kirgizov; Armen Petrossian (Discret. Math., 2018)

Descent distribution on Catalan words avoiding a pattern of length at most three. - Jean-Luc Baril; Sergey Kirgizov; Vincent Vajnovszki (Discret. Math., 2018)

Representation of NURBS surfaces by Controlled Iterated Functions System automata. - Lucas Morlet; Christian Gentil; Sandrine Lanquetin; Marc Neveu; Jean-Luc Baril (Comput. Graph. X, 2019)

Popularity of patterns over d-equivalence classes of words and permutations. - Jean-Luc Baril; Vincent Vajnovszki (CoRR, 2019)

Enumeration of Łukasiewicz paths modulo some patterns. - Jean-Luc Baril; Sergey Kirgizov; Armen Petrossian (Discret. Math., 2019)

Motzkin Paths With a Restricted First Return Decomposition. - Jean-Luc Baril; Sergey Kirgizov; Armen Petrossian (Integers, 2019)

Bijections between Directed Animals, Multisets and Grand-Dyck Paths. - Jean-Luc Baril; David I. Bevan; Sergey Kirgizov (Electron. J. Comb., 2020)

Catalan and Schröder permutations sortable by two restricted stacks. - Jean-Luc Baril; Carine Khalil; Vincent Vajnovszki (CoRR, 2020)

Gray codes for Fibonacci q-decreasing words. - Jean-Luc Baril; Sergey Kirgizov; Vincent Vajnovszki (CoRR, 2020)

Pattern distributions in Dyck paths with a first return decomposition constrained by height. - Jean-Luc Baril; Richard Genestier; Sergey Kirgizov (Discret. Math., 2020)

Popularity of patterns over d-equivalence classes of words and permutations. - Jean-Luc Baril; Vincent Vajnovszki (Theor. Comput. Sci., 2020)

Transformation à la Foata for special kinds of descents and excedances. - Jean-Luc Baril; Sergey Kirgizov (CoRR, 2021)

Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths. - Jean-Luc Baril; Sergey Kirgizov (CoRR, 2021)

Asymptotic bit frequency in Fibonacci words. - Jean-Luc Baril; Sergey Kirgizov; Vincent Vajnovszki (CoRR, 2021)

Lattice paths with a first return decomposition constrained by the maximal height of a pattern. - Jean-Luc Baril; Sergey Kirgizov (CoRR, 2021)

Pattern statistics in faro words and permutations. - Jean-Luc Baril; Alexander Burstein; Sergey Kirgizov (Discret. Math., 2021)

Catalan words avoiding pairs of length three patterns. - Jean-Luc Baril; Carine Khalil; Vincent Vajnovszki (Discret. Math. Theor. Comput. Sci., 2021)

Catalan and Schröder permutations sortable by two restricted stacks. - Jean-Luc Baril; Giulio Cerbai; Carine Khalil; Vincent Vajnovszki (Inf. Process. Lett., 2021)

Enumeration of Dyck paths with air pockets. - Jean-Luc Baril; Sergey Kirgizov; Rémi Maréchal; Vincent Vajnovszki (CoRR, 2022)

Dyck paths with catastrophes modulo the positions of a given pattern. - Jean-Luc Baril; Sergey Kirgizov; Armen Petrossian (CoRR, 2022)

Gray codes for Fibonacci q-decreasing words. - Jean-Luc Baril; Sergey Kirgizov; Vincent Vajnovszki (Theor. Comput. Sci., 2022)

Descent distribution on Catalan words avoiding ordered pairs of relations. - Jean-Luc Baril; José Luis Ramírez (Adv. Appl. Math., 2023)

A lattice on Dyck paths close to the Tamari lattice. - Jean-Luc Baril; Sergey Kirgizov; Mehdi Naima (CoRR, 2023)

Knight's paths towards Catalan numbers. - Jean-Luc Baril; José Luis Ramírez (Discret. Math., 2023)

Grand Dyck paths with air pockets. - Jean-Luc Baril; Rémi Maréchal; Sergey Kirgizov; Vincent Vajnovszki (Art Discret. Appl. Math., 2023)

Two kinds of partial Motzkin paths with air pockets. - Jean-Luc Baril; Paul Barry (Ars Math. Contemp., 2024)

Grand zigzag knight's paths. - Jean-Luc Baril; Nathanaël Hassler; Sergey Kirgizov; José Luis Ramírez (CoRR, 2024)

Consecutive pattern-avoidance in Catalan words according to the last symbol. - Jean-Luc Baril; Daniela Colmenares; José Luis Ramírez; Emmanuel D. Silva; Lina M. Simbaqueba; Diana A. Toquica (RAIRO Theor. Informatics Appl., 2024)

Bijections between directed-column convex polyominoes and restricted compositions. - Jean-Luc Baril; José Luis Ramírez; Fabio A. Velandia (Theor. Comput. Sci., 2024)

Last Symbol Distribution in Pattern Avoiding Catalan Words. - Jean-Luc Baril; Javier F. González; José Luis Ramírez (Math. Comput. Sci., 2024)

Enumerating runs, valleys, and peaks in Catalan words. - Jean-Luc Baril; Pamela E. Harris; Kimberly J. Harry; Matt McClinton; José Luis Ramírez (Art Discret. Appl. Math., 2025)

The Ascent Lattice on Dyck Paths. - Jean-Luc Baril; Mireille Bousquet-Mélou; Sergey Kirgizov; Mehdi Naima (Electron. J. Comb., 2025)

The combinatorics of Motzkin polyominoes. - Jean-Luc Baril; Sergey Kirgizov; José Luis Ramírez; Diego Villamizar (Discret. Appl. Math., 2025)

Fibonacci and Catalan paths in a wall. - Jean-Luc Baril; José Luis Ramírez (Discret. Math., 2025)

Partial Motzkin paths with air pockets of the first kind avoiding peaks, valleys or double rises. - Jean-Luc Baril; José Luis Ramírez (Discret. Math. Algorithms Appl., 2025)