Open Access
| Issue |
RAIRO-Theor. Inf. Appl.
Volume 59, 2025
Generation, enumeration and tiling
|
|
|---|---|---|
| Article Number | 16 | |
| Number of page(s) | 14 | |
| DOI | https://doi.org/10.1051/ita/2025014 | |
| Published online | 07 November 2025 | |
- A. Williams, The greedy Gray code algorithm, in F. Dehne, R. Solis-Oba, and J.-R. Sack, editors, Algorithms and Data Structures, pp. 525–536, Berlin, Heidelberg (2013). [Google Scholar]
- A. Merino and T. Mütze, A. Williams, All your bases are belong to us: listing all bases of a matroid by greedy exchanges, FUN 2022, May 30–June 3 (2022), Island of Favignana, Sicily, Italy [Google Scholar]
- A. Merino and T. Muütze, Traversing Combinatorial 0/1-Polytopes via Optimization, SIAM J. Comput. 53 (2024) 1257–1292. [Google Scholar]
- N. Hassler, V. Vajnovszki, and D. Wong, Greedy Gray codes for some restricted classes of binary words, GASCom 2024, June 24–28, Bordeaux, France. [Google Scholar]
- V. Vajnovszki and T. Walsh, A loop-free two-close Gray-code algorithm for listing k-ary Dyck words, J. Discrete Algorithms 4 (2006). [Google Scholar]
- P. Eades and B. McKay, An algorithm for generating subsets of fixed size with a strong minimal change property, Information Processing Letters 19 (1984) 131–133. [Google Scholar]
- A. Bultena and F. Ruskey, An Eades-McKay algorithm for well-formed parentheses strings, Inf. Process. Lett. 68 (1998) 255–259. [Google Scholar]
- D. Wong and V. Vajnovszki, Greedy Gray codes for Dyck words and ballot sequences, COCOON 2023, 15–17 December (2023), Hawaii, USA. [Google Scholar]
- F. Ruskey. Combinatorial Generation. 2003. Working version. [Google Scholar]
- T. Mütze, Combinatorial Gray codes – an updated survey, Electron. J. Comb. Dyn. Surv. DS26 93 (2023) 99 pp. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.