{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:45:18Z","timestamp":1767339918633},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540624950"},{"type":"electronic","value":"9783540680482"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62495-3_53","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:38:38Z","timestamp":1330295918000},"page":"257-270","source":"Crossref","is-referenced-by-count":14,"title":["Intersection graphs of noncrossing arc-connected sets in the plane"],"prefix":"10.1007","author":[{"given":"Jan","family":"Kratochv\u00edl","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"issue":"1-3","key":"21_CR1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0012-365X(93)90354-V","volume":"114","author":"S. Bellantoni","year":"1993","unstructured":"Bellantoni,S., Ben-Arroyo Hartman,I., Przytycka,T., Whitesides,S.: Grid intersection graphs and boxicity, Discrete Appl. Math. (1994), 41\u201349","journal-title":"Discrete Mathematics"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science 1027","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BFb0021793","volume-title":"Graph Drawing","author":"H. Breu","year":"1996","unstructured":"Breu, H., Kirkpatrick, D.: On the complexity of recognizing intersection and touching graphs of disks, In: Graph Drawing (F.J.Brandenburg ed.), Proceedings Graph Drawing '95, Passau, September 1995, Lecture Notes in Computer Science 1027, Springer Verlag, Berlin Heidelberg, 1996, pp. 88\u201398"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science 1027","first-page":"140","volume-title":"Graph Drawing","author":"M. Chandramouli","year":"1995","unstructured":"Chandramouli, M., Diwan, A.A.: Upward numbering testing for triconnected graphs, In: Graph Drawing (F.J.Brandenburg ed.), Proceedings Graph Drawing '95, Passau, September 1995, Lecture Notes in Computer Science 1027, Springer Verlag, Berlin Heidelberg, 1995, pp. 140\u2013151"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0095-8956(76)90022-8","volume":"21","author":"G. Eherlich","year":"1976","unstructured":"Eherlich, G., Even, S., Tarjan, R.E.: Intersection graphs of curves in the plane, J. Combin. Theory Ser. B 21 (1976), 8\u201320","journal-title":"J. Combin. Theory Ser. B"},{"key":"21_CR5","first-page":"109","volume":"63","author":"H. Fraysseix de","year":"1991","unstructured":"de Fraysseix, H., de Mendez, P.O., Pach, J.: Representation of planar graphs by segments, Intuitive Geometry, Colloquia Mathematica Societatos Janos Bolyai 63 (1991), 109\u2013117","journal-title":"Colloquia Mathematica Societatos Janos Bolyai"},{"key":"21_CR6","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability, W.H.Freeman and Co., 1978"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science 1027","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BFb0021814","volume-title":"Graph Drawing","author":"P. Hlin\u011bn\u00fd","year":"1996","unstructured":"P.Hlin\u011bn\u00fd: Contact graphs of curves, In: Graph Drawing (P.J.Brandenburg ed.), Proceedings Graph Drawing '95, Passau, September 1995, Lecture Notes in Computer Science 1027, Springer Verlag, Berlin Heidelberg, 1996, pp. 312\u2013323"},{"key":"21_CR8","first-page":"141","volume":"88","author":"P. Koebe","year":"1936","unstructured":"Koebe,P.: Kontaktprobleme den konformen Abbildung, Berichte \u00fcber die Verhandlungen der S\u00e4chsischen Akademie der Wissenschaften, Leipzig, Math.-Physische Klasse 88 (1936), 141\u2013164","journal-title":"Leipzig, Math.-Physische Klasse"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0095-8956(91)90090-7","volume":"52","author":"J. Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl,J.: String graphs I. There are infinitely many critical nonstring graphs, J. Combin. Theory Ser. B 52 (1991), 53\u201366","journal-title":"J. Combin. Theory Ser. B"},{"key":"21_CR10","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 (1991), 67\u201378","journal-title":"J. Combin. Theory Ser. B"},{"key":"21_CR11","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 some consequences of its NP-completeness, Discrete Appl. Math. 52 (1994), 233\u2013252","journal-title":"Discrete Appl. Math."},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0097-3165(94)90109-0","volume":"68","author":"J. Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl,J., Matou\u0161ek,J.: Intersection graphs of segments, J. Combin. Th. Ser. B 68 (1994), 317\u2013339","journal-title":"J. Combin. Th. Ser. B"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Kratochv\u00edl,J.: Intersection graphs of noncrossing arc-connected sets in the plane (technical report), KAM Series, Charles University, 1996.","DOI":"10.1007\/3-540-62495-3_53"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BFb0021820","volume-title":"Graph Drawing","author":"J. Kratochv\u00edl","year":"1996","unstructured":"Kratochv\u00edl,J., Przytycka, T.:Grid intersection and box intersection graphs on surfaces (extended abstract) In: Graph Drawing (F.J.Brandenburg ed.), Proceedings Graph Drawing '95, Passau, September 1995, Lecture Notes in Computer Science 1027, Springer Verlag, Berlin Heidelberg, 1996, pp. 365\u2013372"},{"key":"21_CR15","first-page":"301","volume-title":"Recent Progress in Combinatorics","author":"F.S. Roberts","year":"1969","unstructured":"Roberts,F.S.: On the boxicity and cubicity of a graph, In: W.T. Tutte, ed., Recent Progress in Combinatorics, Academic Press, New York, 1969, pp. 301\u2013310"},{"issue":"9","key":"21_CR16","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1002\/j.1538-7305.1966.tb01713.x","volume":"45","author":"F. W. Sinden","year":"1966","unstructured":"Sinden,F.W.: Topology of thin film RC-circuits, Bell System Tech. J. (1966), 1639\u20131662","journal-title":"Bell System Technical Journal"},{"key":"21_CR17","unstructured":"Wood,D.: The riches of rectangles, in: Proceedings 5th International Meeting of Young Computer Scientists, Smolenice, 1988, 67\u201375"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62495-3_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:12:54Z","timestamp":1605647574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62495-3_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540624950","9783540680482"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-62495-3_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}