Vincent Vajnovszki

Publication Activity (10 Years)

Years Active: 1995-2023
Publications (10 Years): 35

Top Topics

Regular Patterns

Top Venues

Discret. Appl. Math.

Theor. Comput. Sci.

Publications

Vincent Vajnovszki, Dennis Wong
Greedy Gray Codes for Dyck Words and Ballot Sequences. COCOON (2) (2023)
Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki
The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three. Discret. Math. 345 (2) (2022)
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, Rémi Maréchal, Vincent Vajnovszki
Grand Dyck paths with air pockets. CoRR (2022)
Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki
The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three. CoRR (2021)
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
Asymptotic bit frequency in Fibonacci words. 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, Vincent Vajnovszki
Gray codes for Fibonacci q-decreasing words. 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)
Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki
On shortening u-cycles and u-words for permutations. Discret. Appl. Math. 260 (2019)
Shishuo Fu, Ting Hua, Vincent Vajnovszki
Mahonian STAT on rearrangement class of words. Discret. Appl. Math. 270 (2019)
Jean-Luc Baril, Vincent Vajnovszki
Popularity of patterns over d-equivalence classes of words and permutations. CoRR (2019)
Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki
Exhaustive generation for permutations avoiding (colored) regular sets of patterns. Discret. Appl. Math. 268 (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)
Vincent Vajnovszki
(132). Inf. Process. Lett. 130 (2018)
Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki
Exhaustive generation for permutations avoiding a (colored) regular sets of patterns. CoRR (2018)
Ahmad Sabri, Vincent Vajnovszki
Exhaustive generation for ballot sequences in lexicographic and Gray code order. GASCom (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)
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
Patterns in treeshelves. Discret. Math. 340 (12) (2017)
Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Vincent Vajnovszki
A Gray code for cross-bifix-free sets. Math. Struct. Comput. Sci. 27 (2) (2017)
Shishuo Fu, Ting Hua, Vincent Vajnovszki
Mahonian STAT on rearrangement class of words. CoRR (2017)
Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki
Right-Justified Characterization for Generating Regular Pattern Avoiding Permutations. MACIS (2017)
Ahmad Sabri, Vincent Vajnovszki
More Restricted Growth Functions: Gray Codes and Exhaustive Generation. Graphs Comb. 33 (3) (2017)
Jean-Luc Baril, Vincent Vajnovszki
A permutation code preserving a double Eulerian bistatistic. Discret. Appl. Math. 224 (2017)
Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki
Gray coding cubic planar maps. Theor. Comput. Sci. 616 (2016)
Jean-Luc Baril, Vincent Vajnovszki
A permutation code preserving a double Eulerian bistatistic. CoRR (2016)
Sergey Kitaev, Vincent Vajnovszki
Mahonian STAT on words. Inf. Process. Lett. 116 (2) (2016)
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
Patterns in treeshelves. CoRR (2016)
Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki
Gray coding planar maps. CoRR (2015)
Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Ahmad Sabri, Vincent Vajnovszki
Gray code orders for q-ary words avoiding a given factor. Acta Informatica 52 (7-8) (2015)
Ahmad Sabri, Vincent Vajnovszki
Two Reflected Gray Code-Based Orders on Some Restricted Growth Sequences. Comput. J. 58 (5) (2015)
Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Vincent Vajnovszki
A Gray Code for cross-bifix-free sets. CoRR (2014)
Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Ahmad Sabri, Vincent Vajnovszki
Gray code orders for $q$-ary words avoiding a given factor. CoRR (2014)
Vincent Vajnovszki
An efficient Gray code algorithm for generating all permutations with a given major index. J. Discrete Algorithms 26 (2014)
Vincent Vajnovszki
The equidistribution of some length three vincular patterns on $S_n(132)$. CoRR (2014)
Sergey Kitaev, Vincent Vajnovszki
Mahonian STAT on words. CoRR (2014)
Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Ahmad Sabri, Vincent Vajnovszki
Prefix partitioned gray codes for particular cross-bifix-free sets. Cryptogr. Commun. 6 (4) (2014)
Vincent Vajnovszki
Lehmer code transforms and Mahonian statistics on permutations. Discret. Math. 313 (5) (2013)
Elena Barcucci, Vincent Vajnovszki
Generalized Schröder permutations. Theor. Comput. Sci. 502 (2013)
Toufik Mansour, Vincent Vajnovszki
Efficient generation of restricted growth words. Inf. Process. Lett. 113 (17) (2013)
Vincent Vajnovszki, Rémi Vernay
Restricted compositions and permutations: From old to new Gray codes. Inf. Process. Lett. 111 (13) (2011)
Vincent Vajnovszki
A new Euler-Mahonian constructive bijection. Discret. Appl. Math. 159 (14) (2011)
Toufik Mansour, Ghalib Nassar, Vincent Vajnovszki
Loop-free Gray code algorithm for the e-restricted growth functions. Inf. Process. Lett. 111 (11) (2011)
Maddalena Poneti, Vincent Vajnovszki
Generating restricted classes of involutions, Bell and Stirling permutations. Eur. J. Comb. 31 (2) (2010)
Vincent Vajnovszki
Generating involutions, derangements, and relatives by ECO. Discret. Math. Theor. Comput. Sci. 12 (1) (2010)
Elfitrin Syahrul, Julien Dubois, Vincent Vajnovszki, Taoufik Saidani, Mohamed Atri
Lossless Image Compression Using Burrows Wheeler Transform (Methods and Techniques). SITIS (2008)
W. M. B. Dukes, Mark F. Flanagan, Toufik Mansour, Vincent Vajnovszki
Combinatorial Gray codes for classes of pattern avoiding permutations. Theor. Comput. Sci. 396 (1-3) (2008)
Vincent Vajnovszki
More restrictive Gray codes for necklaces and Lyndon words. Inf. Process. Lett. 106 (3) (2008)
Vincent Vajnovszki
Gray Code Order for Lyndon Words. Discret. Math. Theor. Comput. Sci. 9 (2) (2007)
Asep Juarna, Vincent Vajnovszki
Some Generalizations of a Simion-Schmidt Bijection. Comput. J. 50 (5) (2007)
Toufik Mansour, Vincent Vajnovszki
Restricted 123-avoiding Baxter permutations and the Padovan numbers. Discret. Appl. Math. 155 (11) (2007)
Vincent Vajnovszki, Timothy Walsh
-ary Dyck words. J. Discrete Algorithms 4 (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, Vincent Vajnovszki
Gray code for derangements. Discret. Appl. Math. 140 (1-3) (2004)
Vincent Vajnovszki
A loopless algorithm for generating the permutations of a multiset. Theor. Comput. Sci. 307 (2) (2003)
Vincent Vajnovszki
Generating a Gray Code for P-Sequences. J. Math. Model. Algorithms 1 (1) (2002)
Vincent Vajnovszki
Gray visiting Motzkins. Acta Informatica 38 (11/12) (2002)
Vincent Vajnovszki
A Loopless Generation of Bitstrings without p Consecutive Ones. DMTCS (2001)
Vincent Vajnovszki, Chris Phillips
-Ary Trees. Parallel Process. Lett. 9 (1) (1999)
Vincent Vajnovszki, Jean Marcel Pallo
Parallel Algorithms for Listing Well-Formed Parentheses Strings. Parallel Process. Lett. 8 (1) (1998)
Vincent Vajnovszki
On the Loopless Generation of Binary Tree Sequences. Inf. Process. Lett. 68 (3) (1998)
Vincent Vajnovszki
Le codage des arbres binaires. Comput. Sci. J. Moldova 3 (2) (1995)
Vincent Vajnovszki
Constant Time Generation of Binary Unordered Trees. Bull. EATCS 57 (1995)