{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:06Z","timestamp":1725516786844},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_12","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"110-118","source":"Crossref","is-referenced-by-count":2,"title":["Polychromatic Colorings of n-Dimensional Guillotine-Partitions"],"prefix":"10.1007","author":[{"given":"Bal\u00e1zs","family":"Keszegh","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.ipl.2006.01.011","volume":"98","author":"E. Ackerman","year":"2006","unstructured":"Ackerman, E., Barequet, G., Pinter, R.Y., Romik, D.: The Number of Guillotine Partitions in d Dimensions. Inf. Process. Lett.\u00a098(4), 162\u2013167 (2006)","journal-title":"Inf. Process. Lett."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Berke, R., Buchin, K., Buchin, M., Csorba, P., Shannigrahi, S., Speckmann, B., Zumstein, P.: Polychromatic Colorings of Plane Graphs. In: Proc. of 24th Annual ACM Symposium on Computational Geometry (2008)","DOI":"10.1145\/1377676.1377734"},{"issue":"3","key":"12_CR3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0925-7721(03)00027-0","volume":"26","author":"P. Bose","year":"2003","unstructured":"Bose, P., Kirkpatrick, D., Li, Z.: Worst-Case-Optimal Algorithms for Guarding Planar Graphs and Polyhedral Surfaces. Comput. Geom. Theory Appl.\u00a026(3), 209\u2013219 (2003)","journal-title":"Comput. Geom. Theory Appl."},{"key":"12_CR4","unstructured":"Dimitrov, D., Horev, E., Krakovski, R.: Polychromatic 4-Coloring of Rectangular Partitions. In: Proc. of 24th European Workshop on Computational Geometry (2008)"},{"key":"12_CR5","unstructured":"Dimitrov, D.: Personal Communication (2007)"},{"key":"12_CR6","unstructured":"Dinitz, Y., Katz, M.J., Krakovski, R.: Guarding Rectangular Partitions. In: Proc. of 23rd European Workshop on Computational Geometry (2007)"},{"key":"12_CR7","unstructured":"Horev, E., Katz, M.J., Krakovski, R.: Polychromatic Colorings of Cubic Bipartite Plane Graphs (submitted, 2007)"},{"key":"12_CR8","unstructured":"Horev, E., Katz, M.J., Krakovski, R., L\u00f6ffler, M.: Polychromatic 4-Colorings of Guillotine Subdivision (submitted, 2007)"},{"key":"12_CR9","unstructured":"Horev, E., Krakovski, R.: Polychromatic Colorings of Bounded Degree Plane Graphs (submitted, 2007)"},{"key":"12_CR10","first-page":"1","volume":"R26","author":"B. Mohar","year":"1999","unstructured":"Mohar, B., \u0160krekovski, R.: The Gr\u00f6tzsch Theorem for the Hypergraph of Maximal Cliques. Electr. J. Comb.\u00a0R26, 1\u201313 (1999)","journal-title":"Electr. J. Comb."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:44:46Z","timestamp":1620017086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}