{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:07:50Z","timestamp":1743124070106,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031206238"},{"type":"electronic","value":"9783031206245"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20624-5_31","type":"book-chapter","created":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T15:18:05Z","timestamp":1666970285000},"page":"510-526","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Min Orderings and\u00a0List Homomorphism Dichotomies for\u00a0Signed and\u00a0Unsigned Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7973-1361","authenticated-orcid":false,"given":"Jan","family":"Bok","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7237-4288","authenticated-orcid":false,"given":"Richard C.","family":"Brewster","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7609-9746","authenticated-orcid":false,"given":"Pavol","family":"Hell","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9518-6386","authenticated-orcid":false,"given":"Nikola","family":"Jedli\u010dkov\u00e1","sequence":"additional","affiliation":[]},{"given":"Arash","family":"Rafiey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,29]]},"reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-030-95018-7_3","volume-title":"Algorithms and Discrete Applied Mathematics","author":"J Bok","year":"2022","unstructured":"Bok, J., Brewster, R., Feder, T., Hell, P., Jedli\u010dkov\u00e1, N.: List homomorphisms to separable signed graphs. In: Balachandran, N., Inkulu, R. (eds.) CALDAM 2022. LNCS, vol. 13179, pp. 22\u201335. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-95018-7_3"},{"key":"31_CR2","unstructured":"Bok, J., Brewster, R.C., Feder, T., Hell, P., Jedli\u010dkov\u00e1, N.: List homomorphism problems for signed graphs. In: Esparza, J., Kr\u00e1\u013e, D. (eds.) 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 170, pp. 20:1\u201320:14. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2020). https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2020\/12688"},{"key":"31_CR3","unstructured":"Bok, J., Brewster, R.C., Feder, T., Hell, P., Jedli\u010dkov\u00e1, N.: List homomorphism problems for signed graphs (2021, submitted). https:\/\/arxiv.org\/abs\/2005.05547"},{"key":"31_CR4","unstructured":"Bok, J., Brewster, R.C., Hell, P., Jedli\u010dkov\u00e1, N., Rafiey, A.: Min orderings and list homomorphism dichotomies for signed and unsigned graphs. CoRR abs\/2206.01068 (2022). https:\/\/arxiv.org\/abs\/2206.01068"},{"key":"31_CR5","unstructured":"Bok, J., Brewster, R.C., Hell, P., Jedli\u010dkov\u00e1, N.: List homomorphisms of signed graphs. In: Bordeaux Graph Workshop, pp. 81\u201384 (2019)"},{"issue":"2","key":"31_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.disc.2016.08.005","volume":"340","author":"RC Brewster","year":"2017","unstructured":"Brewster, R.C., Foucaud, F., Hell, P., Naserasr, R.: The complexity of signed graph and edge-coloured graph homomorphisms. Discret. Math. 340(2), 223\u2013235 (2017)","journal-title":"Discret. Math."},{"issue":"10","key":"31_CR7","doi-asserted-by":"publisher","first-page":"2768","DOI":"10.1016\/j.disc.2018.06.026","volume":"341","author":"RC Brewster","year":"2018","unstructured":"Brewster, R.C., Siggers, M.: A complexity dichotomy for signed $$H$$-colouring. Discret. Math. 341(10), 2768\u20132773 (2018)","journal-title":"Discret. Math."},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Bulatov, A.A.: A dichotomy theorem for nonuniform CSPs. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 319\u2013330. IEEE (2017)","DOI":"10.1109\/FOCS.2017.37"},{"issue":"4","key":"31_CR9","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s004939970003","volume":"19","author":"T Feder","year":"1999","unstructured":"Feder, T., Hell, P., Huang, J.: List homomorphisms and circular arc graphs. Combinatorica 19(4), 487\u2013505 (1999)","journal-title":"Combinatorica"},{"issue":"1","key":"31_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/jgt.10073","volume":"42","author":"T Feder","year":"2003","unstructured":"Feder, T., Hell, P., Huang, J.: Bi-arc graphs and the complexity of list homomorphisms. J. Graph Theory 42(1), 61\u201380 (2003)","journal-title":"J. Graph Theory"},{"issue":"6","key":"31_CR11","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1016\/j.dam.2011.04.016","volume":"160","author":"T Feder","year":"2012","unstructured":"Feder, T., Hell, P., Huang, J., Rafiey, A.: Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms. Discret. Appl. Math. 160(6), 697\u2013707 (2012)","journal-title":"Discret. Appl. Math."},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. In: STOC, pp. 612\u2013622 (1993)","DOI":"10.1145\/167088.167245"},{"issue":"1","key":"31_CR13","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jctb.2001.2051","volume":"83","author":"B Guenin","year":"2001","unstructured":"Guenin, B.: A characterization of weakly bipartite graphs. J. Combin. Theory Ser. B 83(1), 112\u2013168 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"key":"31_CR14","unstructured":"Guenin, B.: Packing odd circuit covers: a conjecture (2005). Manuscript"},{"key":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-642-33090-2_51","volume-title":"Algorithms \u2013 ESA 2012","author":"P Hell","year":"2012","unstructured":"Hell, P., Mastrolilli, M., Nevisi, M.M., Rafiey, A.: Approximation of minimum cost homomorphisms. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 587\u2013598. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_51"},{"issue":"1","key":"31_CR16","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of $$H$$-coloring. J. Combin. Theory Ser. B 48(1), 92\u2013110 (1990)","journal-title":"J. Combin. Theory Ser. B"},{"key":"31_CR17","series-title":"Oxford Lecture Series in Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001","volume-title":"Graphs and Homomorphisms","author":"P Hell","year":"2004","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: Graphs and Homomorphisms. Oxford Lecture Series in Mathematics and its Applications, vol. 28. Oxford University Press, Oxford (2004)"},{"key":"31_CR18","unstructured":"Kaiser, T., Luko\u0165ka, R., Rollov\u00e1, E.: Nowhere-zero flows in signed graphs: a survey. In: Selected Topics in Graph Theory and Its Applications. Lecture Notes of Seminario Interdisciplinare di Matematica, vol. 14, pp. 85\u2013104. Seminario Interdisciplinare di Matematica (S.I.M.), Potenza (2017)"},{"key":"31_CR19","unstructured":"Kim, H., Siggers, M.: Towards a dichotomy for the switch list homomorphism problem for signed graphs (2021). https:\/\/arxiv.org\/abs\/2104.07764"},{"key":"31_CR20","doi-asserted-by":"publisher","unstructured":"Naserasr, R., Sopena, E., Zaslavsky, T.: Homomorphisms of signed graphs: an update. European J. Combin. 91, Paper No. 103222, 20 (2021). https:\/\/doi.org\/10.1016\/j.ejc.2020.103222","DOI":"10.1016\/j.ejc.2020.103222"},{"issue":"2","key":"31_CR21","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1006\/jctb.2001.2101","volume":"85","author":"A Schrijver","year":"2002","unstructured":"Schrijver, A.: A short proof of Guenin\u2019s characterization of weakly bipartite graphs. J. Combin. Theory Ser. B 85(2), 255\u2013260 (2002)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"31_CR22","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(82)90144-3","volume":"39","author":"T Zaslavsky","year":"1982","unstructured":"Zaslavsky, T.: Signed graph coloring. Discrete Math. 39(2), 215\u2013228 (1982)","journal-title":"Discrete Math."},{"key":"31_CR23","unstructured":"Zaslavsky, T.: A mathematical bibliography of signed and gain graphs and allied areas. Electron. J. Combin. 5, Dynamic Surveys 8, 124 (1998). Manuscript prepared with Marge Pratt"},{"key":"31_CR24","doi-asserted-by":"crossref","unstructured":"Zhuk, D.: A proof of CSP dichotomy conjecture. In: 58th Annual IEEE Symposium on Foundations of Computer Science\u2014FOCS 2017, pp. 331\u2013342. IEEE Computer Society, Los Alamitos (2017)","DOI":"10.1109\/FOCS.2017.38"}],"container-title":["Lecture Notes in Computer Science","LATIN 2022: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20624-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T23:07:47Z","timestamp":1667084867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20624-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206238","9783031206245"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20624-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guanajuato","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/delta.cs.cinvestav.mx\/~francisco\/Latin22\/","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":"114","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":"46","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":"40% - 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":"4","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":"8.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)"}}]}}