{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T11:45:20Z","timestamp":1747136720015},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_38","type":"book-chapter","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T21:23:04Z","timestamp":1323897784000},"page":"403-414","source":"Crossref","is-referenced-by-count":1,"title":["Upward Point Set Embeddability for Convex Point Sets Is in P"],"prefix":"10.1007","author":[{"given":"Michael","family":"Kaufmann","sequence":"first","affiliation":[]},{"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-18469-7_3","volume-title":"Graph Drawing","author":"P. Angelini","year":"2011","unstructured":"Angelini, P., Frati, F., Geyer, M., Kaufmann, M., Mchedlidze, T., Symvonis, A.: Upward Geometric Graph Embeddings into Point Sets. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 25\u201337. Springer, Heidelberg (2011)"},{"issue":"2-3","key":"38_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.tcs.2008.08.004","volume":"408","author":"M. Badent","year":"2008","unstructured":"Badent, M., Di Giacomo, E., Liotta, G.: Drawing colored graphs on colored points. Theor. Comput. Sci.\u00a0408(2-3), 129\u2013142 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.comgeo.2009.07.002","volume":"43","author":"C. Binucci","year":"2010","unstructured":"Binucci, C., Di Giacomo, E., Didimo, W., Estrella-Balderrama, A., Frati, F., Kobourov, S., Liotta, G.: Upward straight-line embeddings of directed graphs into point sets. Computat. Geom. Th. Appl.\u00a043, 219\u2013232 (2010)","journal-title":"Computat. Geom. Th. Appl."},{"issue":"3","key":"38_CR4","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0925-7721(01)00069-4","volume":"23","author":"P. Bose","year":"2002","unstructured":"Bose, P.: On embedding an outer-planar graph in a point set. Computat. Geom. Th. Appl.\u00a023(3), 303\u2013312 (2002)","journal-title":"Computat. Geom. Th. Appl."},{"issue":"2","key":"38_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00002","volume":"1","author":"P. Bose","year":"1997","unstructured":"Bose, P., McAllister, M., Snoeyink, J.: Optimal algorithms to embed trees in a point set. J. Graph Alg. Appl.\u00a01(2), 1\u201315 (1997)","journal-title":"J. Graph Alg. Appl."},{"issue":"2","key":"38_CR6","doi-asserted-by":"publisher","first-page":"353","DOI":"10.7155\/jgaa.00132","volume":"10","author":"S. Cabello","year":"2006","unstructured":"Cabello, S.: Planar embeddability of the vertices of a graph using a fixed point set is NP-hard. J. Graph Alg. Appl.\u00a010(2), 353\u2013366 (2006)","journal-title":"J. Graph Alg. Appl."},{"issue":"1","key":"38_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.7155\/jgaa.00158","volume":"12","author":"E. Giacomo Di","year":"2008","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H., Trotta, F., Wismath, S.K.: k-colored point-set embeddability of outerplanar graphs. J. Graph Alg. Appl.\u00a012(1), 29\u201349 (2008)","journal-title":"J. Graph Alg. Appl."},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-642-18381-2_23","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"M. Geyer","year":"2011","unstructured":"Geyer, M., Kaufmann, M., Mchedlidze, T., Symvonis, A.: Upward Point-Set Embeddability. In: \u010cern\u00e1, I., Gyim\u00f3thy, T., Hromkovi\u010d, J., Jefferey, K., Kr\u00e1lovi\u0107, R., Vukoli\u0107, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol.\u00a06543, pp. 272\u2013283. Springer, Heidelberg (2011)"},{"key":"38_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-77120-3_17","volume-title":"Algorithms and Computation","author":"F. Giordano","year":"2007","unstructured":"Giordano, F., Liotta, G., Mchedlidze, T., Symvonis, A.: Computing Upward Topological Book Embeddings of Upward Planar Digraphs. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 172\u2013183. Springer, Heidelberg (2007)"},{"key":"38_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-00219-9_23","volume-title":"Graph Drawing","author":"F. Giordano","year":"2009","unstructured":"Giordano, F., Liotta, G., Whitesides, S.: Embeddability Problems for Upward Planar Digraphs. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 242\u2013253. Springer, Heidelberg (2009)"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.2307\/2323956","volume":"98","author":"P. Gritzmann","year":"1991","unstructured":"Gritzmann, P., Mohar, B., Pach, J., Pollack, R.: Embedding a planar triangulation with vertices at specified positions. Amer. Math. Mont.\u00a098, 165\u2013166 (1991)","journal-title":"Amer. Math. Mont."},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0020-0255(91)90052-V","volume":"54","author":"J. Halton","year":"1991","unstructured":"Halton, J.: On the thickness of graphs of given degree. Inf. Sci.\u00a054, 219\u2013238 (1991)","journal-title":"Inf. Sci."},{"issue":"4","key":"38_CR13","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539795280287","volume":"28","author":"L.S. Heath","year":"1999","unstructured":"Heath, L.S., Pemmaraju, S.V., Trenk, A.N.: Stack and queue layouts of directed acyclic graphs: Part\u00a0I. SIAM J. Comput.\u00a028(4), 1510\u20131539 (1999)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"38_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.7155\/jgaa.00046","volume":"6","author":"M. Kaufmann","year":"2002","unstructured":"Kaufmann, M., Wiese, R.: Embedding vertices at points: Few bends suffice for planar graphs. J. Graph Alg. Appl.\u00a06(1), 115\u2013129 (2002)","journal-title":"J. Graph Alg. Appl."},{"key":"38_CR15","unstructured":"Kaufmann, M., Mchedlidze, T., Symvonis, A.: Upward point set embeddability for convex point sets is in P. Technical report. arXiv:1108.3092, \n                    \n                      http:\/\/arxiv.org\/abs\/1108.3092"},{"key":"38_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-642-11805-0_40","volume-title":"Graph Drawing","author":"T. Mchedlidze","year":"2010","unstructured":"Mchedlidze, T., Symvonis, A.: On \u03c1-Constrained Upward Topological Book Embeddings. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 411\u2013412. Springer, Heidelberg (2010)"},{"issue":"4","key":"38_CR17","doi-asserted-by":"publisher","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. Graphs and Combinatorics\u00a017(4), 717\u2013728 (2001)","journal-title":"Graphs and Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T21:01:01Z","timestamp":1555880461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}