{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:57:26Z","timestamp":1648853846775},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,5,29]],"date-time":"2008-05-29T00:00:00Z","timestamp":1212019200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s00224-008-9117-y","type":"journal-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T15:18:58Z","timestamp":1211987938000},"page":"230-244","source":"Crossref","is-referenced-by-count":2,"title":["Drawing Borders Efficiently"],"prefix":"10.1007","volume":"44","author":[{"given":"Kazuo","family":"Iwama","sequence":"first","affiliation":[]},{"given":"Eiji","family":"Miyano","sequence":"additional","affiliation":[]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,5,29]]},"reference":[{"issue":"4","key":"9117_CR1","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF02523677","volume":"17","author":"P. Berman","year":"1997","unstructured":"Berman, P., DasGupta, B.: Complexities of efficient solutions of rectilinear polygon cover problems. Algorithmica 17(4), 331\u2013356 (1997)","journal-title":"Algorithmica"},{"key":"9117_CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"9117_CR3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jagm.1994.1025","volume":"17","author":"J.C. Culberson","year":"1994","unstructured":"Culberson, J.C., Reckhow, R.A.: Covering polygons is hard. J.\u00a0Algorithms 17, 2\u201344 (1994)","journal-title":"J.\u00a0Algorithms"},{"key":"9117_CR4","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/S0304-3975(02)00738-7","volume":"296","author":"J. Edmonds","year":"2003","unstructured":"Edmonds, J., Gryz, J., Liang, D., Miller, R.J.: Mining for empty rectangles in large data sets. Theor. Comput. Sci. 296, 435\u2013452 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"9117_CR5","volume-title":"Computers and Intractability\u2014A Guide to the Theory of $\\mathcal{NP}$ -Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability\u2014A Guide to the Theory of $\\mathcal{NP}$ -Completeness. Freeman, New York (1979)"},{"key":"9117_CR6","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1089\/cmb.1995.2.219","volume":"2","author":"D.S. Greenberg","year":"1995","unstructured":"Greenberg, D.S., Istrail, S.C.: Physical mapping by STS hybridization: algorithmic strategies and the challenge of software evaluation. J. Comput. Biol. 2, 219\u2013274 (1995)","journal-title":"J. Comput. Biol."},{"issue":"4","key":"9117_CR7","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1023\/A:1009879504783","volume":"3","author":"J. Gudmundsson","year":"1999","unstructured":"Gudmundsson, J., Levcopoulos, C.: Close approximations of minimum rectangular coverings. J.\u00a0Comb. Optim. 3(4), 437\u2013452 (1999)","journal-title":"J.\u00a0Comb. Optim."},{"key":"9117_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0010-4485(82)90104-X","volume":"14","author":"A. Heged\u00fcs","year":"1982","unstructured":"Heged\u00fcs, A.: Algorithms for covering polygons by rectangles. Comput. Aided Geom. Des. 14, 257\u2013260 (1982)","journal-title":"Comput. Aided Geom. Des."},{"issue":"6","key":"9117_CR9","doi-asserted-by":"crossref","first-page":"1509","DOI":"10.1137\/S0097539799358835","volume":"32","author":"V.S. Anil Kumar","year":"2003","unstructured":"Anil Kumar, V.S., Ramesh, H.: Covering rectilinear polygons with axis-parallel rectangles. SIAM J. Comput. 32(6), 1509\u20131541 (2003)","journal-title":"SIAM J. Comput."},{"issue":"7","key":"9117_CR10","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1093\/bioinformatics\/btg081","volume":"19","author":"P.M. Magwene","year":"2003","unstructured":"Magwene, P.M., Lizardi, P., Kim, J.: Reconstructing the temporal ordering of biological samples using microarray data. Bioinformatics 19(7), 842\u2013850 (2003)","journal-title":"Bioinformatics"},{"key":"9117_CR11","unstructured":"Masek, W.J.: Some $\\mathcal{NP}$ -complete set covering problems. MIT, Cambridge. Unpublished manuscript (1978). Referenced in [5]"},{"key":"9117_CR12","unstructured":"Reuhman, D.: A short route to tgif pictures. ftp:\/\/bourbon.usc.edu\/pub\/tgif\/contrib\/tgifintro\/ (2002)"},{"key":"9117_CR13","volume-title":"Handbook of Discrete and Computational Geometry","author":"S. Suri","year":"1997","unstructured":"Suri, S.: Polygons. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton (1997)"},{"key":"9117_CR14","unstructured":"Xfig User Manual (ver. 3.2.5). http:\/\/www.xfig.org\/userman\/"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-008-9117-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-008-9117-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-008-9117-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:51:36Z","timestamp":1558684296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-008-9117-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,29]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["9117"],"URL":"https:\/\/doi.org\/10.1007\/s00224-008-9117-y","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,29]]}}}