{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:22:15Z","timestamp":1760080935256,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031556005"},{"type":"electronic","value":"9783031556012"}],"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-55601-2_3","type":"book-chapter","created":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T19:02:17Z","timestamp":1709665337000},"page":"31-45","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bi-arc Digraphs: Recognition Algorithm and\u00a0Applications"],"prefix":"10.1007","author":[{"given":"Pavol","family":"Hell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akbar","family":"Rafiey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arash","family":"Rafiey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,6]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-15205-4_10","volume-title":"Computer Science Logic","author":"G Bagan","year":"2010","unstructured":"Bagan, G., Durand, A., Filiot, E., Gauwin, O.: Efficient enumeration for conjunctive queries over x-underbar structures. In: Dawar, A., Veith, H. (eds.) CSL 2010. LNCS, vol. 6247, pp. 80\u201394. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15205-4_10"},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335\u2013379 (1976)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1137\/S0895480103436748","volume":"22","author":"RC Brewster","year":"2008","unstructured":"Brewster, R.C., Feder, T., Hell, P., Huang, J., MacGillivray, G.: Near-unanimity functions and varieties of reflexive graphs. SIAM J. Discret. Math. 22(3), 938\u2013960 (2008)","journal-title":"SIAM J. Discret. Math."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bulatov, A.A.: A dichotomy theorem for nonuniform CSPs. In: FOCS, pp. 319\u2013330. IEEE (2017)","DOI":"10.1109\/FOCS.2017.37"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Bulatov, A.A., Rafiey, A.: On the complexity of csp-based ideal membership problems. In: STOC, pp. 436\u2013449. ACM (2022)","DOI":"10.1145\/3519935.3520063"},{"key":"3_CR6","first-page":"1","volume":"16","author":"C Carvalho","year":"2015","unstructured":"Carvalho, C., Egri, L., Jackson, M., Niven, T.: On Maltsev digraphs. Electron. J. Comb. 16, 1\u201321 (2015)","journal-title":"Electron. J. Comb."},{"issue":"3","key":"3_CR7","first-page":"11","volume":"9","author":"H Chen","year":"2017","unstructured":"Chen, H., Larose, B.: Asking the metaquestions in constraint tractability. ACM Trans. Comput. Theor. (TOCT) 9(3), 11 (2017)","journal-title":"ACM Trans. Comput. Theor. (TOCT)"},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1137\/S0895480100373455","volume":"23","author":"DG Corneil","year":"2009","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: The LBFS structure and recognition of interval graphs. SIAM J. Discret. Math. 23(4), 1905\u20131953 (2009)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1002\/jgt.3190130206","volume":"13","author":"S Das","year":"1989","unstructured":"Das, S., Sen, M., Roy, A.B., West, D.B.: Interval digraphs: An analogue of interval graphs. J. Graph Theor. 13(2), 189\u2013202 (1989)","journal-title":"J. Graph Theor."},{"issue":"1","key":"3_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 Theor. 42(1), 61\u201380 (2003)","journal-title":"J. Graph Theor."},{"issue":"6","key":"3_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."},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1940","DOI":"10.1137\/120894312","volume":"27","author":"T Feder","year":"2013","unstructured":"Feder, T., Hell, P., Loten, C., Siggers, M., Tardif, C.: Graphs admitting k-nu operations. Part 1: the reflexive case. SIAM J. Discret. Math. 27(4), 1940\u20131963 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Feder, T., Vardi, M.Y.: Monotone monadic SNP and constraint satisfaction. In: STOC, pp. 612\u2013622 (1993)","DOI":"10.1145\/167088.167245"},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D Fulkerson","year":"1965","unstructured":"Fulkerson, D., Gross, O.: Incidence matrices and interval graphs. Pac. J. Math. 15(3), 835\u2013855 (1965)","journal-title":"Pac. J. Math."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, vol. 57. Elsevier (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"issue":"4","key":"3_CR16","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/jgt.20006","volume":"46","author":"P Hell","year":"2004","unstructured":"Hell, P., Huang, J.: Interval bigraphs and circular arc graphs. J. Graph Theor. 46(4), 313\u2013327 (2004)","journal-title":"J. Graph Theor."},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"1710","DOI":"10.1137\/19M1241763","volume":"34","author":"P Hell","year":"2020","unstructured":"Hell, P., Huang, J., McConnell, R.M., Rafiey, A.: Min-orderable digraphs. SIAM J. Discret. Math. 34(3), 1710\u20131724 (2020)","journal-title":"SIAM J. Discret. Math."},{"key":"3_CR18","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"},{"key":"3_CR19","unstructured":"Hell, P., Rafiey, A., Rafiey, A.: Bi-arc digraphs and conservative polymorphisms. arXiv preprint arXiv:1608.03368 (2016)"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Hell, P., Rafiey, A.: The dichotomy of list homomorphisms for digraphs. In: SODA, pp. 1703\u20131713 (2011)","DOI":"10.1137\/1.9781611973082.131"},{"issue":"4","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1576","DOI":"10.1137\/100783844","volume":"26","author":"P Hell","year":"2012","unstructured":"Hell, P., Rafiey, A.: Monotone proper interval digraphs and min-max orderings. SIAM J. Discret. Math. 26(4), 1576\u20131596 (2012)","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"3_CR22","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1145\/263867.263489","volume":"44","author":"P Jeavons","year":"1997","unstructured":"Jeavons, P., Cohen, D.A., Gyssens, M.: Closure properties of constraints. J. ACM 44(4), 527\u2013548 (1997)","journal-title":"J. ACM"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Kun, G., O\u2019Donnell, R., Tamaki, S., Yoshida, Y., Zhou, Y.: Linear programming, width-1 CSPs, and robust satisfaction. In: ITCS, pp. 484\u2013495 (2012)","DOI":"10.1145\/2090236.2090274"},{"issue":"1","key":"3_CR24","doi-asserted-by":"publisher","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C Lekkeikerker","year":"1962","unstructured":"Lekkeikerker, C., Boland, J.: Representation of a finite graph by a set of intervals on the real line. Fundam. Math. 51(1), 45\u201364 (1962)","journal-title":"Fundam. Math."},{"issue":"3","key":"3_CR25","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 Universalis 59(3), 463\u2013489 (2008)","journal-title":"Algebra Universalis"},{"key":"3_CR26","unstructured":"Rafiey, A., Rafiey, A., Santos, T.: Toward a dichotomy for approximation of h-coloring. In: ICALP, pp. 91:1\u201391:16 (2019)"},{"issue":"15","key":"3_CR27","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1016\/j.dam.2010.06.002","volume":"158","author":"AMS Shrestha","year":"2010","unstructured":"Shrestha, A.M.S., Tayu, S., Ueno, S.: On orthogonal ray graphs. Discret. Appl. Math. 158(15), 1650\u20131659 (2010)","journal-title":"Discret. Appl. Math."},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Zhuk, D.: A proof of CSP dichotomy conjecture. In: FOCS, pp. 331\u2013342. IEEE (2017)","DOI":"10.1109\/FOCS.2017.38"}],"container-title":["Lecture Notes in Computer Science","LATIN 2024: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-55601-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T19:04:04Z","timestamp":1709665444000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55601-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031556005","9783031556012"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55601-2_3","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":"6 March 2024","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":"Puerto Varas","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","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":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2024.cmm.uchile.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"92","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":"44","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":"48% - 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.3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}