{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T14:30:21Z","timestamp":1726065021727},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030389185"},{"type":"electronic","value":"9783030389192"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-38919-2_48","type":"book-chapter","created":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T17:03:18Z","timestamp":1579194198000},"page":"587-596","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Hardness of Energy Minimisation for Crystal Structure Prediction"],"prefix":"10.1007","author":[{"given":"Duncan","family":"Adamson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Argyrios","family":"Deligkas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir V.","family":"Gusev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,17]]},"reference":[{"key":"48_CR1","unstructured":"Adamson, D., Deligkas, A., Gusev, V., Potapov, I.: On the Hardness of Energy Minimisation for Crystal Structure Prediction. \narXiv.org\/abs\/1910.12026"},{"key":"48_CR2","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1134\/S1064562414030235","volume":"89","author":"AA Ageev","year":"2014","unstructured":"Ageev, A.A., Kelmanov, A.V., Pyatkin, A.V.: Np-hardness of the euclidean max-cut problem. Doklady Math. 89, 343\u2013345 (2014)","journal-title":"Doklady Math."},{"issue":"10","key":"48_CR3","doi-asserted-by":"publisher","first-page":"3241","DOI":"10.1088\/0305-4470\/15\/10\/028","volume":"15","author":"F Barahona","year":"1982","unstructured":"Barahona, F.: On the computational complexity of Ising spin glass models. J. Phys. A: Math. Gen. 15(10), 3241\u20133253 (1982)","journal-title":"J. Phys. A: Math. Gen."},{"issue":"933","key":"48_CR4","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1098\/rspa.1938.0173","volume":"168","author":"RA Buckingham","year":"1938","unstructured":"Buckingham, R.A.: The classical equation of state of gaseous helium, neon and argon. Proc. Royal Soc. London Ser. A. Math. Phys. Sci. 168(933), 264\u2013283 (1938)","journal-title":"Proc. Royal Soc. London Ser. A. Math. Phys. Sci."},{"issue":"3","key":"48_CR5","first-page":"331","volume":"45","author":"MR Cerioli","year":"2011","unstructured":"Cerioli, M.R., Faria, L., Ferreira, T.O., Protti, F.: A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation. RAIRO 45(3), 331\u2013346 (2011)","journal-title":"RAIRO"},{"issue":"1","key":"48_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Disc. Math. 86(1), 165\u2013177 (1990)","journal-title":"Disc. Math."},{"issue":"7657","key":"48_CR7","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1038\/nature22374","volume":"546","author":"M Zanella","year":"2017","unstructured":"Zanella, M., et al.: Accelerated discovery of two crystal structure types in a complex inorganic phase field. Nature 546(7657), 280 (2017)","journal-title":"Nature"},{"issue":"4","key":"48_CR8","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1137\/0208049","volume":"8","author":"M Krishnamoorthy","year":"1979","unstructured":"Krishnamoorthy, M., Deo, N.: Node-deletion np-complete problems. SIAM J. Comput. 8(4), 619\u2013625 (1979)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"48_CR9","doi-asserted-by":"publisher","first-page":"1623","DOI":"10.1016\/j.cpc.2010.06.007","volume":"181","author":"AO Lyakhov","year":"2010","unstructured":"Lyakhov, A.O., Oganov, A.R., Mario, V.: How to predict very large and complex crystal structures. Comput. Phys. Commun. 181(9), 1623\u20131632 (2010)","journal-title":"Comput. Phys. Commun."},{"key":"48_CR10","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-00202-1_24","volume-title":"WALCOM: Algorithms and Computation","author":"Meena Mahajan","year":"2009","unstructured":"Mahajan, M., Nimbhorkar, P., Varadarajan, K.: The planar k-means problem is np-hard. In: WALCOM: Algorithms and Computation, pp. 274\u2013285 (2009)"},{"key":"48_CR11","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1039\/C8FD90033G","volume":"211","author":"AR Oganov","year":"2018","unstructured":"Oganov, A.R.: Crystal structure prediction: reflections on present status and challenges. Faraday Discuss. 211, 643\u2013660 (2018)","journal-title":"Faraday Discuss."},{"issue":"24","key":"48_CR12","doi-asserted-by":"publisher","first-page":"244704","DOI":"10.1063\/1.2210932","volume":"124","author":"AR Oganov","year":"2006","unstructured":"Oganov, A.R., Glass, C.W.: Crystal structure prediction using ab initio evolutionary techniques: principles and applications. J. Chem. phys. 124(24), 244704 (2006)","journal-title":"J. Chem. phys."},{"issue":"8","key":"48_CR13","doi-asserted-by":"publisher","first-page":"L419","DOI":"10.1088\/0305-4470\/18\/8\/003","volume":"18","author":"LT Wille","year":"1985","unstructured":"Wille, L.T., Vennik, J.: Computational complexity of the ground-state determination of atomic clusters. J. Phys. A: Math. Gen. 18(8), L419\u2013L422 (1985)","journal-title":"J. Phys. A: Math. Gen."},{"issue":"12","key":"48_CR14","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1038\/nmat2321","volume":"7","author":"SM Woodley","year":"2008","unstructured":"Woodley, S.M., Catlow, R.: Crystal structure prediction from first principles. Nat. Mater. 7(12), 937 (2008)","journal-title":"Nat. Mater."},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node-and edge-deletion np-complete problems. In: STOC, vol. 1978, pp. 253\u2013264 (1978)","DOI":"10.1145\/800133.804355"},{"issue":"2","key":"48_CR16","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1137\/0210022","volume":"10","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Node-deletion problems on bipartite graphs. SIAM J. Comput. 10(2), 310\u2013327 (1981)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2020: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38919-2_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T17:15:24Z","timestamp":1579194924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38919-2_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030389185","9783030389192"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38919-2_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cyprusconferences.org\/sofsem2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"125","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}