{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:25:56Z","timestamp":1725643556207},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_36","type":"book-chapter","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T21:23:04Z","timestamp":1323897784000},"page":"379-390","source":"Crossref","is-referenced-by-count":5,"title":["Monotone Drawings of Graphs with Fixed Embedding"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[]},{"given":"Vincenzo","family":"Roselli","sequence":"additional","affiliation":[]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Wismath","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-18469-7_2","volume-title":"Graph Drawing","author":"P. Angelini","year":"2011","unstructured":"Angelini, P., Colasante, E., Di Battista, G., Frati, F., Patrignani, M.: Monotone Drawings of Graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 13\u201324. Springer, Heidelberg (2011)"},{"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. J. Graph Algorithms Appl.\u00a014(1), 19\u201351 (2010)","journal-title":"J. Graph Algorithms Appl."},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Arkin, E.M., Connelly, R., Mitchell, J.S.B.: On monotone paths among obstacles with applications to planning assemblies. In: Symposium on Computational Geometry, pp. 334\u2013343 (1989)","DOI":"10.1145\/73833.73870"},{"key":"36_CR4","first-page":"186","volume":"6","author":"A. Brocot","year":"1860","unstructured":"Brocot, A.: Calcul des rouages par approximation, nouvelle methode. Revue Chronometrique\u00a06, 186\u2013194 (1860)","journal-title":"Revue Chronometrique"},{"key":"36_CR5","volume-title":"Graph Drawing","author":"G. Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput.\u00a025, 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01108622","volume":"12","author":"A. Garg","year":"1995","unstructured":"Garg, A., Tamassia, R.: Upward planarity testing. Order\u00a012, 109\u2013133 (1995)","journal-title":"Order"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Huang, W., Eades, P., Hong, S.-H.: A graph reading behavior: Geodesic-path tendency. In: PacificVis, pp. 137\u2013144 (2009)","DOI":"10.1109\/PACIFICVIS.2009.4906848"},{"issue":"3","key":"36_CR9","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/s00454-009-9227-6","volume":"44","author":"T. Leighton","year":"2010","unstructured":"Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. Discrete & Computational Geometry\u00a044(3), 686\u2013705 (2010)","journal-title":"Discrete & Computational Geometry"},{"issue":"1","key":"36_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.022","volume":"344","author":"C.H. Papadimitriou","year":"2005","unstructured":"Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theor. Comput. Sci.\u00a0344(1), 3\u201314 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1515\/crll.1858.55.193","volume":"55","author":"M.A. Stern","year":"1858","unstructured":"Stern, M.A.: Ueber eine zahlentheoretische funktion. Journal fur die reine und angewandte Mathematik\u00a055, 193\u2013220 (1858)","journal-title":"Journal fur die reine und angewandte Mathematik"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T19:29:28Z","timestamp":1561058968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}