Vincent Vajnovszki

According to our database1, Vincent Vajnovszki authored at least 39 papers between 1995 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 




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

Descent distribution on Catalan words avoiding a pattern of length at most three.
Discrete Mathematics, 2018

Exhaustive generation for ballot sequences in lexicographic and Gray code order.
Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, 2018

A Gray code for cross-bifix-free sets.
Mathematical Structures in Computer Science, 2017

More Restricted Growth Functions: Gray Codes and Exhaustive Generation.
Graphs and Combinatorics, 2017

Patterns in treeshelves.
Discrete Mathematics, 2017

A permutation code preserving a double Eulerian bistatistic.
Discrete Applied Mathematics, 2017

Right-Justified Characterization for Generating Regular Pattern Avoiding Permutations.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

Gray coding cubic planar maps.
Theor. Comput. Sci., 2016

Mahonian STAT on words.
Inf. Process. Lett., 2016

Two Reflected Gray Code-Based Orders on Some Restricted Growth Sequences.
Comput. J., 2015

Gray code orders for q-ary words avoiding a given factor.
Acta Inf., 2015

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

Prefix partitioned gray codes for particular cross-bifix-free sets.
Cryptography and Communications, 2014

Generalized Schröder permutations.
Theor. Comput. Sci., 2013

Efficient generation of restricted growth words.
Inf. Process. Lett., 2013

Lehmer code transforms and Mahonian statistics on permutations.
Discrete Mathematics, 2013

Restricted compositions and permutations: From old to new Gray codes.
Inf. Process. Lett., 2011

Loop-free Gray code algorithm for the e-restricted growth functions.
Inf. Process. Lett., 2011

A new Euler-Mahonian constructive bijection.
Discrete Applied Mathematics, 2011

Generating restricted classes of involutions, Bell and Stirling permutations.
Eur. J. Comb., 2010

Generating involutions, derangements, and relatives by ECO.
Discrete Mathematics & Theoretical Computer Science, 2010

Combinatorial Gray codes for classes of pattern avoiding permutations.
Theor. Comput. Sci., 2008

More restrictive Gray codes for necklaces and Lyndon words.
Inf. Process. Lett., 2008

Lossless Image Compression Using Burrows Wheeler Transform (Methods and Techniques).
Proceedings of the 4th IEEE International Conference on Signal Image Technology and Internet Based Systems, 2008

Gray Code Order for Lyndon Words.
Discrete Mathematics & Theoretical Computer Science, 2007

Restricted 123-avoiding Baxter permutations and the Padovan numbers.
Discrete Applied Mathematics, 2007

Some Generalizations of a Simion-Schmidt Bijection.
Comput. J., 2007

A loop-free two-close Gray-code algorithm for listing k-ary Dyck words.
J. Discrete Algorithms, 2006

Minimal change list for Lucas strings and some graph theoretic consequences.
Theor. Comput. Sci., 2005

Gray code for derangements.
Discrete Applied Mathematics, 2004

A loopless algorithm for generating the permutations of a multiset.
Theor. Comput. Sci., 2003

Generating a Gray Code for P-Sequences.
J. Math. Model. Algorithms, 2002

Gray visiting Motzkins.
Acta Inf., 2002

Systolic Generation of k-Ary Trees.
Parallel Processing Letters, 1999

Parallel Algorithms for Listing Well-Formed Parentheses Strings.
Parallel Processing Letters, 1998

On the Loopless Generation of Binary Tree Sequences.
Inf. Process. Lett., 1998

Constant Time Generation of Binary Unordered Trees.
Bulletin of the EATCS, 1995

Le codage des arbres binaires.
The Computer Science Journal of Moldova, 1995