{"id":"https://openalex.org/W7167076569","doi":"https://doi.org/10.48550/arxiv.2607.00118","title":"Temporal Path Covers: Dilworth Properties and Parameterized Complexity","display_name":"Temporal Path Covers: Dilworth Properties and Parameterized Complexity","publication_year":2026,"publication_date":"2026-06-30","ids":{"openalex":"https://openalex.org/W7167076569","doi":"https://doi.org/10.48550/arxiv.2607.00118"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.00118","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00118","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2607.00118","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032928017","display_name":"Lapo Cioni","orcid":"https://orcid.org/0000-0002-4605-8473"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cioni, Lapo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092231004","display_name":"Sotiris Kanellopoulos","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kanellopoulos, Sotiris","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114285343","display_name":"Edouard Nemery","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nemery, Edouard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135290852","display_name":"Aris Pagourtzis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pagourtzis, Aris","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119981656","display_name":"Christos Pergaminelis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pergaminelis, Christos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5037706878","display_name":"Manolis Vasilakis","orcid":"https://orcid.org/0000-0001-6505-2977"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vasilakis, Manolis","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.23160000145435333,"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.23160000145435333,"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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.22169999778270721,"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/T12029","display_name":"DNA and Biological Computing","score":0.10199999809265137,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8382999897003174},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.8382999897003174},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.7340999841690063},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6263999938964844},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5062000155448914},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45809999108314514},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.44179999828338623},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4343000054359436}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8382999897003174},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8382999897003174},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7401999831199646},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.7340999841690063},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6263999938964844},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5527999997138977},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5062000155448914},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47429999709129333},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45809999108314514},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.44179999828338623},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4343000054359436},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41659998893737793},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.4065999984741211},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3903999924659729},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.38690000772476196},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.34549999237060547},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.31929999589920044},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3084999918937683},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.28780001401901245},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.25189998745918274}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.00118","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00118","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.00118","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.00118","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Life in Land","score":0.4321669638156891,"id":"https://metadata.un.org/sdg/15"}],"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],"Minimum":[1,7],"Temporal":[2],"Path":[3,10],"Cover":[4,11],"(TPC)":[5],"and":[6,136,141,247,273],"Temporally":[8],"Disjoint":[9],"(TDPC)":[12],"problems":[13],"were":[14,24],"introduced":[15],"by":[16,152,173,183],"[Chakraborty,":[17],"Dailly,":[18],"Foucaud,":[19],"Klasing,":[20],"MFCS":[21],"'24].":[22],"Both":[23],"shown":[25],"to":[26,66,121,156,192,240],"be":[27,190],"NP-hard":[28,37,250],"on":[29,38],"temporal":[30,39,53,161],"DAGs,":[31],"while":[32],"the":[33,58,61,67,70,83,86,99,109,112,115,122,126,153,168,195,207,217,220,231,236,258,271,274,278],"latter":[34],"is":[35,64,78,118,146,149,211,238],"also":[36],"oriented":[40],"trees.":[41],"All":[42],"tractable":[43],"cases":[44],"for":[45,101,139,160,252],"T(D)PC":[46,63,79,117],"established":[47],"in":[48,98,105,167,219,235],"that":[49,57,85,147,200,229],"paper":[50],"satisfy":[51],"a":[52,75,227],"Dilworth":[54,88],"property,":[55],"namely":[56],"size":[59,68,113],"of":[60,69,114,125,187,216,233,277],"minimum":[62,116],"equal":[65,120],"maximum":[71,275],"antichain.":[72],"This":[73],"raises":[74],"natural":[76],"question:":[77],"polynomial-time":[80],"solvable":[81],"under":[82,108],"promise":[84],"respective":[87,110],"property":[89],"holds?":[90],"In":[91,129],"this":[92,96,225],"work,":[93],"we":[94,132,198,260],"answer":[95],"question":[97,172],"affirmative":[100],"both":[102,245],"problems,":[103],"proving":[104],"fact":[106],"that,":[107],"promise,":[111],"exactly":[119],"Lov\u00e1sz":[123],"number":[124,186,210,232],"connectivity":[127],"graph.":[128,280],"another":[130],"direction,":[131],"establish":[133,261],"parameterized":[134,151,182],"algorithms":[135],"hardness":[137],"results":[138,265],"TPC":[140,148,246],"TDPC.":[142],"Our":[143],"main":[144],"result":[145],"W[1]-hard":[150],"deletion":[154],"distance":[155],"linear":[157],"forest":[158],"even":[159,251],"graphs":[162],"with":[163,226],"two":[164],"time-steps,":[165],"answering":[166],"negative":[169],"an":[170,179,201],"open":[171],"Chakraborty":[174],"et":[175],"al.":[176],"about":[177],"whether":[178],"XP":[180],"algorithm":[181,203],"treewidth":[184,218],"plus":[185],"time-steps":[188,234],"can":[189],"improved":[191],"FPT.":[193],"On":[194],"other":[196,263],"hand,":[197],"prove":[199],"FPT":[202],"does":[204],"exist":[205],"if":[206],"vertex":[208,254],"cover":[209,255],"used":[212],"as":[213,270],"parameter":[214,237],"instead":[215],"above":[221],"parameterization.":[222],"We":[223],"complement":[224],"proof":[228],"including":[230],"necessary":[239],"yield":[241],"tractability,":[242],"as,":[243],"otherwise,":[244],"TDPC":[248],"remain":[249],"constant":[253],"size.":[256],"Along":[257],"way,":[259],"various":[262],"para-NP-hardness":[264],"involving":[266],"structural":[267],"parameters":[268],"such":[269],"pathwidth":[272],"degree":[276],"underlying":[279]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-03T00:00:00"}