{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:45:41Z","timestamp":1725500741009},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360640"},{"type":"electronic","value":"9783642360657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36065-7_7","type":"book-chapter","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T16:36:53Z","timestamp":1358786213000},"page":"53-64","source":"Crossref","is-referenced-by-count":1,"title":["Base Location Problems for Base-Monotone Regions"],"prefix":"10.1007","author":[{"given":"Jinhee","family":"Chun","sequence":"first","affiliation":[]},{"given":"Takashi","family":"Horiyama","sequence":"additional","affiliation":[]},{"given":"Takehiro","family":"Ito","sequence":"additional","affiliation":[]},{"given":"Natsuda","family":"Kaothanthong","sequence":"additional","affiliation":[]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[]},{"given":"Yota","family":"Otachi","sequence":"additional","affiliation":[]},{"given":"Takeshi","family":"Tokuyama","sequence":"additional","affiliation":[]},{"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley (1974)","key":"7_CR1"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1142\/S0218195901000420","volume":"11","author":"T. Asano","year":"2001","unstructured":"Asano, T., Chen, D.Z., Katoh, N., Tokuyama, T.: Efficient algorithms for optimization-based image segmentation. Internat. J. Comput. Geom. Appl.\u00a011, 145\u2013166 (2001)","journal-title":"Internat. J. Comput. Geom. Appl."},{"unstructured":"Chun, J., Horiyama, T., Ito, T., Kaothanthong, N., Ono, H., Otachi, Y., Tokuyama, T., Uehara, R., Uno, T.: Algorithms for computing optimal image segmentation using quadtree decomposition. To appear in TJJCCGG 2012 (2012)","key":"7_CR3"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.cviu.2012.03.003","volume":"116","author":"J. Chun","year":"2012","unstructured":"Chun, J., Kaothanthong, N., Kasai, R., Korman, M., N\u00f6llenburg, M., Tokuyama, T.: Algorithms for computing the maximum weight region decomposable into elementary shapes. Comput. Vis. Image Und.\u00a0116, 803\u2013814 (2012)","journal-title":"Comput. Vis. Image Und."},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.1007\/978-3-642-10631-6_117","volume-title":"Algorithms and Computation","author":"J. Chun","year":"2009","unstructured":"Chun, J., Kasai, R., Korman, M., Tokuyama, T.: Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 1166\u20131174. Springer, Heidelberg (2009)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1023\/B:VISI.0000022288.19776.77","volume":"59","author":"P.F. Felzenszwalb","year":"2004","unstructured":"Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient graph-based image segmentation. Int. J. Comput. Vis.\u00a059, 167\u2013181 (2004)","journal-title":"Int. J. Comput. Vis."},{"unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)","key":"7_CR7"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoret. Comput. Sci.\u00a01, 237\u2013267 (1976)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/978-3-642-25591-5_74","volume-title":"Algorithms and Computation","author":"M. Gibson","year":"2011","unstructured":"Gibson, M., Han, D., Sonka, M., Wu, X.: Maximum Weight Digital Regions Decomposable into Digital Star-Shaped Regions. In: Asano, T., Nakano, S.-I., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol.\u00a07074, pp. 724\u2013733. Springer, Heidelberg (2011)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-31155-0_12","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"Y. Han","year":"2012","unstructured":"Han, Y., Takaoka, T.: An O(n\n                  3 loglogn \/ log2\n                  n) Time Algorithm for All Pairs Shortest Paths. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol.\u00a07357, pp. 131\u2013141. Springer, Heidelberg (2012)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(83)90080-X","volume":"6","author":"D.S. Hochbaum","year":"1983","unstructured":"Hochbaum, D.S.: Efficient bounds for the stable set, vertex cover and set packing problems. Discrete Appl. Math.\u00a06, 243\u2013254 (1983)","journal-title":"Discrete Appl. Math."},{"unstructured":"Otten, R.H.J.M., van Wijk, J.G.: Graph representations in interactive layout design. In: IEEE Internat. Symp. on Circuits and Systems, pp. 914\u2013918 (1978)","key":"7_CR12"},{"unstructured":"Wang, J.J., He, X.: Compact visibility representation of plane graphs. In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011. LIPIcs, vol.\u00a09, pp. 141\u2013152 (2011)","key":"7_CR13"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36065-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:35:04Z","timestamp":1620135304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36065-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360640","9783642360657"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36065-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}