{"id":"https://openalex.org/W4408909543","doi":"https://doi.org/10.46298/lmcs-21(1:29)2025","title":"Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries","display_name":"Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries","publication_year":2025,"publication_date":"2025-03-27","ids":{"openalex":"https://openalex.org/W4408909543","doi":"https://doi.org/10.46298/lmcs-21(1:29)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(1:29)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(1:29)2025","pdf_url":"https://lmcs.episciences.org/15433/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":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/15433/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044394587","display_name":"Karl Bringmann","orcid":"https://orcid.org/0000-0003-1356-5177"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Karl Bringmann","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5030337488","display_name":"Nofar Carmeli","orcid":"https://orcid.org/0000-0003-0673-5510"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nofar Carmeli","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044394587"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06352398,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9972000122070312,"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"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9972000122070312,"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/T11106","display_name":"Data Management and Algorithms","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11719","display_name":"Data Quality and Management","score":0.9776999950408936,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.9297422766685486},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.7387698888778687},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.580743134021759},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3796353042125702},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36252498626708984},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32444334030151367},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3137695789337158},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.2869136333465576},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.07375907897949219}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.9297422766685486},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.7387698888778687},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.580743134021759},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3796353042125702},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36252498626708984},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32444334030151367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3137695789337158},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2869136333465576},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.07375907897949219}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.46298/lmcs-21(1:29)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(1:29)2025","pdf_url":"https://lmcs.episciences.org/15433/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:HAL:lirmm-05246520v1","is_oa":true,"landing_page_url":"https://hal-lirmm.ccsd.cnrs.fr/lirmm-05246520","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, 2025, 21 (1), ⟨10.46298/lmcs-21(1:29)2025⟩","raw_type":"Journal articles"},{"id":"pmh:oai:doaj.org/article:851e60a08e104a8ab1cc525377c7265b","is_oa":true,"landing_page_url":"https://doaj.org/article/851e60a08e104a8ab1cc525377c7265b","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 21, Issue 1 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(1:29)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(1:29)2025","pdf_url":"https://lmcs.episciences.org/15433/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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4408909543.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W108845024","https://openalex.org/W2406961474","https://openalex.org/W4300125793","https://openalex.org/W2578985712","https://openalex.org/W2952598754","https://openalex.org/W3042106073","https://openalex.org/W2143566611","https://openalex.org/W4251460363","https://openalex.org/W588267724"],"abstract_inverted_index":{"We":[0,170],"study":[1],"the":[2,22,36,68,75,93,111,157,198,214,229,259],"enumeration":[3,230],"of":[4,8,39,137,159,182,191,216,228,232,246,254,279],"answers":[5],"to":[6,20,74,82,121,147,155,179,200,224,284],"Unions":[7],"Conjunctive":[9],"Queries":[10],"(UCQs)":[11],"with":[12,28,72],"optimal":[13],"time":[14,31,54],"guarantees.":[15],"More":[16],"precisely,":[17],"we":[18,101,130,145,185,196,242],"wish":[19],"identify":[21,131],"queries":[23],"that":[24,47,103,141,172,221],"can":[25,49,269],"be":[26,50,270,285],"solved":[27,51],"linear":[29,168],"preprocessing":[30],"and":[32],"constant":[33],"delay.":[34],"Despite":[35],"basic":[37],"nature":[38],"this":[40,138,173,201,207],"problem,":[41],"it":[42,153],"was":[43],"shown":[44],"only":[45],"recently":[46],"UCQs":[48,107,280],"within":[52],"these":[53],"bounds":[55],"if":[56,63,144,195],"they":[57],"admit":[58],"free-connex":[59],"union":[60,69],"extensions,":[61],"even":[62],"all":[64,149],"individual":[65],"CQs":[66,194],"in":[67,124,162,167,177,213],"are":[70,108],"intractable":[71],"respect":[73],"same":[76],"complexity":[77,231],"measure.":[78],"Our":[79],"goal":[80],"is":[81,142,152,175,203,222],"understand":[83],"whether":[84],"there":[85],"exist":[86],"additional":[87,252],"tractable":[88],"UCQs,":[89],"not":[90,282],"covered":[91],"by":[92],"currently":[94,281],"known":[95,117,283],"algorithms.":[96],"As":[97,126],"a":[98,116,127,132,135,160,163,187,210,217,236,262,277],"first":[99],"step,":[100,129],"show":[102,186],"some":[104,180],"previously":[105],"unclassified":[106],"hard":[109],"using":[110],"classic":[112],"3SUM":[113,120],"hypothesis,":[114],"via":[115],"reduction":[118],"from":[119],"triangle":[122,161,240,266],"listing":[123],"graphs.":[125],"second":[128],"question":[133,202],"about":[134],"variant":[136],"graph":[139,166],"task":[140,174],"unavoidable":[143],"want":[146],"classify":[148],"self-join-free":[150,193,256],"UCQs:":[151],"possible":[154],"decide":[156],"existence":[158],"vertex-unbalanced":[164],"tripartite":[165],"time?":[169],"prove":[171],"equivalent":[176],"hardness":[178],"family":[181,278],"UCQs.":[183,234],"Finally,":[184],"dichotomy":[188],"for":[189,238,251,276],"unions":[190,253],"two":[192,255],"assume":[197],"answer":[199],"negative.":[204],"In":[205],"conclusion,":[206],"paper":[208],"pinpoints":[209],"computational":[211],"barrier":[212],"form":[215],"single":[218],"decision":[219],"problem":[220],"key":[223],"advancing":[225],"our":[226],"understanding":[227],"many":[233],"Without":[235],"breakthrough":[237],"unbalanced":[239,265],"detection,":[241],"have":[243],"no":[244],"hope":[245],"finding":[247],"an":[248,273],"efficient":[249,264,274],"algorithm":[250,268,275],"CQs.":[257],"On":[258],"other":[260],"hand,":[261],"sufficiently":[263],"detection":[267],"turned":[271],"into":[272],"tractable.":[286]},"counts_by_year":[],"updated_date":"2026-02-27T16:54:17.756197","created_date":"2025-10-10T00:00:00"}