{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:26:03Z","timestamp":1725643563921},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_3","type":"book-chapter","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T21:23:04Z","timestamp":1323897784000},"page":"14-25","source":"Crossref","is-referenced-by-count":6,"title":["Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames"],"prefix":"10.1007","author":[{"given":"Soroush","family":"Alamdari","sequence":"first","affiliation":[]},{"given":"Therese","family":"Biedl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Alamdari, S., Biedl, T.: Planar Open Rectangle-of-Influence Drawings with Non-Aligned Frames. Technical Report CS-2011-17, David R. Cheriton School of Computer Science, University of Waterloo (2011)","DOI":"10.1007\/978-3-642-25878-7_3"},{"key":"3_CR2","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall (1998)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/3-540-46648-7_37","volume-title":"Graph Drawing","author":"T.C. Biedl","year":"1999","unstructured":"Biedl, T.C., Bretscher, A., Meijer, H.: Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 359\u2013368. Springer, Heidelberg (1999)"},{"issue":"7","key":"3_CR4","doi-asserted-by":"publisher","first-page":"1870","DOI":"10.1016\/j.disc.2007.12.093","volume":"309","author":"E. Fusy","year":"2009","unstructured":"Fusy, E.: Transversal structures on triangulations: A combinatorial study and straight-line drawings. Discrete Mathematics\u00a0309(7), 1870\u20131894 (2009)","journal-title":"Discrete Mathematics"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"A.V. Goldberg","year":"1998","unstructured":"Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM\u00a045, 783\u2013797 (1998)","journal-title":"J. ACM"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/net.3230150202","volume":"5","author":"K. Kozminski","year":"1985","unstructured":"Kozminski, K., Kinnen, E.: Rectangular dual of planar graphs. Networks\u00a05, 145\u2013157 (1985)","journal-title":"Networks"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Leinwand, S.M., Lai, Y.-T.: An algorithm for building rectangular floor-plans. In: 21st Design Automation Conference, pp. 663\u2013664. IEEE Press (1984)","DOI":"10.1109\/DAC.1984.1585874"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0925-7721(97)00018-7","volume":"10","author":"G. Liotta","year":"1998","unstructured":"Liotta, G., Lubiw, A., Meijer, H., Whitesides, S.H.: The rectangle of influence drawability problem. Computational Geometry\u00a010(1), 1\u201322 (1998)","journal-title":"Computational Geometry"},{"issue":"2-3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1142\/S0218195906002026","volume":"16","author":"K. Miura","year":"2006","unstructured":"Miura, K., Haga, H., Nishizeki, T.: Inner rectangular drawings of plane graphs. Int. J. Comput. Geometry Appl.\u00a016(2-3), 249\u2013270 (2006)","journal-title":"Int. J. Comput. Geometry Appl."},{"issue":"4","key":"3_CR10","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s00454-008-9098-2","volume":"41","author":"K. Miura","year":"2009","unstructured":"Miura, K., Matsuno, T., Nishizeki, T.: Open rectangle-of-influence drawings of inner triangulated plane graphs. Discrete & Computational Geometry\u00a041(4), 643\u2013670 (2009)","journal-title":"Discrete & Computational Geometry"},{"key":"3_CR11","unstructured":"Miura, K., Nishizeki, T.: Rectangle-of-influence drawings of four-connected plane graphs. In: Asia-Pacific Symposium on Information Visualization (APVIS). CRPIT, vol.\u00a045, pp. 75\u201380 (2005)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.comgeo.2010.07.001","volume":"44","author":"S. Sadasivam","year":"2011","unstructured":"Sadasivam, S., Zhang, H.: Closed rectangle-of-influence drawings for irreducible triangulations. Comput. Geom. Theory Appl.\u00a044, 9\u201319 (2011)","journal-title":"Comput. Geom. Theory Appl."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput.\u00a016, 421\u2013444 (1987)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1112\/jlms\/s1-28.3.336","volume":"28","author":"P. Ungar","year":"1953","unstructured":"Ungar, P.: On diagrams representing maps. J. London Mathematical Society\u00a028(3), 336\u2013342 (1953)","journal-title":"J. London Mathematical Society"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1142\/S1793830909000257","volume":"1","author":"H. Zhang","year":"2009","unstructured":"Zhang, H., Vaidya, M.: On open rectangle-of-influence and rectangular dual drawings of plane graphs. Discrete Mathematics, Algorithms and Applications\u00a01, 319\u2013333 (2009)","journal-title":"Discrete Mathematics, Algorithms and Applications"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T19:29:32Z","timestamp":1561058972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}