{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T18:46:39Z","timestamp":1767033999718},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,12,6]],"date-time":"2012-12-06T00:00:00Z","timestamp":1354752000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s00454-012-9481-x","type":"journal-article","created":{"date-parts":[[2012,12,5]],"date-time":"2012-12-05T22:45:43Z","timestamp":1354747543000},"page":"280-286","source":"Crossref","is-referenced-by-count":13,"title":["Disjoint Edges in Complete Topological Graphs"],"prefix":"10.1007","volume":"49","author":[{"given":"Andrew","family":"Suk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,6]]},"reference":[{"key":"9481_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"PK Agarwal","year":"1998","unstructured":"Agarwal, P.K., van Kreveld, M., Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geom. Theory Appl. 11, 209\u2013218 (1998)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9481_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method, 3rd edn","author":"N Alon","year":"2008","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 3rd edn. Wiley, New York (2008)"},{"key":"9481_CR3","doi-asserted-by":"crossref","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 4, 310\u2013323 (1983)","journal-title":"J. Algorithms"},{"key":"9481_CR4","volume-title":"Research Problems in Discrete Geometry","author":"P Brass","year":"2005","unstructured":"Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, Berlin (2005)"},{"key":"9481_CR5","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF02187743","volume":"4","author":"B Chazelle","year":"1989","unstructured":"Chazelle, B., Welzl, E.: Quasi-optimal range searching in spaces of finite VC-dimension. Discrete Comput. Geom. 4, 467\u2013489 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"9481_CR6","doi-asserted-by":"crossref","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. Comb. Theory B 21, 8\u201320 (1979)","journal-title":"J. Comb. Theory B"},{"key":"9481_CR7","doi-asserted-by":"crossref","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. 25, 37\u201352 (1989)","journal-title":"Discrete Appl. Math."},{"key":"9481_CR8","doi-asserted-by":"crossref","unstructured":"Fox, J., Pach, J.: Coloring $$K_k$$ -free intersection graphs of geometric objects in the plane. Eur. J. Combin. 33, 853\u2013866 (2012). A preliminary version appeared in Proceedings of the 24th ACM Symposium on Computational Geometry, pp. 346\u2013354 (2008)","DOI":"10.1016\/j.ejc.2011.09.021"},{"key":"9481_CR9","doi-asserted-by":"crossref","unstructured":"Fox, J., Pach, J.: Computing the independence number of intersection graphs. In: SODA, pp. 1161\u20131165 (2011)","DOI":"10.1137\/1.9781611973082.87"},{"key":"9481_CR10","doi-asserted-by":"crossref","unstructured":"Fox, J., Sudakov, B.: Density theorems for bipartite graphs and related Ramsey-type results. Combinatorica 29, 153\u2013196 (2009)","DOI":"10.1007\/s00493-009-2475-5"},{"key":"9481_CR11","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inform. Process. Lett. 12, 133\u2013137 (1981)"},{"key":"9481_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR 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":"9481_CR13","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32, 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"9481_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-03942-3","volume-title":"Geometric Discrepancy: An Illustrated Guide Algorithms and Combinatorics, vol. 18","author":"J Matousek","year":"1999","unstructured":"Matousek, J.: Geometric Discrepancy: An Illustrated Guide Algorithms and Combinatorics, vol. 18. Springer, Berlin (1999)"},{"key":"9481_CR15","doi-asserted-by":"crossref","unstructured":"Pach, J.: Notes on geometric graph theory. In: Goodman, J.E., et al. (eds.) Discrete and Computational Geometry. DIMACS Series, vol. 6, pp. 273\u2013285. AMS, Providence (1991)","DOI":"10.1090\/dimacs\/006\/19"},{"key":"9481_CR16","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s00454-003-0012-9","volume":"30","author":"J Pach","year":"2003","unstructured":"Pach, J., Solymosi, J., T\u00f3th, G.: Unavoidable configurations in complete topological graphs. Discrete Comput. Geom. 30, 311\u2013320 (2003)","journal-title":"Discrete Comput. Geom."},{"key":"9481_CR17","doi-asserted-by":"crossref","unstructured":"Pach, J., T\u00f3th, G.: Disjoint edges in topological graphs. In: Akiyama, J., et al. (eds.) Combinatorial Geometry and Graph Theory. Lecture Notes in Computer Science, vol. 3330, pp. 133\u2013140. Springer, Berlin (2005)","DOI":"10.1007\/978-3-540-30540-8_15"},{"key":"9481_CR18","doi-asserted-by":"crossref","unstructured":"T\u00f3th, G.: Personal Communcation (2012)","DOI":"10.3998\/ark.5550190.0013.515"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9481-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-012-9481-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9481-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T14:45:28Z","timestamp":1643813128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-012-9481-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,6]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["9481"],"URL":"https:\/\/doi.org\/10.1007\/s00454-012-9481-x","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,6]]}}}