{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:37:43Z","timestamp":1725550663444},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291077"},{"type":"electronic","value":"9783540320722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560647_37","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:04:06Z","timestamp":1129817046000},"page":"562-578","source":"Crossref","is-referenced-by-count":6,"title":["Maximum Marking Problems with Accumulative Weight Functions"],"prefix":"10.1007","author":[{"given":"Isao","family":"Sasano","sequence":"first","affiliation":[]},{"given":"Mizuhito","family":"Ogawa","sequence":"additional","affiliation":[]},{"given":"Zhenjiang","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","volume-title":"Algebra of Programming","author":"R. Bird","year":"1996","unstructured":"Bird, R., de Moor, O.: Algebra of Programming. Prentice Hall, Englewood Cliffs (1996)"},{"key":"37_CR2","series-title":"NATO ASI Series","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/978-3-642-87374-4_1","volume-title":"Logic of Programming and Calculi of Discrete Design","author":"R. Bird","year":"1987","unstructured":"Bird, R.: An introduction to the theory of lists. In: Broy, M. (ed.) Logic of Programming and Calculi of Discrete Design. NATO ASI Series, vol.\u00a0F36, pp. 5\u201342. Springer, Heidelberg (1987)"},{"issue":"2","key":"37_CR3","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1093\/comjnl\/32.2.122","volume":"32","author":"R. Bird","year":"1989","unstructured":"Bird, R.: Algebraic identities for program calculation. The Computer Journal\u00a032(2), 122\u2013126 (1989)","journal-title":"The Computer Journal"},{"key":"37_CR4","volume-title":"Introduction to Functional Programming using Haskell","author":"R. Bird","year":"1998","unstructured":"Bird, R.: Introduction to Functional Programming using Haskell, 2nd edn. Prentice Hall, Englewood Cliffs (1998)","edition":"2"},{"issue":"4","key":"37_CR5","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1017\/S0956796801004038","volume":"11","author":"R. Bird","year":"2001","unstructured":"Bird, R.: Maximum marking problems. Journal of Functional Programming\u00a011(4), 411\u2013424 (2001)","journal-title":"Journal of Functional Programming"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","volume":"8","author":"M.W. Bern","year":"1987","unstructured":"Bern, M.W., Lawler, E.L., Wong, A.L.: Linear-time computation of optimal subgraphs of decomposable graphs. Journal of Algorithms\u00a08, 216\u2013235 (1987)","journal-title":"Journal of Algorithms"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BF01758777","volume":"7","author":"R.B. Borie","year":"1992","unstructured":"Borie, R.B., Parker, R.G., Tovey, C.A.: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica\u00a07, 555\u2013581 (1992)","journal-title":"Algorithmica"},{"key":"37_CR8","first-page":"33","volume-title":"Formal Development of Programs and Proofs","author":"D. Gries","year":"1990","unstructured":"Gries, D.: The maximum-segment-sum problem. In: Dijkstra, E.W. (ed.) Formal Development of Programs and Proofs, pp. 33\u201336. Addison-Wesley, Reading (1990)"},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/944705.944716","volume-title":"Proceedings of the 8th ACM SIGPLAN International Conference on Functional Programming (ICFP 2003)","author":"M. Ogawa","year":"2003","unstructured":"Ogawa, M., Hu, Z., Sasano, I.: Iterative-free program analysis. In: Proceedings of the 8th ACM SIGPLAN International Conference on Functional Programming (ICFP 2003), Uppsala, Sweden, August 2003, pp. 111\u2013123. ACM Press, New York (2003)"},{"key":"37_CR10","unstructured":"Jones, S.P., Hughes, J. (eds.): The Haskell 98 Report (February 1999), Available from \n                    \n                      http:\/\/www.haskell.org\/definition\/"},{"issue":"2","key":"37_CR11","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1145\/234528.234529","volume":"28","author":"A. Pettrossi","year":"1996","unstructured":"Pettrossi, A., Proietti, M.: Rules and strategies for transforming functional and logic programs. ACM Computing Surveys\u00a028(2), 360\u2013414 (1996)","journal-title":"ACM Computing Surveys"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-44806-3_5","volume-title":"Semantics, Applications, and Implementation of Program Generation","author":"I. Sasano","year":"2001","unstructured":"Sasano, I., Hu, Z., Takeichi, M.: Generation of efficient programs for solving maximum multi-marking problems. In: Taha, W. (ed.) SAIG 2001. LNCS, vol.\u00a02196, pp. 72\u201391. Springer, Heidelberg (2001)"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/351240.351254","volume-title":"Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming (ICFP\u201900)","author":"I. Sasano","year":"2000","unstructured":"Sasano, I., Hu, Z., Takeichi, M., Ogawa, M.: Make it practical: A generic linear-time algorithm for solving maximum-weightsum problems. In: Proceedings of the 5th ACM SIGPLAN International Conference on Functional Programming (ICFP 2000), Montreal, Canada, September 2000, pp. 137\u2013149. ACM Press, New York (2000)"},{"issue":"2","key":"37_CR14","first-page":"59","volume":"18","author":"I. Sasano","year":"2001","unstructured":"Sasano, I., Hu, Z., Takeichi, M., Ogawa, M.: Solving a class of knapsack problems on recursive data structures (in Japanese). Computer Software\u00a018(2), 59\u201363 (2001)","journal-title":"Computer Software"},{"issue":"4","key":"37_CR15","first-page":"39","volume":"19","author":"I. Sasano","year":"2002","unstructured":"Sasano, I., Hu, Z., Takeichi, M., Ogawa, M.: Derivation of linear algorithm for mining optimized gain association rules. Computer Software\u00a019(4), 39\u201344 (2002)","journal-title":"Computer Software"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560647_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T02:36:12Z","timestamp":1552444572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560647_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291077","9783540320722"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11560647_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}