{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:49Z","timestamp":1725457009800},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642352607"},{"type":"electronic","value":"9783642352614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35261-4_64","type":"book-chapter","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T01:59:41Z","timestamp":1355450381000},"page":"619-628","source":"Crossref","is-referenced-by-count":2,"title":["Beyond Homothetic Polygons: Recognition and Maximum Clique"],"prefix":"10.1007","author":[{"given":"Konstanty","family":"Junosza-Szaniawski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Pergel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"64_CR1","unstructured":"Badent, M., Binucci, C., Di Giacomo, E., Didimo, W., Felsner, S., Giordano, F., Kratochv\u00edl, J., Palladino, P., Patrignani, M., Trotta, F.: Homothetic Triangle Contact Representations of Planar Graphs. In: Proc. CCCG 2007, pp. 233\u2013236 (2007)"},{"key":"64_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-642-33090-2_22","volume-title":"Algorithms \u2013 ESA 2012","author":"S. Cabello","year":"2012","unstructured":"Cabello, S., Cardinal, J., Langerman, S.: The Clique Problem in Ray Intersection Graphs. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 241\u2013252. Springer, Heidelberg (2012)"},{"key":"64_CR3","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1137\/S0895480100373455","volume":"23","author":"D.G. Corneil","year":"2009","unstructured":"Corneil, D.G., Olariu, O., Stewart, L.: The LBFS Structure and Recognition of Interval Graphs. SIAM J. Discrete Math.\u00a023, 1905\u20131953 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"64_CR4","doi-asserted-by":"publisher","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","volume":"16","author":"P.C. Gilmore","year":"1964","unstructured":"Gilmore, P.C., Hoffman, A.J.: A characterization of comparability graphs and of interval graphs. Can. J. Math.\u00a016, 539\u2013548 (1964)","journal-title":"Can. J. Math."},{"key":"64_CR5","doi-asserted-by":"crossref","unstructured":"Golumbic, M.: Algorithmic Graph Theory and Perfect Graphs. Acad. Press (1980)","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"64_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0012-365X(00)00204-1","volume":"229","author":"P. Hlin\u011bn\u00fd","year":"2001","unstructured":"Hlin\u011bn\u00fd, P., Kratochv\u00edl, J.: Representing graphs by disks and balls (a survey of recognition-complexity results). Discrete Mathematics\u00a0229, 101\u2013124 (2001)","journal-title":"Discrete Mathematics"},{"key":"64_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On GeneraLemmating All Maximal Independent Sets. Information Processing Letters\u00a027, 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"key":"64_CR8","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Kratochv\u00edl, J., Lehmann, K., Subramanian, A.: Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. In: Proc. SODA 2006, pp. 832\u2013841 (2006)","DOI":"10.1145\/1109557.1109649"},{"key":"64_CR9","doi-asserted-by":"crossref","first-page":"52","DOI":"10.37236\/1805","volume":"11","author":"S.-J. Kim","year":"2004","unstructured":"Kim, S.-J., Kostochka, A., Nakprasit, K.: On the chromatic number of intersection graphs of convex sets in the plane. Electronic J. of Combinatorics\u00a011, #R52 (2004)","journal-title":"Electronic J. of Combinatorics"},{"key":"64_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(94)90143-0","volume":"52","author":"J. Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J.: A special planar satisfiability problem and a consequence of its NP-completeness. Discrete Applied Mathematics\u00a052, 233\u2013252 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"64_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-62495-3_53","volume-title":"Graph Drawing","author":"J. Kratochv\u00edl","year":"1997","unstructured":"Kratochv\u00edl, J.: Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane. In: North, S.C. (ed.) GD 1996. LNCS, vol.\u00a01190, pp. 257\u2013270. Springer, Heidelberg (1997)"},{"key":"64_CR12","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 Mathematics\u00a0178, 251\u2013255 (1998)","journal-title":"Discrete Mathematics"},{"key":"64_CR13","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. Journal of Combinatorial Theory, Series B\u00a062, 289\u2013315 (1994)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"64_CR14","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. Comm. Math. Uni. Car.\u00a031, 85\u201393 (1990)","journal-title":"Comm. Math. Uni. Car."},{"key":"64_CR15","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.endm.2008.06.056","volume":"31","author":"J. Kratochv\u00edl","year":"2008","unstructured":"Kratochv\u00edl, J., Pergel, M.: Intersection graphs of homothetic polygons. Electronic Notes in Discrete Mathematics\u00a031, 277\u2013280 (2008)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"64_CR16","doi-asserted-by":"crossref","unstructured":"M\u00fcller, T., van Leeuwen, E.J., van Leeuwen, J.: Integer representations of convex polygon intersection graphs. In: Symposium on Comput. Geometry, pp. 300\u2013307 (2011)","DOI":"10.1145\/1998196.1998248"},{"key":"64_CR17","unstructured":"Pergel, M.: Special graph classes and algorithms on them. Ph.D.-thesis, Charles University (2008)"},{"key":"64_CR18","series-title":"Fields Institute Monographs 19","volume-title":"Efficient Graph Representations","author":"J. Spinrad","year":"2003","unstructured":"Spinrad, J.: Efficient Graph Representations. Fields Institute Monographs 19. American Mathematical Society, Providence (2003)"},{"key":"64_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-642-18469-7_35","volume-title":"Graph Drawing","author":"E.J. Leeuwen van","year":"2011","unstructured":"van Leeuwen, E.J., van Leeuwen, J.: Convex Polygon Intersection Graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol.\u00a06502, pp. 377\u2013388. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35261-4_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T19:23:34Z","timestamp":1595100214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35261-4_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642352607","9783642352614"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35261-4_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}