{"id":"https://openalex.org/W6942214630","doi":"https://doi.org/10.14279/depositonce-19836","title":"New parameterized algorithms for matching and packing problems","display_name":"New parameterized algorithms for matching and packing problems","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W6942214630","doi":"https://doi.org/10.14279/depositonce-19836"},"language":"en","primary_location":{"id":"pmh:oai:depositonce.tu-berlin.de:11303/21036","is_oa":true,"landing_page_url":"https://depositonce.tu-berlin.de/handle/11303/21036","pdf_url":null,"source":{"id":"https://openalex.org/S4406922277","display_name":"DepositOnce","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":null,"raw_type":"acceptedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://depositonce.tu-berlin.de/handle/11303/21036","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Koana, Tomohiro","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Koana, Tomohiro","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.53853443,"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":true,"primary_topic":{"id":"https://openalex.org/T10451","display_name":"Mycorrhizal Fungi and Plant Interactions","score":0.5073999762535095,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10451","display_name":"Mycorrhizal Fungi and Plant Interactions","score":0.5073999762535095,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10825","display_name":"Plant Pathogens and Fungal Diseases","score":0.06970000267028809,"subfield":{"id":"https://openalex.org/subfields/1307","display_name":"Cell 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"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.06840000301599503,"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/bipartite-graph","display_name":"Bipartite graph","score":0.7562000155448914},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7365999817848206},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6740000247955322},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.645799994468689},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.5684000253677368},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5349000096321106},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5041000247001648},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.49790000915527344}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7562000155448914},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7365999817848206},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6740000247955322},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.645799994468689},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6327999830245972},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.5684000253677368},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5349000096321106},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5134000182151794},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5041000247001648},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.49790000915527344},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4936000108718872},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4867999851703644},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.47600001096725464},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.47189998626708984},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4661000072956085},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4528000056743622},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43779999017715454},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.4293999969959259},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.39410001039505005},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3840999901294708},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.36559998989105225},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.319599986076355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27410000562667847},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.26339998841285706},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:depositonce.tu-berlin.de:11303/21036","is_oa":true,"landing_page_url":"https://depositonce.tu-berlin.de/handle/11303/21036","pdf_url":null,"source":{"id":"https://openalex.org/S4406922277","display_name":"DepositOnce","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":null,"raw_type":"acceptedVersion"},{"id":"doi:10.14279/depositonce-19836","is_oa":true,"landing_page_url":"https://doi.org/10.14279/depositonce-19836","pdf_url":null,"source":{"id":"https://openalex.org/S7407052985","display_name":"Technische Universit\u00e4t Berlin \u2013 Universit\u00e4tsbibliothek","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":"article-journal"}],"best_oa_location":{"id":"pmh:oai:depositonce.tu-berlin.de:11303/21036","is_oa":true,"landing_page_url":"https://depositonce.tu-berlin.de/handle/11303/21036","pdf_url":null,"source":{"id":"https://openalex.org/S4406922277","display_name":"DepositOnce","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":null,"raw_type":"acceptedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0,140,359,387],"thesis":[1,65],"considers":[2],"parameterized":[3,162,235,373],"algorithms":[4,189,234],"for":[5,61,75,137,190,248,351],"matching":[6,47,83,145,169,175,257,309,333,385],"and":[7,26,171,310,330,382],"packing":[8,311,353],"problems":[9,399],"which":[10],"are":[11],"widely":[12],"studied":[13],"in":[14,262,277,393],"computer":[15],"science.":[16],"In":[17,266,339],"these":[18,67],"problems,":[19,312],"we":[20,177,269,342],"have":[21],"a":[22,32,42,46,87,93,102,111,207,222,295,356,394],"collection":[23,33,43],"of":[24,34,89,100,150,198,225,239,274,298,328,380],"sets,":[25],"the":[27,98,143,148,154,164,167,172,228,237,240,255,284,313,322,331,365,375,378,383],"task":[28],"is":[29,44,84,117,204,252,283,361],"to":[30,109,158,205,217,221,363],"find":[31,206],"pairwise":[35],"disjoint":[36],"sets":[37],"under":[38,355],"certain":[39],"constraints.":[40],"Such":[41],"called":[45],"when":[48,161],"each":[49,211],"set":[50,88,224],"comprises":[51],"two":[52],"elements.":[53],"Matchings":[54],"exhibit":[55],"structural":[56],"properties":[57],"that":[58,91,183,254],"prove":[59],"useful":[60],"algorithm":[62,273,350,372],"design.":[63],"The":[64,119,202],"investigates":[66],"topics,":[68],"organized":[69],"into":[70],"six":[71],"chapters.":[72],"Polynomial":[73],"Kernels":[74],"Induced":[76,138],"Matching":[77],"on":[78,114,124,305,397],"Sparse":[79],"Graphs.":[80],"An":[81],"induced":[82,104,144,174],"defined":[85],"by":[86,163,236,374],"vertices":[90,226],"induces":[92],"1-regular":[94],"graph.":[95],"We":[96,194,231,293,346],"study":[97,195,343],"problem":[99,146,155,258,325,334,354],"finding":[101],"maximum":[103,168,173,256,384],"matching.":[105,201],"A":[106],"unified":[107],"framework":[108,120],"design":[110],"polynomial":[112,122],"kernel":[113],"sparse":[115],"graphs":[116],"presented.":[118],"yields":[121],"kernels":[123],"c-close":[125],"graphs,":[126,129],"weakly":[127],"\u03b3-closed":[128],"as":[130,132],"well":[131],"biclique-free":[133],"graphs.":[134],"Below-guarantee":[135],"Parameterizations":[136],"Matching.":[139,193,250],"chapter":[141,314],"studies":[142],"from":[147,213,227],"perspectives":[149],"below-guarantee":[151,181],"parameterizations.":[152],"While":[153],"turns":[156],"out":[157],"be":[159,260],"W[1]-hard":[160],"difference":[165,376],"between":[166,377],"size":[170,238],"size,":[176],"uncover":[178],"an":[179,185,271,348,370,389],"intricate":[180],"parameterization":[182],"admits":[184],"FPT":[186,188,233,300,349,371],"algorithm.":[187],"Fair":[191],"Many-to-One":[192],"\u201cfair\u201d":[196],"variants":[197],"bipartite":[199],"many-to-one":[200,208],"objective":[203],"matching,":[209],"where":[210,281],"vertex":[212,286,289],"one":[214],"side\u2014potentially":[215],"matched":[216,220],"multiple":[218],"vertices\u2014is":[219],"balanced":[223],"other":[229],"side.":[230],"contribute":[232],"side":[241],"with":[242],"multi-vertex":[243],"matches.":[244],"Fully":[245],"Polynomial-Time":[246],"Algorithms":[247],"Maximum":[249],"It":[251],"known":[253],"can":[259],"solved":[261],"randomized":[263],"O(n^\u03c9)":[264],"time.":[265],"this":[267,340],"chapter,":[268,341],"give":[270],"adaptive":[272],"this,":[275],"running":[276],"time":[278],"O(k^{\u03c9\u22121}":[279],"n^{1+o(1)}),":[280],"k":[282],"feedback":[285],"number":[287,379],"or":[288],"integrity.":[290],"Determinantal":[291],"Sieving.":[292],"introduce":[294],"novel":[296],"toolkit":[297],"algebraic":[299],"algorithms:":[301],"determinantal":[302],"sieving.":[303],"Focusing":[304],"its":[306],"applications":[307],"within":[308],"presents":[315],"several":[316],"improvements":[317],"over":[318,321],"existing":[319],"results":[320],"3-matroid":[323],"intersection":[324],"(a":[326],"generalization":[327],"3D-matching)":[329],"diverse":[332],"among":[335],"others.":[336],"Delta-matroid":[337],"Problems.":[338],"delta-matroid":[344,357],"problems.":[345],"present":[347],"triangle":[352],"constraint.":[358],"insight":[360],"applied":[362],"address":[364],"cluster":[366],"subgraph":[367],"problem,":[368],"giving":[369],"edges":[381],"size.":[386],"answers":[388],"open":[390],"question":[391],"raised":[392],"recent":[395],"survey":[396],"edge-modification":[398],"[Crespelle":[400],"et":[401],"al.,":[402],"Computer":[403],"Science":[404],"Review,":[405],"2023].":[406]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}