{"id":"https://openalex.org/W7111122740","doi":"https://doi.org/10.4230/lipics.fsttcs.2025.36","title":"Hardness of Finding Kings and Strong Kings","display_name":"Hardness of Finding Kings and Strong Kings","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7111122740","doi":"https://doi.org/10.4230/lipics.fsttcs.2025.36"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25085","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.36","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.36/LIPIcs.FSTTCS.2025.36.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.36/LIPIcs.FSTTCS.2025.36.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ismaili Alaoui, Ziad","orcid":"https://orcid.org/0009-0002-3529-0418"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Ismaili Alaoui, Ziad","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"last","author":{"id":null,"display_name":"Mande, Nikhil","orcid":"https://orcid.org/0000-0002-9520-7340"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mande, Nikhil","raw_affiliation_strings":["Department of Computer Science, University of Liverpool, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.69427769,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"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.902400016784668,"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.902400016784668,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.06019999831914902,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.012799999676644802,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.9359999895095825},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6794000267982483},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6633999943733215},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4916999936103821},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.3984000086784363},{"id":"https://openalex.org/keywords/contrast","display_name":"Contrast (vision)","score":0.32749998569488525}],"concepts":[{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.9359999895095825},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6834999918937683},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6794000267982483},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6633999943733215},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6597999930381775},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4916999936103821},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4147000014781952},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3984000086784363},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.32749998569488525},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.25589999556541443},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2524999976158142}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25085","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.36","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.36/LIPIcs.FSTTCS.2025.36.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.fsttcs.2025.36","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fsttcs.2025.36","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25085","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.36","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol360-fsttcs2025/LIPIcs.FSTTCS.2025.36/LIPIcs.FSTTCS.2025.36.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6282489895820618}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7111122740.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"A":[0,190],"king":[1,66,96,124,128,170],"in":[2,50,67,75,100,111,171,187,193],"a":[3,7,20,41,65,85,95,122,127,168,172,178,206],"directed":[4],"graph":[5,36],"is":[6,15,28,71,74,84,147,174,196,205],"vertex":[8,14,204],"v":[9,18,134,146,157],"such":[10,130],"that":[11,31,57,94,135,162],"every":[12,32,133,203],"other":[13],"reachable":[16],"from":[17,143,156],"via":[19],"path":[21],"of":[22,61,64,114,140,153,166,180,199,212],"length":[23],"at":[24,44],"most":[25],"2.":[26],"It":[27],"well":[29],"known":[30],"tournament":[33,115,173,232],"(a":[34],"complete":[35],"where":[37,81,87,202],"each":[38],"edge":[39],"has":[40,43],"direction)":[42],"least":[45],"one":[46],"king.":[47],"Our":[48],"contributions":[49],"this":[51],"work":[52],"are:":[53],"-":[54,103],"We":[55,160,215],"show":[56,161],"the":[58,79,82,109,112,138,151,163,188,197],"query":[59,164],"complexity":[60,165],"determining":[62],"existence":[63],"arbitrary":[68],"n-vertex":[69],"digraphs":[70],"\u0398(n\u00b2).":[72,175],"This":[73,176],"stark":[76],"contrast":[77],"to":[78,107,125,145,158,227],"case":[80],"input":[83],"tournament,":[86],"Shen,":[88],"Sheng,":[89],"and":[90,118,184,208,219,224],"Wu":[91],"[SICOMP'03]":[92],"showed":[93],"can":[97],"be":[98,126],"found":[99],"O(n^{3/2})":[101],"queries.":[102],"In":[104],"an":[105],"attempt":[106],"increase":[108],"\"fairness\"":[110],"definition":[113],"winners,":[116],"Ho":[117],"Chang":[119],"[IPL'03]":[120],"defined":[121],"strong":[123,169],"k":[129,144],"that,":[131],"for":[132],"dominates":[136],"k,":[137],"number":[139,152],"length-2":[141,154],"paths":[142,155],"strictly":[148],"larger":[149],"than":[150],"k.":[159],"finding":[167],"answers":[177],"question":[179],"Biswas,":[181],"Jayapaul,":[182],"Raman,":[183],"Satti":[185],"[DAM'22]":[186],"negative.":[189],"key":[191],"component":[192],"our":[194],"proofs":[195],"design":[198],"specific":[200],"tournaments":[201],"king,":[207],"analyzing":[209],"certain":[210],"properties":[211,220],"these":[213,217],"tournaments.":[214],"feel":[216],"constructions":[218],"are":[221],"independently":[222],"interesting":[223,229],"may":[225],"lead":[226],"more":[228],"results":[230],"about":[231],"solutions.":[233]},"counts_by_year":[],"updated_date":"2026-03-11T14:59:36.786465","created_date":"2025-12-10T00:00:00"}