{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:45:06Z","timestamp":1725795906763},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_61","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"738-750","source":"Crossref","is-referenced-by-count":2,"title":["Coloring Relatives of Interval Overlap Graphs via On-line Games"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Krawczyk","sequence":"first","affiliation":[]},{"given":"Bartosz","family":"Walczak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"61_CR1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.7146\/math.scand.a-10607","volume":"8","author":"E. Asplund","year":"1960","unstructured":"Asplund, E., Gr\u00fcnbaum, B.: On a colouring problem. Math. Scand.\u00a08, 181\u2013188 (1960)","journal-title":"Math. Scand."},{"issue":"6","key":"61_CR2","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.ipl.2007.07.004","volume":"104","author":"J. Enright","year":"2007","unstructured":"Enright, J., Stewart, L.: Subtree filament graphs are subtree overlap graphs. Inform. Process. Lett.\u00a0104(6), 228\u2013232 (2007)","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"61_CR3","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0304-3975(96)00204-6","volume":"175","author":"S. Felsner","year":"1997","unstructured":"Felsner, S.: On-line chain partitions of orders. Theoret. Comput. Sci.\u00a0175(2), 283\u2013292 (1997)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"61_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1017\/S0963548313000412","volume":"23","author":"J. Fox","year":"2014","unstructured":"Fox, J., Pach, J.: Applications of a new separator theorem for string graphs. Combin. Prob. Comput.\u00a023(1), 66\u201374 (2014)","journal-title":"Combin. Prob. Comput."},{"issue":"5-6","key":"61_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0020-0190(00)00025-9","volume":"73","author":"F. Gavril","year":"2000","unstructured":"Gavril, F.: Maximum weight independent sets and cliques in intersection graphs of filaments. Inform. Process. Lett.\u00a073(5-6), 181\u2013188 (2000)","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"61_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(83)90019-5","volume":"43","author":"M.C. Golumbic","year":"1983","unstructured":"Golumbic, M.C., Rotem, D., Urrutia, J.: Comparability graphs and intersection graphs. Discrete Math.\u00a043(1), 37\u201346 (1983)","journal-title":"Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Gy\u00e1rf\u00e1s, A.: On the chromatic number of multiple interval graphs and overlap graphs. Discrete Math.\u00a055(2), 161-166 (1985)","key":"#cr-split#-61_CR7.1","DOI":"10.1016\/0012-365X(85)90044-5"},{"doi-asserted-by":"crossref","unstructured":"Corrigendum: Discrete Math. 62(3), 333 (1986)","key":"#cr-split#-61_CR7.2","DOI":"10.1016\/0012-365X(86)90224-4"},{"key":"61_CR8","first-page":"204","volume":"10","author":"A. Kostochka","year":"1988","unstructured":"Kostochka, A.: On upper bounds for the chromatic numbers of graphs. Trudy Inst. Mat.\u00a010, 204\u2013226 (1988)","journal-title":"Trudy Inst. Mat."},{"issue":"1-3","key":"61_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0012-365X(96)00344-5","volume":"163","author":"A. Kostochka","year":"1997","unstructured":"Kostochka, A., Kratochv\u00edl, J.: Covering and coloring polygon-circle graphs. Discrete Math.\u00a0163(1-3), 299\u2013305 (1997)","journal-title":"Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Kostochka, A., Milans, K.: Coloring clean and K\n                  4-free circle graphs. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 399\u2013414. Springer (2012)","key":"61_CR10","DOI":"10.1007\/978-1-4614-0110-0_21"},{"unstructured":"Krawczyk, T., Pawlik, A., Walczak, B.: Coloring triangle-free rectangle overlap graphs with O(loglogn) colors, arXiv:1301.0541 (submitted)","key":"61_CR11"},{"issue":"3","key":"61_CR12","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1007\/s00454-013-9534-9","volume":"50","author":"A. Pawlik","year":"2013","unstructured":"Pawlik, A., Kozik, J., Krawczyk, T., Laso\u0144, M., Micek, P., Trotter, W.T., Walczak, B.: Triangle-free geometric intersection graphs with large chromatic number. Discrete Comput. Geom.\u00a050(3), 714\u2013726 (2013)","journal-title":"Discrete Comput. Geom."},{"unstructured":"Rok, A., Walczak, B.: Outerstring graphs are \u03c7-bounded. In: 30th Annual Symposium on Computational Geometry (SoCG 2014), arXiv:1312.1559 (to appear, 2014)","key":"61_CR13"},{"issue":"3","key":"61_CR14","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. System Sci.\u00a026(3), 362\u2013391 (1983)","journal-title":"J. Comput. System Sci."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:21:05Z","timestamp":1558923665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}