{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:58Z","timestamp":1725559018403},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223399"},{"type":"electronic","value":"9783540278108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_39","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T17:27:29Z","timestamp":1279042049000},"page":"455-467","source":"Crossref","is-referenced-by-count":2,"title":["On Geometric Structure of Global Roundings for Graphs and Range Spaces"],"prefix":"10.1007","author":[{"given":"Tetsuo","family":"Asano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hisao","family":"Tamaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Tokuyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-45071-8_15","volume-title":"Computing and Combinatorics","author":"T. Asano","year":"2003","unstructured":"Asano, T., Katoh, N., Tamaki, H., Tokuyama, T.: The Structure and Number of Global Roundings of a Graph. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 130\u2013138. Springer, Heidelberg (2003)"},{"issue":"6","key":"39_CR2","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1137\/S0097539702417511","volume":"32","author":"T. Asano","year":"2003","unstructured":"Asano, T., Katoh, N., Obokata, K., Tokuyama, T.: Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning. SIAM J. Comput.\u00a032(6), 1423\u20131435 (2003)","journal-title":"SIAM J. Comput."},{"key":"39_CR3","first-page":"241","volume":"7","author":"T. Asano","year":"2000","unstructured":"Asano, T., Matsui, T., Tokuyama, T.: Optimal Roundings of Sequences and Matrices. Nordic Journal of Computing\u00a07, 241\u2013256 (2000)","journal-title":"Nordic Journal of Computing"},{"key":"39_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/3-540-45678-3_54","volume-title":"Algorithms and Computation","author":"T. Asano","year":"2001","unstructured":"Asano, T., Tokuyama, T.: How to color a checkerboard with a given distribution - matrix rounding achieving low 2\u00d72-discrepancy. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 636\u2013648. Springer, Heidelberg (2001)"},{"key":"39_CR5","volume-title":"Handbook of Combinatorics Volume","author":"J. Beck","year":"1995","unstructured":"Beck, J., S\u00f3s, V.T.: Discrepancy Theory. In: Graham, T., Gr\u00f6tshel, M., Lov\u00e1sz, L. (eds.) Handbook of Combinatorics Volume, Elsevier, Amsterdam (1995)"},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/rsa.3240010208","volume":"1","author":"G. Bohus","year":"1990","unstructured":"Bohus, G.: On the Discrepancy of 3 Permutations. Random Structuctures & Algorithms\u00a01, 215\u2013220 (1990)","journal-title":"Random Structuctures & Algorithms"},{"key":"39_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511626371","volume-title":"The Discrepancy Method, Cambridge U","author":"B. Chazelle","year":"2000","unstructured":"Chazelle, B.: The Discrepancy Method .Cambridge U. Press, Cambridge (2000)"},{"key":"39_CR8","unstructured":"Doerr, B.: Lattice Approximation and Linear Discrepancy of Totally Unimodular Matrices. In: Proc. 12th ACM-SIAM SODA, pp. 119\u2013125 (2001)"},{"key":"39_CR9","unstructured":"Jansson, J., Tokuyama, T.: Semi-Balanced Coloring of Graphs\u2013 2-Colorings Based on a Relaxed Discrepancy Condition (to appear in Graph and Combinatorics)"},{"key":"39_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/1477","volume":"6","author":"M. Juvan","year":"1999","unstructured":"Juvan, M., Mohar, B., Thomas, R.: List edge-coloring of series-parallel graphs. The Electoronic Journal of Combinatorics\u00a06, 1\u20136 (1999)","journal-title":"The Electoronic Journal of Combinatorics"},{"key":"39_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-03942-3","volume-title":"Geometric Discrepancy, Algorithms and Combinatorics","author":"J. Matou\u0161ek","year":"1999","unstructured":"Matou\u0161ek, J.: Geometric Discrepancy, Algorithms and Combinatorics, vol.\u00a018. Springer, Heidelberg (1999)"},{"key":"39_CR12","unstructured":"R\u00f6dl, V., Winkler, P.: Concerning a Matrix Approximation Problem, Crux Mathmaticorum, pp. 76-79 (1990)"},{"key":"39_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-48224-5_14","volume-title":"Automata, Languages and Programming","author":"K. Sadakane","year":"2001","unstructured":"Sadakane, K., Takki-Chebihi, N., Tokuyama, T.: Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 166\u2013177. Springer, Heidelberg (2001)"},{"key":"39_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-540-24587-2_44","volume-title":"Algorithms and Computation","author":"N. Takki-Chebihi","year":"2003","unstructured":"Takki-Chebihi, N., Tokuyama, T.: Enumerating Roundings for an Outerplanar Graph. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 425\u2013433. Springer, Heidelberg (2003)"},{"key":"39_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-45071-8_19","volume-title":"Computing and Combinatorics","author":"X. Zhou","year":"2003","unstructured":"Zhou, X., Matsuo, Y., Nishizeki, T.: List Total Coloring of Series-Parallel Graphs. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 172\u2013181. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:44Z","timestamp":1605759704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}