\def\cprime{$'$}
\begin{thebibliography}{10}

\bibitem{aa:simple:alg}
{\sc Albert, M.~H., and Atkinson, M.~D.}
\newblock {Simple permutations and pattern restricted permutations}.
\newblock {\em Discrete Math. 300}, 1-3 (2005), 1--15.

\bibitem{aab:poly}
{\sc Albert, M.~H., Atkinson, M.~D., and Brignall, R.}
\newblock Permutation classes of polynomial growth.
\newblock \texttt{arXiv:math.CO/0603315}.

\bibitem{aar:regular}
{\sc Albert, M.~H., Atkinson, M.~D., and Ru{\v{s}}kuc, N.}
\newblock Regular closed sets of permutations.
\newblock {\em Theoret. Comput. Sci. 306}, 1-3 (2003), 85--100.

\bibitem{insertion}
{\sc Albert, M.~H., Linton, S., and Ru\v{s}kuc, N.}
\newblock The insertion encoding of permutations.
\newblock {\em Electron. J. Combin. 12}, 1 (2005), Research paper 47, 31 pp.
  (electronic).

\bibitem{a:skewmerged}
{\sc Atkinson, M.~D.}
\newblock Permutations which are the union of an increasing and a decreasing
  subsequence.
\newblock {\em Electron. J. Combin. 5\/} (1998), Research paper 6, 13 pp.\
  (electronic).

\bibitem{a:rp}
{\sc Atkinson, M.~D.}
\newblock Restricted permutations.
\newblock {\em Discrete Math. 195}, 1-3 (1999), 27--38.

\bibitem{amr:pwocsop}
{\sc Atkinson, M.~D., Murphy, M.~M., and Ru{\v{s}}kuc, N.}
\newblock Partially well-ordered closed sets of permutations.
\newblock {\em Order 19}, 2 (2002), 101--113.

\bibitem{bbw:growth2000}
{\sc Balogh, J., Bollob{\'a}s, B., and Weinreich, D.}
\newblock The speed of hereditary properties of graphs.
\newblock {\em J. Combin. Theory Ser. B 79}, 2 (2000), 131--156.

\bibitem{es:acpig}
{\sc Erd\H{o}s, P., and Szekeres, G.}
\newblock A combinatorial problem in geometry.
\newblock {\em Compos. Math. 2\/} (1935), 463--470.

\bibitem{fh:sg}
{\sc F{\"o}ldes, S., and Hammer, P.~L.}
\newblock Split graphs.
\newblock In {\em Proceedings of the Eighth Southeastern Conference on
  Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton
  Rouge, La., 1977)\/} (Winnipeg, Man., 1977), Utilitas Math., pp.~311--315.
  Congressus Numerantium, No. XIX.

\bibitem{kk:growth}
{\sc Kaiser, T., and Klazar, M.}
\newblock On growth rates of closed permutation classes.
\newblock {\em Electron. J. Combin. 9}, 2 (2002/03), Research paper 10, 20 pp.
  (electronic).

\bibitem{ksw:incdec}
{\sc K{\'e}zdy, A.~E., Snevily, H.~S., and Wang, C.}
\newblock Partitioning permutations into increasing and decreasing
  subsequences.
\newblock {\em J. Combin. Theory Ser. A 73}, 2 (1996), 353--359.

\bibitem{knuth1}
{\sc Knuth, D.~E.}
\newblock {\em The art of computer programming. {V}ol. 1: {F}undamental
  algorithms}.
\newblock Addison-Wesley Publishing Co., Reading, Mass., 1969.

\bibitem{ls:smooth}
{\sc Lakshmibai, V., and Sandhya, B.}
\newblock Criterion for smoothness of {S}chubert varieties in {${\rm
  SL}(n)/B$}.
\newblock {\em Proc. Indian Acad. Sci. Math. Sci. 100}, 1 (1990), 45--52.

\bibitem{mt:swc}
{\sc Marcus, A., and Tardos, G.}
\newblock Excluded permutation matrices and the {S}tanley-{W}ilf conjecture.
\newblock {\em J. Combin. Theory Ser. A 107}, 1 (2004), 153--160.

\bibitem{profile}
{\sc Murphy, M.~M., and Vatter, V.}
\newblock Profile classes and partial well-order for permutations.
\newblock {\em Electron. J. Combin. 9}, 2 (2002/03), Research paper 17, 30 pp.
  (electronic).

\bibitem{pt:poly}
{\sc Pouzet, M., and Thi{\'e}ry, N.~M.}
\newblock Some relational structures with polynomial growth and their
  associated algebras.
\newblock \texttt{arXiv:math.CO/0601256}.

\bibitem{sz:hered}
{\sc Scheinerman, E.~R., and Zito, J.}
\newblock On the size of hereditary classes of graphs.
\newblock {\em J. Combin. Theory Ser. B 61}, 1 (1994), 16--39.

\bibitem{stankova:fs}
{\sc Stankova, Z.~E.}
\newblock Forbidden subsequences.
\newblock {\em Discrete Math. 132}, 1-3 (1994), 291--316.

\bibitem{s:E2546}
{\sc Stanley, R.~P.}
\newblock Solution to problem {E}2546.
\newblock {\em Amer. Math. Monthly 83}, 10 (1976), 813--814.

\end{thebibliography}