{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:36:54Z","timestamp":1725467814217},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642367625"},{"type":"electronic","value":"9783642367632"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36763-2_13","type":"book-chapter","created":{"date-parts":[[2013,2,14]],"date-time":"2013-02-14T03:17:33Z","timestamp":1360811853000},"page":"138-149","source":"Crossref","is-referenced-by-count":0,"title":["Circle-Representations of Simple 4-Regular Planar Graphs"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chrysanthi N.","family":"Raftopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/BFb0049394","volume-title":"Algorithms - ESA \u201994","author":"T. Biedl","year":"1994","unstructured":"Biedl, T., Kant, G.: A Better Heuristic for Orthogonal Graph Drawings. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 24\u201335. Springer, Heidelberg (1994)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Bollobas, B.: Modern Graph Theory. Springer (1998)","DOI":"10.1007\/978-1-4612-0619-4"},{"issue":"5","key":"13_CR3","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1002\/jgt.3190170508","volume":"17","author":"H. Broersma","year":"1993","unstructured":"Broersma, H., Duijvestijn, A., G\u00f6bel, F.: Generating all 3-connected 4-regular planar graphs from the octahedron graph. J. of Graph Theory\u00a017(5), 613\u2013620 (1993)","journal-title":"J. of Graph Theory"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","first-page":"310","volume-title":"GD 2011","author":"R. Chernobelskiy","year":"2012","unstructured":"Chernobelskiy, R., Cunningham, K., Goodrich, M., Kobourov, S.G., Trott, L.: Force-Directed Lombardi-Style Graph Drawing. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol.\u00a07034, pp. 310\u2013321. Springer, Heidelberg (2012)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-18469-7_17","volume-title":"Graph Drawing","author":"C.A. Duncan","year":"2011","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Drawing Trees with Perfect Angular Resolution and Polynomial Area. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 183\u2013194. Springer, Heidelberg (2011)"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.7155\/jgaa.00251","volume":"16","author":"C.A. Duncan","year":"2011","unstructured":"Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., N\u00f6llenburg, M.: Lombardi Drawings of Graphs. J. of Graph Algorithms and Applications\u00a016(1), 85\u2013108 (2011)","journal-title":"J. of Graph Algorithms and Applications"},{"key":"13_CR7","volume-title":"Combinatorial theory and its applications","author":"P. Erdos","year":"1970","unstructured":"Erdos, P., Renyi, A., Sos, V.T.: Combinatorial theory and its applications. North-Holland, Amsterdam (1970)"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1006\/jctb.1998.1846","volume":"74","author":"P. Hlinen\u00fd","year":"1998","unstructured":"Hlinen\u00fd, P.: Classes and recognition of curve contact graphs. J. of Combinatorial Theory, Series B\u00a074(1), 87\u2013103 (1998)","journal-title":"J. of Combinatorial Theory, Series B"},{"issue":"1-3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0012-365X(00)00204-1","volume":"229","author":"P. Hlinen\u00fd","year":"2001","unstructured":"Hlinen\u00fd, P., Kratochv\u00edl, J.: Representing graphs by disks and balls (a survey of recognition-complexity results). Discrete Mathematics\u00a0229(1-3), 101\u2013124 (2001)","journal-title":"Discrete Mathematics"},{"key":"13_CR10","first-page":"141","volume":"88","author":"P. Koebe","year":"1936","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig, Mathematisch-Physikalische Klasse\u00a088, 141\u2013164 (1936)","journal-title":"Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig, Mathematisch-Physikalische Klasse"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1002\/jgt.3190050412","volume":"5","author":"J. Lehel","year":"1981","unstructured":"Lehel, J.: Generating all 4-regular planar graphs from the graph of the octahedron. J. of Graph Theory\u00a05(4), 423\u2013426 (1981)","journal-title":"J. of Graph Theory"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Leighton, F.T.: New lower bound techniques for VLSI. In: 22nd Ann. IEEE Symp. on Foundations of Computer Science, pp. 1\u201312. IEEE (1981)","DOI":"10.1109\/SFCS.1981.22"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E.: Area-efficient graph layouts (for VLSI). In: 21st Ann. IEEE Symp. on Foundations of Computer Science, vol. 1547, pp. 270\u2013281. IEEE (1980)","DOI":"10.1109\/SFCS.1980.13"},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/jgt.3190030406","volume":"3","author":"P. Manca","year":"1979","unstructured":"Manca, P.: Generating all planar graphs regular of degree four. J. of Graph Theory\u00a03(4), 357\u2013364 (1979)","journal-title":"J. of Graph Theory"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. of Computing\u00a016, 421\u2013444 (1987)","journal-title":"SIAM J. of Computing"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Tamassia, R., Tollis, I.: Planar grid embedding in linear time. IEEE Transactions on Circuits and Systems (1989)","DOI":"10.1109\/31.34669"},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"30","author":"L.G. Valiant","year":"1981","unstructured":"Valiant, L.G.: Universality considerations in VLSI circuits. IEEE Transaction on Computers\u00a030(2), 135\u2013140 (1981)","journal-title":"IEEE Transaction on Computers"},{"key":"13_CR18","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall (2000)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36763-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T06:52:03Z","timestamp":1557557523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36763-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642367625","9783642367632"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36763-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}