{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T12:10:05Z","timestamp":1744027805478,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_22","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"241-252","source":"Crossref","is-referenced-by-count":6,"title":["The Clique Problem in Ray Intersection Graphs"],"prefix":"10.1007","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","reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.comgeo.2005.12.001","volume":"34","author":"P.K. Agarwal","year":"2006","unstructured":"Agarwal, P.K., Mustafa, N.H.: Independent set of intersection graphs of convex objects in 2D. Computational Geometry\u00a034(2), 83\u201395 (2006)","journal-title":"Computational Geometry"},{"issue":"3","key":"22_CR2","doi-asserted-by":"publisher","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.\u00a038(3), 279\u2013292 (2005)","journal-title":"Theory Comput. Syst."},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Bang-Jensen, J., Reed, B., Schacht, M., S\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.\u00a026, pp. 613\u2013627. Springer (2006)","DOI":"10.1007\/3-540-33700-8_30"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Gon\u00e7alves, D.: Every planar graph is the intersection graph of segments in the plane. In: STOC, pp. 631\u2013638 (2009)","DOI":"10.1145\/1536414.1536500"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-45022-X_2","volume-title":"Automata, Languages and Programming","author":"L. Engebretsen","year":"2000","unstructured":"Engebretsen, L., Holmerin, J.: Clique Is Hard to Approximate within n 1\u2009\u2212\u2009o(1). In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 2\u201312. Springer, Heidelberg (2000)"},{"key":"22_CR6","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"},{"issue":"10","key":"22_CR7","doi-asserted-by":"publisher","first-page":"1815","DOI":"10.1016\/j.disc.2012.01.024","volume":"312","author":"M.C. Francis","year":"2012","unstructured":"Francis, M.C., Kratochv\u00edl, J., Vyskocil, T.: Segment representation of a subclass of co-planar graphs. Discrete Mathematics\u00a0312(10), 1815\u20131818 (2012)","journal-title":"Discrete Mathematics"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M.R. Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The rectilinear steiner tree problem is NP-complete. SIAM J. Appl. Math.\u00a032, 826\u2013834 (1977)","journal-title":"SIAM J. Appl. Math."},{"issue":"1-3","key":"22_CR9","doi-asserted-by":"publisher","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.\u00a0178(1-3), 251\u2013255 (1998)","journal-title":"Discrete Math."},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","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\u00a062(2), 289\u2013315 (1994)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1","key":"22_CR11","first-page":"85","volume":"31","author":"J. Kratochv\u00edl","year":"1990","unstructured":"Kratochv\u00edl, J., Ne\u0161et\u0159il, J.: Independent set and clique problems in intersection-defined classes of graphs. Commentationes Mathematicae Universitatis Carolinae\u00a031(1), 85\u201393 (1990)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"issue":"1-3","key":"22_CR12","doi-asserted-by":"publisher","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.\u00a0108(1-3), 365\u2013372 (1992)","journal-title":"Discrete Math."},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n 1\u2009\u2212\u2009\u03b5 . In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS 1996), p. 627 (1996)","DOI":"10.1109\/SFCS.1996.548522"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T11:34:59Z","timestamp":1744025699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}