{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:33Z","timestamp":1725558993756},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262244"},{"type":"electronic","value":"9783540324409"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496199_26","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T10:29:15Z","timestamp":1279103355000},"page":"233-242","source":"Crossref","is-referenced-by-count":0,"title":["Perfectness and Imperfectness of the kth Power of Lattice Graphs"],"prefix":"10.1007","author":[{"given":"Yuichiro","family":"Miyamoto","sequence":"first","affiliation":[]},{"given":"Tomomi","family":"Matsui","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Annals of Mathematics\u00a051, 161\u2013166 (1950)","journal-title":"Annals of Mathematics"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1006\/jctb.2001.2042","volume":"83","author":"S. Gerke","year":"2001","unstructured":"Gerke, S., McDiarmid, C.: Graph Imperfection. Journal of Combinatorial Theory\u00a0B 83, 58\u201378 (2001)","journal-title":"Journal of Combinatorial Theory"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1006\/jctb.2001.2043","volume":"83","author":"S. Gerke","year":"2001","unstructured":"Gerke, S., McDiarmid, C.: Graph Imperfection II. Journal of Combinatorial Theory\u00a0B 83, 79\u2013101 (2001)","journal-title":"Journal of Combinatorial Theory"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1006\/jagm.2001.1210","volume":"42","author":"M.M. Halld\u00f3rsson","year":"2002","unstructured":"Halld\u00f3rsson, M.M., Kortsarz, G.: Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees. Journal of Algorithms\u00a042, 334\u2013366 (2002)","journal-title":"Journal of Algorithms"},{"key":"26_CR5","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 Applied Mathematics\u00a06, 243\u2013254 (1983)","journal-title":"Discrete Applied Mathematics"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1002\/1097-0037(200009)36:2<114::AID-NET6>3.0.CO;2-G","volume":"36","author":"C. McDiarmid","year":"2000","unstructured":"McDiarmid, C., Reed, B.: Channel Assignment and Weighted Coloring. Networks\u00a036, 114\u2013117 (2000)","journal-title":"Networks"},{"key":"26_CR7","volume-title":"Appears in Recent Advances in Algorithms and Combinatorics","author":"C. McDiarmid","year":"2003","unstructured":"McDiarmid, C.: Discrete Mathematics and Radio Channel Assignment. Appears in Recent Advances in Algorithms and Combinatorics. Springer, Heidelberg (2003)"},{"key":"26_CR8","doi-asserted-by":"crossref","first-page":"123","DOI":"10.15807\/jorsj.47.123","volume":"47","author":"Y. Miyamoto","year":"2004","unstructured":"Miyamoto, Y., Matsui, T.: Linear Time Approximation Algorithm for Multicoloring Lattice Graphs with Diagonals. Journal of the Operations Research Society of Japan\u00a047, 123\u2013128 (2004)","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"26_CR9","unstructured":"Miyamoto, Y., Matsui, T.: Multicoloring Unit Disk Graphs on Triangular Lattice Points. In: Proceedings of the Sixteenth ACM-SIAM Symposium on Discrete Algorithms (to appear)"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/s004530010067","volume":"29","author":"L. Narayanan","year":"2001","unstructured":"Narayanan, L., Shende, S.M.: Static Frequency Assignment in Cellular Networks. Algorithmica\u00a029, 396\u2013409 (2001)","journal-title":"Algorithmica"},{"key":"26_CR11","volume-title":"Combinatorial Optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Applications in Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496199_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:39:55Z","timestamp":1619505595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496199_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262244","9783540324409"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11496199_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}