Vincent Vajnovszki

Vincent Vajnovszki: Lehmer code transforms and Mahonian statistics on permutations. Discrete Mathematics 313(5): 581-589 (2013)

Vincent Vajnovszki: A new Euler-Mahonian constructive bijection. Discrete Applied Mathematics 159(14): 1453-1459 (2011)

Toufik Mansour, Ghalib Nassar, Vincent Vajnovszki: Loop-free Gray code algorithm for the e-restricted growth functions. Inf. Process. Lett. 111(11): 541-544 (2011)

Vincent Vajnovszki, Rémi Vernay: Restricted compositions and permutations: From old to new Gray codes. Inf. Process. Lett. 111(13): 650-655 (2011)

Vincent Vajnovszki: Generating involutions, derangements, and relatives by ECO. Discrete Mathematics & Theoretical Computer Science 12(1): 109-122 (2010)

Maddalena Poneti, Vincent Vajnovszki: Generating restricted classes of involutions, Bell and Stirling permutations. Eur. J. Comb. 31(2): 553-564 (2010)

Vincent Vajnovszki: More restrictive Gray codes for necklaces and Lyndon words. Inf. Process. Lett. 106(3): 96-99 (2008)

W. M. B. Dukes, M. F. Flanagan, Toufik Mansour, Vincent Vajnovszki: Combinatorial Gray codes for classes of pattern avoiding permutations. Theor. Comput. Sci. 396(1-3): 35-49 (2008)

Elfitrin Syahrul, Julien Dubois, Vincent Vajnovszki, Taoufik Saidani, Mohamed Atri: Lossless Image Compression Using Burrows Wheeler Transform (Methods and Techniques). SITIS 2008: 338-343

Asep Juarna, Vincent Vajnovszki: Some Generalizations of a Simion-Schmidt Bijection. Comput. J. 50(5): 574-580 (2007)

Toufik Mansour, Vincent Vajnovszki: Restricted 123-avoiding Baxter permutations and the Padovan numbers. Discrete Applied Mathematics 155(11): 1430-1440 (2007)

Vincent Vajnovszki: Gray Code Order for Lyndon Words. Discrete Mathematics & Theoretical Computer Science 9(2) (2007)

Vincent Vajnovszki, Timothy Walsh: A loop-free two-close Gray-code algorithm for listing k-ary Dyck words. J. Discrete Algorithms 4(4): 633-648 (2006)

Jean-Luc Baril, Vincent Vajnovszki: Minimal change list for Lucas strings and some graph theoretic consequences. Theor. Comput. Sci. 346(2-3): 189-199 (2005)

Jean-Luc Baril, Vincent Vajnovszki: Gray code for derangements. Discrete Applied Mathematics 140(1-3): 207-221 (2004)

Vincent Vajnovszki: A loopless algorithm for generating the permutations of a multiset. Theor. Comput. Sci. 307(2): 415-431 (2003)

Cristian Calude, Michael J. Dinneen, Vincent Vajnovszki (Eds.): Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings. Lecture Notes in Computer Science 2731, Springer 2003, isbn 3-540-40505-4

Vincent Vajnovszki: Gray visiting Motzkins. Acta Inf. 38(11/12): 793-811 (2002)

Vincent Vajnovszki: Generating a Gray Code for P-Sequences. J. Math. Model. Algorithms 1(1): 31-41 (2002)

Vincent Vajnovszki, Chris Phillips: Systolic Generation of k-Ary Trees. Parallel Processing Letters 9(1): 93-101 (1999)

Vincent Vajnovszki: On the Loopless Generation of Binary Tree Sequences. Inf. Process. Lett. 68(3): 113-117 (1998)

Vincent Vajnovszki, Jean Marcel Pallo: Parallel Algorithms for Listing Well-Formed Parentheses Strings. Parallel Processing Letters 8(1): 19-28 (1998)

Vincent Vajnovszki: Constant Time Generation of Binary Unordered Trees. Bulletin of the EATCS 57 (1995)