{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:54:56Z","timestamp":1725573296497},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343752"},{"type":"electronic","value":"9783540343783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_27","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T10:34:15Z","timestamp":1149244455000},"page":"272-283","source":"Crossref","is-referenced-by-count":2,"title":["How to Pack Directed Acyclic Graphs into Small Blocks"],"prefix":"10.1007","author":[{"given":"Yuichi","family":"Asahiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuya","family":"Furukawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keiichi","family":"Ikegami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eiji","family":"Miyano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"volume-title":"Handbook of massive data sets","year":"2002","key":"27_CR1","unstructured":"Abello, J., Pardalos, P.M., Resende, M.G.C. (eds.): Handbook of massive data sets. Kluwer Academic Pub., Dordrecht (2002)"},{"issue":"9","key":"27_CR2","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Commun. ACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Bender, M.A., Demaine, E.D., Farach-Colton, M., Rauhe, T., Thorup, M.: Efficient tree layout in a multilevel memory hierarchy. CoRR cs.DS\/0211010 (2002)","DOI":"10.1007\/3-540-45749-6_18"},{"key":"27_CR4","unstructured":"Amer-Yahia, S., Koudas, N., Marian, A., Srivastava, D., Toman, D.: Structure and content scoring for XML. In: Proc. 31st VLDB, pp. 361\u2013372 (2005)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Arge, L., Danner, A., Teh, S.-M.: I\/O-efficient point location using persistent B-trees. In: Proc. 5th ALENEX, pp. 82\u201392 (2003)","DOI":"10.1145\/996546.996549"},{"key":"27_CR6","unstructured":"Clark, D., Munro, J.: Efficient suffix trees on secondary storage. In: Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 383\u2013391 (1996)"},{"key":"27_CR7","unstructured":"Diwan, A.A., Rane, S., Seshadri, S., Sudarshan, S.: Clustering techniques for minimizing external path length. In: Proc. 22nd VLDB, pp. 432\u2013353 (1996)"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Comput.\u00a05, 691\u2013703 (1976)","journal-title":"SIAM J. Comput."},{"key":"#cr-split#-27_CR9.1","doi-asserted-by":"crossref","unstructured":"Gil, J., Itai, A.: Packing trees. In: Proc. 3rd Annual European Symposium on Algorithms, pp. 113???127 (1995);","DOI":"10.1007\/3-540-60313-1_138"},{"key":"#cr-split#-27_CR9.2","doi-asserted-by":"crossref","unstructured":"Full version: J. Algorithms 32(2), pp.108???132 (1999)","DOI":"10.1006\/jagm.1999.1014"},{"issue":"28","key":"27_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D.G. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.G.: Optimal search in planar subdivisions. SIAM J. Comput.\u00a012(28), 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Varman, P.J., Verma, R.M.: An efficient multiversion access structure. IEEE Trans. on Knowledge and Data Engineering\u00a09(3) (1997)","DOI":"10.1109\/69.599929"},{"key":"27_CR12","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"},{"issue":"2","key":"27_CR13","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"J.S. Vitter","year":"2001","unstructured":"Vitter, J.S.: External memory algorithms and data structures: Dealing with massive data. ACM Comput. Surveys\u00a033(2), 209\u2013271 (2001)","journal-title":"ACM Comput. Surveys"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:25Z","timestamp":1619507065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11758471_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}