{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:13:56Z","timestamp":1754486036225},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,5,3]],"date-time":"2013-05-03T00:00:00Z","timestamp":1367539200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s00453-013-9790-3","type":"journal-article","created":{"date-parts":[[2013,5,2]],"date-time":"2013-05-02T18:31:20Z","timestamp":1367519480000},"page":"233-257","source":"Crossref","is-referenced-by-count":16,"title":["Monotone Drawings of Graphs with Fixed Embedding"],"prefix":"10.1007","volume":"71","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincenzo","family":"Roselli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Wismath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,3]]},"reference":[{"issue":"1","key":"9790_CR1","doi-asserted-by":"crossref","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. 14(1), 19\u201351 (2010)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"9790_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.7155\/jgaa.00249","volume":"16","author":"P. Angelini","year":"2012","unstructured":"Angelini, P., Colasante, E., Battista, G.D., Frati, F., Patrignani, M.: Monotone drawings of graphs. J.\u00a0Graph Algorithms Appl. 16(1), 5\u201335 (2012). Special Issue on Selected Papers from GD \u201910","journal-title":"J.\u00a0Graph Algorithms Appl."},{"key":"9790_CR3","first-page":"334","volume-title":"Symposium on Computational Geometry","author":"E.M. Arkin","year":"1989","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)"},{"issue":"4","key":"9790_CR4","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/BF01961541","volume":"15","author":"G.D. Battista","year":"1996","unstructured":"Battista, G.D.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica 15(4), 302\u2013318 (1996)","journal-title":"Algorithmica"},{"key":"9790_CR5","doi-asserted-by":"crossref","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G.D. Battista","year":"1996","unstructured":"Battista, G.D.: On-line planarity testing. SIAM J. Comput. 25, 956\u2013997 (1996)","journal-title":"SIAM J. Comput."},{"key":"9790_CR6","first-page":"186","volume":"6","author":"A. Brocot","year":"1860","unstructured":"Brocot, A.: Calcul des rouages par approximation, nouvelle methode. Rev. Chronom. 6, 186\u2013194 (1860)","journal-title":"Rev. Chronom."},{"key":"9790_CR7","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B. Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6, 485\u2013524 (1991)","journal-title":"Discrete Comput. Geom."},{"key":"9790_CR8","series-title":"Annals of Discrete Mathematics","volume-title":"Planar Graphs: Theory and Algorithms","author":"N. Chiba","year":"1988","unstructured":"Chiba, N., Nishizeki, T.: Planar Graphs: Theory and Algorithms. Annals of Discrete Mathematics, vol. 32. North-Holland, Amsterdam (1988)"},{"key":"9790_CR9","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF00264230","volume":"22","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Onoguchi, K., Nishizeki, T.: Drawing plane graphs nicely. Acta Inform. 22, 187\u2013201 (1985)","journal-title":"Acta Inform."},{"key":"9790_CR10","volume-title":"Graph Drawing","author":"G. Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)"},{"issue":"2","key":"9790_CR11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01108622","volume":"12","author":"A. Garg","year":"1995","unstructured":"Garg, A., Tamassia, R.: Upward planarity testing. Order 12(2), 109\u2013133 (1995)","journal-title":"Order"},{"key":"9790_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing","author":"C. Gutwenger","year":"2001","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of spqr-trees. In: Marks, J. (ed.) Graph Drawing. Lecture Notes in Computer Science, vol. 1984, pp. 77\u201390. Springer, Berlin (2001)"},{"key":"9790_CR13","first-page":"137","volume-title":"PacificVis","author":"W. Huang","year":"2009","unstructured":"Huang, W., Eades, P., Hong, S.-H.: A graph reading behavior: geodesic-path tendency. In: PacificVis, pp. 137\u2013144 (2009)"},{"issue":"3","key":"9790_CR14","doi-asserted-by":"crossref","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 Comput. Geom. 44(3), 686\u2013705 (2010)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"9790_CR15","doi-asserted-by":"crossref","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. 344(1), 3\u201314 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"9790_CR16","doi-asserted-by":"crossref","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. J. Reine Angew. Math. 55, 193\u2013220 (1858)","journal-title":"J. Reine Angew. Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9790-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9790-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9790-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:12Z","timestamp":1559123112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9790-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,3]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["9790"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9790-3","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,3]]}}}