{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:18Z","timestamp":1759638618369,"version":"3.38.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,10,9]],"date-time":"2010-10-09T00:00:00Z","timestamp":1286582400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s00453-010-9433-x","type":"journal-article","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T17:41:53Z","timestamp":1286991713000},"page":"569-592","source":"Crossref","is-referenced-by-count":8,"title":["Colored Simultaneous Geometric Embeddings and\u00a0Universal Pointsets"],"prefix":"10.1007","volume":"60","author":[{"given":"Ulrik","family":"Brandes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cesim","family":"Erten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"Estrella-Balderrama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Joseph","family":"Fowler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Geyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Gutwenger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen G.","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,9]]},"reference":[{"issue":"2\u20133","key":"9433_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0166-218X(99)00042-6","volume":"93","author":"M. Abellanas","year":"1999","unstructured":"Abellanas, M., Garc\u00eda, J., Hern\u00e1ndez, G., Noy, M., Ramos, P.: Bipartite embeddings of trees in the plane. Discrete Appl. Math. 93(2\u20133), 141\u2013148 (1999)","journal-title":"Discrete Appl. Math."},{"key":"9433_CR2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1145\/276884.276917","volume-title":"Proceedings of the Fourteenth Annual Symposium on Computational Geometry, SoCG 1998","author":"T.C. Biedl","year":"1998","unstructured":"Biedl, T.C.: Drawing planar partitions I: LL-drawings and LH-drawings. In: Proceedings of the Fourteenth Annual Symposium on Computational Geometry, SoCG 1998, pp. 287\u2013296. ACM Press, New York (1998)"},{"key":"9433_CR3","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/10692760_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T.C. Biedl","year":"1998","unstructured":"Biedl, T.C., Kaufmann, M., Mutzel, P.: Drawing planar partitions. II. HH-drawings. In: Graph-Theoretic Concepts in Computer Science, Smolenice Castle, 1998. LNCS, vol. 1517, pp. 124\u2013136. Springer, Berlin (1998)"},{"issue":"3","key":"9433_CR4","doi-asserted-by":"crossref","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. Comput. Geom.: Theory Appl. 23(3), 303\u2013312 (2002)","journal-title":"Comput. Geom.: Theory Appl."},{"issue":"2","key":"9433_CR5","doi-asserted-by":"crossref","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.A., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous graph embedding. Comput. Geom.: Theory Appl. 36(2), 117\u2013130 (2007)","journal-title":"Comput. Geom.: Theory Appl."},{"issue":"3","key":"9433_CR6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"7","author":"M. Chrobak","year":"1997","unstructured":"Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. Int. J. Comput. Geom. Appl. 7(3), 211\u2013223 (1997)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9433_CR7","doi-asserted-by":"crossref","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting Fary embeddings of planar graphs. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988, pp.\u00a0426\u2013433 (1988)","DOI":"10.1145\/62212.62254"},{"issue":"1","key":"9433_CR8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"issue":"23","key":"9433_CR9","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"Di\u00a0Battista, G., Tamassia, R.: Algorithms for plane representation of acyclic digraphs. Theor. Comput. Sci. 61(23), 175\u2013198 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"9433_CR10","doi-asserted-by":"crossref","unstructured":"Dux, B., Iyer, A., Debray, S., Forrester, D., Kobourov, S.G.: Visualizing the behavior of dynamically modifiable code. In: 13th Workshop on Program Comprehension, pp. 337\u2013340 (2005)","DOI":"10.1109\/WPC.2005.46"},{"issue":"3","key":"9433_CR11","doi-asserted-by":"crossref","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 Algorithms Appl. 9(3), 347\u2013364 (2005)","journal-title":"J. Graph Algorithms Appl."},{"issue":"7","key":"9433_CR12","doi-asserted-by":"crossref","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.J., Kobourov, S.G.: Characterization of unlabeled level planar trees. Comput. Geom.: Theory Appl. 42(7), 704\u2013721 (2009)","journal-title":"Comput. Geom.: Theory Appl."},{"key":"9433_CR13","series-title":"LNCS","first-page":"69","volume-title":"15th Symposium on Graph Drawing, GD 2007","author":"J.J. Fowler","year":"2008","unstructured":"Fowler, J.J., Kobourov, S.G.: Minimum level nonplanar patterns for trees. In: 15th Symposium on Graph Drawing, GD 2007. LNCS, vol. 4875, pp. 69\u201375. Springer, Berlin (2008)"},{"key":"9433_CR14","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/978-3-540-92248-3_14","volume-title":"34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2008","author":"J.J. Fowler","year":"2008","unstructured":"Fowler, J.J., J\u00fcnger, M., Kobourov, S.G., Schulz, M.: Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges. In: 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2008. LNCS, vol. 5344, pp. 146\u2013158. Springer, Berlin (2008)"},{"key":"9433_CR15","series-title":"LNCS","first-page":"108","volume-title":"14th Symposium on Graph Drawing, GD 2006","author":"F. Frati","year":"2007","unstructured":"Frati, F.: Embedding graphs simultaneously with fixed edges. In: 14th Symposium on Graph Drawing, GD 2006. LNCS, vol. 4372, pp. 108\u2013113. Springer, Berlin (2007)"},{"key":"9433_CR16","series-title":"LNCS","first-page":"268","volume-title":"15th Symposium on Graph Drawing, GD 2007","author":"F. Frati","year":"2008","unstructured":"Frati, F., Kaufmann, M., Kobourov, S.G.: Constrained simultaneous and near-simultaneous embeddings. In: 15th Symposium on Graph Drawing, GD 2007. LNCS, vol. 4875, pp. 268\u2013279. Springer, Berlin (2008)"},{"key":"9433_CR17","doi-asserted-by":"crossref","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 points. Am. Math. Mon. 98, 165\u2013166 (1991)","journal-title":"Am. Math. Mon."},{"key":"9433_CR18","doi-asserted-by":"crossref","unstructured":"Healy, P., Kuusik, A., Leipert, S.: Characterization of level non-planar graphs by minimal patterns. In: 6th Computing and Combinatorics Conference, COCOON 2000, pp.\u00a074\u201384 (2000)","DOI":"10.1007\/3-540-44968-X_8"},{"key":"9433_CR19","series-title":"LNCS","first-page":"201","volume-title":"13th Symposium on Graph Drawing, GD 2005","author":"M. Kaufmann","year":"2006","unstructured":"Kaufmann, M., Vrto, I., Geyer, M.: Two trees which are self-intersecting when drawn simultaneously. In: 13th Symposium on Graph Drawing, GD 2005. LNCS, vol. 3843, pp. 201\u2013210. Springer, Berlin (2006)"},{"key":"9433_CR20","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"C. Kuratowski","year":"1930","unstructured":"Kuratowski, C.: Sur les probl\u00e8mes des courbes gauches en Topologie. Fundam. Math. 15, 271\u2013283 (1930)","journal-title":"Fundam. Math."},{"issue":"4","key":"9433_CR21","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom. 1(4), 343\u2013353 (1986)","journal-title":"Discrete Comput. Geom."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9433-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9433-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9433-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T18:36:11Z","timestamp":1740594971000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9433-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,9]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9433"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9433-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2010,10,9]]}}}