Jean-Luc Baril

Discret. Math., 2025

2024

Last Symbol Distribution in Pattern Avoiding Catalan Words.

[BibT_eX]

[DOI]

Javier F. González

Math. Comput. Sci., March, 2024

Bijections between directed-column convex polyominoes and restricted compositions.

[BibT_eX]

[DOI]

Fabio A. Velandia

Theor. Comput. Sci., 2024

Consecutive pattern-avoidance in Catalan words according to the last symbol.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2024

Grand zigzag knight's paths.

[BibT_eX]

[DOI]

CoRR, 2024

The Combinatorics of Motzkin Polyominoes.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Knight's paths towards Catalan numbers.

[BibT_eX]

[DOI]

Discret. Math., June, 2023

A lattice on Dyck paths close to the Tamari lattice.

[BibT_eX]

[DOI]

Mehdi Naima

CoRR, 2023

Descent distribution on Catalan words avoiding ordered pairs of relations.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2023

2022

Gray codes for Fibonacci <i>q</i>-decreasing words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Grand Dyck paths with air pockets.

[BibT_eX]

[DOI]

CoRR, 2022

Dyck paths with catastrophes modulo the positions of a given pattern.

[BibT_eX]

[DOI]

CoRR, 2022

Enumeration of Dyck paths with air pockets.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Catalan and Schröder permutations sortable by two restricted stacks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2021

Catalan words avoiding pairs of length three patterns.

[BibT_eX]

[DOI]

Carine Khalil

Discret. Math. Theor. Comput. Sci., 2021

Pattern statistics in faro words and permutations.

[BibT_eX]

[DOI]

Alexander Burstein

Discret. Math., 2021

Lattice paths with a first return decomposition constrained by the maximal height of a pattern.

[BibT_eX]

[DOI]

CoRR, 2021

Asymptotic bit frequency in Fibonacci words.

[BibT_eX]

[DOI]

CoRR, 2021

Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths.

[BibT_eX]

[DOI]

CoRR, 2021

Transformation à la Foata for special kinds of descents and excedances.

[BibT_eX]

[DOI]

CoRR, 2021

2020

Popularity of patterns over <i>d</i>-equivalence classes of words and permutations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Pattern distributions in Dyck paths with a first return decomposition constrained by height.

[BibT_eX]

[DOI]

Richard Genestier

Discret. Math., 2020

Gray codes for Fibonacci q-decreasing words.

[BibT_eX]

[DOI]

CoRR, 2020

Catalan and Schröder permutations sortable by two restricted stacks.

[BibT_eX]

[DOI]

Carine Khalil

CoRR, 2020

Bijections between Directed Animals, Multisets and Grand-Dyck Paths.

[BibT_eX]

[DOI]

David I. Bevan

Electron. J. Comb., 2020

2019

Motzkin Paths With a Restricted First Return Decomposition.

[BibT_eX]

[DOI]

Integers, 2019

Enumeration of Łukasiewicz paths modulo some patterns.

[BibT_eX]

[DOI]

Discret. Math., 2019

Popularity of patterns over d-equivalence classes of words and permutations.

[BibT_eX]

[DOI]

CoRR, 2019

Representation of NURBS surfaces by Controlled Iterated Functions System automata.

[BibT_eX]

[DOI]

Comput. Graph. X, 2019

2018

Descent distribution on Catalan words avoiding a pattern of length at most three.

[BibT_eX]

[DOI]

Discret. Math., 2018

Dyck paths with a first return decomposition constrained by height.

[BibT_eX]

[DOI]

Discret. Math., 2018

BATMAN : plate-forme blockchain pour l'authentification et la confiance dans les WSNs.

[BibT_eX]

[DOI]

Axel Moinet

Benoît Darties

CoRR, 2018

2017

Patterns in treeshelves.

[BibT_eX]

[DOI]

Discret. Math., 2017

The pure descent statistic on permutations.

[BibT_eX]

[DOI]

Discret. Math., 2017

A permutation code preserving a double Eulerian bistatistic.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Blockchain based trust & authentication for decentralized sensor networks.

[BibT_eX]

[DOI]

Axel Moinet

Benoît Darties

CoRR, 2017

Completely independent spanning trees for enhancing the robustness in ad-hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the 13th IEEE International Conference on Wireless and Mobile Computing, 2017

2016

Avoiding patterns in irreducible permutations.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2016

Right-jumps and pattern avoiding permutations.

[BibT_eX]

[DOI]

Cyril Banderier

Céline Moreira Dos Santos

Discret. Math. Theor. Comput. Sci., 2016

Rooted planar maps modulo some patterns.

[BibT_eX]

[DOI]

Discret. Math., 2016

2015

Equivalence Classes of Motzkin Paths Modulo a Pattern of Length at Most Two.

[BibT_eX]

[DOI]

J. Integer Seq., 2015

A Motzkin filter in the Tamari lattice.

[BibT_eX]

[DOI]

Discret. Math., 2015

Equivalence classes of Dyck paths modulo some statistics.

[BibT_eX]

[DOI]

Discret. Math., 2015

2014

Motzkin subposets and Motzkin geodesics in Tamari lattices.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

2013

Statistics-preserving bijections between classical and cyclic permutations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

ECO-generation for some restricted classes of compositions.

[BibT_eX]

[DOI]

Phan-Thuan Do

Comput. Sci. J. Moldova, 2013

Gray code for permutations with a fixed number of left-to-right minima.

[BibT_eX]

Ars Comb., 2013

2012

Vertex Distinguishing Edge- and Total-Colorings of Cartesian and other Product Graphs.

[BibT_eX]

Hamamache Kheddouci

Ars Comb., 2012

2011

Cyclic and lift closures for k...21-avoiding permutations.

[BibT_eX]

[DOI]

Discret. Math., 2011

Classical Sequences Revisited with Permutations Avoiding Dotted Pattern.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

2010

Whole mirror duplication-random loss model and pattern avoiding permutations.

[BibT_eX]

[DOI]

Rémi Vernay

Inf. Process. Lett., 2010

2009

More restrictive Gray codes for some classes of pattern avoiding permutations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Neighbor-distinguishing k-tuple edge-colorings of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

The pruning-grafting lattice of binary trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

2007

Gray code for permutations with a fixed number of cycles.

[BibT_eX]

[DOI]

Discret. Math., 2007

2006

The Phagocyte Lattice of Dyck Words.

[BibT_eX]

[DOI]

Order, 2006

Efficient lower and upper bounds of the diagonal-flip distance between triangulations.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Adjacent vertex distinguishing edge-colorings of meshes.

[BibT_eX]

[DOI]

Hamamache Kheddouci

Australas. J Comb., 2006

2005

Minimal change list for Lucas strings and some graph theoretic consequences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

The irregularity strength of circulant graphs.

[BibT_eX]

[DOI]

Hamamache Kheddouci

Discret. Math., 2005

2004

Gray code for derangements.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

2003

Matchings in Three Catalan Lattices.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2003

Gray Code for Cayley Permutations.

[BibT_eX]

[DOI]