{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:20:47Z","timestamp":1754482847466,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319739144"},{"type":"electronic","value":"9783319739151"}],"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_26","type":"book-chapter","created":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T03:42:19Z","timestamp":1516419739000},"page":"326-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Simple Compact Monotone Tree Drawings"],"prefix":"10.1007","author":[{"given":"Anargyros","family":"Oikonomou","sequence":"first","affiliation":[]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"issue":"1","key":"26_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. J. Graph Algorithms Appl. 16(1), 5\u201335 (2012)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00453-013-9790-3","volume":"71","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Didimo, W., Kobourov, S., Mchedlidze, T., Roselli, V., Symvonis, A., Wismath, S.: Monotone drawings of graphs with fixed embedding. Algorithmica 71(2), 233\u2013257 (2015)","journal-title":"Algorithmica"},{"key":"26_CR3","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":"Revue Chronometrique"},{"key":"26_CR4","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"RL Graham","year":"1994","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science, 2nd edn. Addison-Wesley Longman Publishing Co. Inc., Boston (1994)","edition":"2"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2016.01.009","volume":"654","author":"D He","year":"2016","unstructured":"He, D., He, X.: Nearly optimal monotone drawing of trees. Theor. Comput. Sci. 654, 26\u201332 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"He, D., He, X.: Optimal monotone drawings of trees. CoRR abs\/1604.03921 (2016)","DOI":"10.1016\/j.tcs.2016.01.009"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-319-21398-9_36","volume-title":"Computing and Combinatorics","author":"X He","year":"2015","unstructured":"He, X., He, D.: Compact monotone drawing of trees. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 457\u2013468. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21398-9_36"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.tcs.2015.09.004","volume":"607","author":"MI Hossain","year":"2015","unstructured":"Hossain, M.I., Rahman, M.S.: Good spanning trees in graph drawing. Theor. Comput. Sci. 607, 149\u2013165 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_41"},{"key":"26_CR10","unstructured":"Oikonomou, A., Symvonis, A.: Simple compact monotone tree drawings. CoRR abs\/1708.09653v2 (2017). http:\/\/arxiv.org\/abs\/1708.09653v2"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1515\/crll.1858.55.193","volume":"55","author":"M Stern","year":"1858","unstructured":"Stern, M.: Ueber eine zahlentheoretische funktion. Journal fur die reine und angewandte Mathematik 55, 193\u2013220 (1858)","journal-title":"Journal fur die reine und angewandte Mathematik"}],"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_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:24:36Z","timestamp":1710242676000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}]}}