{"id":"https://openalex.org/W7158978769","doi":"https://doi.org/10.4230/dagrep.15.8.29","title":"Frontiers of Parameterized Algorithmics of Matching under Preferences (Dagstuhl Seminar 25342)","display_name":"Frontiers of Parameterized Algorithmics of Matching under Preferences (Dagstuhl Seminar 25342)","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7158978769","doi":"https://doi.org/10.4230/dagrep.15.8.29"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25774","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.8.29","pdf_url":null,"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":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.8.29","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134902058","display_name":"Jiehua Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Chen, Jiehua","raw_affiliation_strings":["TU Wien, AT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, AT","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102374330","display_name":"Christine Cheng","orcid":null},"institutions":[{"id":"https://openalex.org/I2801879210","display_name":"University School of Milwaukee","ror":"https://ror.org/045bzwt16","country_code":"US","type":"education","lineage":["https://openalex.org/I2801879210"]},{"id":"https://openalex.org/I43579087","display_name":"University of Wisconsin\u2013Milwaukee","ror":"https://ror.org/031q21x57","country_code":"US","type":"education","lineage":["https://openalex.org/I43579087"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cheng, Christine","raw_affiliation_strings":["University of Wisconsin - Milwaukee, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin - Milwaukee, US","institution_ids":["https://openalex.org/I2801879210","https://openalex.org/I43579087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124015759","display_name":"David Manlove","orcid":null},"institutions":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Manlove, David","raw_affiliation_strings":["University of Glasgow, GB"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Glasgow, GB","institution_ids":["https://openalex.org/I7882870"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070244460","display_name":"Ildik\u00f3 Schlotter","orcid":"https://orcid.org/0000-0002-0114-8280"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]},{"id":"https://openalex.org/I4210142495","display_name":"Eltek (Czechia)","ror":"https://ror.org/03ydrze65","country_code":"CZ","type":"company","lineage":["https://openalex.org/I4210142495"]}],"countries":["CZ","HU"],"is_corresponding":false,"raw_author_name":"Schlotter, Ildik\u00f3","raw_affiliation_strings":["ELTE KRTK - Budapest, HU"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ELTE KRTK - Budapest, HU","institution_ids":["https://openalex.org/I106118109","https://openalex.org/I4210142495"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033440939","display_name":"Manuel Sorge","orcid":"https://orcid.org/0000-0001-7394-3147"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Sorge, Manuel","raw_affiliation_strings":["TU Wien, AT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, AT","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":5,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.53639461,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9703999757766724,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9703999757766724,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.004000000189989805,"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/T11182","display_name":"Auction Theory and Applications","score":0.003700000001117587,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.9700999855995178},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7675999999046326},{"id":"https://openalex.org/keywords/algorithmics","display_name":"Algorithmics","score":0.5471000075340271},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4410000145435333},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42890000343322754},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.3571999967098236}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9700999855995178},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7675999999046326},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6478000283241272},{"id":"https://openalex.org/C34628019","wikidata":"https://www.wikidata.org/wiki/Q13636890","display_name":"Algorithmics","level":2,"score":0.5471000075340271},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4620000123977661},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4410000145435333},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42890000343322754},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3571999967098236},{"id":"https://openalex.org/C2778464652","wikidata":"https://www.wikidata.org/wiki/Q309849","display_name":"Open research","level":2,"score":0.34869998693466187},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2759000062942505},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.267300009727478},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.2671999931335449},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26330000162124634}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25774","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.8.29","pdf_url":null,"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":"Article"},{"id":"doi:10.4230/dagrep.15.8.29","is_oa":true,"landing_page_url":"https://doi.org/10.4230/dagrep.15.8.29","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Report"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25774","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.8.29","pdf_url":null,"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":"Article"},"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":{"This":[0,80],"report":[1,106],"documents":[2],"the":[3,6,31,83,90],"program":[4,53],"and":[5,36,63,70,114],"outcomes":[7],"of":[8,13,16,65,94,109],"Dagstuhl":[9],"Seminar":[10],"25342":[11],"\"Frontiers":[12],"Parameterized":[14,37],"Algorithmics":[15],"Matching":[17,32],"under":[18],"Preferences\",":[19],"held":[20],"from":[21,30],"August":[22],"17-22,":[23],"2025.":[24],"The":[25,52,105],"seminar":[26,81],"brought":[27],"together":[28],"researchers":[29],"Under":[33],"Preferences":[34],"(MATCH-UP)":[35],"Complexity":[38],"Theory":[39],"(PCT)":[40],"communities":[41],"to":[42,47,87],"systematically":[43],"apply":[44],"parameterized":[45,57,91],"techniques":[46],"computationally":[48],"hard":[49],"matching":[50,95],"problems.":[51,79],"included":[54],"tutorials":[55],"on":[56,60],"algorithmics,":[58],"surveys":[59],"MATCH-UP":[61],"complexity":[62,92],"structure":[64],"stable":[66],"matchings,":[67],"contributed":[68],"talks,":[69,110],"intensive":[71],"working":[72,112],"group":[73],"sessions":[74],"that":[75],"explored":[76],"fundamental":[77],"open":[78,115],"represents":[82],"first":[84],"focused":[85],"effort":[86],"comprehensively":[88],"map":[89],"landscape":[93],"markets,":[96],"establishing":[97],"frameworks":[98],"for":[99],"ongoing":[100],"collaboration":[101],"between":[102],"these":[103],"communities.":[104],"presents":[107],"abstracts":[108],"tutorials,":[111],"groups,":[113],"problems":[116],"in":[117],"alphabetical":[118],"order":[119],"by":[120],"speaker.":[121]},"counts_by_year":[],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2026-05-01T00:00:00"}