Jean-Luc Baril

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 44

Top Topics

Equivalence Class

Lexico Syntactic

Conditional Independencies

Top Venues

Theor. Comput. Sci.

Discret. Math. Theor. Comput. Sci.

Publications

Jean-Luc Baril, José Luis Ramírez, Fabio A. Velandia
Bijections between directed-column convex polyominoes and restricted compositions. Theor. Comput. Sci. 1003 (2024)
Jean-Luc Baril, Nathanaël Hassler, Sergey Kirgizov, José Luis Ramírez
Grand zigzag knight's paths. CoRR (2024)
Jean-Luc Baril, Sergey Kirgizov, José Luis Ramírez, Diego Villamizar
The Combinatorics of Motzkin Polyominoes. CoRR (2024)
Jean-Luc Baril, Daniela Colmenares, José Luis Ramírez, Emmanuel D. Silva, Lina M. Simbaqueba, Diana A. Toquica
Consecutive pattern-avoidance in Catalan words according to the last symbol. RAIRO Theor. Informatics Appl. 58 (2024)
Jean-Luc Baril, Javier F. González, José Luis Ramírez
Last Symbol Distribution in Pattern Avoiding Catalan Words. Math. Comput. Sci. 18 (1) (2024)
Jean-Luc Baril, José L. Ramírez
Knight's paths towards Catalan numbers. Discret. Math. 346 (6) (2023)
Jean-Luc Baril, José Luis Ramírez
Descent distribution on Catalan words avoiding ordered pairs of relations. Adv. Appl. Math. 149 (2023)
Jean-Luc Baril, Sergey Kirgizov, Mehdi Naima
A lattice on Dyck paths close to the Tamari lattice. CoRR (2023)
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
-decreasing words. Theor. Comput. Sci. 927 (2022)
Jean-Luc Baril, Sergey Kirgizov, Rémi Maréchal, Vincent Vajnovszki
Enumeration of Dyck paths with air pockets. CoRR (2022)
Jean-Luc Baril, Sergey Kirgizov, Armen Petrossian
Dyck paths with catastrophes modulo the positions of a given pattern. CoRR (2022)
Jean-Luc Baril, Sergey Kirgizov, Rémi Maréchal, Vincent Vajnovszki
Grand Dyck paths with air pockets. CoRR (2022)
Jean-Luc Baril, Sergey Kirgizov
Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths. CoRR (2021)
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
Asymptotic bit frequency in Fibonacci words. CoRR (2021)
Jean-Luc Baril, Alexander Burstein, Sergey Kirgizov
Pattern statistics in faro words and permutations. Discret. Math. 344 (8) (2021)
Jean-Luc Baril, Sergey Kirgizov
Lattice paths with a first return decomposition constrained by the maximal height of a pattern. CoRR (2021)
Jean-Luc Baril, Carine Khalil, Vincent Vajnovszki
Catalan words avoiding pairs of length three patterns. Discret. Math. Theor. Comput. Sci. 22 (2) (2021)
Jean-Luc Baril, Giulio Cerbai, Carine Khalil, Vincent Vajnovszki
Catalan and Schröder permutations sortable by two restricted stacks. Inf. Process. Lett. 171 (2021)
Jean-Luc Baril, Sergey Kirgizov
Transformation à la Foata for special kinds of descents and excedances. CoRR (2021)
Jean-Luc Baril, David I. Bevan, Sergey Kirgizov
Bijections between Directed Animals, Multisets and Grand-Dyck Paths. Electron. J. Comb. 27 (2) (2020)
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
Gray codes for Fibonacci q-decreasing words. CoRR (2020)
Jean-Luc Baril, Richard Genestier, Sergey Kirgizov
Pattern distributions in Dyck paths with a first return decomposition constrained by height. Discret. Math. 343 (9) (2020)
Jean-Luc Baril, Alexander Burstein, Sergey Kirgizov
Pattern statistics in faro words and permutations. CoRR (2020)
Jean-Luc Baril, Vincent Vajnovszki
-equivalence classes of words and permutations. Theor. Comput. Sci. 814 (2020)
Jean-Luc Baril, Carine Khalil, Vincent Vajnovszki
Catalan and Schröder permutations sortable by two restricted stacks. CoRR (2020)
Jean-Luc Baril, Sergey Kirgizov, Armen Petrossian
Motzkin Paths With a Restricted First Return Decomposition. Integers 19 (2019)
Jean-Luc Baril, Sergey Kirgizov, Armen Petrossian
Enumeration of Łukasiewicz paths modulo some patterns. Discret. Math. 342 (4) (2019)
Jean-Luc Baril, Vincent Vajnovszki
Popularity of patterns over d-equivalence classes of words and permutations. CoRR (2019)
Lucas Morlet, Christian Gentil, Sandrine Lanquetin, Marc Neveu, Jean-Luc Baril
Representation of NURBS surfaces by Controlled Iterated Functions System automata. Comput. Graph. X 2 (2019)
Jean-Luc Baril, Carine Khalil, Vincent Vajnovszki
Catalan words avoiding pairs of length three patterns. CoRR (2019)
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
Descent distribution on Catalan words avoiding a pattern of length at most three. CoRR (2018)
Jean-Luc Baril, Sergey Kirgizov, Armen Petrossian
Dyck paths with a first return decomposition constrained by height. Discret. Math. 341 (6) (2018)
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
Descent distribution on Catalan words avoiding a pattern of length at most three. Discret. Math. 341 (9) (2018)
Axel Moinet, Benoît Darties, Jean-Luc Baril
BATMAN : plate-forme blockchain pour l'authentification et la confiance dans les WSNs. CoRR (2018)
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
Patterns in treeshelves. Discret. Math. 340 (12) (2017)
Axel Moinet, Benoît Darties, Jean-Luc Baril
Blockchain based trust & authentication for decentralized sensor networks. CoRR (2017)
Axel Moinet, Benoît Darties, Nicolas Gastineau, Jean-Luc Baril, Olivier Togni
Completely independent spanning trees for enhancing the robustness in ad-hoc Networks. WiMob (2017)
Jean-Luc Baril, Sergey Kirgizov
The pure descent statistic on permutations. Discret. Math. 340 (10) (2017)
Jean-Luc Baril, Vincent Vajnovszki
A permutation code preserving a double Eulerian bistatistic. Discret. Appl. Math. 224 (2017)
Jean-Luc Baril, Richard Genestier, Alain Giorgetti, Armen Petrossian
Rooted planar maps modulo some patterns. Discret. Math. 339 (4) (2016)
Jean-Luc Baril, Vincent Vajnovszki
A permutation code preserving a double Eulerian bistatistic. CoRR (2016)
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
Patterns in treeshelves. CoRR (2016)
Cyril Banderier, Jean-Luc Baril, Céline Moreira Dos Santos
Right-jumps and pattern avoiding permutations. Discret. Math. Theor. Comput. Sci. 18 (2) (2016)
Jean-Luc Baril
Avoiding patterns in irreducible permutations. Discret. Math. Theor. Comput. Sci. 17 (3) (2016)
Jean-Luc Baril, Armen Petrossian
Equivalence Classes of Motzkin Paths Modulo a Pattern of Length at Most Two. J. Integer Seq. 18 (7) (2015)
Jean-Luc Baril, Jean Marcel Pallo
A Motzkin filter in the Tamari lattice. Discret. Math. 338 (8) (2015)
Cyril Banderier, Jean-Luc Baril, Céline Moreira Dos Santos
Right-jumps and pattern avoiding permutations. CoRR (2015)
Jean-Luc Baril, Armen Petrossian
Equivalence classes of Dyck paths modulo some statistics. Discret. Math. 338 (4) (2015)
Jean-Luc Baril, Jean Marcel Pallo
Motzkin subposets and Motzkin geodesics in Tamari lattices. Inf. Process. Lett. 114 (1-2) (2014)
Jean-Luc Baril
Gray code for permutations with a fixed number of left-to-right minima. Ars Comb. 111 (2013)
Jean-Luc Baril
Statistics-preserving bijections between classical and cyclic permutations. Inf. Process. Lett. 113 (1-2) (2013)
Jean-Luc Baril, Phan-Thuan Do
ECO-generation for some restricted classes of compositions. Comput. Sci. J. Moldova 21 (1) (2013)
Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni
Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs. Ars Comb. 107 (2012)
Jean-Luc Baril
Cyclic and lift closures for k...21-avoiding permutations. Discret. Math. 311 (1) (2011)
Jean-Luc Baril
Classical Sequences Revisited with Permutations Avoiding Dotted Pattern. Electron. J. Comb. 18 (1) (2011)
Jean-Luc Baril, Rémi Vernay
Whole mirror duplication-random loss model and pattern avoiding permutations. Inf. Process. Lett. 110 (11) (2010)
Jean-Luc Baril
More restrictive Gray codes for some classes of pattern avoiding permutations. Inf. Process. Lett. 109 (14) (2009)
Jean-Luc Baril, Olivier Togni
Neighbor-distinguishing k-tuple edge-colorings of graphs. Discret. Math. 309 (16) (2009)
Jean-Luc Baril, Jean Marcel Pallo
The pruning-grafting lattice of binary trees. Theor. Comput. Sci. 409 (3) (2008)
Jean-Luc Baril
Gray code for permutations with a fixed number of cycles. Discret. Math. 307 (13) (2007)
Jean-Luc Baril, Jean Marcel Pallo
The Phagocyte Lattice of Dyck Words. Order 23 (2-3) (2006)
Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni
Adjacent vertex distinguishing edge-colorings of meshes. Australas. J Comb. 35 (2006)
Jean-Luc Baril, Jean Marcel Pallo
Efficient lower and upper bounds of the diagonal-flip distance between triangulations. Inf. Process. Lett. 100 (4) (2006)
Jean-Luc Baril, Vincent Vajnovszki
Minimal change list for Lucas strings and some graph theoretic consequences. Theor. Comput. Sci. 346 (2-3) (2005)
Jean-Luc Baril, Hamamache Kheddouci, Olivier Togni
The irregularity strength of circulant graphs. Discret. Math. 304 (1-3) (2005)
Jean-Luc Baril, Vincent Vajnovszki
Gray code for derangements. Discret. Appl. Math. 140 (1-3) (2004)
Jean-Luc Baril
Gray Code for Cayley Permutations. Comput. Sci. J. Moldova 11 (2) (2003)
Jean-Luc Baril, Jean Marcel Pallo
Matchings in Three Catalan Lattices. Int. J. Comput. Math. 80 (2) (2003)