{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:39:20Z","timestamp":1766378360169},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,6,24]],"date-time":"2015-06-24T00:00:00Z","timestamp":1435104000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s00453-015-0018-6","type":"journal-article","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T09:43:22Z","timestamp":1435052602000},"page":"47-67","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Extending Convex Partial Drawings of Graphs"],"prefix":"10.1007","volume":"76","author":[{"given":"Tamara","family":"Mchedlidze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignaz","family":"Rutter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"18_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\u201910), pp. 202\u2013221. SIAM (2010)","DOI":"10.1137\/1.9781611973075.19"},{"key":"18_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 16, 618\u2013632 (1996)","journal-title":"Algorithmica"},{"issue":"2","key":"18_CR3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.7155\/jgaa.00257","volume":"16","author":"EW 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. J. Gr. Algorithms Appl. 16(2), 243\u2013259 (2012)","journal-title":"J. Gr. Algorithms Appl."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Frati, F., Gutwenger, C., Lubiw, A., Mutzel, P., Schaefer, M.: Drawing partially embedded and simultaneously planar graphs. In: Graph Drawing, vol. 8871 of Lecture Notes in Computer Science, pp. 25\u201339. Springer, Berlin (2014)","DOI":"10.1007\/978-3-662-45803-7_3"},{"issue":"1","key":"18_CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.7155\/jgaa.00215","volume":"15","author":"CA Duncan","year":"2011","unstructured":"Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Planar drawings of higher-genus graphs. J. Gr. Algorithms Appl. 15(1), 7\u201332 (2011)","journal-title":"J. Gr. Algorithms Appl."},{"issue":"12","key":"18_CR6","doi-asserted-by":"crossref","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. Discret Appl Math 156(12), 2368\u20132380 (2008)","journal-title":"Discret Appl Math"},{"issue":"4","key":"18_CR7","doi-asserted-by":"crossref","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. Comput. Geom. Theory Appl. 46(4), 466\u2013492 (2013)","journal-title":"Comput. Geom. Theory Appl."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Mchedlidze, T., N\u00f6llenburg, M., Rutter, I.: Drawing planar graphs with a prescribed cycle. In: Wismath S. , Wolff A. (eds.) Proceedings of the 21st International Symposium Graph Drawing (GD\u201913), vol. 8242 of LNCS, pp. 316\u2013327. Springer, Berlin (2013)","DOI":"10.1007\/978-3-319-03841-4_28"},{"issue":"4","key":"18_CR9","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/PL00007258","volume":"17","author":"J Pach","year":"2001","unstructured":"Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Gr. Comb. 17(4), 717\u2013728 (2001)","journal-title":"Gr. Comb."},{"issue":"5","key":"18_CR10","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1142\/S0129054106004261","volume":"17","author":"M Patrignani","year":"2006","unstructured":"Patrignani, M.: On extending a partial straight-line drawing. Int. J. Found. Comput. Sci. 17(5), 1061\u20131070 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"18_CR11","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/S0097539793253565","volume":"26","author":"H Ripphausen-Lipa","year":"1997","unstructured":"Ripphausen-Lipa, H., Wagner, D., Weihe, K.: The vertex-disjoint menger problem in planar graphs. SIAM J. Comput. 26(2), 331\u2013349 (1997)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"18_CR12","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. Lond. Math. Soc. 13(3), 743\u2013768 (1963)","journal-title":"Proc. Lond. Math. Soc."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0018-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0018-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0018-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T12:06:20Z","timestamp":1566907580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0018-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,24]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["18"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0018-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,24]]}}}