Vincent Vajnovszki

71 papers Journal 64Unranked 6
YearRankTypeTitle / Venue / Authors
2025 J jnl
Efficient Generation of some Greedy Binary Gray codes.
RAIRO Theor. Informatics Appl.
Nathanaël Hassler, Vincent Vajnovszki, Dennis Wong
2024 — conf
Greedy Gray Codes for some Restricted Classes of Binary Words.
GASCom
Nathanaël Hassler, Vincent Vajnovszki, Dennis Wong
2023 J jnl
Grand Dyck paths with air pockets.
Art Discret. Appl. Math.
Jean-Luc Baril, Rémi Maréchal, Sergey Kirgizov, Vincent Vajnovszki
2023 — conf
Greedy Gray Codes for Dyck Words and Ballot Sequences.
COCOON (2)
Vincent Vajnovszki, Dennis Wong
2022 J jnl
Enumeration of Dyck paths with air pockets.
CoRR
Jean-Luc Baril, Sergey Kirgizov, Rémi Maréchal, Vincent Vajnovszki
2022 J jnl
Grand Dyck paths with air pockets.
CoRR
Jean-Luc Baril, Sergey Kirgizov, Rémi Maréchal, Vincent Vajnovszki
2022 J jnl
Gray codes for Fibonacci
Theor. Comput. Sci.
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
2022 J jnl
The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three.
Discret. Math.
Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki
2021 J jnl
Asymptotic bit frequency in Fibonacci words.
CoRR
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
2021 J jnl
Catalan and Schröder permutations sortable by two restricted stacks.
Inf. Process. Lett.
Jean-Luc Baril, Giulio Cerbai, Carine Khalil, Vincent Vajnovszki
2021 J jnl
Catalan words avoiding pairs of length three patterns.
Discret. Math. Theor. Comput. Sci.
Jean-Luc Baril, Carine Khalil, Vincent Vajnovszki
2021 J jnl
The equidistribution of some Mahonian statistics over permutations avoiding a pattern of length three.
CoRR
Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki
2020 J jnl
Catalan and Schröder permutations sortable by two restricted stacks.
CoRR
Jean-Luc Baril, Carine Khalil, Vincent Vajnovszki
2020 J jnl
Gray codes for Fibonacci q-decreasing words.
CoRR
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
2020 J jnl
Popularity of patterns over
Theor. Comput. Sci.
Jean-Luc Baril, Vincent Vajnovszki
2019 J jnl
Catalan words avoiding pairs of length three patterns.
CoRR
Jean-Luc Baril, Carine Khalil, Vincent Vajnovszki
2019 J jnl
Exhaustive generation for permutations avoiding (colored) regular sets of patterns.
Discret. Appl. Math.
Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki
2019 J jnl
Mahonian STAT on rearrangement class of words.
Discret. Appl. Math.
Shishuo Fu, Ting Hua, Vincent Vajnovszki
2019 J jnl
On shortening u-cycles and u-words for permutations.
Discret. Appl. Math.
Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki
2019 J jnl
Popularity of patterns over d-equivalence classes of words and permutations.
CoRR
Jean-Luc Baril, Vincent Vajnovszki
2018 J jnl
Descent distribution on Catalan words avoiding a pattern of length at most three.
CoRR
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
2018 J jnl
Descent distribution on Catalan words avoiding a pattern of length at most three.
Discret. Math.
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
2018 — conf
Exhaustive generation for ballot sequences in lexicographic and Gray code order.
GASCom
Ahmad Sabri, Vincent Vajnovszki
2018 J jnl
Exhaustive generation for permutations avoiding a (colored) regular sets of patterns.
CoRR
Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki
2018 J jnl
The equidistribution of some length-three vincular patterns on
Inf. Process. Lett.
Vincent Vajnovszki
2017 J jnl
A Gray code for cross-bifix-free sets.
Math. Struct. Comput. Sci.
Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Vincent Vajnovszki
2017 J jnl
A permutation code preserving a double Eulerian bistatistic.
Discret. Appl. Math.
Jean-Luc Baril, Vincent Vajnovszki
2017 J jnl
Mahonian STAT on rearrangement class of words.
CoRR
Shishuo Fu, Ting Hua, Vincent Vajnovszki
2017 J jnl
More Restricted Growth Functions: Gray Codes and Exhaustive Generation.
Graphs Comb.
Ahmad Sabri, Vincent Vajnovszki
2017 J jnl
Patterns in treeshelves.
Discret. Math.
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
2017 — conf
Right-Justified Characterization for Generating Regular Pattern Avoiding Permutations.
MACIS
Phan-Thuan Do, Thi Thu Huong Tran, Vincent Vajnovszki
2016 J jnl
A permutation code preserving a double Eulerian bistatistic.
CoRR
Jean-Luc Baril, Vincent Vajnovszki
2016 J jnl
Gray coding cubic planar maps.
Theor. Comput. Sci.
Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki
2016 J jnl
Mahonian STAT on words.
Inf. Process. Lett.
Sergey Kitaev, Vincent Vajnovszki
2016 J jnl
Patterns in treeshelves.
CoRR
Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki
2015 J jnl
Gray code orders for q-ary words avoiding a given factor.
Acta Informatica
Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Ahmad Sabri, Vincent Vajnovszki
2015 J jnl
Gray coding planar maps.
CoRR
Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N. Potapov, Vincent Vajnovszki
2015 J jnl
Two Reflected Gray Code-Based Orders on Some Restricted Growth Sequences.
Comput. J.
Ahmad Sabri, Vincent Vajnovszki
2014 J jnl
A Gray Code for cross-bifix-free sets.
CoRR
Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Vincent Vajnovszki
2014 J jnl
An efficient Gray code algorithm for generating all permutations with a given major index.
J. Discrete Algorithms
Vincent Vajnovszki
2014 J jnl
Gray code orders for $q$-ary words avoiding a given factor.
CoRR
Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Ahmad Sabri, Vincent Vajnovszki
2014 J jnl
Mahonian STAT on words.
CoRR
Sergey Kitaev, Vincent Vajnovszki
2014 J jnl
Prefix partitioned gray codes for particular cross-bifix-free sets.
Cryptogr. Commun.
Antonio Bernini, Stefano Bilotta, Renzo Pinzani, Ahmad Sabri, Vincent Vajnovszki
2014 J jnl
The equidistribution of some length three vincular patterns on $S_n(132)$.
CoRR
Vincent Vajnovszki
2013 J jnl
Efficient generation of restricted growth words.
Inf. Process. Lett.
Toufik Mansour, Vincent Vajnovszki
2013 J jnl
Generalized Schröder permutations.
Theor. Comput. Sci.
Elena Barcucci, Vincent Vajnovszki
2013 J jnl
Lehmer code transforms and Mahonian statistics on permutations.
Discret. Math.
Vincent Vajnovszki
2011 J jnl
A new Euler-Mahonian constructive bijection.
Discret. Appl. Math.
Vincent Vajnovszki
2011 J jnl
Loop-free Gray code algorithm for the e-restricted growth functions.
Inf. Process. Lett.
Toufik Mansour, Ghalib Nassar, Vincent Vajnovszki
2011 J jnl
Restricted compositions and permutations: From old to new Gray codes.
Inf. Process. Lett.
Vincent Vajnovszki, Rémi Vernay
2010 J jnl
Generating involutions, derangements, and relatives by ECO.
Discret. Math. Theor. Comput. Sci.
Vincent Vajnovszki
2010 J jnl
Generating restricted classes of involutions, Bell and Stirling permutations.
Eur. J. Comb.
Maddalena Poneti, Vincent Vajnovszki
2008 J jnl
Combinatorial Gray codes for classes of pattern avoiding permutations.
Theor. Comput. Sci.
W. M. B. Dukes, Mark F. Flanagan, Toufik Mansour, Vincent Vajnovszki
2008 — conf
Lossless Image Compression Using Burrows Wheeler Transform (Methods and Techniques).
SITIS
Elfitrin Syahrul, Julien Dubois, Vincent Vajnovszki, Taoufik Saidani, Mohamed Atri
2008 J jnl
More restrictive Gray codes for necklaces and Lyndon words.
Inf. Process. Lett.
Vincent Vajnovszki
2007 J jnl
Gray Code Order for Lyndon Words.
Discret. Math. Theor. Comput. Sci.
Vincent Vajnovszki
2007 J jnl
Restricted 123-avoiding Baxter permutations and the Padovan numbers.
Discret. Appl. Math.
Toufik Mansour, Vincent Vajnovszki
2007 J jnl
Some Generalizations of a Simion-Schmidt Bijection.
Comput. J.
Asep Juarna, Vincent Vajnovszki
2006 J jnl
A loop-free two-close Gray-code algorithm for listing
J. Discrete Algorithms
Vincent Vajnovszki, Timothy Walsh
2005 J jnl
Minimal change list for Lucas strings and some graph theoretic consequences.
Theor. Comput. Sci.
Jean-Luc Baril, Vincent Vajnovszki
2004 J jnl
Gray code for derangements.
Discret. Appl. Math.
Jean-Luc Baril, Vincent Vajnovszki
2003 J jnl
A loopless algorithm for generating the permutations of a multiset.
Theor. Comput. Sci.
Vincent Vajnovszki
2003 — ed.
Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings
DMTCS
Cristian Calude, Michael J. Dinneen, Vincent Vajnovszki
2002 J jnl
Generating a Gray Code for P-Sequences.
J. Math. Model. Algorithms
Vincent Vajnovszki
2002 J jnl
Gray visiting Motzkins.
Acta Informatica
Vincent Vajnovszki
2001 — conf
A Loopless Generation of Bitstrings without p Consecutive Ones.
DMTCS
Vincent Vajnovszki
1999 J jnl
Systolic Generation of
Parallel Process. Lett.
Vincent Vajnovszki, Chris Phillips
1998 J jnl
On the Loopless Generation of Binary Tree Sequences.
Inf. Process. Lett.
Vincent Vajnovszki
1998 J jnl
Parallel Algorithms for Listing Well-Formed Parentheses Strings.
Parallel Process. Lett.
Vincent Vajnovszki, Jean Marcel Pallo
1995 J jnl
Constant Time Generation of Binary Unordered Trees.
Bull. EATCS
Vincent Vajnovszki
1995 J jnl
Le codage des arbres binaires.
Comput. Sci. J. Moldova
Vincent Vajnovszki