{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:30:23Z","timestamp":1725489023989},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433095"},{"type":"electronic","value":"9783540458487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45848-4_21","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T10:47:53Z","timestamp":1186829273000},"page":"261-271","source":"Crossref","is-referenced-by-count":1,"title":["On Intersection Graphs of Segments with Prescribed Slopes"],"prefix":"10.1007","author":[{"given":"Jakub","family":"\u010cern\u00fd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Kr\u00e1l","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helena","family":"Nyklov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"Pangr\u00e1c","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,21]]},"reference":[{"key":"21_CR1","first-page":"9","volume":"1","author":"T. Asano","year":"1991","unstructured":"T. Asano: Difficulty of the maximum independent set problem on intersection graphs of geometric objects, Graph theory, combinatorics and applications, vol.1, Wiley-Intersci.Publ., 1991, pp.9\u201318.","journal-title":"Graph theory, combinatorics and applications"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF02579301","volume":"7","author":"A. Bouchet","year":"1987","unstructured":"A. Bouchet: Reducing prime graphs and recognizing circle graphs, Combinatorica 7, 1987, pp.243\u2013254.","journal-title":"Combinatorica"},{"key":"21_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/3-540-46648-7_35","volume-title":"Graph drawing","author":"N. Castro de","year":"1999","unstructured":"N.de Castro, F.J. Cobos, J.C. Dana, A. Marquez, M. Noy: Triangle-free planar graphs as segments intersection graphs, J. Krato chvil (ed.), Graph drawing, 7th international symposium, \u0160ti\u0159\u00fdn Castle, Czech Republic, proceedings, Springer LNCS 1731, 1999, pp.341\u2013350."},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0095-8956(76)90022-8","volume":"21","author":"G. Ehrlich","year":"1976","unstructured":"G. Ehrlich, S. Even, R.E. Tarjan: Intersection graphs of curves in the plane, J. Combinatorial Theory Ser.B 21, 1976, no.1, 8\u201320.","journal-title":"J. Combinatorial Theory Ser.B"},{"key":"21_CR5","first-page":"811","volume":"286A","author":"J. C. Fournier","year":"1978","unstructured":"J. C. Fournier: Une caracterization des graphes de cordes, C.R. Acad. Sci. Paris 286A, 1978, pp.811\u2013813.","journal-title":"C.R. Acad. Sci."},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0195-6698(84)80005-0","volume":"5","author":"H. Fraysseix de","year":"1984","unstructured":"H. de Fraysseix: A characterization of circle graphs, European Journal of Combinatorics 5, 1984, pp.223\u2013238.","journal-title":"European Journal of Combinatorics"},{"key":"21_CR7","first-page":"109","volume":"63","author":"H. Fraysseix de","year":"1991","unstructured":"H.de Fraysseix, P. Ossona de Mendez, J. Pach: Representation of planar graphs by segments, Intuitive Geometry 63, 1991, pp.109\u2013117.","journal-title":"Intuitive Geometry"},{"key":"21_CR8","unstructured":"M. Goljan, J. Kratochv\u00edl, P. Ku\u010dera: String graphs, Academia, Prague 1986."},{"issue":"1","key":"21_CR9","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":"I. B.-A. Hartman, I. Newman, R. Ziv: On grid intersection graphs, Discrete Math. 87, 1991, no.1, pp.41\u201352.","journal-title":"Discrete Math."},{"key":"21_CR10","unstructured":"V. B. Kalinin: On intersection graphs, Algorithmic constructions and their efficiency (in Russian), Yaroslav. Gos. Univ., 1983, pp.72\u201376."},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0012-365X(87)90126-9","volume":"66","author":"S. Klav\u017ear","year":"1987","unstructured":"S. Klav\u017ear, M. Petkov\u0161ek: Intersection graphs of halflines and halfplanes, Discrete Math. 66, 1987, no.1\u20132, pp.133\u2013137.","journal-title":"Discrete Math."},{"key":"21_CR12","unstructured":"J. Kratochv\u00edl: personal comunication."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J. Kratochv\u00edl","year":"1994","unstructured":"J. Kratochv\u00edl, J. Matou\u0161ek: Intersection Graphs of Segments, Journal of Combinatorial Theory, Series B, Vol.62, No.2, 1994, pp.289\u2013315.","journal-title":"Journal of Combinatorial Theory"},{"key":"21_CR14","first-page":"761","volume":"30","author":"J. Kratochv\u00edl","year":"1989","unstructured":"J. Kratochv\u00edl, J. Matou\u0161ek: NP-hardness results for intersection graphs, Comment. Math.Univ.Carolin. 30, 1989, pp.761\u2013773.","journal-title":"Comment. Math.Univ.Carolin."},{"key":"21_CR15","first-page":"85","volume":"31","author":"J. Kratochv\u00edl","year":"1990","unstructured":"J. Kratochv\u00edl, J. Ne\u0161et\u0159il: Independent set and clique problems in intersection defined classes of graphs, Comment.Math.Univ. Carolin. 31, 1990, pp.85\u201393.","journal-title":"Comment.Math.Univ. Carolin."},{"key":"21_CR16","first-page":"211","volume":"31","author":"A. C. Tucker","year":"1980","unstructured":"A. C. Tucker: An algorithm for circular-arc graphs, SIAM J.Computing 31.2, 1980, pp.211\u2013216.","journal-title":"SIAM J.Computing"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45848-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T07:28:01Z","timestamp":1550734081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45848-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433095","9783540458487"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45848-4_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}