{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:29Z","timestamp":1725544769878},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_36","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T11:50:30Z","timestamp":1140177030000},"page":"374-385","source":"Crossref","is-referenced-by-count":4,"title":["On Minimum k-Modal Partitions of Permutations"],"prefix":"10.1007","author":[{"given":"Gabriele","family":"Di Stefano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Krause","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco E.","family":"L\u00fcbbecke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe T.","family":"Zimmermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Inc., Englewood Cliffs (1993)"},{"issue":"5","key":"36_CR2","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s002360050126","volume":"35","author":"R. Bar-Yehuda","year":"1998","unstructured":"Bar-Yehuda, R., Fogel, S.: Partitioning a sequence into few monotone subsequences. Acta Inform.\u00a035(5), 421\u2013440 (1998)","journal-title":"Acta Inform."},{"issue":"1","key":"36_CR3","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/PL00020912","volume":"49","author":"U. Blasum","year":"1999","unstructured":"Blasum, U., Bussieck, M.R., Hochst\u00e4ttler, W., Moll, C., Scheel, H.-H., Winter, T.: Scheduling trams in the morning. Math. Methods Oper. Res.\u00a049(1), 137\u2013148 (1999)","journal-title":"Math. Methods Oper. Res."},{"issue":"5\/6","key":"36_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. Informationsverarb. Kybernet.\u00a022(5\/6), 263\u2013273 (1986)","journal-title":"Elektron. Informationsverarb. Kybernet."},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0097-3165(80)90021-7","volume":"29","author":"F.R.K. Chung","year":"1980","unstructured":"Chung, F.R.K.: On unimodal subsequences. J. Combin. Theory Ser. A\u00a029, 267\u2013279 (1980)","journal-title":"J. Combin. Theory Ser. A"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.entcs.2003.12.020","volume":"92","author":"G. Stefano Di","year":"2004","unstructured":"Di Stefano, G., Ko\u010di, M.L.: A graph theoretical approach to the shunting problem. Electr. Notes Theor. Comput. Sci.\u00a092, 16\u201333 (2004)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0029561","volume-title":"Online Algorithms","author":"A. Fiat","year":"1998","unstructured":"Fiat, A., Woeginger, G.J.: Dagstuhl Seminar 1996. LNCS, vol.\u00a01442. Springer, Heidelberg (1998)"},{"issue":"5","key":"36_CR8","doi-asserted-by":"publisher","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.-C.: Approximating minimum cocolourings. Inform. Process. Lett.\u00a084(5), 285\u2013290 (2002)","journal-title":"Inform. Process. Lett."},{"key":"36_CR9","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0012-365X(81)90168-0","volume":"33","author":"J.M. Steele","year":"1981","unstructured":"Steele, J.M.: Long unimodal subsequences: A problem of F.R.K. Chung. Discrete Math.\u00a033, 223\u2013225 (1981)","journal-title":"Discrete Math."},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-1-4612-0801-3_9","volume-title":"Discrete Probability and Algorithms","author":"J.M. Steele","year":"1995","unstructured":"Steele, J.M.: Variations on the monotone subsequence theme of Erd\u00f6s and Szekeres. In: Aldous, D., Diaconis, P., Spencer, J., Steele, J.M. (eds.) Discrete Probability and Algorithms, pp. 111\u2013131. Springer, New York (1995)"},{"issue":"12","key":"36_CR12","first-page":"633","volume":"20","author":"K. Wagner","year":"1984","unstructured":"Wagner, K.: Monotonic coverings of finite sets. Elektron. Informationsverarb. Kybernet.\u00a020(12), 633\u2013639 (1984)","journal-title":"Elektron. Informationsverarb. Kybernet."},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/A:1018907720194","volume":"96","author":"T. Winter","year":"2000","unstructured":"Winter, T., Zimmermann, U.T.: Real-time dispatch of trams in storage yards. Ann. Oper. Res.\u00a096, 287\u2013315 (2000)","journal-title":"Ann. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T14:28:56Z","timestamp":1683383336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11682462_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}