{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:47Z","timestamp":1725475007449},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_26","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T00:57:35Z","timestamp":1164761855000},"page":"243-252","source":"Crossref","is-referenced-by-count":0,"title":["Inverse HAMILTONIAN CYCLE and Inverse 3-D\u00a0MATCHING Are coNP-Complete"],"prefix":"10.1007","author":[{"given":"Michael","family":"Kr\u00fcger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harald","family":"Hempel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-540-45138-9_28","volume-title":"Mathematical Foundations of Computer Science 2003","author":"H. Chen","year":"2003","unstructured":"Chen, H.: Inverse NP problems. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 338\u2013347. Springer, Heidelberg (2003)"},{"key":"26_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman, New York (1979)"},{"issue":"2-3","key":"26_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.tcs.2005.07.015","volume":"345","author":"E.L. Hemaspaandra","year":"2005","unstructured":"Hemaspaandra, E.L., Hempel, H.: All superlinear inverse schemes are coNP-hard. Theoretical Computer Science\u00a0345(2-3), 345\u2013358 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1137\/S0097539795285114","volume":"28","author":"D. Kavvadias","year":"1998","unstructured":"Kavvadias, D., Sideri, M.: The inverse satisfiability problem. SIAM Journal on Computing\u00a028(1), 152\u2013163 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR5","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"26_CR6","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:49:49Z","timestamp":1619495389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11940128_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}