{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:11:42Z","timestamp":1725577902936},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_35","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T05:30:40Z","timestamp":1297315840000},"page":"377-388","source":"Crossref","is-referenced-by-count":4,"title":["Convex Polygon Intersection Graphs"],"prefix":"10.1007","author":[{"given":"Erik Jan","family":"van Leeuwen","sequence":"first","affiliation":[]},{"given":"Jan","family":"van Leeuwen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"H.: Breu, Algorithmic aspects of constrained unit disk graphs, PhD Thesis, The University of British Columbia, Vancouver (1996)"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H. Breu","year":"1998","unstructured":"Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Computational Geometry\u00a09, 3\u201324 (1998)","journal-title":"Computational Geometry"},{"issue":"2","key":"35_CR3","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0406017","volume":"6","author":"G.R. Brightwell","year":"1993","unstructured":"Brightwell, G.R., Scheinerman, E.R.: Representations of planar graphs. SIAM Journal of Discrete Mathematics\u00a06(2), 214\u2013229 (1993)","journal-title":"SIAM Journal of Discrete Mathematics"},{"issue":"4","key":"35_CR4","first-page":"429","volume":"13","author":"J. Czyzowicz","year":"2004","unstructured":"Czyzowicz, J., Kranakis, E., Krizanc, D., Urrutia, J.: Discrete realizations of contact and intersection graphs. Int. J. Pure and Applied Mathematics\u00a013(4), 429\u2013442 (2004)","journal-title":"Int. J. Pure and Applied Mathematics"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1137\/S0097539792269095","volume":"25","author":"X. Deng","year":"1996","unstructured":"Deng, X., Hell, P., Huang, J.: Linear time representation of proper circular arc graphs and proper interval graphs. SIAM Journal of Computing\u00a025, 390\u2013403 (1996)","journal-title":"SIAM Journal of Computing"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0196-6774(85)90039-2","volume":"6","author":"H. Edelsbrunner","year":"1985","unstructured":"Edelsbrunner, H.: Computing the extreme distances between two convex polygons. J. of Algorithms\u00a06, 213\u2013224 (1985)","journal-title":"J. of Algorithms"},{"key":"35_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542985","volume-title":"Tolerance graphs","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C., Trenk, A.N.: Tolerance graphs. Cambridge University Press, Cambridge (2004)"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.dam.2003.08.012","volume":"143","author":"R.B. Hayward","year":"2004","unstructured":"Hayward, R.B., Shamir, R.: A note on tolerance graph recognition. Discrete Applied Mathematics\u00a0143, 307\u2013311 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"35_CR9","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":"35_CR10","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Kratochv\u00edl, J., Lehmann, K.A., Subramanian, A.R.: Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. In: Proc. 17th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA 2006), pp. 832\u2013841 (2006)","DOI":"10.1145\/1109557.1109649"},{"issue":"3","key":"35_CR11","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1007\/BF01097528","volume":"61","author":"V.P. Kozyrev","year":"1992","unstructured":"Kozyrev, V.P., Yushmanov, S.V.: Representations of graphs and networks (codings, layouts and embeddings). Journal of Soviet Mathematics\u00a061(3), 2152\u20132194 (1992)","journal-title":"Journal of Soviet Mathematics"},{"issue":"4","key":"35_CR12","first-page":"761","volume":"30","author":"J. Kratochv\u00edl","year":"1989","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: NP-hardness results for intersection graphs. Commentationes Mathematicae Universitatis Carolinae\u00a030(4), 761\u2013773 (1989)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"issue":"3","key":"35_CR13","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(3), 233\u2013252 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"35_CR14","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":"35_CR15","unstructured":"Kratochv\u00edl, J.: Geometric representations of graphs, Graduate Course, notes, Universitat Polit\u00e8cnica de Catalunya, Barcelona (April 2005), http:\/\/www.aco.gatech.edu\/conference\/archive\/acokratochvil.ppt"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Kratochv\u00edl, J., Pergel, M.: Intersection graphs of homothetic polygons. In: Electronic Notes in Discrete Mathematics, vol.\u00a031, pp. 277\u2013280 (2008), http:\/\/www.canalc2.tv\/video.asp?idvideo=7571","DOI":"10.1016\/j.endm.2008.06.056"},{"issue":"1","key":"35_CR17","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/060650805","volume":"22","author":"M.C. Lin","year":"2008","unstructured":"Lin, M.C., Szwarcfiter, J.L.: Unit circular-arc graph representations and feasible circulations. SIAM J. Discrete Mathematics\u00a022(1), 409\u2013423 (2008)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"35_CR18","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ipl.2004.10.013","volume":"93","author":"A. Lingas","year":"2005","unstructured":"Lingas, A., Wahlen, M.: A note on maximum independent set and related problems on box graphs. Inf. Proc. Letters\u00a093, 169\u2013171 (2005)","journal-title":"Inf. Proc. Letters"},{"key":"35_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-16926-7_29","volume-title":"Graph Theoretic Concepts in Computer Science","author":"C. McDiarmid","year":"2010","unstructured":"McDiarmid, C., M\u00fcller, T.: The number of bits needed to represent a unit disk graph. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol.\u00a06410, pp. 315\u2013323. Springer, Heidelberg (2010)"},{"key":"35_CR20","volume-title":"SIAM Monographs on Discrete Mathematics and Applications","author":"T.A. McKee","year":"1999","unstructured":"McKee, T.A., Mc\u0328Morris, F.R.: Topics in intersection graph theory. SIAM Monographs on Discrete Mathematics and Applications, vol.\u00a02, SIAM, Philadelphia (1999)"},{"key":"35_CR21","unstructured":"Pergel, M.: Special graph classes and algorithms on them, PhD Thesis, Dept. of Applied Mathematics, Charles University, Prague (2008)"},{"key":"35_CR22","volume-title":"Field Institute Monographs","author":"J.R. Spinrad","year":"2003","unstructured":"Spinrad, J.R.: Efficient graph representations. In: Field Institute Monographs, vol.\u00a019, American Mathematical Society, Providence (2003)"},{"key":"35_CR23","unstructured":"van Leeuwen, E.J.: Optimization and approximation on systems of geometric objects, PhD thesis, University of Amsterdam (2009)"},{"key":"35_CR24","unstructured":"van Leeuwen, E.J., van Leeuwen, J.: On the representation of disk graphs, Techn. Report UU-CS-2006-037, Dept. of Information and Computing Sciences, Utrecht University (2006)"},{"key":"35_CR25","doi-asserted-by":"crossref","unstructured":"van Leeuwen, E.J., van Leeuwen, J.: Convex polygon intersection graphs, Techn. Report, Dept. of Information and Computing Sciences, Utrecht University (to appear, 2010)","DOI":"10.1007\/978-3-642-18469-7_35"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T12:45:02Z","timestamp":1559997902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}