{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:11:29Z","timestamp":1725577889459},"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_31","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T05:30:40Z","timestamp":1297315840000},"page":"341-352","source":"Crossref","is-referenced-by-count":3,"title":["Confluent Drawing Algorithms Using Rectangular Dualization"],"prefix":"10.1007","author":[{"given":"Gianluca","family":"Quercini","sequence":"first","affiliation":[]},{"given":"Massimo","family":"Ancona","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-03367-4_3","volume-title":"Algorithms and Data Structures","author":"P. Angelini","year":"2009","unstructured":"Angelini, P., Frati, F., Kaufmann, M.: Straight-Line Rectangular Drawings of Clustered Graphs. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 25\u201336. Springer, Heidelberg (2009)"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-58218-5_8","volume-title":"Algorithm Theory - SWAT \u201994","author":"T.C. Biedl","year":"1994","unstructured":"Biedl, T.C., Kant, G., Kaufmann, M.: On Triangulating Planar Graphs under the Four-Connectivity Constraint. In: Schmidt, E.M., Skyum, S. (eds.) SWAT 1994. LNCS, vol.\u00a0824, pp. 83\u201394. Springer, Heidelberg (1994)"},{"issue":"1","key":"31_CR3","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and Subgraph Listing. SIAM Journal on Computing\u00a014(1), 210\u2013223 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24595-7_1","volume-title":"Graph Drawing","author":"M. Dickerson","year":"2004","unstructured":"Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 1\u201312. Springer, Heidelberg (2004)"},{"issue":"4","key":"31_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.7155\/jgaa.00016","volume":"3","author":"P. Eades","year":"1999","unstructured":"Eades, P., Feng, Q.-W., Nagamochi, H.: Drawing Clustered Graphs on an Orthogonal Grid. Journal on Graph Algorithms and Applications\u00a03(4), 3\u201329 (1999)","journal-title":"Journal on Graph Algorithms and Applications"},{"key":"31_CR6","volume-title":"Algorithms and Theory of Computation Handbook","author":"P. Eades","year":"2009","unstructured":"Eades, P., Gutwenger, C., Hong, S.-H., Mutzel, P.: Graph Drawing Algorithms. In: Algorithms and Theory of Computation Handbook, 2nd edn., vol.\u00a02, CRC Press, Boca Raton (2009)","edition":"2"},{"key":"31_CR7","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_CR8","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_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-60313-1_145","volume-title":"Algorithms - ESA \u201995","author":"Q.-W. Feng","year":"1995","unstructured":"Feng, Q.-W., Cohen, R.F., Eades, P.: Planarity for Clustered Graphs. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.\u00a0979, pp. 213\u2013226. Springer, Heidelberg (1995)"},{"key":"31_CR10","unstructured":"Feng, Q.: Algorithms for Drawing Clustered Graphs. Ph.D. thesis, University of Newcastle, Australia (1997)"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0021809","volume-title":"Graph Drawing","author":"U. F\u00f6ssmeier","year":"1996","unstructured":"F\u00f6ssmeier, U., Kaufmann, M.: Drawing High Degree Graphs with Low Bend Numbers. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 254\u2013266. Springer, Heidelberg (1996)"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-62495-3_49","volume-title":"Graph Drawing","author":"A. Garg","year":"1997","unstructured":"Garg, A., Tamassia, R.: A New Minimum Cost Flow Algorithm with Applications to Graph Drawing. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 201\u2013216. Springer, Heidelberg (1997)"},{"key":"31_CR13","first-page":"426","volume-title":"Proceedings of the 29th Annual ACM Symposium on Theory of Computing","author":"X. He","year":"1997","unstructured":"He, X.: On Floorplans of Planar Graphs. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 426\u2013435. ACM, New York (1997)"},{"key":"31_CR14","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":"4","key":"31_CR15","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., Stefankovic, D.: Train Tracks and Confluent Drawings. Algorithmica\u00a047(4), 465\u2013479 (2007)","journal-title":"Algorithmica"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/3-540-57899-4_69","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G. Kant","year":"1994","unstructured":"Kant, G., He, X.: Two Algorithms for Finding Rectangular Duals of Planar Graphs. In: van Leeuwen, J. (ed.) WG 1993. LNCS, vol.\u00a0790, pp. 396\u2013410. Springer, Heidelberg (1994)"},{"issue":"2","key":"31_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/net.3230150202","volume":"15","author":"K. Ko\u017ami\u0144ski","year":"1985","unstructured":"Ko\u017ami\u0144ski, K., Kinnen, E.: Rectangular Duals of Planar Graphs. Networks\u00a015(2), 145\u2013157 (1985)","journal-title":"Networks"},{"issue":"12","key":"31_CR18","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1109\/43.16806","volume":"7","author":"Y.-T. Lai","year":"1988","unstructured":"Lai, Y.-T., Leinwand, S.M.: Algorithms for Floorplan Design via Rectangular Dualization. IEEE Transactions on Computer-Aided Design\u00a07(12), 1278\u20131289 (1988)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"31_CR19","unstructured":"Quercini, G.: Optimizing and Visualizing Planar Graphs via Rectangular Dualization. Ph.D. thesis, University of Genoa, Genoa, Italy (2009)"}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T07:57:18Z","timestamp":1553414238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}