1. Heubach, S., Li, N., Mansour, T.: A garden of k-Catalan structures. Preprint (2008). Available at: http://www.calstatela.edu/faculty/sheubac/papers/k-Catalan-20structures.pdf
2. Humphreys, K., Niederhausen, H.: Counting lattice paths with privileged access using Sheffer sequences. In: Stanton, R.G., Allston, J.L. (eds.) Proceedings of the Thirty-first Southeastern International Conference on Combinatorics, Graph Theory and Computing, pp. 141–160. Utilitas Mathematica Publishing, Inc., Winnipeg (2000)
3. Humphreys K., Niederhausen H.: Counting lattice paths taking steps in infinitely many directions under special access restrictions. Theoret. Comput. Sci. 319(1-3), 385–409 (2004)
4. Kemp T. et al.: Enumeration of non-crossing pairings on bit strings. J. Combin. Theory Ser. A 118(1), 129–151 (2011)
5. Kung, J., Sun, X., Yan, C.H.: Goncarov-type polynomials and applications in combinatorics. Preprint (2005). Available at: http://www.math.tamu.edu/~cyan/Files/DGP.pdf