Abstract is missing.
- q-distributionsCharalambos A. Charalambides. 1-6 [doi]
- Different tree approaches to the problem of counting numerical semigroups by genusMaria Bras-Amorós. 7-11 [doi]
- On Hamilton cycles in highly symmetric graphsTorsten Mütze. 12-23 [doi]
- On the maximal number of leaves in induced subtrees of series-parallel graphsMoussa Abdenbi, Alexandre Blondin Massé, Alain Goupil. 24-31 [doi]
- Cyclic descent extensions and distributionsRon M. Adin, Sergi Elizalde, Victor Reiner, Yuval Roichman. 32-42 [doi]
- MergeShuffle: a very fast, parallel random permutation algorithmAxel Bacher, Olivier Bodini, Alexandros Hollender, Jérémie O. Lumbroso. 43-52 [doi]
- DEli Bagno, Riccardo Biagioli, David Garber. 53-59 [doi]
- Rectangular Young tableaux with local decreases and the density method for uniform random generationCyril Banderier, Philippe Marchal, Michael Wallner. 60-68 [doi]
- Local time for lattice paths and the associated limit lawsCyril Banderier, Michael Wallner. 69-78 [doi]
- Exhaustive generation of positive lattice pathsElena Barcucci, Antonio Bernini, Renzo Pinzani. 79-86 [doi]
- A Gray code for a regular languageElena Barcucci, Antonio Bernini, Renzo Pinzani. 87-93 [doi]
- Linear-time exact sampling of sum-constrained random variablesFrédérique Bassino, Andrea Sportiello. 94-105 [doi]
- Random input helps searching predecessorsDjamal Belazzougui, Alexis C. Kaporis, Paul G. Spirakis. 106-115 [doi]
- Non saturated polyhexes and polyiamondsAlexandre Blondin Massé, Julien de Carufel, Alain Goupil. 116-123 [doi]
- Permutation patterns in genome rearrangement problemsGiulio Cerbai, Luca Ferrari. 124-131 [doi]
- A Markov chain for lattice polytopesJulien David, Lionel Pournin, Rado Rakotonarivo. 132-139 [doi]
- 2 with imposed symmetriesHenri Derycke. 140-147 [doi]
- Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemmaIoannis Giotis 0001, Lefteris M. Kirousis, John Livieratos, Kostas I. Psaromiligkos, Dimitrios M. Thilikos. 148-155 [doi]
- q-Random walks on the integers and on the two-dimensional integer latticeThomas Kamalakis, Malvina Vamvakari. 156-165 [doi]
- A semantic view of the switching lemmaDimitris J. Kavvadias, Lina Panagopoulou. 166-171 [doi]
- q-distributionsAndreas Kyriakoussis, Malvina Vamvakari. 172-178 [doi]
- The density method and permutations with a prescribed descent setPhilippe Marchal. 179-186 [doi]
- On the largest part size and its multiplicity of a random integer partitionLjuben S. Mutafchiev. 187-194 [doi]
- Exhaustive generation for ballot sequences in lexicographic and Gray code orderAhmad Sabri, Vincent Vajnovszki. 195-201 [doi]
- Growth diagrams and edge local rulesXavier Gérard Viennot. 202-211 [doi]
- Using Grassmann calculus in combinatorics: Lindström-Gessel-Viennot lemma and Schur functionsSylvain Carrozza, Thomas Krajewski, Adrian Tanasa. 212-221 [doi]