{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:10:41Z","timestamp":1725577841140},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_4","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T00:30:40Z","timestamp":1297297840000},"page":"38-49","source":"Crossref","is-referenced-by-count":7,"title":["On a Tree and a Path with No Geometric Simultaneous Embedding"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[]},{"given":"Markus","family":"Geyer","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Neuwirth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Angelini, P., Geyer, M., Kaufmann, M., Neuwirth, D.: On a tree and a path with no geometric simultaneous embedding. Tech. Report 176, Dipartimento di Informatica e Automazione, Roma Tre University (2010)","DOI":"10.1007\/978-3-642-18469-7_4"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-73545-8_26","volume-title":"Computing and Combinatorics","author":"U. Brandes","year":"2007","unstructured":"Brandes, U., Erten, C., Fowler, J., Frati, F., Geyer, M., Gutwenger, C., Hong, S.H., Kaufmann, M., Kobourov, S., Liotta, G., Mutzel, P., Symvonis, A.: Colored simultaneous geometric embeddings. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 254\u2013263. Springer, Heidelberg (2007)"},{"issue":"2","key":"4_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.comgeo.2006.05.006","volume":"36","author":"P. Brass","year":"2007","unstructured":"Brass, P., Cenek, E., Duncan, C., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S., Lubiw, A., Mitchell, J.: On simultaneous planar graph embeddings. Comp. Geom.\u00a036(2), 117\u2013130 (2007)","journal-title":"Comp. Geom."},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-11805-0_18","volume-title":"Graph Drawing","author":"S. Cabello","year":"2010","unstructured":"Cabello, S., van Kreveld, M., Liotta, G., Meijer, H., Speckmann, B., Verbeek, K.: Geometric simultaneous embeddings of a graph and a matching. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 183\u2013194. Springer, Heidelberg (2010)"},{"issue":"3","key":"4_CR5","doi-asserted-by":"publisher","first-page":"423","DOI":"10.7155\/jgaa.00193","volume":"13","author":"E. Di Giacomo","year":"2009","unstructured":"Di Giacomo, E., Didimo, W., van Kreveld, M., Liotta, G., Speckmann, B.: Matched drawings of planar graphs. J. Graph Alg. Appl.\u00a013(3), 423\u2013445 (2009)","journal-title":"J. Graph Alg. Appl."},{"issue":"3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.7155\/jgaa.00113","volume":"9","author":"C. Erten","year":"2005","unstructured":"Erten, C., Kobourov, S.G.: Simultaneous embedding of planar graphs with few bends. J. Graph Alg. Appl.\u00a09(3), 347\u2013364 (2005)","journal-title":"J. Graph Alg. Appl."},{"issue":"6-7","key":"4_CR7","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1016\/j.comgeo.2008.12.006","volume":"42","author":"A. Estrella-Balderrama","year":"2009","unstructured":"Estrella-Balderrama, A., Fowler, J., Kobourov, S.G.: Characterization of unlabeled level planar trees. Comp. Geom.\u00a042(6-7), 704\u2013721 (2009)","journal-title":"Comp. Geom."},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-92248-3_14","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Fowler","year":"2008","unstructured":"Fowler, J., J\u00fcnger, M., Kobourov, S.G., Schulz, M.: Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol.\u00a05344, pp. 146\u2013158. Springer, Heidelberg (2008)"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-77537-9_7","volume-title":"Graph Drawing","author":"J. Fowler","year":"2008","unstructured":"Fowler, J., Kobourov, S.: Characterization of unlabeled level planar graphs. In: Hong, S.H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 37\u201349. Springer, Heidelberg (2008)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-77537-9_10","volume-title":"Graph Drawing","author":"J. Fowler","year":"2008","unstructured":"Fowler, J., Kobourov, S.: Minimum level nonplanar patterns for trees. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 69\u201375. Springer, Heidelberg (2008)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-70904-6_12","volume-title":"Graph Drawing","author":"F. Frati","year":"2007","unstructured":"Frati, F.: Embedding graphs simultaneously with fixed edges. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 108\u2013113. Springer, Heidelberg (2007)"},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"447","DOI":"10.7155\/jgaa.00194","volume":"13","author":"F. Frati","year":"2009","unstructured":"Frati, F., Kaufmann, M., Kobourov, S.: Constrained simultaneous and near-simultaneous embeddings. J. Graph Alg. Appl.\u00a013(3), 447\u2013465 (2009)","journal-title":"J. Graph Alg. Appl."},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/11917496_29","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E. Gassner","year":"2006","unstructured":"Gassner, E., J\u00fcnger, M., Percan, M., Schaefer, M., Schulz, M.: Simultaneous graph embeddings with fixed edges. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 325\u2013335. Springer, Heidelberg (2006)"},{"issue":"7","key":"4_CR14","doi-asserted-by":"publisher","first-page":"1909","DOI":"10.1016\/j.disc.2008.01.033","volume":"309","author":"M. Geyer","year":"2009","unstructured":"Geyer, M., Kaufmann, M., Vrt\u2019o, I.: Two trees which are self-intersecting when drawn simultaneously. Disc. Math.\u00a0309(7), 1909\u20131916 (2009)","journal-title":"Disc. Math."},{"key":"4_CR15","volume-title":"Ramsey Theory","author":"R.L. Graham","year":"1990","unstructured":"Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey Theory. John Wiley & Sons, Chichester (1990)"},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0020-0255(91)90052-V","volume":"54","author":"J.H. Halton","year":"1991","unstructured":"Halton, J.H.: On the thickness of graphs of given degree. Inf. Sc.\u00a054(3), 219\u2013238 (1991)","journal-title":"Inf. Sc."},{"issue":"4","key":"4_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 Comb.\u00a017(4), 717\u2013728 (2001)","journal-title":"Graphs and Comb."},{"issue":"1-3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0012-365X(92)00062-V","volume":"124","author":"C. Thomassen","year":"1994","unstructured":"Thomassen, C.: Embeddings of graphs. Disc. Math.\u00a0124(1-3), 217\u2013228 (1994)","journal-title":"Disc. Math."},{"key":"4_CR19","first-page":"743","volume":"13","author":"W.T. Tutte","year":"1962","unstructured":"Tutte, W.T.: How to draw a graph. London Math. Society\u00a013, 743\u2013768 (1962)","journal-title":"London Math. Society"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T08:44:47Z","timestamp":1559983487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}