{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:10:50Z","timestamp":1725577850915},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_2","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T00:30:40Z","timestamp":1297297840000},"page":"13-24","source":"Crossref","is-referenced-by-count":3,"title":["Monotone Drawings of Graphs"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"given":"Enrico","family":"Colasante","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Patrignani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Angelini, P., Colasante, E., di Battista, G., Frati, F., Patrignani, M.: Monotone drawings of graphs. Tech. Report 178, Dip. di Informatica e Automazione, Universit\u00e0 Roma Tre (2010)","DOI":"10.1007\/978-3-642-18469-7_2"},{"issue":"1","key":"2_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 Alg. Appl.\u00a014(1), 19\u201351 (2010)","journal-title":"J. Graph Alg. Appl."},{"key":"2_CR3","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)","DOI":"10.1145\/73833.73870"},{"key":"2_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":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-70904-6_9","volume-title":"Graph Drawing","author":"J. Carlson","year":"2007","unstructured":"Carlson, J., Eppstein, D.: Trees with convex faces and optimal angles. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 77\u201388. Springer, Heidelberg (2007)"},{"key":"2_CR6","volume-title":"Annals of Discrete Mathematics","author":"N. Chiba","year":"1988","unstructured":"Chiba, N., Nishizeki, T.: Planar Graphs: Theory and Algorithms. In: Annals of Discrete Mathematics, vol.\u00a032, North-Holland, Amsterdam (1988)"},{"key":"2_CR7","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.\u00a061, 175\u2013198 (1988)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"2_CR8","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF01961541","volume":"15","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica\u00a015(4), 302\u2013318 (1996)","journal-title":"Algorithmica"},{"issue":"5","key":"2_CR9","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Di Battista","year":"1996","unstructured":"Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comp.\u00a025(5), 956\u2013997 (1996)","journal-title":"SIAM J. Comp."},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A. Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comp.\u00a031(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comp."},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.) GD 2000. LNCS, vol.\u00a01984, pp. 77\u201390. Springer, Heidelberg (2001)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Moitra, A., Leighton, T.: Some results on greedy embeddings in metric spaces. In: Foundations of Computer Science (FOCS 2008), pp. 337\u2013346 (2008)","DOI":"10.1109\/FOCS.2008.18"},{"issue":"1","key":"2_CR13","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. Theoretical Computer Science\u00a0344(1), 3\u201314 (2005)","journal-title":"Theoretical Computer Science"},{"key":"2_CR14","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-18469-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T08:44:53Z","timestamp":1559983493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}