{"id":"https://openalex.org/W7109972711","doi":"https://doi.org/10.4230/lipics.stacs.2025.41","title":"Residue Domination in Bounded-Treewidth Graphs","display_name":"Residue Domination in Bounded-Treewidth Graphs","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7109972711","doi":"https://doi.org/10.4230/lipics.stacs.2025.41"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:22867","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.41","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol327-stacs2025/LIPIcs.STACS.2025.41/LIPIcs.STACS.2025.41.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":"InProceedings"},"type":"article","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol327-stacs2025/LIPIcs.STACS.2025.41/LIPIcs.STACS.2025.41.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Greilhuber, Jakob","orcid":null},"institutions":[{"id":"https://openalex.org/I4210128801","display_name":"Helmholtz Center for Information Security","ror":"https://ror.org/02njgxr09","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I4210128801"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Greilhuber, Jakob","raw_affiliation_strings":["TU Wien, Austria; CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Austria; CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210128801"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Schepper, Philipp","orcid":null},"institutions":[{"id":"https://openalex.org/I4210128801","display_name":"Helmholtz Center for Information Security","ror":"https://ror.org/02njgxr09","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I4210128801"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Schepper, Philipp","raw_affiliation_strings":["CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210128801"]}]},{"author_position":"last","author":{"id":null,"display_name":"Wellnitz, Philip","orcid":null},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]},{"id":"https://openalex.org/I200475212","display_name":"The Graduate University for Advanced Studies, SOKENDAI","ror":"https://ror.org/0516ah480","country_code":"JP","type":"education","lineage":["https://openalex.org/I200475212"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Wellnitz, Philip","raw_affiliation_strings":["National Institute of Informatics, Tokyo, Japan; The Graduate University for Advanced Studies, SOKENDAI, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Tokyo, Japan; The Graduate University for Advanced Studies, SOKENDAI, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095","https://openalex.org/I200475212"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7772,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.81210625,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"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.7962999939918518,"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.7962999939918518,"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.1738000065088272,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.00570000009611249,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6394000053405762},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.46399998664855957},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45680001378059387},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.43810001015663147},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.423799991607666},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4153999984264374},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41359999775886536},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.40720000863075256},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.37860000133514404}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7421000003814697},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7315999865531921},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6394000053405762},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4876999855041504},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.46399998664855957},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45680001378059387},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.43810001015663147},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.423799991607666},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4153999984264374},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41359999775886536},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.40720000863075256},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.37860000133514404},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.36660000681877136},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.35409998893737793},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3352000117301941},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.33489999175071716},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.33070001006126404},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.3294000029563904},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.3133000135421753},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.29429998993873596},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2883000075817108},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2727999985218048},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2599000036716461},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2524999976158142},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.25110000371932983}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:22867","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.41","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol327-stacs2025/LIPIcs.STACS.2025.41/LIPIcs.STACS.2025.41.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":"InProceedings"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:22867","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2025.41","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol327-stacs2025/LIPIcs.STACS.2025.41/LIPIcs.STACS.2025.41.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":"InProceedings"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.5947966575622559}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W7109972711.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"For":[0,183],"the":[1,18,29,38,51,81,92,110,126,133,139,144,192,196],"vertex":[2],"selection":[3],"problem":[4,111],"(\u03c3,\u03c1)-DomSet":[5],"one":[6],"is":[7,20,43,56,155,170,199],"given":[8],"two":[9,99],"fixed":[10],"sets":[11],"\u03c3":[12,45,95],"and":[13,17,75,96,115,129],"\u03c1":[14,58,97],"of":[15,28,40,53,132],"integers":[16],"task":[19],"to":[21,90,191],"decide":[22],"whether":[23],"we":[24,187],"can":[25],"select":[26],"vertices":[27],"input":[30],"graph":[31,69],"such":[32,71],"that,":[33],"for":[34,47,143],"every":[35,48],"selected":[36,41,54],"vertex,":[37,50],"number":[39,52],"neighbors":[42,55],"in":[44,57,121],"and,":[46],"unselected":[49],"[Telle,":[59],"Nord.":[60],"J.":[61],"Comp.":[62],"1994].":[63],"This":[64,135],"framework":[65],"covers":[66],"many":[67],"fundamental":[68],"problems":[70],"as":[72,195],"Independent":[73],"Set":[74],"Dominating":[76],"Set.":[77],"We":[78,108,157],"significantly":[79,136],"extend":[80,188],"recent":[82],"result":[83],"by":[84,113,161,177],"Focke":[85],"et":[86],"al.":[87],"[SODA":[88],"2023]":[89],"investigate":[91],"case":[93,145],"when":[94],"are":[98],"(potentially":[100],"different)":[101],"residue":[102],"classes":[103],"modulo":[104],"m":[105,146,184],"\u2265":[106,147],"2.":[107],"study":[109],"parameterized":[112,176],"treewidth":[114],"present":[116],"an":[117,151],"algorithm":[118,160,175],"that":[119,168],"solves":[120],"time":[122,154],"m^tw":[123],"\u22c5":[124,173],"n^O(1)":[125],"decision,":[127],"minimization":[128,193],"maximization":[130],"version":[131,194,198],"problem.":[134],"improves":[137],"upon":[138],"known":[140],"algorithms":[141],"where":[142],"3":[148],"not":[149],"even":[150],"explicit":[152],"running":[153],"known.":[156],"complement":[158],"our":[159],"providing":[162],"matching":[163],"lower":[164],"bounds":[165,190],"which":[166],"state":[167],"there":[169],"no":[171],"(m-\u03b5)^pw":[172],"n^O(1)-time":[174],"pathwidth":[178],"pw,":[179],"unless":[180],"SETH":[181],"fails.":[182],"=":[185],"2,":[186],"these":[189],"decision":[197],"efficiently":[200],"solvable.":[201]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-12-08T00:00:00"}