| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Toufik Mansour, Ghalib Nassar, Vincent Vajnovszki |
Loop-free Gray code algorithm for the e-restricted growth functions.  |
Inf. Process. Lett.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Vajnovszki, Rémi Vernay |
Restricted compositions and permutations: From old to new Gray codes. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Vajnovszki |
A new Euler-Mahonian constructive bijection. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Vajnovszki |
Generating involutions, derangements, and relatives by ECO. |
Discrete Mathematics & Theoretical Computer Science |
2010 |
DBLP BibTeX RDF |
|
| 1 | Maddalena Poneti, Vincent Vajnovszki |
Generating restricted classes of involutions, Bell and Stirling permutations. |
Eur. J. Comb. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Vajnovszki |
More restrictive Gray codes for necklaces and Lyndon words. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | W. M. B. Dukes, M. F. Flanagan, Toufik Mansour, Vincent Vajnovszki |
Combinatorial Gray codes for classes of pattern avoiding permutations. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Vajnovszki |
Gray Code Order for Lyndon Words. |
Discrete Mathematics & Theoretical Computer Science |
2007 |
DBLP BibTeX RDF |
|
| 1 | Asep Juarna, Vincent Vajnovszki |
Some Generalizations of a Simion-Schmidt Bijection. |
Comput. J. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Toufik Mansour, Vincent Vajnovszki |
Restricted 123-avoiding Baxter permutations and the Padovan numbers. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Vajnovszki, Timothy Walsh |
A loop-free two-close Gray-code algorithm for listing k-ary Dyck words. |
J. Discrete Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Luc Baril, Vincent Vajnovszki |
Minimal change list for Lucas strings and some graph theoretic consequences. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Luc Baril, Vincent Vajnovszki |
Gray code for derangements. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Vajnovszki |
A loopless algorithm for generating the permutations of a multiset. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DMTCS |
2003 |
DBLP BibTeX RDF |
|
| 1 | Vincent Vajnovszki |
Generating a Gray Code for P-Sequences. |
J. Math. Model. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Vajnovszki |
Gray visiting Motzkins. |
Acta Inf. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Vajnovszki, Chris Phillips |
Systolic Generation of k-Ary Trees. |
Parallel Processing Letters |
1999 |
DBLP BibTeX RDF |
|
| 1 | Vincent Vajnovszki |
On the Loopless Generation of Binary Tree Sequences. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Vajnovszki, Jean Marcel Pallo |
Parallel Algorithms for Listing Well-Formed Parentheses Strings. |
Parallel Processing Letters |
1998 |
DBLP BibTeX RDF |
|
| 1 | Vincent Vajnovszki |
Constant Time Generation of Binary Unordered Trees. |
Bulletin of the EATCS |
1995 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")