{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:43:56Z","timestamp":1742989436666,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319739144"},{"type":"electronic","value":"9783319739151"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73915-1_33","type":"book-chapter","created":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T03:42:19Z","timestamp":1516419739000},"page":"426-439","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Planar Drawings of Fixed-Mobile Bigraphs"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felice","family":"De Luca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis G.","family":"Tollis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"issue":"2\u20133","key":"33_CR1","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. Theoret. Comput. Sci. 408(2\u20133), 129\u2013142 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-319-27261-0_42","volume-title":"Graph Drawing and Network Visualization","author":"L Barth","year":"2015","unstructured":"Barth, L., Gemsa, A., Niedermann, B., N\u00f6llenburg, M.: On the readability of boundary labeling. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 515\u2013527. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_42"},{"issue":"3","key":"33_CR3","doi-asserted-by":"publisher","first-page":"779","DOI":"10.7155\/jgaa.00379","volume":"19","author":"MA Bekos","year":"2015","unstructured":"Bekos, M.A., Cornelsen, S., Fink, M., Hong, S., Kaufmann, M., N\u00f6llenburg, M., Rutter, I., Symvonis, A.: Many-to-one boundary labeling with backbones. J. Graph Algorithms Appl. 19(3), 779\u2013816 (2015)","journal-title":"J. Graph Algorithms Appl."},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Bekos, M.A., De Luca, F., Didimo, W., Mchedlidze, T., N\u00f6llenburg, M., Symvonis, A., Tollis., I.: Planar drawings of fixed-mobile bigraphs. CoRR 1708.09238 (2017)","DOI":"10.1007\/978-3-319-73915-1_33"},{"issue":"3","key":"33_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.comgeo.2006.05.003","volume":"36","author":"MA Bekos","year":"2007","unstructured":"Bekos, M.A., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary labeling: models and efficient algorithms for rectangular maps. Comput. Geom. 36(3), 215\u2013236 (2007)","journal-title":"Comput. Geom."},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Biedl, T.C.: Drawing planar partitions I: LL-drawings and LH-drawings. In: Janardan, R. (ed.) Computational Geometry (SoCG 1998), pp. 287\u2013296. ACM (1998)","DOI":"10.1145\/276884.276917"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/10692760_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T Biedl","year":"1998","unstructured":"Biedl, T., Kaufmann, M., Mutzel, P.: Drawing planar partitions II: HH-drawings. In: Hromkovi\u010d, J., S\u00fdkora, O. (eds.) WG 1998. LNCS, vol. 1517, pp. 124\u2013136. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/10692760_11"},{"issue":"3","key":"33_CR8","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s00453-010-9433-x","volume":"60","author":"U Brandes","year":"2011","unstructured":"Brandes, U., Erten, C., Estrella-Balderrama, A., Fowler, J.J., Frati, F., Geyer, M., Gutwenger, C., Hong, S., Kaufmann, M., Kobourov, S.G., Liotta, G., Mutzel, P., Symvonis, A.: Colored simultaneous geometric embeddings and universal pointsets. Algorithmica 60(3), 569\u2013592 (2011)","journal-title":"Algorithmica"},{"issue":"2","key":"33_CR9","doi-asserted-by":"publisher","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. Graph Algorithms Appl. 16(2), 243\u2013259 (2012)","journal-title":"J. Graph Algorithms Appl."},{"key":"33_CR10","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)"},{"issue":"1","key":"33_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.7155\/jgaa.00158","volume":"12","author":"E Di Giacomo","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 Algorithms Appl. 12(1), 29\u201349 (2008)","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"33_CR12","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1007\/s00453-008-9255-2","volume":"57","author":"E Di Giacomo","year":"2010","unstructured":"Di Giacomo, E., Liotta, G., Trotta, F.: Drawing colored graphs with constrained vertex positions and few bends per edge. Algorithmica 57(4), 796\u2013818 (2010)","journal-title":"Algorithmica"},{"issue":"1","key":"33_CR13","doi-asserted-by":"publisher","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. Graph Algorithms Appl. 15(1), 7\u201332 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-62592-5_66","volume-title":"Algorithms and Complexity","author":"U F\u00f6\u00dfmeier","year":"1997","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M.: Nice drawings for planar bipartite graphs. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds.) CIAC 1997. LNCS, vol. 1203, pp. 122\u2013134. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62592-5_66"},{"issue":"4","key":"33_CR15","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/s00454-008-9130-6","volume":"42","author":"X Goaoc","year":"2009","unstructured":"Goaoc, X., Kratochv\u00edl, J., Okamoto, Y., Shin, C., Spillner, A., Wolff, A.: Untangling a planar graph. Discrete Comput. Geom. 42(4), 542\u2013569 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Halperin, D.: Arrangements. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, Chap. 24, pp. 529\u2013562. CRC Press LLC, Boca Raton (2004)","DOI":"10.1201\/9781420035315.ch24"},{"key":"33_CR17","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading (1972)"},{"issue":"12","key":"33_CR18","doi-asserted-by":"publisher","first-page":"2368","DOI":"10.1016\/j.dam.2007.10.012","volume":"156","author":"SH Hong","year":"2008","unstructured":"Hong, S.H., Nagamochi, H.: Convex drawings of graphs with non-convex boundary constraints. Discrete Appl. Math. 156(12), 2368\u20132380 (2008)","journal-title":"Discrete Appl. Math."},{"key":"33_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/978-3-642-02577-8_89","volume-title":"Human-Computer Interaction. Novel Interaction Methods and Techniques","author":"T Ito","year":"2009","unstructured":"Ito, T., Misue, K., Tanaka, J.: Sphere anchored map: a visualization technique for bipartite graphs in 3D. In: Jacko, J.A. (ed.) HCI 2009. LNCS, vol. 5611, pp. 811\u2013820. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02577-8_89"},{"key":"33_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44969-8","volume-title":"Drawing Graphs","year":"2001","unstructured":"Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol. 2025. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44969-8"},{"issue":"1","key":"33_CR21","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 Algorithms Appl. 6(1), 115\u2013129 (2002)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"33_CR22","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s00453-015-0028-4","volume":"76","author":"P Kindermann","year":"2016","unstructured":"Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: Multi-sided boundary labeling. Algorithmica 76(1), 225\u2013258 (2016)","journal-title":"Algorithmica"},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Lin, C.: Crossing-free many-to-one boundary labeling with hyperleaders. In: IEEE Pacific Visualization Symposium PacificVis 2010, Taipei, Taiwan, 2\u20135 March 2010, pp. 185\u2013192. IEEE Computer Society (2010)","DOI":"10.1109\/PACIFICVIS.2010.5429592"},{"issue":"1","key":"33_CR24","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00453-015-0018-6","volume":"76","author":"T Mchedlidze","year":"2016","unstructured":"Mchedlidze, T., N\u00f6llenburg, M., Rutter, I.: Extending convex partial drawings of graphs. Algorithmica 76(1), 47\u201367 (2016)","journal-title":"Algorithmica"},{"key":"33_CR25","doi-asserted-by":"crossref","unstructured":"McKee, T.A., McMorris, F.R.: Topics in Intersection Graph Theory. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719802"},{"issue":"11","key":"33_CR26","doi-asserted-by":"publisher","first-page":"2599","DOI":"10.1093\/ietisy\/e91-d.11.2599","volume":"91\u2013D","author":"K Misue","year":"2008","unstructured":"Misue, K.: Anchored map: Graph drawing technique to support network mining. IEICE Trans. 91\u2013D(11), 2599\u20132606 (2008)","journal-title":"IEICE Trans."},{"key":"33_CR27","doi-asserted-by":"crossref","unstructured":"Misue, K., Zhou, Q.: Drawing semi-bipartite graphs in anchor+matrix style. In: Information Visualisation (IV 2011), London, UK, 13\u201315 July 2011, pp. 26\u201331. IEEE Computer Society (2011)","DOI":"10.1109\/IV.2011.24"},{"key":"33_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-44969-8_10","volume-title":"Drawing Graphs","author":"G Neyer","year":"2001","unstructured":"Neyer, G.: Map labeling with application to graph drawing. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol. 2025, pp. 247\u2013273. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44969-8_10"},{"issue":"4","key":"33_CR29","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 17(4), 717\u2013728 (2001)","journal-title":"Graphs and Combinatorics"},{"issue":"5","key":"33_CR30","doi-asserted-by":"publisher","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."},{"key":"33_CR31","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. 3843, pp. 380\u2013385. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11618058_34"},{"issue":"5","key":"33_CR32","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1006\/jvlc.2002.0232","volume":"13","author":"HC Purchase","year":"2002","unstructured":"Purchase, H.C.: Metrics for graph drawing aesthetics. J. Vis. Lang. Comput. 13(5), 501\u2013516 (2002)","journal-title":"J. Vis. Lang. Comput."},{"issue":"3","key":"33_CR33","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1016344215610","volume":"7","author":"HC Purchase","year":"2002","unstructured":"Purchase, H.C., Carrington, D.A., Allder, J.: Empirical evaluation of aesthetics-based graph layout. Empirical Softw. Eng. 7(3), 233\u2013255 (2002)","journal-title":"Empirical Softw. Eng."},{"volume-title":"Handbook on Graph Drawing and Visualization","year":"2013","key":"33_CR34","unstructured":"Tamassia, R. (ed.): Handbook on Graph Drawing and Visualization. Chapman and Hall\/CRC, Boca Raton (2013)"},{"key":"33_CR35","doi-asserted-by":"crossref","unstructured":"Tamassia, R., Liotta, G.: Graph drawing. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., pp. 1163\u20131185. Chapman and Hall\/CRC, Boca Raton (2004)","DOI":"10.1201\/9781420035315.ch52"},{"issue":"3","key":"33_CR36","doi-asserted-by":"publisher","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. London Math. Soc. 13(3), 743\u2013768 (1963)","journal-title":"Proc. London Math. Soc."},{"key":"33_CR37","unstructured":"Wolff, A., Strijk, T.: The map-labeling bibliography (1996). http:\/\/i11www.ira.uka.de\/map-labeling\/bibliography"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73915-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:25:21Z","timestamp":1710242721000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Boston","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2017.ccis.northeastern.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}