{"id":"https://openalex.org/W7163564913","doi":"https://doi.org/10.48550/arxiv.2606.04572","title":"Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances","display_name":"Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances","publication_year":2026,"publication_date":"2026-06-03","ids":{"openalex":"https://openalex.org/W7163564913","doi":"https://doi.org/10.48550/arxiv.2606.04572"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.04572","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.04572","pdf_url":null,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.04572","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090485692","display_name":"Tim A. Hartmann","orcid":"https://orcid.org/0000-0002-1028-6351"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hartmann, Tim A.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137856828","display_name":"D\u00e1niel Marx","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marx, D\u00e1niel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"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.6952000260353088,"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.6952000260353088,"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.29120001196861267,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.003800000064074993,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/pairwise-comparison","display_name":"Pairwise comparison","score":0.7074999809265137},{"id":"https://openalex.org/keywords/irrational-number","display_name":"Irrational number","score":0.6941999793052673},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.5874000191688538},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5199999809265137},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5027999877929688},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4984000027179718},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4625000059604645},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4478999972343445},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.4327000081539154},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4153999984264374}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.730400025844574},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7074999809265137},{"id":"https://openalex.org/C94931360","wikidata":"https://www.wikidata.org/wiki/Q607728","display_name":"Irrational number","level":2,"score":0.6941999793052673},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.5874000191688538},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5199999809265137},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5027999877929688},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4984000027179718},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4625000059604645},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45730000734329224},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4478999972343445},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.4327000081539154},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41670000553131104},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4153999984264374},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3662000000476837},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.364300012588501},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.34869998693466187},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.34700000286102295},{"id":"https://openalex.org/C2984853995","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independence number","level":3,"score":0.34459999203681946},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.33809998631477356},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3239000141620636},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3228999972343445},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.31869998574256897},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.3163999915122986},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.30320000648498535},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.30149999260902405},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.3009999990463257},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.2858999967575073},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.2752000093460083},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.27410000562667847},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.25870001316070557}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.04572","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.04572","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.04572","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.04572","pdf_url":null,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"distance-d":[1],"variants":[2],"of":[3,22,47,103,125,139,168,177,200],"Independent":[4],"Set":[5,8],"and":[6,33,39,61,91,112],"Dominating":[7],"problems":[9,24,52,105,203],"have":[10],"been":[11],"extensively":[12],"studied":[13],"from":[14,152,190],"different":[15],"algorithmic":[16],"viewpoints.":[17],"In":[18,127],"particular,":[19],"the":[20,50,70,75,128,131,157,160,178,191],"complexity":[21],"these":[23,82,104,201],"are":[25,78,145],"well":[26],"understood":[27],"on":[28,204],"bounded-treewidth":[29,205],"graphs":[30],"[Katsikarelis,":[31],"Lampis,":[32],"Paschos,":[34],"Discret.":[35],"Appl.":[36],"Math":[37],"2022][Borradaile":[38],"Le,":[40],"IPEC":[41],"2016]:":[42],"given":[43],"a":[44,107,122,136,165,197],"tree":[45],"decomposition":[46],"width":[48],"t,":[49],"two":[51,202],"can":[53],"be":[54,87],"solved":[55],"in":[56,81,106,156],"time":[57],"$d^t":[58],"\\cdot":[59,65],"n^{O(1)}$":[60],"$(2d":[62],"+":[63],"1)t":[64],"n^{O(1)}$,":[66],"respectively.":[67],"Furthermore,":[68],"assuming":[69],"Strong":[71],"Exponential-Time":[72],"Hypothesis":[73],"(SETH),":[74],"base":[76],"constants":[77],"best":[79],"possible":[80],"running":[83],"times:":[84],"they":[85],"cannot":[86],"improved":[88],"to":[89,134,163],"$d-\u03b5$":[90],"$2d+1-\u03b5$,":[92],"respectively,":[93],"for":[94],"any":[95],"$\u03b5":[96],">":[97],"0$.":[98],"We":[99,195],"investigate":[100],"continuous":[101],"versions":[102],"setting":[108],"introduced":[109],"by":[110,121],"Megiddo":[111],"Tamir":[113],"[SICOMP":[114],"1983],":[115],"where":[116],"every":[117,175],"edge":[118],"is":[119,133,162,184],"modeled":[120],"unit-length":[123],"interval":[124],"points.":[126],"\u03b4-Dispersion":[129],"problem,":[130,159],"task":[132,161],"find":[135,164],"maximum":[137],"number":[138,167],"points":[140,169],"(possibly":[141,170],"inside":[142,171,182],"edges)":[143,172,183],"that":[144,174],"pairwise":[146],"at":[147,149,185,187],"distance":[148,186],"least":[150],"\u03b4":[151,189],"each":[153],"other.":[154],"Similarly,":[155],"\u03b4-Covering":[158],"minimum":[166],"such":[173],"point":[176,193],"graph":[179],"(including":[180],"those":[181],"most":[188],"selected":[192],"set.":[194],"provide":[196],"comprehensive":[198],"understanding":[199],"graphs.":[206]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-05T00:00:00"}