Veronika Pillwein & Carsten Schneider 
Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra 
In Honour of Peter Paule on his 60th Birthday

When the search for solutions can be terminated.- Euler’s partition theorem and refinement without appeal to infinit.- Sequences in partitions, double q-series and the Mock Theta Function.- Refine q-trinomial coecients and two infinit hierarchies of q-series identities.- Large scale analytic calculations in quantum field theories.- An eigenvalue problem for the associated Askey–Wilson polynomials.- Context-free grammars and stable multivariate polynomials over Stirling permutations.- An interesting class of Hankel determinants.- A sequence of polynomials generated by a Kapteyn series of the second kind.- Comparative analysis of random generators.-Difference equation theory meets mathematical finance.- Evaluations as L-subsets.- Exact lower bounds for monochromatic Schur triples and generalizations.- Evaluation of binomial double sums involving absolute values.- On two subclasses of Motzkin paths and their relation to ternary trees.- A theorem to reduce certain modular form relations modulo primes.- Trying to solve a linear system for strict partitions in ‘closed form’.- Untying the Gordian Knot via experimental mathematics.