{"id":"https://openalex.org/W1791050365","doi":"https://doi.org/10.2168/lmcs-11(4:18)2015","title":"A finer reduction of constraint problems to digraphs","display_name":"A finer reduction of constraint problems to digraphs","publication_year":2015,"publication_date":"2015-12-29","ids":{"openalex":"https://openalex.org/W1791050365","doi":"https://doi.org/10.2168/lmcs-11(4:18)2015","mag":"1791050365"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-11(4:18)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(4:18)2015","pdf_url":"https://lmcs.episciences.org/1619/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1619/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065699864","display_name":"Jakub Bul\u00edn","orcid":"https://orcid.org/0000-0001-5235-8715"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jakub Bul\u00edn","raw_affiliation_strings":["Charles University Prague"],"raw_orcid":"https://orcid.org/0000-0001-5235-8715","affiliations":[{"raw_affiliation_string":"Charles University Prague","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004111547","display_name":"Dejan Deli\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I530967","display_name":"Toronto Metropolitan University","ror":"https://ror.org/05g13zd79","country_code":"CA","type":"education","lineage":["https://openalex.org/I530967"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Dejan Delic","raw_affiliation_strings":["(Ryerson University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"(Ryerson University","institution_ids":["https://openalex.org/I530967"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032939431","display_name":"Marcel Jackson","orcid":"https://orcid.org/0000-0002-8149-1141"},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]},{"id":"https://openalex.org/I196829312","display_name":"La Trobe University","ror":"https://ror.org/01rxfrp27","country_code":"AU","type":"education","lineage":["https://openalex.org/I196829312"]},{"id":"https://openalex.org/I530967","display_name":"Toronto Metropolitan University","ror":"https://ror.org/05g13zd79","country_code":"CA","type":"education","lineage":["https://openalex.org/I530967"]}],"countries":["AU","CA","US"],"is_corresponding":false,"raw_author_name":"Marcel Jackson","raw_affiliation_strings":["Department of Mathematics, Ryerson University, Canada","Department of Mathematics, University of Colorado Boulder, USA","La Trobe University"],"raw_orcid":"https://orcid.org/0000-0002-8149-1141","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Ryerson University, Canada","institution_ids":["https://openalex.org/I530967"]},{"raw_affiliation_string":"Department of Mathematics, University of Colorado Boulder, USA","institution_ids":["https://openalex.org/I188538660"]},{"raw_affiliation_string":"La Trobe University","institution_ids":["https://openalex.org/I196829312"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089784010","display_name":"Todd Niven","orcid":null},"institutions":[{"id":"https://openalex.org/I196829312","display_name":"La Trobe University","ror":"https://ror.org/01rxfrp27","country_code":"AU","type":"education","lineage":["https://openalex.org/I196829312"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Todd Niven","raw_affiliation_strings":["Department of Mathematics and Statistics, La Trobe University, Australia","La Trobe University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, La Trobe University, Australia","institution_ids":["https://openalex.org/I196829312"]},{"raw_affiliation_string":"La Trobe University","institution_ids":["https://openalex.org/I196829312"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4704,"has_fulltext":true,"cited_by_count":21,"citation_normalized_percentile":{"value":0.89176555,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"Volume 11, Issue 4","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9868999719619751,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9825999736785889,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.823883056640625},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7599032521247864},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7015275955200195},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6510481238365173},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6468467712402344},{"id":"https://openalex.org/keywords/complexity-of-constraint-satisfaction","display_name":"Complexity of constraint satisfaction","score":0.5913494825363159},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5477275252342224},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4937010705471039},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4769543409347534},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4107525944709778},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.14421769976615906}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.823883056640625},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7599032521247864},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7015275955200195},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6510481238365173},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6468467712402344},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.5913494825363159},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5477275252342224},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4937010705471039},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4769543409347534},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4107525944709778},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.14421769976615906},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-11(4:18)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(4:18)2015","pdf_url":"https://lmcs.episciences.org/1619/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1406.6413","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1406.6413","pdf_url":"https://arxiv.org/pdf/1406.6413","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.747.2981","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.747.2981","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1406.6413.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:eebff811321c4a349930a1ec5b185429","is_oa":true,"landing_page_url":"https://doaj.org/article/eebff811321c4a349930a1ec5b185429","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 11, Issue 4 (2015)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-11(4:18)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(4:18)2015","pdf_url":"https://lmcs.episciences.org/1619/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2359931329","display_name":"Computation in direct powers","funder_award_id":"P24285","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G604205570","display_name":null,"funder_award_id":"13-01832S","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320309872","display_name":"Grantov\u00e1 Agentura, Univerzita Karlova","ror":"https://ror.org/024d6js02"},{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1791050365.pdf","grobid_xml":"https://content.openalex.org/works/W1791050365.grobid-xml"},"referenced_works_count":46,"referenced_works":["https://openalex.org/W655258421","https://openalex.org/W1486682191","https://openalex.org/W1524176804","https://openalex.org/W1534682606","https://openalex.org/W1567556142","https://openalex.org/W1570219696","https://openalex.org/W1576761890","https://openalex.org/W1796497853","https://openalex.org/W1976017655","https://openalex.org/W1978292808","https://openalex.org/W1984074081","https://openalex.org/W1988961015","https://openalex.org/W1989358964","https://openalex.org/W1991486497","https://openalex.org/W1997649256","https://openalex.org/W1998968023","https://openalex.org/W2003272326","https://openalex.org/W2020154454","https://openalex.org/W2026679370","https://openalex.org/W2026753685","https://openalex.org/W2027524199","https://openalex.org/W2049516232","https://openalex.org/W2052726983","https://openalex.org/W2052936500","https://openalex.org/W2071152266","https://openalex.org/W2077575555","https://openalex.org/W2078752178","https://openalex.org/W2091694652","https://openalex.org/W2101081760","https://openalex.org/W2102459557","https://openalex.org/W2114841580","https://openalex.org/W2116407296","https://openalex.org/W2119456262","https://openalex.org/W2125578232","https://openalex.org/W2128522328","https://openalex.org/W2150339067","https://openalex.org/W2151131175","https://openalex.org/W2156215965","https://openalex.org/W2165528704","https://openalex.org/W2166162093","https://openalex.org/W2166566648","https://openalex.org/W2271628119","https://openalex.org/W2949738152","https://openalex.org/W2962951564","https://openalex.org/W4213009134","https://openalex.org/W4300915415"],"related_works":["https://openalex.org/W2950997747","https://openalex.org/W179383408","https://openalex.org/W2067565196","https://openalex.org/W1996335051","https://openalex.org/W2063711222","https://openalex.org/W2185632961","https://openalex.org/W188677872","https://openalex.org/W2962866002","https://openalex.org/W2137376285","https://openalex.org/W2597306717"],"abstract_inverted_index":{"It":[0],"is":[1,15,42],"well":[2,80],"known":[3],"that":[4,36,46,52],"the":[5,20,37,56,65,68,74,82],"constraint":[6,21,39],"satisfaction":[7,40],"problem":[8,22,41],"over":[9,23,47],"a":[10,29,72],"general":[11],"relational":[12],"structure":[13],"A":[14,66],"polynomial":[16],"time":[17],"equivalent":[18,44,94],"to":[19,45,95,98],"some":[24],"associated":[25],"digraph.":[26,70],"We":[27],"present":[28],"variant":[30],"of":[31,55],"this":[32],"construction":[33],"and":[34,67,89],"show":[35,51],"corresponding":[38],"logspace":[43,88,92],"A.":[48],"Moreover,":[49],"we":[50],"almost":[53],"all":[54],"commonly":[57],"encountered":[58],"polymorphism":[59],"properties":[60],"are":[61,93],"held":[62],"equivalently":[63],"on":[64],"constructed":[69],"As":[71],"consequence,":[73],"Algebraic":[75],"CSP":[76],"dichotomy":[77],"conjecture":[78],"as":[79,81],"conjectures":[83],"characterizing":[84],"CSPs":[85],"solvable":[86],"in":[87,90],"nondeterministic":[91],"their":[96],"restriction":[97],"digraphs.":[99]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2016-06-24T00:00:00"}