{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:54:13Z","timestamp":1725558853836},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245285"},{"type":"electronic","value":"9783540318439"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31843-9_23","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T16:54:14Z","timestamp":1278348854000},"page":"217-227","source":"Crossref","is-referenced-by-count":2,"title":["Contact and Intersection Representations"],"prefix":"10.1007","author":[{"given":"Hubert","family":"de Fraysseix","sequence":"first","affiliation":[]},{"given":"Patrice","family":"Ossona de Mendez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(98)00046-5","volume":"66","author":"J. Czyziwicz","year":"1998","unstructured":"Czyziwicz, J., Kranakis, E., Urrutia, J.: A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments. Information Processing Letters\u00a066, 125\u2013126 (1998)","journal-title":"Information Processing Letters"},{"issue":"1","key":"23_CR2","doi-asserted-by":"crossref","first-page":"7","DOI":"10.7155\/jgaa.00043","volume":"6","author":"N. Castro de","year":"2002","unstructured":"de Castro, N., Cobos, F.J., Dana, J.C., M\u00b4arquez, A.: Triangle-free planar graphs as segment intersection graphs. Journal of Graph Algorithms and Applications\u00a06(1), 7\u201326 (2002)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0012-365X(81)90255-7","volume":"33","author":"H. Fraysseix de","year":"1981","unstructured":"de Fraysseix, H.: Local complementation and interlacement graphs. Discrete Mathematics\u00a033, 29\u201335 (1981)","journal-title":"Discrete Mathematics"},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0195-6698(84)80005-0","volume":"5","author":"H. Fraysseix de","year":"1984","unstructured":"de Fraysseix, H.: A Characterization of Circle Graphs. European Journal of Combinatorics\u00a05, 223\u2013238 (1984)","journal-title":"European Journal of Combinatorics"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"de Fraysseix, H., Ossona de Mendez, P.: Intersection Graphs of Jordan Arcs. In: Contemporary Trends in Discrete Mathematics, DIMATIA-DIMACS,\u0160ti\u0159in 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a049, pp. 11\u201328 (1999)","DOI":"10.1090\/dimacs\/049\/02"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"de Fraysseix, H., Ossona de Mendez, P.: On a Characterization of Gauss Codes. Discrete and Computational Geometry\u00a02(2) (1999)","DOI":"10.1007\/PL00009461"},{"key":"23_CR7","unstructured":"de Fraysseix, H., Ossona de Mendez, P.: Barycentric systems and stretchability. Discrete Applied Mathematics (2004) (submited)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-540-24595-7_7","volume-title":"Graph Drawing","author":"H. Fraysseix de","year":"2004","unstructured":"de Fraysseix, H., Ossona de Mendez, P.: Stretching of Jordan arc contact systems. In: Liotta, G. (ed.) GD 2003. LNCS, vol.\u00a02912, pp. 71\u201385. Springer, Heidelberg (2004)"},{"key":"23_CR9","first-page":"109","volume":"63","author":"H. Fraysseix de","year":"1991","unstructured":"de Fraysseix, H., Ossona de Mendez, P., Pach, J.: Representation of planar graphs by segments. Intuitive Geometry\u00a063, 109\u2013117 (1991)","journal-title":"Intuitive Geometry"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0963548300001139","volume":"3","author":"H. Fraysseix de","year":"1994","unstructured":"de Fraysseix, H., Ossona de Mendez, P., Rosenstiehl, P.: On triangle contact graphs. Combinatorics, Probability and Computing\u00a03, 233\u2013246 (1994)","journal-title":"Combinatorics, Probability and Computing"},{"issue":"B","key":"23_CR11","first-page":"8","volume":"21","author":"G. Ehrlich","year":"1986","unstructured":"Ehrlich, G., Even, S., Tarjan, R.E.: Intersection graphs of curves in the plane. Journal of Combinatorial Theory\u00a021(B), 8\u201320 (1986)","journal-title":"Journal of Combinatorial Theory"},{"key":"23_CR12","unstructured":"Gauss, C.F.: Werke, pp. 272, pp. 282\u2013285. Teubner Leipzig (1900)"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0012-365X(91)90069-E","volume":"87","author":"I.B.-A. Hartman","year":"1991","unstructured":"Hartman, I.B.-A., Newman, I., Ziv, R.: On grid intersection graphs. Discrete Math.\u00a087, 41\u201352 (1991)","journal-title":"Discrete Math"},{"issue":"1-3","key":"23_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0012-365X(00)00263-6","volume":"235","author":"P. Hlin\u011bny","year":"2001","unstructured":"Hlin\u011bny, P.: Contact graphs of line segments are NP-complete. Discrete Mathematics\u00a0235(1-3), 95\u2013106 (2001)","journal-title":"Discrete Mathematics"},{"key":"23_CR15","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: the number of critical nonstring graphs is infinite. J. Combin. Theory Ser. B\u00a052, 53\u201366 (1991)","journal-title":"J. Combin. Theory Ser. B"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Kratochv\u00edl, J.: String graphs II: Recognizing string graphs is NP-hard. J. Combin. Theory Ser. B\u00a052 (1991b)","DOI":"10.1016\/0095-8956(91)90091-W"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(91)90050-T","volume":"52","author":"J. Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: String graphs requiring exponential representations. J. Combin. Theory Ser. B\u00a052, 1\u20134 (1991)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"B","key":"23_CR18","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\u00a062(B,2), 289\u2013315 (1994)","journal-title":"Journal of Combinatorial Theory"},{"key":"23_CR19","first-page":"335","volume":"32","author":"N.E. Mn\u00ebv","year":"1985","unstructured":"Mn\u00ebv, N.E.: On manifolds of combinatorial types of projective configurations and convex polyhedra. Soviet Math. Deokl.\u00a032, 335\u2013337 (1985)","journal-title":"Soviet Math. Deokl"},{"key":"23_CR20","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/BFb0082792","volume-title":"Topology and Geometry \u2013 Rohlin Seminar (Berlin)","author":"N.E. Mn\u00ebv","year":"1988","unstructured":"Mn\u00ebv, N.E.: The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. In: Viro, O.Y. (ed.) Topology and Geometry \u2013 Rohlin Seminar (Berlin). Lecture Notes in Mathematics, vol.\u00a01346, pp. 527\u2013544. Springer, Heidelberg (1988)"},{"issue":"2","key":"23_CR21","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1006\/jctb.2000.1978","volume":"80","author":"J. Pach","year":"2000","unstructured":"Pach, J., T\u00b4oth, G.: Which crossing number is it anyway? Journal of Combinatorial Theory, Ser. B\u00a080(2), 225\u2013246 (2000)","journal-title":"Journal of Combinatorial Theory, Ser. B"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Richter-Gebert, J.: Realization spaces of polytopes. Lecture Notes in Mathematics, vol.\u00a01643 (1996)","DOI":"10.1007\/BFb0093761"},{"issue":"1","key":"23_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/aama.1999.0643","volume":"23","author":"P. Rosenstiehl","year":"1999","unstructured":"Rosenstiehl, P.: A new proof of the Gauss interlace conjecture. Advances in Applied Mathematics\u00a023(1), 3\u201313 (1999)","journal-title":"Advances in Applied Mathematics"},{"issue":"2","key":"23_CR24","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. Journal of Computer and System Sciences\u00a067(2), 365\u2013380 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR25","unstructured":"Scheinerman, E.R.: Intersection classes and multiple intersection parameters of graphs, Ph.D. thesis, Princeton University (1984)"},{"key":"23_CR26","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1090\/dimacs\/004\/41","volume":"4","author":"P.W. Shor","year":"1991","unstructured":"Shor, P.W.: Stretchability of pseudolines is NP-hard. DIMACS Series in Discrete Mathematics and Theoretical Computer Science\u00a04, 531\u2013554 (1991)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Sinden, F.W.: Topology of thin RC-circuits. Bell System Tech. J., 1639\u20131662 (1966)","DOI":"10.1002\/j.1538-7305.1966.tb01713.x"},{"issue":"1","key":"23_CR28","first-page":"10","volume":"2","author":"D. West","year":"1999","unstructured":"West, D.: Opem problems. SIAM J. Discrete Math. Newslett.\u00a02(1), 10\u201312 (1999)","journal-title":"SIAM J. Discrete Math. Newslett."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31843-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:43:07Z","timestamp":1558280587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31843-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245285","9783540318439"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31843-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}