{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:32:30Z","timestamp":1743125550385,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_12","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"146-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Partitioning Orthogonal Histograms into Rectangular Boxes"],"prefix":"10.1007","author":[{"given":"Therese","family":"Biedl","sequence":"first","affiliation":[]},{"given":"Martin","family":"Derka","sequence":"additional","affiliation":[]},{"given":"Veronika","family":"Irvine","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2338-361X","authenticated-orcid":false,"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[]},{"given":"Debajyoti","family":"Mondal","sequence":"additional","affiliation":[]},{"given":"Alexi","family":"Turcotte","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"issue":"1\u20132","key":"12_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoret. Comput. Sci. 237(1\u20132), 123\u2013134 (2000)","journal-title":"Theoret. Comput. Sci."},{"unstructured":"Barrera-Cruz, F., Biedl, T.C., Derka, M., Kiazyk, S., Lubiw, A., Vosoughpour, H.: Turning orthogonally convex polyhedra into orthoballs. In: Proceedings of CCCG (2014)","key":"12_CR2"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(91)90207-X","volume":"38","author":"VJ Dielissen","year":"1991","unstructured":"Dielissen, V.J., Kaldewaij, A.: Rectangular partition is polynomial in two dimensions but NP-complete in three. Inf. Process. Lett. 38(1), 1\u20136 (1991)","journal-title":"Inf. Process. Lett."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.tcs.2017.05.035","volume":"689","author":"S Durocher","year":"2017","unstructured":"Durocher, S., Mehrabi, S.: Computing conforming partitions of orthogonal polygons with minimum stabbing number. Theor. Comput. Sci. 689, 157\u2013168 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-11409-0_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D Eppstein","year":"2010","unstructured":"Eppstein, D.: Graph-theoretic solutions to computational geometry problems. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol. 5911, pp. 1\u201316. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11409-0_1"},{"issue":"1","key":"12_CR6","first-page":"179","volume":"5","author":"D Eppstein","year":"2014","unstructured":"Eppstein, D., Mumford, E.: Steinitz theorems for simple orthogonal polyhedra. J. Comput. Geom. 5(1), 179\u2013244 (2014)","journal-title":"J. Comput. Geom."},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/0734-189X(84)90139-7","volume":"28","author":"L Ferrari","year":"1984","unstructured":"Ferrari, L., Sankar, P.V., Sklansky, J.: Minimal rectangular partitions of digitized blobs. Comput. Vis. Graph. Image Process. 28(1), 58\u201371 (1984)","journal-title":"Comput. Vis. Graph. Image Process."},{"doi-asserted-by":"crossref","unstructured":"Floderus, P., Jansson, J., Levcopoulos, C., Lingas, A., Sledneu, D.: 3D rectangulations and geometric matrix multiplication. Algorithmica (2016, in press)","key":"12_CR8","DOI":"10.1007\/s00453-016-0247-3"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16(1), 4\u201332 (1996)","journal-title":"Algorithmica"},{"issue":"03","key":"12_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1142\/S0218195902000803","volume":"12","author":"M Keil","year":"2002","unstructured":"Keil, M., Snoeyink, J.: On the time bound for convex decomposition of simple polygons. Int. J. Comput. Geom. Appl. 12(03), 181\u2013192 (2002)","journal-title":"Int. J. Comput. Geom. Appl."},{"unstructured":"Lingas, A., Pinter, R., Rivest, R., Shamir, A.: Minimum edge length partitioning of rectilinear polygons. In: Proceedings of the Annual Allerton Conference on Communication, Control, and Computing, vol. 10, pp. 53\u201363 (1982)","key":"12_CR11"},{"key":"12_CR12","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3233\/FI-1978-2116","volume":"2","author":"W Lipski","year":"1979","unstructured":"Lipski, W., Lodi, E., Luccio, F., Mugnai, C., Pagli, L.: On two-dimensional data organization II. Fundam. Informaticae 2, 245\u2013260 (1979)","journal-title":"Fundam. Informaticae"},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1002\/net.3230130308","volume":"13","author":"W Lipski","year":"1983","unstructured":"Lipski, W.: Finding a Manhattan path and related problems. Networks 13(3), 399\u2013409 (1983)","journal-title":"Networks"},{"unstructured":"Ohtsuki, T.: Minimum dissection of rectilinear regions. In: Proceedings of the IEEE International Symposium on Circuits and Systems, pp. 1210\u20131213 (1982)","key":"12_CR14"},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TIT.1983.1056648","volume":"29","author":"J O\u2019Rourke","year":"1983","unstructured":"O\u2019Rourke, J., Supowit, K.J.: Some NP-hard polygon decomposition problems. IEEE Trans. Inf. Theory 29(2), 181\u2013189 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.comgeo.2004.01.007","volume":"28","author":"J O\u2019Rourke","year":"2004","unstructured":"O\u2019Rourke, J., Tewari, G.: The structure of optimal partitions of orthogonal polygons into fat rectangles. Comput. Geom. 28(1), 49\u201371 (2004)","journal-title":"Comput. Geom."},{"issue":"2","key":"12_CR17","first-page":"307","volume":"15","author":"S Poljak","year":"1974","unstructured":"Poljak, S.: A note on stable sets and colorings of graphs. Comment. Math. Univ. Carol. 15(2), 307\u2013309 (1974)","journal-title":"Comment. Math. Univ. Carol."},{"unstructured":"Uehara, R.: NP-complete problems on a 3-connected cubic planar graph and their applications. Technical report TWCU-M-0004, Tokyo Woman\u2019s Christian University (1996)","key":"12_CR18"}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:01:19Z","timestamp":1709827279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_12","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":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}