{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:54:46Z","timestamp":1742979286475,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_36","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"457-468","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Compact Monotone Drawing of Trees"],"prefix":"10.1007","author":[{"given":"Xin","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dayu","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"issue":"1","key":"36_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7155\/jgaa.00249","volume":"16","author":"P Angelini","year":"2012","unstructured":"Angelini, P., Colasante, E., Di Battista, G., Frati, F., Patrignani, M.: Monotone Drawings of Graphs. Journal of Graph Algorithms and Applications 16(1), 5\u201335 (2012)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"1","key":"36_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.7155\/jgaa.00197","volume":"14","author":"P Angelini","year":"2010","unstructured":"Angelini, P., Frati, F., Grilli, L.: An Algorithm to Construct Greedy Drawings of Triangulations. Journal of Graph Algorithms and Applications 14(1), 19\u201351 (2010)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"36_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9790-3","author":"P Angelini","year":"2013","unstructured":"Angelini, P., Didimo, W., Kobourov, S., Mchedlidze, T., Roselli, V., Symvonis, A., Wismath, S.: Monotone Drawings of Graphs with Fixed Embedding. Algorithmica (2013). doi:10.1007\/s00453-013-9790-3","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Arkin, E.M., Connelly, R., Mitchell, J.S.: On Monotone Paths among Obstacles with Applications to Planning Assemblies. In: SoCG 1989, pp. 334\u2013343 (1989)","key":"36_CR4","DOI":"10.1145\/73833.73870"},{"key":"36_CR5","first-page":"186","volume":"6","author":"A Brocot","year":"1860","unstructured":"Brocot, A.: Calcul des Rouages par Approximation. Nouvelle Methode, Revue Chronometrique 6, 186\u2013194 (1860)","journal-title":"Nouvelle Methode, Revue Chronometrique"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G Di Battista","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for Plane Representations of Acyclic Digraphs. Theor. Comput. Sci. 61, 175\u2013198 (1988)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"36_CR7","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A Garg","year":"2001","unstructured":"Garg, A., Tammassia, R.: On the Computational Complexity of Upward and Rectilinear Planarity Testing. SIAM J. Comp. 31(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comp."},{"unstructured":"Hardy, G., Write, E.M.: An Introduction to the Theory of Numbers, 5th edn. Oxford University Press (1989)","key":"36_CR8"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-319-08016-1_10","volume-title":"Frontiers in Algorithmics","author":"MI Hossain","year":"2014","unstructured":"Hossain, M.I., Rahman, M.S.: Monotone Grid Drawings of Planar Graphs. In: Chen, J., Hopcroft, J.E., Wang, J. (eds.) FAW 2014. LNCS, vol. 8497, pp. 105\u2013116. Springer, Heidelberg (2014)"},{"doi-asserted-by":"crossref","unstructured":"Huang, W., Eades, P., Hong, S.-H.: A Graph Reading Behavior: Geodesic-Path Tendency. In Proceedings of IEEE Pacific Visualization Symposium, pp. 137\u2013144 (2009)","key":"36_CR10","DOI":"10.1109\/PACIFICVIS.2009.4906848"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1007\/978-3-662-45803-7_41","volume-title":"Graph Drawing","author":"P Kindermann","year":"2014","unstructured":"Kindermann, P., Schulz, A., Spoerhase, J., Wolff, A.: On Monotone Drawings of Trees. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 488\u2013500. Springer, Heidelberg (2014)"},{"doi-asserted-by":"crossref","unstructured":"Moitra, A., Leighton, T.: Some Results on Greedy Embeddings in Metric Spaces. In: Proceedings FOCS 2008, pp. 337\u2013346 (2008)","key":"36_CR12","DOI":"10.1109\/FOCS.2008.18"},{"issue":"1","key":"36_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.022","volume":"344","author":"CH Papadimitriou","year":"2005","unstructured":"Papadimitriou, C.H., Ratajczak, D.: On a Conjecture Related to Geometric Routing. Theoretical Computer Science 344(1), 3\u201314 (2005)","journal-title":"Theoretical Computer Science"},{"key":"36_CR14","first-page":"193","volume":"55","author":"MA Stern","year":"1958","unstructured":"Stern, M.A.: Ueber eine Zahlentheoretische Funktion. Journal fur die reine und angewandte Mathematik 55, 193\u2013220 (1958)","journal-title":"Journal fur die reine und angewandte Mathematik"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T04:17:35Z","timestamp":1675138655000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}