{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:33Z","timestamp":1725664113972},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540589501"},{"type":"electronic","value":"9783540491552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-58950-3_358","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:55:42Z","timestamp":1330257342000},"page":"76-83","source":"Crossref","is-referenced-by-count":0,"title":["On drawing a graph convexly in the plane (extended abstract)"],"prefix":"10.1007","author":[{"given":"Hristo N.","family":"Djidjev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"8_CR1","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Technical Report, Brown University, 1988; updated 1993."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Guiseppe Di Battista, Roberto Tamassia, and Luca Vismara, On-line convex planarity testing, Proc. WG'94, in Lecture Notes in Computer Science, Springer-Verlag, to appear.","DOI":"10.1007\/3-540-59071-4_52"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. Booth","year":"1976","unstructured":"K. Booth, G. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithm, J. Comp. Syst. Sci. 13, 1976, pp. 335\u2013379.","journal-title":"J. Comp. Syst. Sci."},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0022-0000(85)90004-2","volume":"30","author":"N. Chiba","year":"1985","unstructured":"N. Chiba, T. Nishizeki, S. Abe, T. Ozawa, A linear algorithm for embedding planar graphs using PQ-trees, J. Comput. System Sci. 30, 1985, 54\u201376.","journal-title":"J. Comput. System Sci."},{"key":"8_CR5","unstructured":"N. Chiba, T. Yamanouchi, T. Nishizeki, Linear algorithms for convex drawings of planar graphs, in Progress in Graph Theory, J. A. Bondy and U.S.R. Murty (eds.), Academic Press, 1984, pp. 153\u2013173."},{"key":"8_CR6","unstructured":"M. Chrobak and G. Kant, Convex grid drawings of 3-connected planar graphs, Technical Report RUU-CS-93-45, Utrecht University, 1993."},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"S. Even and R.E. Tarjan, Computing an st-numbering, Theor. Comput. Sci. 2, 1976, 339\u2013344.","journal-title":"Theor. Comput. Sci."},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"J. Hopcroft and R.E. Tarjan, Dividing a graph into triconnected components, SIAM J. Comput. 2, 1973, pp. 135\u2013158.","journal-title":"SIAM J. Comput."},{"issue":"4","key":"8_CR9","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"J. Hopcroft and R.E. Tarjan, Efficient planarity testing, J.ACM, 21:4, 1974, pp. 549\u2013568.","journal-title":"J.ACM"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"G. Kant, Drawing planar graphs using the lmc-ordering, Proc. IEEE Symp. on Foundations of Computer Science, 1992, pp. 101\u2013110.","DOI":"10.1109\/SFCS.1992.267814"},{"key":"8_CR11","first-page":"215","volume-title":"Theory of Graphs: International Symposium","author":"A. Lempel","year":"1967","unstructured":"A. Lempel, S. Even, I. Cederbaum, An algorithm for planarity testing of a graph, Theory of Graphs: International Symposium, Gordon and Breach, New York, 1967, pp. 215\u2013232."},{"key":"8_CR12","unstructured":"T. Nishizeki, N. Chiba, Planar Graphs: Theory and Algorithms, North Holland, 1988."},{"key":"8_CR13","unstructured":"W. Schnyder and W. Trotter, Convex drawings of planar graphs, Abstracts of the AMS, vol. 13, 1992."},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1090\/S0002-9939-1951-0041425-5","volume":"2","author":"S. K. Stein","year":"1951","unstructured":"S. K. Stein, Convex maps, Proc. Amer. Math. Soc., vol. 2, pp. 464\u2013466, 1951.","journal-title":"Proc. Amer. Math. Soc."},{"key":"8_CR15","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0095-8956(80)90083-0","volume":"29","author":"C. Thomassen","year":"1980","unstructured":"C. Thomassen, Planarity and duality of finite and infinite planar graphs, J. Combinatorial Theory, Series B 29, 1980, pp. 244\u2013271.","journal-title":"J. Combinatorial Theory, Series B"},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1112\/plms\/s3-10.1.304","volume":"10","author":"W. T. Tutte","year":"1960","unstructured":"W. T. Tutte, Convex representations of graphs, Proc. London Math Soc., vol. 10, 1960, pp. 304\u2013320.","journal-title":"Proc. London Math Soc."},{"issue":"no.13","key":"8_CR17","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"3","author":"W.T. Tutte","year":"1963","unstructured":"W.T. Tutte, How to draw a graph, Proc. London Math Soc., vol. 3, no. 13, 1963, pp. 743\u2013768.","journal-title":"Proc. London Math Soc."},{"key":"8_CR18","first-page":"26","volume":"46","author":"K. Wagner","year":"1936","unstructured":"K. Wagner, Bemerkungen zum Vierfarbenproblem, Jber. Deutsch. Math.-Verein, vol. 46, 1936, pp. 26\u201332.","journal-title":"Jber. Deutsch. Math.-Verein"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58950-3_358.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:21:23Z","timestamp":1619558483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58950-3_358"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589501","9783540491552"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-58950-3_358","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}