Le codage des arbres binaires. - Vincent Vajnovszki (Comput. Sci. J. Moldova, 1995)

Constant Time Generation of Binary Unordered Trees. - Vincent Vajnovszki (Bull. EATCS, 1995)

On the Loopless Generation of Binary Tree Sequences. - Vincent Vajnovszki (Inf. Process. Lett., 1998)

Parallel Algorithms for Listing Well-Formed Parentheses Strings. - Vincent Vajnovszki; Jean Marcel Pallo (Parallel Process. Lett., 1998)

Systolic Generation of k-Ary Trees. - Vincent Vajnovszki; Chris Phillips (Parallel Process. Lett., 1999)

A Loopless Generation of Bitstrings without p Consecutive Ones. - Vincent Vajnovszki (DMTCS, 2001)

Gray visiting Motzkins. - Vincent Vajnovszki (Acta Informatica, 2002)

Generating a Gray Code for P-Sequences. - Vincent Vajnovszki (J. Math. Model. Algorithms, 2002)

A loopless algorithm for generating the permutations of a multiset. - Vincent Vajnovszki (Theor. Comput. Sci., 2003)

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

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

A loop-free two-close Gray-code algorithm for listing k-ary Dyck words. - Vincent Vajnovszki; Timothy Walsh 001 (J. Discrete Algorithms, 2006)

Some Generalizations of a Simion-Schmidt Bijection. - Asep Juarna; Vincent Vajnovszki (Comput. J., 2007)

Restricted 123-avoiding Baxter permutations and the Padovan numbers. - Toufik Mansour; Vincent Vajnovszki (Discret. Appl. Math., 2007)

Gray Code Order for Lyndon Words. - Vincent Vajnovszki (Discret. Math. Theor. Comput. Sci., 2007)

Lossless Image Compression Using Burrows Wheeler Transform (Methods and Techniques). - Elfitrin Syahrul; Julien Dubois; Vincent Vajnovszki; Taoufik Saidani; Mohamed Atri (SITIS, 2008)

More restrictive Gray codes for necklaces and Lyndon words. - Vincent Vajnovszki (Inf. Process. Lett., 2008)

Combinatorial Gray codes for classes of pattern avoiding permutations. - W. M. B. Dukes; Mark F. Flanagan; Toufik Mansour; Vincent Vajnovszki (Theor. Comput. Sci., 2008)

Generating involutions, derangements, and relatives by ECO. - Vincent Vajnovszki (Discret. Math. Theor. Comput. Sci., 2010)

Generating restricted classes of involutions, Bell and Stirling permutations. - Maddalena Poneti; Vincent Vajnovszki (Eur. J. Comb., 2010)

A new Euler-Mahonian constructive bijection. - Vincent Vajnovszki (Discret. Appl. Math., 2011)

Loop-free Gray code algorithm for the e-restricted growth functions. - Toufik Mansour; Ghalib Nassar; Vincent Vajnovszki (Inf. Process. Lett., 2011)

Restricted compositions and permutations: From old to new Gray codes. - Vincent Vajnovszki; Rémi Vernay (Inf. Process. Lett., 2011)

Lehmer code transforms and Mahonian statistics on permutations. - Vincent Vajnovszki (Discret. Math., 2013)

Efficient generation of restricted growth words. - Toufik Mansour; Vincent Vajnovszki (Inf. Process. Lett., 2013)

Generalized Schröder permutations. - Elena Barcucci; Vincent Vajnovszki (Theor. Comput. Sci., 2013)

Prefix partitioned gray codes for particular cross-bifix-free sets. - Antonio Bernini; Stefano Bilotta; Renzo Pinzani; Ahmad Sabri; Vincent Vajnovszki (Cryptogr. Commun., 2014)

The equidistribution of some length three vincular patterns on $S_n(132)$. - Vincent Vajnovszki (CoRR, 2014)

An efficient Gray code algorithm for generating all permutations with a given major index. - Vincent Vajnovszki (J. Discrete Algorithms, 2014)

Gray code orders for q-ary words avoiding a given factor. - Antonio Bernini; Stefano Bilotta; Renzo Pinzani; Ahmad Sabri; Vincent Vajnovszki (Acta Informatica, 2015)

Two Reflected Gray Code-Based Orders on Some Restricted Growth Sequences. - Ahmad Sabri; Vincent Vajnovszki (Comput. J., 2015)

Gray coding planar maps. - Sergey V. Avgustinovich; Sergey Kitaev; Vladimir N. Potapov; Vincent Vajnovszki (CoRR, 2015)

Mahonian STAT on words. - Sergey Kitaev; Vincent Vajnovszki (Inf. Process. Lett., 2016)

Gray coding cubic planar maps. - Sergey V. Avgustinovich; Sergey Kitaev; Vladimir N. Potapov; Vincent Vajnovszki (Theor. Comput. Sci., 2016)

Right-Justified Characterization for Generating Regular Pattern Avoiding Permutations. - Phan-Thuan Do; Thi Thu Huong Tran; Vincent Vajnovszki (MACIS, 2017)

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

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

More Restricted Growth Functions: Gray Codes and Exhaustive Generation. - Ahmad Sabri; Vincent Vajnovszki (Graphs Comb., 2017)

A Gray code for cross-bifix-free sets. - Antonio Bernini; Stefano Bilotta; Renzo Pinzani; Vincent Vajnovszki (Math. Struct. Comput. Sci., 2017)

Exhaustive generation for ballot sequences in lexicographic and Gray code order. - Ahmad Sabri; Vincent Vajnovszki (GASCom, 2018)

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

The equidistribution of some length-three vincular patterns on Sn(132). - Vincent Vajnovszki (Inf. Process. Lett., 2018)

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

Exhaustive generation for permutations avoiding (colored) regular sets of patterns. - Phan-Thuan Do; Thi Thu Huong Tran; Vincent Vajnovszki (Discret. Appl. Math., 2019)

Mahonian STAT on rearrangement class of words. - Shishuo Fu; Ting Hua; Vincent Vajnovszki (Discret. Appl. Math., 2019)

On shortening u-cycles and u-words for permutations. - Sergey Kitaev; Vladimir N. Potapov; Vincent Vajnovszki (Discret. Appl. Math., 2019)

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)

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

Asymptotic bit frequency in Fibonacci words. - Jean-Luc Baril; Sergey Kirgizov; Vincent Vajnovszki (CoRR, 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)

The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three. - Phan-Thuan Do; Thi Thu Huong Tran; Vincent Vajnovszki (Discret. Math., 2022)

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

Greedy Gray Codes for Dyck Words and Ballot Sequences. - Vincent Vajnovszki; Dennis Wong (COCOON (2), 2023)

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

Greedy Gray Codes for some Restricted Classes of Binary Words. - Nathanaël Hassler; Vincent Vajnovszki; Dennis Wong (GASCom, 2024)