Fundamentals of Computational Methods for Engineers
Rana, Masud, Xu, Wei, Guo, Youguang
Foreword
Ferrari, Luca, Massazza, Paolo
Uniform generation of infinite traces
Abbes, Samy, Jugé, Vincent
A q, r-analogue for the Stirling numbers of the second kind of Coxeter groups of type B
Bagno, Eli, Garber, David, Komatsu, Takao
On the exhaustive generation of discrete figures with connectivity constraints
Tremblay, Hugo, Vernay, Julien
Enumeration of rooted 3-connected bipartite planar maps
Noy, Marc, Requilé, Clément, Rué, Juanjo
A generating tree with a single label for permutations avoiding the vincular pattern 1−32−4
Cervetti, Matteo
Using large random permutations to partition permutation classes
Bean, Christian, Nadeau, Émile, Pantone, Jay, Ulfarsson, Henning
Finding automatic sequences with few correlations
Jugé, Vincent, Marcovici, Irène
Asymptotic behaviour of d-variate absorption distributions, d = 1, 2
Vamvakari, Malvina
From the Fibonacci to Pell numbers and beyond via Dyck paths
Barcucci, Elena, Bernini, Antonio, Pinzani, Renzo
On counting Z-convex polyominoes
Massazza, Paolo