乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:11:27Z","timestamp":1725577887786},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_10","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T00:30:40Z","timestamp":1297297840000},"page":"105-116","source":"Crossref","is-referenced-by-count":4,"title":["Drawing Ordered (k\u2009\u2212\u20091)\u2013Ary Trees on k\u2013Grids"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Brunner","sequence":"first","affiliation":[]},{"given":"Marco","family":"Matzeder","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"8","key":"10_CR1","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s00236-004-0138-y","volume":"40","author":"T. Akkerman","year":"2004","unstructured":"Akkerman, T., Buchheim, C., J\u00fcnger, M., Teske, D.: On the complexity of drawing trees nicely: Corrigendum. Acta Inf.\u00a040(8), 603\u2013607 (2004)","journal-title":"Acta Inf."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Aziza, S., Biedl, T.C.: Hexagonal grid drawings: Algorithms and lower bounds. In: Graph Drawing, pp. 18\u201324 (2004)","DOI":"10.1007\/978-3-540-31843-9_3"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-00219-9_36","volume-title":"Graph Drawing","author":"C. Bachmaier","year":"2009","unstructured":"Bachmaier, C., Brandenburg, F.J., Brunner, W., Hofmeier, A., Matzeder, M., Unfried, T.: Tree drawings on the hexagonal grid. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 372\u2013383. Springer, Heidelberg (2009)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bachmaier, C., Brandenburg, F.J., Forster, M., Holleis, P., Raitner, M.: Gravisto: Graph visualization toolkit. In: Graph Drawing, pp. 502\u2013503 (2004)","DOI":"10.1007\/978-3-540-31843-9_52"},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0020-0190(87)90173-6","volume":"25","author":"S.N. Bhatt","year":"1987","unstructured":"Bhatt, S.N., Cosmadakis, S.S.: The complexity of minimizing wire lengths in VLSI layouts. Inf. Process. Lett.\u00a025(4), 263\u2013267 (1987)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0925-7721(01)00066-9","volume":"23","author":"T.M. Chan","year":"2002","unstructured":"Chan, T.M., Goodrich, M.T., Kosaraju, S.R., Tamassia, R.: Optimizing area and aspect ratio in straight-line orthogonal tree drawings. Comput. Geom. Theory Appl.\u00a023(2), 153\u2013162 (2002)","journal-title":"Comput. Geom. Theory Appl."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0925-7721(92)90021-J","volume":"2","author":"P. Crescenzi","year":"1992","unstructured":"Crescenzi, P., Di Battista, G., Piperno, A.: A note on optimal area algorithms for upward drawings of binary trees. Comput. Geom. Theory Appl.\u00a02, 187\u2013200 (1992)","journal-title":"Comput. Geom. Theory Appl."},{"key":"10_CR8","first-page":"10","volume":"5","author":"P. Eades","year":"1992","unstructured":"Eades, P.: Drawing free trees. Bulletin of the Institute of Combinatorics and its Applications\u00a05, 10\u201336 (1992)","journal-title":"Bulletin of the Institute of Combinatorics and its Applications"},{"key":"10_CR9","unstructured":"Eades, P., Lin, T., Lin, X.: Minimum size h-v drawings. In: Advanced Visual Interfaces, pp. 386\u2013394 (1992)"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0304-3975(97)84223-5","volume":"169","author":"P. Eades","year":"1996","unstructured":"Eades, P., Whitesides, S.: The logic engine and the realization problem for nearest neighbor graphs. Theor. Comput. Sci.\u00a0169(1), 23\u201337 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-77537-9_11","volume-title":"Graph Drawing","author":"F. Frati","year":"2008","unstructured":"Frati, F.: Straight-line orthogonal drawings of binary and ternary trees. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 76\u201387. Springer, Heidelberg (2008)"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.7155\/jgaa.00086","volume":"8","author":"A. Garg","year":"2004","unstructured":"Garg, A., Rusu, A.: Straight-line drawings of binary trees with linear area and arbitrary aspect ratio. J. Graph Algo. App.\u00a08(2), 135\u2013160 (2004)","journal-title":"J. Graph Algo. App."},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-56402-0_53","volume-title":"Live Data Structures in Logic Programs","author":"G. Kant","year":"1993","unstructured":"Kant, G.: Hexagonal grid drawings. In: Mulkers, A. (ed.) Live Data Structures in Logic Programs. LNCS, vol.\u00a0675, pp. 263\u2013276. Springer, Heidelberg (1993)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol.\u00a02025. Springer, Heidelberg (2001)"},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"295","DOI":"10.7155\/jgaa.00093","volume":"8","author":"K. Marriott","year":"2004","unstructured":"Marriott, K., Stuckey, P.J.: NP-completeness of minimal width unordered tree layout. J. Graph Algorithms Appl.\u00a08(2), 295\u2013312 (2004)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"10_CR16","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"7","author":"E.M. Reingold","year":"1981","unstructured":"Reingold, E.M., Tilford, J.S.: Tidier drawing of trees. IEEE Trans. Software Eng.\u00a07(2), 223\u2013228 (1981)","journal-title":"IEEE Trans. Software Eng."},{"issue":"4","key":"10_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0925-7721(99)00053-X","volume":"15","author":"C.S. Shin","year":"2000","unstructured":"Shin, C.S., Kim, S.K., Chwa, K.Y.: Area-efficient algorithms for straight-line tree drawings. Comput. Geom. Theory Appl.\u00a015(4), 175\u2013202 (2000)","journal-title":"Comput. Geom. Theory Appl."},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF00289576","volume":"18","author":"K.J. Supowit","year":"1982","unstructured":"Supowit, K.J., Reingold, E.M.: The complexity of drawing trees nicely. Acta Inf.\u00a018, 377\u2013392 (1982)","journal-title":"Acta Inf."},{"issue":"3","key":"10_CR19","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput.\u00a016(3), 421\u2013444 (1987)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"10_CR20","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1002\/spe.4380200705","volume":"20","author":"J.Q.W. Walker","year":"1990","unstructured":"Walker, J.Q.W.: A node-positioning algorithm for general trees. Softw. Pract. Exper.\u00a020(7), 685\u2013705 (1990)","journal-title":"Softw. Pract. Exper."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T08:44:57Z","timestamp":1559983497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}