On the loopless generation of binary tree sequences V Vajnovszki Information Processing Letters 68 (3), 113-117, 1998 | 58 | 1998 |

Gray code for derangements JL Baril, V Vajnovszki Discrete Applied Mathematics 140 (1-3), 207-221, 2004 | 46 | 2004 |

A loopless algorithm for generating the permutations of a multiset V Vajnovszki Theoretical Computer Science 307 (2), 415-431, 2003 | 39 | 2003 |

A Loopless Generation of Bitstrings without *p* Consecutive OnesV Vajnovszki Combinatorics, Computability and Logic: Proceedings of the Third …, 2001 | 31 | 2001 |

Combinatorial Gray codes for classes of pattern avoiding permutations WMB Dukes, MF Flanagan, T Mansour, V Vajnovszki Theoretical Computer Science 396 (1-3), 35-49, 2008 | 30 | 2008 |

A loop-free two-close Gray-code algorithm for listing k-ary Dyck words V Vajnovszki, T Walsh Journal of Discrete Algorithms 4 (4), 633-648, 2006 | 30 | 2006 |

Generating a Gray code for P-sequences V Vajnovszki Journal of Mathematical Modelling and Algorithms 1, 31-41, 2002 | 27 | 2002 |

Minimal change list for Lucas strings and some graph theoretic consequences JL Baril, V Vajnovszki Theoretical computer science 346 (2-3), 189-199, 2005 | 26 | 2005 |

Prefix partitioned gray codes for particular cross-bifix-free sets A Bernini, S Bilotta, R Pinzani, A Sabri, V Vajnovszki Cryptography and Communications 6, 359-369, 2014 | 24 | 2014 |

Lossless image compression using Burrows Wheeler Transform (methods and techniques) E Syahrul, J Dubois, V Vajnovszki, T Saidani, M Atri 2008 IEEE International Conference on Signal Image Technology and Internet …, 2008 | 23 | 2008 |

A permutation code preserving a double Eulerian bistatistic JL Baril, V Vajnovszki Discrete Applied Mathematics 224, 9-15, 2017 | 22 | 2017 |

Gray code order for Lyndon words V Vajnovszki Discrete Mathematics & Theoretical Computer Science 9, 2007 | 22 | 2007 |

A Gray code for cross-bifix-free sets A Bernini, S Bilotta, R Pinzani, V Vajnovszki Mathematical Structures in Computer Science 27 (2), 184-196, 2017 | 21 | 2017 |

Restricted compositions and permutations: from old to new Gray codes V Vajnovszki, R Vernay Information Processing Letters 111 (13), 650-655, 2011 | 21 | 2011 |

Efficient generation of restricted growth words T Mansour, V Vajnovszki Information Processing Letters 113 (17), 613-616, 2013 | 20 | 2013 |

More restrictive Gray codes for necklaces and Lyndon words V Vajnovszki Information Processing Letters 106 (3), 96-99, 2008 | 20 | 2008 |

Lehmer code transforms and Mahonian statistics on permutations V Vajnovszki Discrete Mathematics 313 (5), 581-589, 2013 | 19 | 2013 |

Gray codes for necklaces and Lyndon words of arbitrary base M Weston, V Vajnovszki Pure Math. Appl.(PU. MA) 17 (1-2), 175-182, 2006 | 18 | 2006 |

Generating binary trees in A-order from codewords defined on a four-letter alphabet V Vajnovszki, J Pallo Journal of Information and Optimization Sciences 15 (3), 345-357, 1994 | 18 | 1994 |

Descent distribution on Catalan words avoiding a pattern of length at most three JL Baril, S Kirgizov, V Vajnovszki Discrete Mathematics 341 (9), 2608-2615, 2018 | 17 | 2018 |