{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T08:38:48Z","timestamp":1794559128945,"version":"4.9.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319739144","type":"print"},{"value":"9783319739151","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73915-1_25","type":"book-chapter","created":{"date-parts":[[2018,1,19]],"date-time":"2018-01-19T22:42:19Z","timestamp":1516401739000},"page":"318-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Upward Drawings of Trees on a Given Grid"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Debajyoti","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"issue":"2","key":"25_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.7155\/jgaa.00206","volume":"14","author":"MJ Alam","year":"2010","unstructured":"Alam, M.J., Samee, M.A.H., Rabbi, M., Rahman, M.S.: Minimum-layer upward drawings of trees. J. Graph Algorithms Appl. 14(2), 245\u2013267 (2010)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"25_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.7155\/jgaa.00287","volume":"17","author":"C Bachmaier","year":"2013","unstructured":"Bachmaier, C., Matzeder, M.: Drawing unordered trees on $$k$$-grids. J. Graph Algorithms Appl. 17(2), 103\u2013128 (2013)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"25_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0020-0190(87)90173-6","volume":"25","author":"SN Bhatt","year":"1987","unstructured":"Bhatt, S.N., Cosmadakis, S.S.: The complexity of minimizing wire lengths in VLSI layouts. Inf. Process. Lett. 25(4), 263\u2013267 (1987)","journal-title":"Inf. Process. Lett."},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-662-43948-7_17","volume-title":"Automata, Languages, and Programming","author":"T Biedl","year":"2014","unstructured":"Biedl, T.: On area-optimal planar graph drawings. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part I. LNCS, vol. 8572, pp. 198\u2013210. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_17"},{"key":"25_CR5","unstructured":"Biedl, T.: Optimum-width upward drawings of trees I: rooted pathwidth. CoRR abs\/1502.02753 (2015)"},{"key":"25_CR6","unstructured":"Biedl, T., Mondal, D.: On upward drawings of trees on a given grid. CoRR abs\/1708.09515 (2017). http:\/\/arxiv.org\/abs\/1708.09515"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-18469-7_10","volume-title":"Graph Drawing","author":"W Brunner","year":"2011","unstructured":"Brunner, W., Matzeder, M.: Drawing ordered ($$k - 1$$)-ary trees on k-grids. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 105\u2013116. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18469-7_10"},{"key":"25_CR8","unstructured":"Di Battista, G., Frati, F.: A survey on small-area planar graph drawing (2014), coRR report 1410.1006"},{"key":"25_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W H Freeman & Co, New York (1979)"},{"issue":"4","key":"25_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0020-0190(89)90118-X","volume":"31","author":"A Gregori","year":"1989","unstructured":"Gregori, A.: Unit-length embedding of binary trees on a square grid. Inf. Process. Lett. 31(4), 167\u2013173 (1989)","journal-title":"Inf. Process. Lett."},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-77537-9_21","volume-title":"Graph Drawing","author":"M Krug","year":"2008","unstructured":"Krug, M., Wagner, D.: Minimizing the area for planar straight-line grid drawings. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 207\u2013212. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77537-9_21"},{"issue":"2","key":"25_CR12","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","volume":"25","author":"SR Mahaney","year":"1982","unstructured":"Mahaney, S.R.: Sparse complete sets of NP: Solution of a conjecture of Berman and Hartmanis. J. Comput. Syst. Sci. 25(2), 130\u2013143 (1982)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"25_CR13","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. 8(2), 295\u2013312 (2004)","journal-title":"J. Graph Algorithms Appl."},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-19094-0_23","volume-title":"WALCOM: Algorithms and Computation","author":"D Mondal","year":"2011","unstructured":"Mondal, D., Alam, M.J., Rahman, M.S.: Minimum-layer drawings of trees. In: Katoh, N., Kumar, A. (eds.) WALCOM 2011. LNCS, vol. 6552, pp. 221\u2013232. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19094-0_23"},{"issue":"2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"177","DOI":"10.7155\/jgaa.00222","volume":"15","author":"D Mondal","year":"2011","unstructured":"Mondal, D., Nishat, R.I., Rahman, M.S., Alam, M.J.: Minimum-area drawings of plane 3-trees. J. Graph Algorithms Appl. 15(2), 177\u2013204 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF00289576","volume":"18","author":"KJ Supowit","year":"1982","unstructured":"Supowit, K.J., Reingold, E.M.: The complexity of drawing trees nicely. Acta Informatica 18, 377\u2013392 (1982)","journal-title":"Acta Informatica"},{"key":"25_CR17","volume-title":"Handbook of Graph Drawing and Visualization (Discrete Mathematics and Its Applications)","year":"2014","unstructured":"Tamassia, R. (ed.): Handbook of Graph Drawing and Visualization (Discrete Mathematics and Its Applications). Chapman and Hall\/CRC, Boca Raton (2014)"},{"issue":"5","key":"25_CR18","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0020-0190(96)81422-0","volume":"57","author":"L Trevisan","year":"1996","unstructured":"Trevisan, L.: A note on minimum-area upward drawing of complete and Fibonacci trees. Inf. Process. Lett. 57(5), 231\u2013236 (1996)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73915-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T07:24:23Z","timestamp":1710228263000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_25","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Boston","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2017.ccis.northeastern.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}