{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:14:42Z","timestamp":1742919282422,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031521126"},{"type":"electronic","value":"9783031521133"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-52113-3_34","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"485-499","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Induced Problem for\u00a0Fixed-Template CSPs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7405-8254","authenticated-orcid":false,"given":"Rustem","family":"Takhanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","unstructured":"Barto, L., Krokhin, A., Willard, R.: Polymorphisms, and how to use them. In: Krokhin, A., Zivny, S. (eds.) The Constraint Satisfaction Problem: Complexity and Approximability, Dagstuhl Follow-Ups, vol.\u00a07, pp. 1\u201344. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl (2017). https:\/\/doi.org\/10.4230\/DFU.Vol7.15301.1, http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/6959","DOI":"10.4230\/DFU.Vol7.15301.1"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Bodnarchuk, V., Kaluz\u030cnin, L., Kotov, V., Romov, B.: Galois theory for post algebras. Cybernetics 5(1-2), 243\u2013252 (1969)","DOI":"10.1007\/BF01070906"},{"issue":"3","key":"34_CR3","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/S0097539700376676","volume":"34","author":"A Bulatov","year":"2005","unstructured":"Bulatov, A., Krokhin, A., Jeavons, A.: Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34(3), 720\u2013742 (2005)","journal-title":"SIAM J. Comput."},{"key":"34_CR4","unstructured":"Bulatov, A.A.: A dichotomy theorem for nonuniform CSPS. CoRR abs\/1703.03021 (2017). http:\/\/arxiv.org\/abs\/1703.03021"},{"issue":"3","key":"34_CR5","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1023\/B:CONS.0000036045.82829.94","volume":"9","author":"DA Cohen","year":"2004","unstructured":"Cohen, D.A.: Tractable decision for a constraint language implies tractable search. Constraints 9(3), 219\u2013229 (2004). https:\/\/doi.org\/10.1023\/B:CONS.0000036045.82829.94","journal-title":"Constraints"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC 1971, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"issue":"1","key":"34_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/S0097539794266766","volume":"28","author":"T Feder","year":"1998","unstructured":"Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory. SIAM J. Comput. 28(1), 57\u2013104 (1998)","journal-title":"SIAM J. Comput."},{"key":"34_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"issue":"1","key":"34_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.2140\/pjm.1968.27.95","volume":"27","author":"D Geiger","year":"1968","unstructured":"Geiger, D.: Closed systems of functions and predicates. Pac. J. Math. 27(1), 95\u2013100 (1968)","journal-title":"Pac. J. Math."},{"issue":"8","key":"34_CR10","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1016\/j.artint.2007.12.001","volume":"172","author":"MJ Green","year":"2008","unstructured":"Green, M.J., Cohen, D.A.: Domain permutation reduction for constraint satisfaction problems. Artif. Intell. 172(8), 1094\u20131118 (2008)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"34_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(97)00230-2","volume":"200","author":"P Jeavons","year":"1998","unstructured":"Jeavons, P.: On the algebraic structure of combinatorial problems. Theor. Comput. Sci. 200(1\u20132), 185\u2013204 (1998)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"34_CR12","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(97)00230-2","volume":"200","author":"PG Jeavons","year":"1998","unstructured":"Jeavons, P.G.: On the algebraic structure of combinatorial problems. Theoret. Comput. Sci. 200(1\u20132), 185\u2013204 (1998). https:\/\/doi.org\/10.1016\/S0304-3975(97)00230-2","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"34_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00012-014-0289-9","volume":"72","author":"K Kearnes","year":"2014","unstructured":"Kearnes, K., Markovi\u0107, P., McKenzie, R.: Optimal strong Mal\u2019cev conditions for omitting type 1 in locally finite varieties. Algebra Univers. 72(1), 91\u2013100 (2014)","journal-title":"Algebra Univers."},{"key":"34_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-662-48971-0_48","volume-title":"Algorithms and Computation","author":"V Kolmogorov","year":"2015","unstructured":"Kolmogorov, V., Rol\u00ednek, M., Takhanov, R.: Effectiveness of structural restrictions for hybrid CSPs. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 566\u2013577. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48971-0_48"},{"issue":"3\u20134","key":"34_CR15","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s00012-008-2122-9","volume":"59","author":"M Mar\u00f3ti","year":"2008","unstructured":"Mar\u00f3ti, M., McKenzie, R.: Existence theorems for weakly symmetric operations. Algebra Univers. 59(3\u20134), 463\u2013489 (2008)","journal-title":"Algebra Univers."},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"issue":"1\u20132","key":"34_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s00012-010-0082-3","volume":"64","author":"MH Siggers","year":"2010","unstructured":"Siggers, M.H.: A strong Mal\u2019cev condition for locally finite varieties omitting the unary type. Algebra Univers. 64(1\u20132), 15\u201320 (2010)","journal-title":"Algebra Univers."},{"key":"34_CR18","unstructured":"Takhanov, R.: Hybrid (V)CSPS and algebraic reductions. CoRR abs\/1506.06540v1 (2015). https:\/\/arxiv.org\/abs\/1506.06540v1"},{"key":"34_CR19","doi-asserted-by":"publisher","unstructured":"Takhanov, R.: Hybrid VCSPs with crisp and valued conservative templates. In: Okamoto, Y., Tokuyama, T. (eds.) 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a092, pp. 65:1\u201365:13. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2017.65, http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/8247","DOI":"10.4230\/LIPIcs.ISAAC.2017.65"},{"key":"34_CR20","unstructured":"Zhuk, D.: The proof of CSP dichotomy conjecture. CoRR abs\/1704.01914 (2017). http:\/\/arxiv.org\/abs\/1704.01914"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2024: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52113-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:05:42Z","timestamp":1711569942000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 February 2024","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 Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cochem","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=90670&L=2","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":"81","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":"33","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":"0","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":"41% - 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":"3.11","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":"7","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)"}}]}}