Vincent Vajnovszki

Dennis Wong

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022

Gray codes for Fibonacci q-decreasing words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three.

[BibT_eX]

[DOI]

Phan-Thuan Do

Thi Thu Huong Tran

Discret. Math., 2022

Grand Dyck paths with air pockets.

[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

Asymptotic bit frequency in Fibonacci words.

[BibT_eX]

[DOI]

CoRR, 2021

2020

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

2019

On shortening u-cycles and u-words for permutations.

[BibT_eX]

[DOI]

Vladimir N. Potapov

Discret. Appl. Math., 2019

Mahonian STAT on rearrangement class of words.

[BibT_eX]

[DOI]

Shishuo Fu

Ting Hua

Discret. Appl. Math., 2019

Exhaustive generation for permutations avoiding (colored) regular sets of patterns.

[BibT_eX]

[DOI]

Phan-Thuan Do

Thi Thu Huong Tran

Discret. Appl. Math., 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

2018

The equidistribution of some length-three vincular patterns on Sn(132).

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

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

[BibT_eX]

[DOI]

Discret. Math., 2018

Exhaustive generation for ballot sequences in lexicographic and Gray code order.

[BibT_eX]

[DOI]

Ahmad Sabri

Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

2017

A Gray code for cross-bifix-free sets.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2017

More Restricted Growth Functions: Gray Codes and Exhaustive Generation.

[BibT_eX]

[DOI]

Ahmad Sabri

Graphs Comb., 2017

Patterns in treeshelves.

[BibT_eX]

[DOI]

Discret. Math., 2017

A permutation code preserving a double Eulerian bistatistic.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Right-Justified Characterization for Generating Regular Pattern Avoiding Permutations.

[BibT_eX]

[DOI]

Phan-Thuan Do

Thi Thu Huong Tran

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

2016

Gray coding cubic planar maps.

[BibT_eX]

[DOI]

Sergey V. Avgustinovich

Vladimir N. Potapov

Theor. Comput. Sci., 2016

Mahonian STAT on words.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

2015

Gray coding planar maps.

[BibT_eX]

[DOI]

Sergey V. Avgustinovich

Vladimir N. Potapov

CoRR, 2015

Two Reflected Gray Code-Based Orders on Some Restricted Growth Sequences.

[BibT_eX]

[DOI]

Ahmad Sabri

Comput. J., 2015

Gray code orders for q-ary words avoiding a given factor.

[BibT_eX]

[DOI]

Acta Informatica, 2015

2014

An efficient Gray code algorithm for generating all permutations with a given major index.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

The equidistribution of some length three vincular patterns on $S_n(132)$.

[BibT_eX]

[DOI]

CoRR, 2014

Prefix partitioned gray codes for particular cross-bifix-free sets.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2014

2013

Generalized Schröder permutations.

[BibT_eX]

[DOI]

Elena Barcucci

Theor. Comput. Sci., 2013

Efficient generation of restricted growth words.

[BibT_eX]

[DOI]

Toufik Mansour

Inf. Process. Lett., 2013

Lehmer code transforms and Mahonian statistics on permutations.

[BibT_eX]

[DOI]

Discret. Math., 2013

2011

Restricted compositions and permutations: From old to new Gray codes.

[BibT_eX]

[DOI]

Rémi Vernay

Inf. Process. Lett., 2011

Loop-free Gray code algorithm for the e-restricted growth functions.

[BibT_eX]

[DOI]

Toufik Mansour

Ghalib Nassar

Inf. Process. Lett., 2011

A new Euler-Mahonian constructive bijection.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

2010

Generating restricted classes of involutions, Bell and Stirling permutations.

[BibT_eX]

[DOI]

Maddalena Poneti

Eur. J. Comb., 2010

Generating involutions, derangements, and relatives by ECO.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2010

2008

Combinatorial Gray codes for classes of pattern avoiding permutations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

More restrictive Gray codes for necklaces and Lyndon words.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Lossless Image Compression Using Burrows Wheeler Transform (Methods and Techniques).

[BibT_eX]

[DOI]

Proceedings of the 4th IEEE International Conference on Signal Image Technology and Internet Based Systems, 2008

2007

Gray Code Order for Lyndon Words.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2007

Restricted 123-avoiding Baxter permutations and the Padovan numbers.

[BibT_eX]

[DOI]

Toufik Mansour

Discret. Appl. Math., 2007

Some Generalizations of a Simion-Schmidt Bijection.

[BibT_eX]

[DOI]

Asep Juarna

Comput. J., 2007

2006

A loop-free two-close Gray-code algorithm for listing k-ary Dyck words.

[BibT_eX]

[DOI]

Timothy Walsh

J. Discrete Algorithms, 2006

2005

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

2004

Gray code for derangements.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2004

2003

A loopless algorithm for generating the permutations of a multiset.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2002

Generating a Gray Code for P-Sequences.

[BibT_eX]

[DOI]

J. Math. Model. Algorithms, 2002

Gray visiting Motzkins.

[BibT_eX]

[DOI]

Acta Informatica, 2002

2001

A Loopless Generation of Bitstrings without p Consecutive Ones.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics, 2001

1999

Systolic Generation of k-Ary Trees.

[BibT_eX]

[DOI]

Chris Phillips

Parallel Process. Lett., 1999

1998

Parallel Algorithms for Listing Well-Formed Parentheses Strings.

[BibT_eX]

[DOI]

Jean Marcel Pallo

Parallel Process. Lett., 1998

On the Loopless Generation of Binary Tree Sequences.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

1995

Constant Time Generation of Binary Unordered Trees.

[BibT_eX]

Bull. EATCS, 1995

Le codage des arbres binaires.

[BibT_eX]

[DOI]