{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T07:13:52Z","timestamp":1765610032389,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Swiss National Science Foundation grant","award":["200021-165977","200020-162884"],"award-info":[{"award-number":["200021-165977","200020-162884"]}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["Z 342-N31"],"award-info":[{"award-number":["Z 342-N31"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003443","name":"Ministry of Education and Science of the Russian Federation","doi-asserted-by":"crossref","award":["075-15-2019-1926"],"award-info":[{"award-number":["075-15-2019-1926"]}],"id":[{"id":"10.13039\/501100003443","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00454-020-00213-z","type":"journal-article","created":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T16:03:50Z","timestamp":1591373030000},"page":"888-917","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Almost All String Graphs are Intersection Graphs of Plane Convex Sets"],"prefix":"10.1007","volume":"63","author":[{"given":"J\u00e1nos","family":"Pach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce","family":"Reed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6467-3437","authenticated-orcid":false,"given":"Yelena","family":"Yuditsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,5]]},"reference":[{"issue":"2","key":"213_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1515\/dma.1993.3.2.191","volume":"3","author":"VE Alekseev","year":"1993","unstructured":"Alekseev, V.E.: On the entropy values of hereditary classes of graphs. Discret. Math. Appl. 3(2), 191\u2013199 (1993)","journal-title":"Discret. Math. Appl."},{"issue":"2","key":"213_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jctb.2010.10.001","volume":"101","author":"N Alon","year":"2011","unstructured":"Alon, N., Balogh, J., Bollob\u00e1s, B., Morris, R.: The structure of almost all graphs in a hereditary property. J. Combin. Theory Ser. B 101(2), 85\u2013110 (2011)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"213_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jctb.2003.08.001","volume":"91","author":"J Balogh","year":"2004","unstructured":"Balogh, J., Bollob\u00e1s, B., Simonovits, M.: The number of graphs without forbidden subgraphs. J. Combin. Theory Ser. B 91(1), 1\u201324 (2004)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"213_CR4","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/rsa.20242","volume":"34","author":"J Balogh","year":"2009","unstructured":"Balogh, J., Bollob\u00e1s, B., Simonovits, M.: The typical structure of graphs without given excluded subgraphs. Random Struct. Algorithms 34(3), 305\u2013318 (2009)","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"213_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.jctb.2010.11.001","volume":"101","author":"J Balogh","year":"2011","unstructured":"Balogh, J., Bollob\u00e1s, B., Simonovits, M.: The fine structure of octahedron-free graphs. J. Combin. Theory Ser. B 101(2), 67\u201384 (2011)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1\u20132","key":"213_CR6","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1002\/rsa.20353","volume":"38","author":"J Balogh","year":"2011","unstructured":"Balogh, J., Butterfield, J.: Excluding induced subgraphs: critical graphs. Random Struct. Algorithms 38(1\u20132), 100\u2013120 (2011)","journal-title":"Random Struct. Algorithms"},{"issue":"11","key":"213_CR7","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1073\/pnas.45.11.1607","volume":"45","author":"S Benzer","year":"1959","unstructured":"Benzer, S.: On the topology of the genetic fine structure. Proc. Natl Acad. Sci. U.S.A. 45(11), 1607\u20131620 (1959)","journal-title":"Proc. Natl Acad. Sci. U.S.A."},{"issue":"5","key":"213_CR8","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1112\/blms\/27.5.417","volume":"27","author":"B Bollob\u00e1s","year":"1995","unstructured":"Bollob\u00e1s, B., Thomason, A.: Projections of bodies and hereditary properties of hypergraphs. Bull. Lond. Math. Soc. 27(5), 417\u2013424 (1995)","journal-title":"Bull. Lond. Math. Soc."},{"key":"213_CR9","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Thomason, A.: Hereditary and monotone properties of graphs. In: The Mathematics of Paul Erd\u0151s, vol. 2. Algorithms and Combinatorics, vol. 14, pp. 70\u201378. Springer, Berlin (1997)","DOI":"10.1007\/978-3-642-60406-5_7"},{"key":"213_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.4064\/fm-23-1-135-142","volume":"23","author":"Ch Chojnacki","year":"1934","unstructured":"Chojnacki, Ch.: \u00dcber wesentlich unpl\u00e4ttbare Kurven im dreidimensionalen Raume. Fund. Math. 23, 135\u2013142 (1934)","journal-title":"Fund. Math."},{"issue":"2","key":"213_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01788085","volume":"2","author":"P Erd\u0151s","year":"1986","unstructured":"Erd\u0151s, P., Frankl, P., R\u00f6dl, V.: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. Graphs Combin. 2(2), 113\u2013121 (1986)","journal-title":"Graphs Combin."},{"key":"213_CR12","unstructured":"Erd\u0151s, P., Kleitman, D.J., Rothschild, B.L.: Asymptotic enumeration of $$K_{n}$$-free graphs. In: Colloquio Internazionale sulle Teorie Combinatorie (Rome 1973), vol. 2. Atti dei Convegni Lincei, vol. 17, pp. 19\u201327. Accad. Naz. Lincei, Rome (1976)"},{"issue":"4","key":"213_CR13","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1002\/jgt.22031","volume":"84","author":"S Janson","year":"2017","unstructured":"Janson, S., Uzzell, A.J.: On string graph limits and the structure of a typical string graph. J. Graph Theory 84(4), 386\u2013407 (2017)","journal-title":"J. Graph Theory"},{"key":"213_CR14","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.jctb.2018.02.002","volume":"131","author":"J Kim","year":"2018","unstructured":"Kim, J., K\u00fchn, D., Osthus, D., Townsend, T.: Forbidding induced even cycles in a graph: typical structure and counting. J. Combin. Theory Ser. B 131, 170\u2013219 (2018)","journal-title":"J. Combin. Theory Ser. B"},{"key":"213_CR15","first-page":"141","volume":"88","author":"P Koebe","year":"1936","unstructured":"Koebe, P.: Kontaktprobleme der konformen Abbildung. Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig, Mathematisch-Physische Kl. 88, 141\u2013164 (1936)","journal-title":"Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften zu Leipzig, Mathematisch-Physische Kl."},{"issue":"1","key":"213_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(91)90091-W","volume":"52","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. II. Recognizing string graphs is NP-hard. J. Combin. Theory Ser. B 52(1), 67\u201378 (1991)","journal-title":"J. Combin. Theory Ser. B"},{"key":"213_CR17","doi-asserted-by":"crossref","unstructured":"Kratochv\u00edl, J., Kub\u011bna, A.: On intersection representations of co-planar graphs. Discret. Math. 178(1\u20133), 251\u2013255 (1998)","DOI":"10.1016\/S0012-365X(97)81834-1"},{"issue":"1","key":"213_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(91)90050-T","volume":"53","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: String graphs requiring exponential representations. J. Combin. Theory Ser. B 53(1), 1\u20134 (1991)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"5","key":"213_CR19","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s00493-006-0032-z","volume":"26","author":"J Pach","year":"2006","unstructured":"Pach, J., T\u00f3th, G.: How many ways can one draw a graph? Combinatorica 26(5), 559\u2013576 (2006)","journal-title":"Combinatorica"},{"issue":"1","key":"213_CR20","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/rsa.3240020106","volume":"2","author":"HJ Pr\u00f6mel","year":"1991","unstructured":"Pr\u00f6mel, H.J., Steger, A.: Excluding induced subgraphs: quadrilaterals. Random Struct. Algorithms 2(1), 55\u201371 (1991)","journal-title":"Random Struct. Algorithms"},{"issue":"1","key":"213_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1017\/S0963548300000079","volume":"1","author":"HJ Pr\u00f6mel","year":"1992","unstructured":"Pr\u00f6mel, H.J., Steger, A.: Almost all Berge graphs are perfect. Combin. Probab. Comput. 1(1), 53\u201379 (1992)","journal-title":"Combin. Probab. Comput."},{"issue":"1","key":"213_CR22","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/rsa.3240030104","volume":"3","author":"HJ Pr\u00f6mel","year":"1992","unstructured":"Pr\u00f6mel, H.J., Steger, A.: Excluding induced subgraphs III: a general asymptotic. Random Struct. Algorithms 3(1), 19\u201331 (1992)","journal-title":"Random Struct. Algorithms"},{"key":"213_CR23","doi-asserted-by":"crossref","unstructured":"Pr\u00f6mel, H.J., Steger, A.: Excluding induced subgraphs II: extremal graphs. Discret. Appl. Math. 44(1\u20133), 283\u2013294 (1993)","DOI":"10.1016\/0166-218X(93)90237-I"},{"key":"213_CR24","unstructured":"Reed, B., Scott, A.: The typical structure of an $$H$$-free graph when $$H$$ is a cycle. Manuscript"},{"key":"213_CR25","unstructured":"Reed, B., Yuditsky, Y.: The typical structure of $$H$$-free graphs for $$H$$ a tree. Manuscript"},{"issue":"2","key":"213_CR26","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0022-0000(03)00045-X","volume":"67","author":"M Schaefer","year":"2003","unstructured":"Schaefer, M., Sedgwick, E., \u0160tefankovi\u010d, D.: Recognizing string graphs in NP. J. Comput. Syst. Sci. 67(2), 365\u2013380 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"213_CR27","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.jcss.2003.07.002","volume":"68","author":"M Schaefer","year":"2004","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: Decidability of string graphs. J. Comput. Syst. Sci. 68(2), 319\u2013334 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"9","key":"213_CR28","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1002\/j.1538-7305.1966.tb01713.x","volume":"45","author":"FW Sinden","year":"1966","unstructured":"Sinden, F.W.: Topology of thin film RC circuits. Bell Syst. Technol. J. 45(9), 1639\u20131662 (1966)","journal-title":"Bell Syst. Technol. J."},{"key":"213_CR29","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0021-9800(70)80007-2","volume":"8","author":"WT Tutte","year":"1970","unstructured":"Tutte, W.T.: Toward a theory of crossing numbers. J. Combin. Theory 8, 45\u201353 (1970)","journal-title":"J. Combin. Theory"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-020-00213-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-020-00213-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-020-00213-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,4]],"date-time":"2021-06-04T23:35:43Z","timestamp":1622849743000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-020-00213-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["213"],"URL":"https:\/\/doi.org\/10.1007\/s00454-020-00213-z","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2020,6]]},"assertion":[{"value":"28 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}