{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:12Z","timestamp":1725483732476},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_16","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:28:20Z","timestamp":1178371700000},"page":"202-211","source":"Crossref","is-referenced-by-count":2,"title":["Balanced k-Colorings"],"prefix":"10.1007","author":[{"given":"Therese C.","family":"Biedl","sequence":"first","affiliation":[]},{"given":"Eowyn","family":"Cenek","sequence":"additional","affiliation":[]},{"given":"Timothy M.","family":"Chan","sequence":"additional","affiliation":[]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Martin L.","family":"Demaine","sequence":"additional","affiliation":[]},{"given":"Rudolf","family":"Fleischer","sequence":"additional","affiliation":[]},{"given":"Ming-Wei","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"16_CR1","first-page":"185","volume-title":"The Probabilistic Method","author":"N. Alon","year":"1992","unstructured":"Noga Alon and Joel H. Spencer. The Probabilistic Method. Wiley, New York, 1992. Chapter 12, pages 185\u2013196."},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0012-365X(90)90227-9","volume":"83","author":"J. Akiyama","year":"1990","unstructured":"Jin Akiyama and Jorge Urrutia. A note on balanced colourings for lattice points. Discrete Mathematics, 83(1):123\u2013126, 1990.","journal-title":"Discrete Mathematics"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Tetsuo Asano, Tomomi Matsui, and Takeshi Tokuyama. On the complexities of the optimal rounding problems of sequences and matrices. In Proceedings of the 7th Scandinavian Workshop on Algorithm Theory (SWAT\u201900), Bergen, Norway, July 2000. To appear.","DOI":"10.1007\/3-540-44985-X_40"},{"key":"16_CR4","unstructured":"J\u00f3zsef Beck. Some results and problems in \u201ccombinatorial discrepancy theory\u201d. In Topics in Classical Number Theory: Proceedings of the International Conference on Number Theory, pages 203\u2013218, Budapest, Hungary, July 1981. Appeared in Colloquia Mathematica Societatis J\u00e1nos Bolyai, volume 34, 1994."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(81)90022-6","volume":"3","author":"J. Beck","year":"1981","unstructured":"J\u00f3zsef Beck and Tibor Fiala. \u201cInteger-making\u201d theorems. Discrete Applied Mathematics, 3:1\u20138, 1981.","journal-title":"Discrete Applied Mathematics"},{"key":"16_CR6","first-page":"1405","volume":"2","author":"J. Beck","year":"1995","unstructured":"J\u00f3zsef Beck and Vera T. S\u00f3s. Discrepancy theory. In Handbook of Combinatorics, volume 2, pages 1405\u20131446. Elsevier, Amsterdam, 1995.","journal-title":"Handbook of Combinatorics"},{"issue":"1\u20133","key":"16_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0012-365X(94)90112-0","volume":"128","author":"A.J.W. Hilton","year":"1994","unstructured":"A.J.W. Hilton and D. de Werra. A sufficient condition for equitable edge-colourings of simple graphs. Discrete Mathematics, 128(1\u20133): 179\u2013201, 1994.","journal-title":"Discrete Mathematics"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Thomas J. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pages 216\u2013226, San Diego, California, May 1978.","DOI":"10.1145\/800133.804350"},{"issue":"3","key":"16_CR9","first-page":"175","volume":"18","author":"J. \u0160\u00edma","year":"1999","unstructured":"Ji\u0159\u00ed \u0160\u00edma. Table rounding problem. Comput. Artificial Intelligence, 18(3): 175\u2013189, 1999.","journal-title":"Comput. Artificial Intelligence"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Joel Spencer. Geometric discrepancy theory. Contemporary Mathematics, 223, 1999.","DOI":"10.1090\/conm\/223\/03148"},{"key":"16_CR11","unstructured":"Joel Spencer. Personal communication. 2000."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T14:52:03Z","timestamp":1550328723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}