{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T09:27:40Z","timestamp":1774690060407,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,4]],"date-time":"2013-09-04T00:00:00Z","timestamp":1378252800000},"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,10]]},"DOI":"10.1007\/s00454-013-9538-5","type":"journal-article","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T13:48:06Z","timestamp":1378216086000},"page":"771-783","source":"Crossref","is-referenced-by-count":25,"title":["The Clique Problem in Ray Intersection Graphs"],"prefix":"10.1007","volume":"50","author":[{"given":"Sergio","family":"Cabello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Cardinal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Langerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,4]]},"reference":[{"issue":"2","key":"9538_CR1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.comgeo.2005.12.001","volume":"34","author":"PK Agarwal","year":"2006","unstructured":"Agarwal, P.K., Mustafa, N.H.: Independent set of intersection graphs of convex objects in 2D. Comput. Geom. 34(2), 83\u201395 (2006)","journal-title":"Comput. Geom."},{"issue":"3","key":"9538_CR2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s00224-005-1141-6","volume":"38","author":"C Amb\u00fchl","year":"2005","unstructured":"Amb\u00fchl, C., Wagner, U.: The clique problem in intersection graphs of ellipses and triangles. Theory Comput. Syst. 38(3), 279\u2013292 (2005)","journal-title":"Theory Comput. Syst."},{"key":"9538_CR3","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/3-540-33700-8_30","volume-title":"Topics in Discrete Mathematics. Algorithms and Combinatorics, vol. 26","author":"J Bang-Jensen","year":"2006","unstructured":"Bang-Jensen, J., Reed, B., Schacht, M., \u0160\u00e1mal, R., Toft, B., Wagner, U.: On six problems posed by Jarik Ne\u0161et\u0159il. In: Klazar, M., Kratochv\u00edl, J., Loebl, M., Matou\u0161ek, J., Thomas, R., Valtr, P. (eds.) Topics in Discrete Mathematics. Algorithms and Combinatorics, vol. 26, pp. 613\u2013627. Springer, Heidelberg (2006)"},{"key":"9538_CR4","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Gon\u00e7alves, D.: Every planar graph is the intersection graph of segments in the plane. In: 41st Annual ACM Symposium on Theory of Computing, STOC, pp. 631\u2013638. ACM, New York (2009)","DOI":"10.1145\/1536414.1536500"},{"key":"9538_CR5","doi-asserted-by":"crossref","unstructured":"Engebretsen, L., Holmerin, J.: Clique is hard to approximate within $$n^{1-o(1)}$$ n 1 - o ( 1 ) . In: Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP\u201900), pp. 2\u201312. Springer, Heidelberg (2000)","DOI":"10.1007\/3-540-45022-X_2"},{"key":"9538_CR6","doi-asserted-by":"crossref","unstructured":"Fox, J., Pach, J.: Computing the independence number of intersection graphs. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 1161\u20131165. SIAM, Philadelphia, PA (2011)","DOI":"10.1137\/1.9781611973082.87"},{"issue":"10","key":"9538_CR7","doi-asserted-by":"crossref","first-page":"1815","DOI":"10.1016\/j.disc.2012.01.024","volume":"312","author":"MC Francis","year":"2012","unstructured":"Francis, M.C., Kratochv\u00edl, J., Vysko\u010dil, T.: Segment representation of a subclass of co-planar graphs. Discrete Math. 312(10), 1815\u20131818 (2012)","journal-title":"Discrete Math."},{"key":"9538_CR8","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32, 826\u2013834 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"9538_CR9","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within $$n^{1-\\epsilon }$$ n 1 - \u03f5 . In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS\u201996), pp. 627\u2013636. IEEE Computer Society, Washington, DC (1996)"},{"issue":"1\u20133","key":"9538_CR10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0012-365X(97)81834-1","volume":"178","author":"J Kratochv\u00edl","year":"1998","unstructured":"Kratochv\u00edl, J., Kub\u011bna, A.: On intersection representations of co-planar graphs. Discrete Math. 178(1\u20133), 251\u2013255 (1998)","journal-title":"Discrete Math."},{"issue":"2","key":"9538_CR11","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. J. Comb. Theory Ser. B 62(2), 289\u2013315 (1994)","journal-title":"J. Comb. Theory Ser. B"},{"key":"9538_CR12","unstructured":"Kratochv\u00edl, J., Ne\u0161et\u0159il, J.: Independent set and clique problems in intersection-defined classes of graphs. Comment. Math. Univ. Carolinae. 31(1), 85\u201393 (1990)"},{"issue":"1\u20133","key":"9538_CR13","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0012-365X(92)90688-C","volume":"108","author":"M Middendorf","year":"1992","unstructured":"Middendorf, M., Pfeiffer, F.: The max clique problem in classes of string-graphs. Discrete Math. 108(1\u20133), 365\u2013372 (1992)","journal-title":"Discrete Math."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9538-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-013-9538-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9538-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T01:33:30Z","timestamp":1563845610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-013-9538-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,4]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9538"],"URL":"https:\/\/doi.org\/10.1007\/s00454-013-9538-5","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,4]]}}}