{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:05:36Z","timestamp":1725761136484},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038407"},{"type":"electronic","value":"9783319038414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_28","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T05:28:55Z","timestamp":1385962135000},"page":"316-327","source":"Crossref","is-referenced-by-count":4,"title":["Drawing Planar Graphs with a Prescribed Inner Face"],"prefix":"10.1007","author":[{"given":"Tamara","family":"Mchedlidze","sequence":"first","affiliation":[]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Angelini, P., Di Battista, G., Frati, F., Jel\u00ednek, V., Kratochv\u00edl, J., Patrignani, M., Rutter, I.: Testing planarity of partially embedded graphs. In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 202\u2013221. SIAM (2010)","DOI":"10.1137\/1.9781611973075.19"},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1007\/BF01944353","volume":"16","author":"D. Avis","year":"1996","unstructured":"Avis, D.: Generating rooted triangulations without repetitions. Algorithmica\u00a016, 618\u2013632 (1996)","journal-title":"Algorithmica"},{"issue":"2","key":"28_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.7155\/jgaa.00257","volume":"16","author":"E.W. Chambers","year":"2012","unstructured":"Chambers, E.W., Eppstein, D., Goodrich, M.T., L\u00f6ffler, M.: Drawing graphs in the plane with a prescribed outer face and polynomial area. Journal of Graph Algorithms and Applications\u00a016(2), 243\u2013259 (2012)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"1","key":"28_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.7155\/jgaa.00215","volume":"15","author":"C.A. Duncan","year":"2011","unstructured":"Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Planar drawings of higher-genus graphs. Journal of Graph Algorithms and Applications\u00a015(1), 7\u201332 (2011)","journal-title":"Journal of Graph Algorithms and Applications"},{"issue":"12","key":"28_CR5","doi-asserted-by":"publisher","first-page":"2368","DOI":"10.1016\/j.dam.2007.10.012","volume":"156","author":"S.-H. Hong","year":"2008","unstructured":"Hong, S.-H., Nagamochi, H.: Convex drawings of graphs with non-convex boundary constraints. Discrete Applied Mathematics\u00a0156(12), 2368\u20132380 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"28_CR6","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.comgeo.2012.07.005","volume":"46","author":"V. Jel\u00ednek","year":"2013","unstructured":"Jel\u00ednek, V., Kratochv\u00edl, J., Rutter, I.: A Kuratowski-type theorem for planarity of partially embedded graphs. Computational Geometry Theory & Applications\u00a046(4), 466\u2013492 (2013)","journal-title":"Computational Geometry Theory & Applications"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Mchedlidze, T., N\u00f6llenburg, M., Rutter, I.: Drawing planar graphs with a prescribed inner face. CoRR, abs\/1308.3370 (2013)","DOI":"10.1007\/978-3-319-03841-4_28"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-37623-2_20","volume-title":"Graph Drawing","author":"J. Pach","year":"1999","unstructured":"Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol.\u00a01547, pp. 263\u2013274. Springer, Heidelberg (1999)"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/11618058_34","volume-title":"Graph Drawing","author":"M. Patrignani","year":"2006","unstructured":"Patrignani, M.: On extending a partial straight-line drawing. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 380\u2013385. Springer, Heidelberg (2006)"},{"issue":"3","key":"28_CR10","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W.T. Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. London Math. Soc.\u00a013(3), 743\u2013768 (1963)","journal-title":"Proc. London Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T01:40:19Z","timestamp":1558748419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}