{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:05:31Z","timestamp":1725761131905},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038407"},{"type":"electronic","value":"9783319038414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_31","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T05:28:55Z","timestamp":1385962135000},"page":"352-363","source":"Crossref","is-referenced-by-count":6,"title":["Strict Confluent Drawing"],"prefix":"10.1007","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[]},{"given":"Danny","family":"Holten","sequence":"additional","affiliation":[]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[]},{"given":"Martin","family":"N\u00f6llenburg","sequence":"additional","affiliation":[]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Verbeek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-642-36763-2_14","volume-title":"Graph Drawing","author":"M.A. Bekos","year":"2013","unstructured":"Bekos, M.A., Kaufmann, M., Kobourov, S.G., Symvonis, A.: Smooth orthogonal layouts. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol.\u00a07704, pp. 150\u2013161. Springer, Heidelberg (2013)"},{"issue":"3","key":"31_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0925-7721(02)00099-8","volume":"25","author":"C.R. Collins","year":"2003","unstructured":"Collins, C.R., Stephenson, K.: A circle packing algorithm. Comput. Geom. Theory Appl.\u00a025(3), 233\u2013256 (2003)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"6","key":"31_CR3","first-page":"1277","volume":"14","author":"W. Cui","year":"2008","unstructured":"Cui, W., Zhou, H., Qu, H., Wong, P.C., Li, X.: Geometry-based edge clustering for graph visualization. IEEE TVCG\u00a014(6), 1277\u20131284 (2008)","journal-title":"IEEE TVCG"},{"issue":"1","key":"31_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.7155\/jgaa.00099","volume":"9","author":"M. Dickerson","year":"2005","unstructured":"Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent drawings: Visualizing non-planar diagrams in a planar way. J. Graph. Algorithms Appl.\u00a09(1), 31\u201352 (2005)","journal-title":"J. Graph. Algorithms Appl."},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-540-70904-6_3","volume-title":"Graph Drawing","author":"T. Dwyer","year":"2007","unstructured":"Dwyer, T., Marriott, K., Wybrow, M.: Integrating edge routing into force-directed layout. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 8\u201319. Springer, Heidelberg (2007)"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/11618058_16","volume-title":"Graph Drawing","author":"D. Eppstein","year":"2006","unstructured":"Eppstein, D., Goodrich, M.T., Meng, J.Y.: Delta-confluent drawings. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 165\u2013176. Springer, Heidelberg (2006)"},{"issue":"4","key":"31_CR7","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s00453-006-0159-8","volume":"47","author":"D. Eppstein","year":"2007","unstructured":"Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent layered drawings. Algorithmica\u00a047(4), 439\u2013452 (2007)","journal-title":"Algorithmica"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Holten, D., L\u00f6ffler, M., N\u00f6llenburg, M., Speckmann, B., Verbeek, K.: Strict confluent drawing. CoRR, abs\/1308.6824 (2013)","DOI":"10.1007\/978-3-319-03841-4_31"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","first-page":"2","volume-title":"Graph Drawing 2011","author":"D. Eppstein","year":"2011","unstructured":"Eppstein, D., Simons, J.A.: Confluent hasse diagrams. In: Speckmann, B. (ed.) GD 2011. LNCS, vol.\u00a07034, pp. 2\u201313. Springer, Heidelberg (2011)"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-540-70904-6_39","volume-title":"Graph Drawing","author":"M. Hirsch","year":"2007","unstructured":"Hirsch, M., Meijer, H., Rappaport, D.: Biclique edge cover graphs and confluent drawings. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol.\u00a04372, pp. 405\u2013416. Springer, Heidelberg (2007)"},{"issue":"5","key":"31_CR11","first-page":"741","volume":"12","author":"D. Holten","year":"2006","unstructured":"Holten, D.: Hierarchical edge bundles: visualization of adjacency relations in hierarchical data. IEEE TVCG\u00a012(5), 741\u2013748 (2006)","journal-title":"IEEE TVCG"},{"issue":"3","key":"31_CR12","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1111\/j.1467-8659.2009.01450.x","volume":"28","author":"D. Holten","year":"2009","unstructured":"Holten, D., van Wijk, J.J.: Force-Directed Edge Bundling for Graph Visualization. Computer Graphics Forum\u00a028(3), 983\u2013990 (2009)","journal-title":"Computer Graphics Forum"},{"issue":"4","key":"31_CR13","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s00453-006-0165-x","volume":"47","author":"P. Hui","year":"2007","unstructured":"Hui, P., Pelsmajer, M.J., Schaefer, M., \u0160tefankovi\u010d, D.: Train tracks and confluent drawings. Algorithmica\u00a047(4), 465\u2013479 (2007)","journal-title":"Algorithmica"},{"issue":"3pt. 1","key":"31_CR14","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1111\/j.1467-8659.2012.03079.x","volume":"31","author":"C. Hurter","year":"2012","unstructured":"Hurter, C., Ersoy, O., Telea, A.: Graph Bundling by Kernel Density Estimation. Computer Graphics Forum\u00a031(3pt. 1), 865\u2013874 (2012)","journal-title":"Computer Graphics Forum"},{"issue":"2","key":"31_CR15","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput.\u00a011(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"issue":"1-3","key":"31_CR16","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0012-365X(93)90340-Y","volume":"117","author":"B. Mohar","year":"1993","unstructured":"Mohar, B.: A polynomial time circle packing algorithm. Discrete Math.\u00a0117(1-3), 257\u2013263 (1993)","journal-title":"Discrete Math."},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-642-18469-7_31","volume-title":"Graph Drawing","author":"G. Quercini","year":"2011","unstructured":"Quercini, G., Ancona, M.: Confluent drawing algorithms using rectangular dualization. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 341\u2013352. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T01:36:43Z","timestamp":1558748203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}