{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T01:32:54Z","timestamp":1784424774694,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,17]],"date-time":"2013-06-17T00:00:00Z","timestamp":1371427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,17]]},"DOI":"10.1145\/2462356.2462394","type":"proceedings-article","created":{"date-parts":[[2014,1,7]],"date-time":"2014-01-07T17:18:46Z","timestamp":1389115126000},"page":"259-266","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Topological graphs"],"prefix":"10.1145","author":[{"given":"Radoslav","family":"Fulek","sequence":"first","affiliation":[{"name":"Charles University, Prague, Czech Rep"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andres J.","family":"Ruiz-Vargas","sequence":"additional","affiliation":[{"name":"Ecole Polytechnique Federale de Lausanne, Lausanne, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(98)00028-5"},{"issue":"4","key":"e_1_3_2_1_2_1","first-page":"323","article-title":"Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane","volume":"4","author":"Asano T.","year":"1983","unstructured":"T. Asano and H. Imai , Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane , J. Algorithms 4 ( 4 ) ( 1983 ), 310?- 323 . T. Asano and H. Imai, Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane, J. Algorithms 4 (4) (1983), 310?-323.","journal-title":"J. Algorithms"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1556\/SScMath.41.2004.2.4"},{"key":"e_1_3_2_1_4_1","volume-title":"Research Problems in Discrete Geometry","author":"Brass P.","year":"2005","unstructured":"P. Brass , W. Moser , and J. Pach , Research Problems in Discrete Geometry . Springer , New York , 2005 . P. Brass, W. Moser, and J. Pach, Research Problems in Discrete Geometry. Springer, New York, 2005."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187743"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702431840"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90111-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-009-2475-5"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-007-9018-x"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00098-3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214106"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1983-077-8"},{"key":"e_1_3_2_1_13_1","first-page":"85","article-title":"Independent set and clique problems in intersection-defined classes of graphs","volume":"31","author":"Kratochv\u00edl J.","year":"1990","unstructured":"J. Kratochv\u00edl and J. Ne?etril , Independent set and clique problems in intersection-defined classes of graphs , Commentationes Mathematicae Universitatis Carolinae 31 ( 1990 ), 85 -?93. J. Kratochv\u00edl and J. Ne?etril, Independent set and clique problems in intersection-defined classes of graphs, Commentationes Mathematicae Universitatis Carolinae 31 (1990), 85-?93.","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-003-0012-9"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30540-8_15"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2005.03.007"},{"key":"e_1_3_2_1_17_1","volume-title":"Efficient Graph Representations. AMS","author":"Spinrad J. P.","year":"2003","unstructured":"J. P. Spinrad , Efficient Graph Representations. AMS , 2003 . J. P. Spinrad, Efficient Graph Representations. AMS, 2003."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36763-2_32"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2261250.2261308"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1999.3001"},{"key":"e_1_3_2_1_21_1","first-page":"21","volume-title":"Proc. 23rd Annual Canadian Conference on Computational Geometry, CCCG","author":"Vogtenhuber B.","year":"2011","unstructured":"B. Vogtenhuber , O. Aichholzer , R. F. Monroy , C. Huemer , J. Urrutia , M. A. Heredia , H. Gonz\u00e1lez-Aguilar , T. Hackl , and P. Valtr , On k-gons and k-holes in point sets , in: Proc. 23rd Annual Canadian Conference on Computational Geometry, CCCG , 2011 , pp. 21 -?26. B. Vogtenhuber, O. Aichholzer, R. F. Monroy, C. Huemer, J. Urrutia, M. A. Heredia, H. Gonz\u00e1lez-Aguilar, T. Hackl, and P. Valtr, On k-gons and k-holes in point sets, in: Proc. 23rd Annual Canadian Conference on Computational Geometry, CCCG, 2011, pp. 21-?26."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2007.v003a006"}],"event":{"name":"SoCG '13: Symposium on Computational Geometry 2013","location":"Rio de Janeiro Brazil","acronym":"SoCG '13","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the twenty-ninth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2462356.2462394","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2462356.2462394","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:29Z","timestamp":1750234709000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2462356.2462394"}},"subtitle":["empty triangles and disjoint matchings"],"short-title":[],"issued":{"date-parts":[[2013,6,17]]},"references-count":22,"alternative-id":["10.1145\/2462356.2462394","10.1145\/2462356"],"URL":"https:\/\/doi.org\/10.1145\/2462356.2462394","relation":{},"subject":[],"published":{"date-parts":[[2013,6,17]]},"assertion":[{"value":"2013-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}