{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T06:27:56Z","timestamp":1745216876662,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_8","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"86-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rectilinear Duals Using Monotone Staircase Polygons"],"prefix":"10.1007","author":[{"given":"Yi-Jun","family":"Chang","sequence":"first","affiliation":[]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"issue":"3","key":"8_CR1","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1007\/s00454-013-9521-1","volume":"50","author":"JM Alam","year":"2013","unstructured":"Alam, J.M., Biedl, T., Felsner, S., Kaufmann, S.G., Ueckert, T.: Computing cartograms with optimal complexity. Discrete Comput. Geom. 50(3), 784\u2013810 (2013)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-013-9764-5","volume":"67","author":"JM Alam","year":"2013","unstructured":"Alam, J.M., Biedl, T., Felsner, S., Gerasch, A., Kaufmann, M., Kobourov, S.G.: Linear-time algorithms for hole-free rectilinear proportional contact graph representations. Algorithmica 67(1), 3\u201322 (2013)","journal-title":"Algorithmica"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-22300-6_9","volume-title":"Algorithms and Data Structures","author":"T Biedl","year":"2011","unstructured":"Biedl, T., Ruiz Vel\u00e1zquez, L.E.: Orthogonal cartograms with few corners per face. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 98\u2013109. Springer, Heidelberg (2011)"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1137\/110834032","volume":"41","author":"D Eppstein","year":"2012","unstructured":"Eppstein, D., Mumford, E., Speckmann, B., Verbeek, K.: Area-universal rectangular layouts. SIAM J. Comput. 41(3), 537\u2013564 (2012)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.tcs.2013.05.007","volume":"532","author":"BD He","year":"2014","unstructured":"He, B.D.: A simple optimal binary representation of mosaic floorplans and Baxter permutations. Theor. Comput. Sci. 532(1), 40\u201350 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"8_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0304-3975(95)00257-X","volume":"172","author":"G Kant","year":"1997","unstructured":"Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theor. Comput. Sci. 172(1\u20132), 175\u2013193 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-31494-0_37","volume-title":"Progress in VLSI Design and Test","author":"B Kar","year":"2012","unstructured":"Kar, B., Sur-Kolay, S., Rangarajan, S.H., Mandal, C.R.: A faster hierarchical balanced bipartitioner for VLSI floorplans using monotone staircase cuts. In: Rahaman, H., Chattopadhyay, S., Chattopadhyay, S. (eds.) VDAT 2012. LNCS, vol. 7373, pp. 327\u2013336. Springer, Heidelberg (2012)"},{"issue":"11","key":"8_CR8","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1016\/j.tcs.2008.10.038","volume":"410","author":"A Kawaguchi","year":"2009","unstructured":"Kawaguchi, A., Nagamochi, H.: Drawing slicing graphs with face areas. Theor. Comput. Sci. 410(11), 1061\u20131072 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/net.3230150202","volume":"15","author":"K Kozminski","year":"1985","unstructured":"Kozminski, K., Kinnen, E.: Rectangular dual of planar graphs. Networks 15, 145\u2013157 (1985)","journal-title":"Networks"},{"issue":"2","key":"8_CR10","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0196-6774(03)00057-9","volume":"48","author":"C Liao","year":"2003","unstructured":"Liao, C., Lu, H., Yen, H.: Compact floor-planning via orderly spanning trees. J. Algorithms 48(2), 441\u2013451 (2003)","journal-title":"J. Algorithms"},{"issue":"1","key":"8_CR11","first-page":"141","volume":"12","author":"S Majumder","year":"2007","unstructured":"Majumder, S., Sur-Kolay, S., Bhattacharya, B., Das, S.: Hierarchical partitioning of VLSI floorplans by staircases. ACM Trans. Des. Automat. Elect. Syst. 12(1), 141\u2013159 (2007)","journal-title":"ACM Trans. Des. Automat. Elect. Syst."},{"key":"8_CR12","unstructured":"Ueckerdt, T.: Geometric Representations of Graphs with Low Polygonal Complexity. Ph.D. thesis, Technische Universitat Berlin (2011)"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/0222035","volume":"22","author":"K Yeap","year":"1993","unstructured":"Yeap, K., Sarrafzadeh, M.: Floor-planning by graph dualization: 2-concave rectilinear modules. SIAM J. Comput. 22, 500\u2013526 (1993)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T05:18:47Z","timestamp":1675833527000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}