Vincent Vajnovszki

According to our database1, Vincent Vajnovszki
  • authored at least 41 papers between 1995 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
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

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

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

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

A permutation code preserving a double Eulerian bistatistic.
CoRR, 2016

Patterns in treeshelves.
CoRR, 2016

2015
Gray coding planar maps.
CoRR, 2015

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

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

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

Mahonian STAT on words.
CoRR, 2014

A Gray Code for cross-bifix-free sets.
CoRR, 2014

Gray code orders for $q$-ary words avoiding a given factor.
CoRR, 2014

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

2013
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

2011
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

2010
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

2008
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

2007
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

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

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

2004
Gray code for derangements.
Discrete Applied Mathematics, 2004

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

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

Gray visiting Motzkins.
Acta Inf., 2002

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

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

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

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

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


  Loading...