{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:54:55Z","timestamp":1725890095488},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540639381"},{"type":"electronic","value":"9783540696742"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63938-1_81","type":"book-chapter","created":{"date-parts":[[2006,7,18]],"date-time":"2006-07-18T07:35:47Z","timestamp":1153208147000},"page":"359-370","source":"Crossref","is-referenced-by-count":0,"title":["Discrete realizations of contact and intersection graphs (extended abstract)"],"prefix":"10.1007","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Kranakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Krizanc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"Urrutia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramowski, B. Lang, and H. Miller, \u201cMoving Regular k-gons in Contact\u201d, In proceedings of International Workshop WG'88 on Graph-Theoretic Concepts in Computer Science, Jan van Leewen, editor, Springer Verlag Lecture Notes in Computer Science, vol. 344, pp. 229\u2013242, 1989.","DOI":"10.1007\/3-540-50728-0_46"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0020-0190(87)90173-6","volume":"25","author":"S. N. Bhatt","year":"1987","unstructured":"S. N. Bhatt and S. S. Cosmadakis, \u201cThe Complexity of Minimizing Wire Lengths in VLSI Layouts\u201d, Information Processing Letters 25 (1987) 263\u2013267.","journal-title":"Information Processing Letters"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"H. Breu and D. G. Kirkpatrick, \u201cOn the Complexity of Recognizing Intersection and Touching Graphs of Disks\u201d, In proceedings of Graph Drawing 95, pp. 88\u201398. Springer Verlag Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0021793"},{"issue":"2","key":"37_CR4","first-page":"214","volume":"6","author":"G. R. Brightwell","year":"1993","unstructured":"G. R. Brightwell, and E. R. Scheinerman, \u201cRepresentation of Planar Graphs\u201d, SIAM Journal on ???, Vol. 6, No. 2, pp. 214\u2013229, May 1993.","journal-title":"SIAM Journal on ???"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0020-0190(95)00046-F","volume":"55","author":"D. G. Corneil","year":"1995","unstructured":"D. G. Corneil, H. Kim, S. Natarajan, S. Olariu, and A. P. Sprague, \u201cSimple Linear Time Recognition of Unit Interval Graphs\u201d, Information Processing Letters 55 (1995) 99\u2013104.","journal-title":"Information Processing Letters"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0020-0190(95)00133-W","volume":"56","author":"C. M. Herrera de Figueiredo","year":"1995","unstructured":"C. M. Herrera de Figueiredo, J. Meidanis, C. Picinin de Mello, \u201cA Linear-Time Alforithm for Proper Interval Graph Recognition\u201d, Information Processing Letters 56 (1995) 179\u2013184.","journal-title":"Information Processing Letters"},{"key":"37_CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1017\/S0963548300001139","volume":"3","author":"H. Fraysseix de","year":"1994","unstructured":"H. de Fraysseix, P. Ossona de Mendez, and P. Rosenstiehl, \u201cOn Triangle Contact Graphs\u201d, Combinatorics, Probability and Computing (1994) 3, 233\u2013246.","journal-title":"Combinatorics, Probability and Computing"},{"key":"37_CR8","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D. R. Fulkerson","year":"1985","unstructured":"D. R. Fulkerson and O. A. Gross, \u201cIncidence Matrices and Interval Graphs\u201d, Pacific Journal of Mathematics, 15, 835\u2013855, 1985.","journal-title":"Pacific Journal of Mathematics"},{"key":"37_CR9","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic, \u201cAlgorithmic Graph Theory and Perfect Graphs\u201d, Academic Press, New York, 1980."},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"N. Korte and R. H. M\u00f6hring, \u201cA Simple Linear-Time Algorithm to Recognize Interval Graphs\u201d, In proceedings of International Workshop WG'86 on Graph-Theoretic Concepts in Computer Science, G. Tinhofer and G. Schmidt, editors, Springer Verlag Lecture Notes in Computer Science, vol. 246, 1987.","DOI":"10.1007\/3-540-17218-1"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/0196-6774(85)90016-1","volume":"6","author":"Z. Miller","year":"1985","unstructured":"Z. Miller and J. B. Orlin, \u201cNP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings\u201d, Journal of Algorithms 6, 10\u201316 (1985).","journal-title":"Journal of Algorithms"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0012-365X(93)E0068-F","volume":"134","author":"H. Sachs","year":"1994","unstructured":"H. Sachs, \u201cCoin Graphs, Polyhedra, and Conformal Mapping\u201d, Discrete Mathematics 134 (1994) 133\u2013138.","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63938-1_81","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T23:17:46Z","timestamp":1555715866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63938-1_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540639381","9783540696742"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-63938-1_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}