{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:02Z","timestamp":1725664082473},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540589501"},{"type":"electronic","value":"9783540491552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-58950-3_377","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:54:15Z","timestamp":1330275255000},"page":"254-261","source":"Crossref","is-referenced-by-count":4,"title":["On the difficulty of embedding planar graphs with inaccuracies"],"prefix":"10.1007","author":[{"given":"Michael","family":"Godau","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0166-218X(90)90110-X","volume":"28","author":"P. Eades","year":"1990","unstructured":"Eades, P., Wormald, N.: Fixed Edge Length Graph Drawing is NP-hard. Discrete Applied Mathematics. 28 (1990) 111\u2013134","journal-title":"Discrete Applied Mathematics"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Cook, S.: The complexity of theorem-proving procedures. Proc. 3rd Ann. ACM Symp. on Theory of Computing (assoc. Comput. Mach., New York, 1971) 151\u2013158","DOI":"10.1145\/800157.805047"},{"key":"27_CR3","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM Journal of Computing 11 (1982) no. 2, 329\u2013343","journal-title":"SIAM Journal of Computing"},{"key":"27_CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"C. Tovey","year":"1984","unstructured":"Tovey, C.: A simplified NP-complete satisfiability problem. Discrete-Applied-Mathematics 8 (1984), no. 1, 85\u201389","journal-title":"Discrete-Applied-Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58950-3_377.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:21:30Z","timestamp":1619572890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58950-3_377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589501","9783540491552"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-58950-3_377","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}