{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:36:40Z","timestamp":1743136600099,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319065687"},{"type":"electronic","value":"9783319065694"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06569-4_5","type":"book-chapter","created":{"date-parts":[[2014,4,11]],"date-time":"2014-04-11T20:16:15Z","timestamp":1397247375000},"page":"75-86","source":"Crossref","is-referenced-by-count":0,"title":["Minimum K-Adjacent Rectangles of Orthogonal Polygons and its Application"],"prefix":"10.1007","author":[{"given":"Thanh-Hai","family":"Nguyen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"ARM: Technical reference manual - arm1176jz-s (2009)"},{"key":"5_CR2","unstructured":"Cormen, T., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill Book Compagny (2001)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"DiMaggio, P.A., McAllister, S.R., Floudas, C.A., Feng, X., Rabinowitz, J., Rabitz, H.: Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies. BMC Bioinformatics (2008)","DOI":"10.1186\/1471-2105-9-458"},{"key":"5_CR4","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 partition of digitized blobs. Comput. Vision, Graph. Image Proc.\u00a028, 58\u201371 (1984)","journal-title":"Comput. Vision, Graph. Image Proc."},{"key":"5_CR5","unstructured":"Goemans, M.X.: Lecture notes on bipartite matching (February 2009)"},{"key":"5_CR6","unstructured":"IBM: Cplex optimizer (2012)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1137\/0215033","volume":"15","author":"H. Imai","year":"1986","unstructured":"Imai, H., Asano, T.: Efficient algorithms for geometric graph search problems. SIAM J. Computer\u00a015, 478\u2013494 (1986)","journal-title":"SIAM J. Computer"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/B978-044482537-7\/50012-7","volume-title":"Handbook of Computational Geometry","author":"J.M. Keil","year":"2000","unstructured":"Keil, J.M.: Polygon decomposition. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 491\u2013518. Elsevier, North Holland, Amsterdam (2000)"},{"key":"5_CR9","first-page":"245","volume":"2","author":"I.l.l.W. Lipski","year":"1979","unstructured":"Lipski, I.l.l.W., Lodi, J.E., Luccio, F., Muganai, C., Pagli, L.: On two dimensional data organization 11: Fundamenta informaticae. SIAM J. Computer\u00a02, 245\u2013260 (1979)","journal-title":"SIAM J. Computer"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.comgeo.2005.10.005","volume":"35","author":"J. Lien","year":"2006","unstructured":"Lien, J., Amato, N.M.: Approximate convex decomposition of polygons. Comput. Geom. Theory Appl.\u00a035(1), 100\u2013123 (2006)","journal-title":"Comput. Geom. Theory Appl."},{"key":"5_CR11","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\u00a013, 399\u2013409 (1983)","journal-title":"Networks"},{"key":"5_CR12","unstructured":"Makhorin, A.: Glpk: GNU GNU Linear Programming Kit (2000\u20132012)"},{"key":"5_CR13","unstructured":"Mead, C., Conway, L.: Introduction to vlsi systems. Addison-Wesley Pub. Co. (1979)"},{"issue":"12","key":"5_CR14","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1890\/05-0027","volume":"86","author":"I. Miklos","year":"2005","unstructured":"Miklos, I., Somodi, I., Podani, J.: Rearrangement of ecological data matrices via markov chain monte carlo simulation. Ecology\u00a086(12), 530\u2013536 (2005)","journal-title":"Ecology"},{"issue":"01","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218195900000024","volume":"10","author":"M. Muller-Hannemann","year":"2000","unstructured":"Muller-Hannemann, M., Weihe, K.: Quadrangular refinements of convex polygons with an application to finite-element meshes. International Journal of Computational Geometry & Applications\u00a010(01), 1\u201340 (2000)","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1109\/43.3182","volume":"7","author":"S. Nahar","year":"1988","unstructured":"Nahar, S., Sahni, S.: Fast algorithm for polygon decomposition. IEEE Transactions on Computer-Aided Design\u00a07, 473\u2013483 (1988)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"5_CR17","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and combinatorial optimization, vol.\u00a018. Wiley, New York (1988)"},{"key":"5_CR18","unstructured":"Ohtsuki, T.: Minimum dissection of rectilinear regions. In: Proc. IEEE Symp. on Circuits and Systems, pp. 1210\u20131213 (1982)"},{"key":"5_CR19","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice Hall Inc., New Jersey (1982)"},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/775265.775268","volume":"8","author":"B.W. Lampson","year":"1974","unstructured":"Lampson, B.W.: Protection. SIGOPS Oper. Syst. Rev.\u00a08(1), 18\u201324 (1974)","journal-title":"SIGOPS Oper. Syst. Rev."}],"container-title":["Advances in Intelligent Systems and Computing","Advanced Computational Methods for Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06569-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T21:12:13Z","timestamp":1716671533000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-06569-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319065687","9783319065694"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06569-4_5","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}