{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:36:30Z","timestamp":1725467790734},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642367625"},{"type":"electronic","value":"9783642367632"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36763-2_32","type":"book-chapter","created":{"date-parts":[[2013,2,13]],"date-time":"2013-02-13T22:17:33Z","timestamp":1360793853000},"page":"352-363","source":"Crossref","is-referenced-by-count":1,"title":["Density Theorems for Intersection Graphs of t-Monotone Curves"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Suk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., van Kreveld, M., Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geom. Theory Appl.\u00a011, 209\u2013218 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.jcta.2004.12.008","volume":"111","author":"N. Alon","year":"2005","unstructured":"Alon, N., Pach, J., Pinchasi, R., Radoicic, R., Sharir, M.: Crossing patterns of semi-algebraic sets. J. Comb. Theory Ser. A\u00a0111, 310\u2013326 (2005)","journal-title":"J. Comb. Theory Ser. A"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/0196-6774(83)90012-3","volume":"4","author":"T. Asano","year":"1983","unstructured":"Asano, T., Imai, H.: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J. Algorithms\u00a04, 310\u2013323 (1983)","journal-title":"J. Algorithms"},{"key":"32_CR4","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 coloring problem. Math. Scand.\u00a08, 181\u2013188 (1960)","journal-title":"Math. Scand."},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1112\/plms\/pdp031","volume":"100","author":"S. Basu","year":"2010","unstructured":"Basu, S.: Combinatorial complexity in o-minimal geometry. Proc. London Math. Soc.\u00a0100, 405\u2013428 (2010)","journal-title":"Proc. London Math. Soc."},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/PL00009495","volume":"23","author":"G. Cairns","year":"2000","unstructured":"Cairns, G., Nikolayevsky, Y.: Bounds for generalized thrackles. Discrete Comput. Geom.\u00a023, 191\u2013206 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0095-8956(76)90022-8","volume":"21","author":"G. Ehrlich","year":"1979","unstructured":"Ehrlich, G., Even, S., Tarjan, R.E.: Intersection graphs of curves in the plane. J. Combinatorial Theory, Ser. B\u00a021, 8\u201320 (1979)","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0166-218X(89)90045-0","volume":"25","author":"P. Erd\u0151s","year":"1989","unstructured":"Erd\u0151s, P., Hajnal, A.: Ramsey-type theorems. Discrete Appl. Math.\u00a025, 37\u201352 (1989)","journal-title":"Discrete Appl. Math."},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1112\/jlms\/jdq087","volume":"83","author":"J. Fox","year":"2011","unstructured":"Fox, J., Pach, J., T\u00f3th: Intersection patterns of curves. Journal of the London Mathematical Society\u00a083, 389\u2013406 (2011)","journal-title":"Journal of the London Mathematical Society"},{"key":"32_CR10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s00493-009-2475-5","volume":"29","author":"J. Fox","year":"2009","unstructured":"Fox, J., Sudakov, B.: Density theorems for bipartite graphs and related Ramsey-type results. Combinatorica\u00a029, 153\u2013196 (2009)","journal-title":"Combinatorica"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.comgeo.2011.02.001","volume":"44","author":"R. Fulek","year":"2011","unstructured":"Fulek, R., Pach, J.: A computational approach to Conway\u2019s thrackle conjecture. Comput. Geom.\u00a044, 345\u2013355 (2011)","journal-title":"Comput. Geom."},{"key":"32_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0012-365X(85)90044-5","volume":"55","author":"A. Gy\u00e1rf\u00e1s","year":"1985","unstructured":"Gy\u00e1rf\u00e1s, A.: On the chromatic number of multiple intervals graphs and overlap graphs. Discrete Math.\u00a055, 161\u2013166 (1985)","journal-title":"Discrete Math."},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM\u00a032, 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"32_CR15","unstructured":"Kozik, J., Krawczyk, T., Laso\u0144, M., Micek, P., Pawlik, A., Trotter, W., Walczak, B.: Triangle-free intersection graphs of segments in the plane with arbitrarily large chromatic number (submitted)"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/PL00009322","volume":"18","author":"L. Lov\u00e1sz","year":"1997","unstructured":"Lov\u00e1sz, L., Pach, J., Szegedy, M.: On Conway\u2019s thrackle conjecture. Discrete Comput. Geom.\u00a018, 369\u2013376 (1997)","journal-title":"Discrete Comput. Geom."},{"key":"32_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J. Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer, New York (2002)"},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1006\/jcta.2001.3184","volume":"96","author":"J. Pach","year":"2001","unstructured":"Pach, J., Solymosi, J.: Crossing patterns of segments. J. Comb. Theory Ser. A\u00a096, 316\u2013325 (2001)","journal-title":"J. Comb. Theory Ser. A"},{"key":"32_CR19","doi-asserted-by":"publisher","first-page":"544","DOI":"10.4169\/amer.math.monthly.118.06.544","volume":"118","author":"J. Pach","year":"2011","unstructured":"Pach, J., Sterling, E.: Conway\u2019s conjecture for monotone thrackles. Amer. Math. Monthley\u00a0118, 544\u2013548 (2011)","journal-title":"Amer. Math. Monthley"},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02574361","volume":"12","author":"J. Pach","year":"1994","unstructured":"Pach, J., T\u00f6r\u00f6csik, J.: Some geometric applications of Dilworth\u2019s theorem. Discrete Comput. Geom.\u00a012, 1\u20137 (1994)","journal-title":"Discrete Comput. Geom."},{"key":"32_CR21","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1006\/jctb.2000.1978","volume":"80","author":"J. Pach","year":"2000","unstructured":"Pach, J., T\u00f3th, G.: Which crossing number is it anyway? J. Comb. Theory Ser. B\u00a080, 225\u2013246 (2000)","journal-title":"J. Comb. Theory Ser. B"},{"key":"32_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-30540-8_15","volume-title":"Combinatorial Geometry and Graph Theory","author":"J. Pach","year":"2005","unstructured":"Pach, J., T\u00f3th, G.: Disjoint Edges in Topological Graphs. In: Akiyama, J., Baskoro, E.T., Kano, M. (eds.) IJCCGGT 2003. LNCS, vol.\u00a03330, pp. 133\u2013140. Springer, Heidelberg (2005)"},{"key":"32_CR23","unstructured":"Suk, A.: Coloring intersection graphs of x-monotone curves in the plane (submitted)"},{"key":"32_CR24","unstructured":"Suk, A.: Disjoint edges in complete topological graphs (to appear)"},{"key":"32_CR25","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1006\/jcta.1999.3001","volume":"89","author":"G. T\u00f3th","year":"2000","unstructured":"T\u00f3th, G.: Note on geometric graphs. J. Comb. Theory Ser. A\u00a089, 126\u2013132 (2000)","journal-title":"J. Comb. Theory Ser. A"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36763-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,22]],"date-time":"2020-07-22T05:00:02Z","timestamp":1595394002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36763-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642367625","9783642367632"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36763-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}