Author:
Jelínek Vít,Opler Michal,Valtr Pavel
Funder
Grantová Agentura České Republiky
Publisher
Springer Science and Business Media LLC
Reference41 articles.
1. Knuth, D.E.: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley Series in Computer Science and Information Processing, pp. 722–1. Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont. (1973)
2. Brandstädt, A., Kratsch, D.: On partitions of permutations into increasing and decreasing subsequences. Elektron Informationsverarb Kybernet 22(5–6), 263–273 (1986)
3. Stankova, Z.E.: Forbidden subsequences. Discrete Math. 132(1–3), 291–316 (1994). https://doi.org/10.1016/0012-365X(94)90242-9
4. Kézdy, A.E., Snevily, H.S., Wang, C.: Partitioning permutations into increasing and decreasing subsequences. J. Comb. Theory Ser. A 73(2), 353–359 (1996). https://doi.org/10.1016/S0097-3165(96)80012-4
5. Atkinson, M.D.: Permutations which are the union of an increasing and a decreasing subsequence. Electron. J. Comb. 5, 6–13 (1998) https://doi.org/10.37236/1344