{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T09:04:01Z","timestamp":1742634241012},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_4","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T11:36:39Z","timestamp":1185104199000},"page":"46-57","source":"Crossref","is-referenced-by-count":6,"title":["A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences"],"prefix":"10.1007","author":[{"given":"Bing","family":"Yang","sequence":"first","affiliation":[]},{"given":"Jing","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Enyue","family":"Lu","sequence":"additional","affiliation":[]},{"given":"S. Q.","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","first-page":"463","volume":"2","author":"P. Erd\u00f6s","year":"1935","unstructured":"Erd\u00f6s, P., Szekeres, G.: A Combinatorial Problem in Geometry. Compositio Mathematica\u00a02, 463\u2013470 (1935)","journal-title":"Compositio Mathematica"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s002360050126","volume":"35","author":"R.B. Yehuda","year":"1998","unstructured":"Yehuda, R.B., Fogel, S.: Partitioning a Sequence into Few Monotone Subsequences. Acta Informatica\u00a035, 421\u2013440 (1998)","journal-title":"Acta Informatica"},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0020-0190(02)00288-0","volume":"84","author":"F.V. Fomin","year":"2002","unstructured":"Fomin, F.V., Kratsch, D., Novelli, J.: Approximating Minimum Cocolorings. Information Processing Letters\u00a084, 285\u2013290 (2002)","journal-title":"Information Processing Letters"},{"key":"4_CR4","first-page":"263","volume":"22","author":"A. Brandst\u00e4dt","year":"1986","unstructured":"Brandst\u00e4dt, A., Kratsch, D.: On Partitions of Permutations into Increasing and Decreasing Subsequences. Elektron. Inf. Verarb. Kybern.\u00a022, 263\u2013273 (1986)","journal-title":"Elektron. Inf. Verarb. Kybern."},{"key":"4_CR5","first-page":"633","volume":"20","author":"K. Wagner","year":"1984","unstructured":"Wagner, K.: Monotonic Coverings of Finite Sets. Elektron. Inf. Verarb. Kybern.\u00a020, 633\u2013639 (1984)","journal-title":"Elektron. Inf. Verarb. Kybern."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1002\/jgt.3190150604","volume":"15","author":"P. Erd\u00f6s","year":"1991","unstructured":"Erd\u00f6s, P., Gimbel, J., Kratsch, D.: Some Extremal Results in Cochromatic and Dichromatic Theory. Journal of Graph Theory\u00a015, 579\u2013585 (1991)","journal-title":"Journal of Graph Theory"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Myers, J.S.: The Minimum Number of Monotone Subsequences. Electronic Journal of Combinatorics 9(2), R4 (2002)","DOI":"10.37236\/1676"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/PL00008763","volume":"119","author":"C.A. Tracy","year":"2001","unstructured":"Tracy, C.A., Widom, H.: On the Distributions of the Lengths of the Longest Monotone Subsequences in Random Words. Probab. Theory Relat. Fields\u00a0119, 350\u2013380 (2001)","journal-title":"Probab. Theory Relat. Fields"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1006\/jcta.1998.2907","volume":"85","author":"R. Siders","year":"1999","unstructured":"Siders, R.: Monotone Subsequences in Any Dimension. Journal of Combinatorial Theory, Series A\u00a085, 243\u2013253 (1999)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J., Welzl, E.: Good splitters for counting points in triangles. In: The 5th Ann. ACM Conf. On Computational Geometry, pp. 124\u2013130 (1989)","DOI":"10.1145\/73833.73847"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(75)90103-X","volume":"11","author":"M.L. Fredman","year":"1975","unstructured":"Fredman, M.L.: On Computing the Length of Longest Increasing Subsequences. Discrete Mathematics\u00a011, 29\u201335 (1975)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A Decomposition Theorem for Partially Ordered Sets. Annals of Mathematics\u00a051(1), 161\u2013166 (1950)","journal-title":"Annals of Mathematics"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/0095-8956(80)90079-9","volume":"29","author":"A. Frank","year":"1980","unstructured":"Frank, A.: On Chain and Antichain Families of a Partially Ordered Set. Journal of Combinatorial Theory, Series B\u00a029, 176\u2013184 (1980)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0095-8956(77)90052-1","volume":"23","author":"A.J. Hoffman","year":"1977","unstructured":"Hoffman, A.J., Schwartz, D.E.: On Partitions of a Partially Ordered Set. Journal of Combinatorial Theory, Series B\u00a023, 3\u201313 (1977)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0097-3165(76)90077-7","volume":"20","author":"C. Greene","year":"1976","unstructured":"Greene, C., Kleitman, D.J.: The Structure of Sperner k-Families. Journal of Combinatorial Theory, Series A\u00a020, 41\u201368 (1976)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0097-3165(76)90078-9","volume":"20","author":"C. Greene","year":"1976","unstructured":"Greene, C.: Some Partitions Associated with a Partially Ordered Set. Journal of Combinatorial Theory, Series A\u00a020, 69\u201379 (1976)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0097-3165(76)90079-0","volume":"20","author":"C. Greene","year":"1976","unstructured":"Greene, C., Kleitman, D.J.: Strong Versions of Sperner\u2019s Theorem. Journal of Combinatorial Theory, Series A\u00a020, 80\u201388 (1976)","journal-title":"Journal of Combinatorial Theory, Series A"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:34:05Z","timestamp":1605764045000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_4","relation":{},"subject":[]}}