{"id":"https://openalex.org/W3158251097","doi":"https://doi.org/10.1145/3439801","title":"Data Reduction for Maximum Matching on Real-World Graphs","display_name":"Data Reduction for Maximum Matching on Real-World Graphs","publication_year":2021,"publication_date":"2021-04-23","ids":{"openalex":"https://openalex.org/W3158251097","doi":"https://doi.org/10.1145/3439801","mag":"3158251097"},"language":"en","primary_location":{"id":"doi:10.1145/3439801","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3439801","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088434500","display_name":"Tomohiro Koana","orcid":"https://orcid.org/0000-0002-8684-0611"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Tomohiro Koana","raw_affiliation_strings":["TU Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"TU Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009985293","display_name":"Viatcheslav Korenwein","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Viatcheslav Korenwein","raw_affiliation_strings":["TU Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"TU Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012560459","display_name":"Andr\u00e9 Nichterlein","orcid":"https://orcid.org/0000-0001-7451-9401"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andr\u00e9 Nichterlein","raw_affiliation_strings":["TU Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"TU Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033021388","display_name":"Rolf Niedermeier","orcid":"https://orcid.org/0000-0003-1703-1236"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Niedermeier","raw_affiliation_strings":["TU Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"TU Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038465467","display_name":"Philipp Zschoche","orcid":"https://orcid.org/0000-0001-9846-0600"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Philipp Zschoche","raw_affiliation_strings":["TU Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"TU Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5088434500"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":null,"apc_paid":null,"fwci":1.3317,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.83030325,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"26","issue":null,"first_page":"1","last_page":"30"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9998000264167786,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.7136313915252686},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6197450160980225},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5644358992576599},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.563567042350769},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5155375003814697},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5059410929679871},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4980282783508301},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4753529727458954},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4600522220134735},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4562183618545532},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.4493383765220642},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.44479674100875854},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.411817342042923},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38390791416168213},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3827824890613556},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3590904176235199},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3587542176246643},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1809537708759308},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.07950550317764282}],"concepts":[{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.7136313915252686},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6197450160980225},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5644358992576599},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.563567042350769},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5155375003814697},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5059410929679871},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4980282783508301},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4753529727458954},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4600522220134735},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4562183618545532},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.4493383765220642},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.44479674100875854},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.411817342042923},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38390791416168213},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3827824890613556},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3590904176235199},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3587542176246643},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1809537708759308},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.07950550317764282},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3439801","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3439801","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8904030062","display_name":null,"funder_award_id":"NI 369/16","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1949860258","https://openalex.org/W1974692335","https://openalex.org/W2013415302","https://openalex.org/W2020282424","https://openalex.org/W2034437384","https://openalex.org/W2047281923","https://openalex.org/W2077654620","https://openalex.org/W2106579389","https://openalex.org/W2157529519","https://openalex.org/W2164424155","https://openalex.org/W2327315803","https://openalex.org/W2513955757","https://openalex.org/W2596114558","https://openalex.org/W2610479830","https://openalex.org/W2617953066","https://openalex.org/W2755088640","https://openalex.org/W2782000683","https://openalex.org/W2949142592","https://openalex.org/W2985682564","https://openalex.org/W2987505511","https://openalex.org/W2998757566","https://openalex.org/W3010460567","https://openalex.org/W3096671981","https://openalex.org/W3104783836","https://openalex.org/W3121437753","https://openalex.org/W4210733105","https://openalex.org/W4230551286","https://openalex.org/W4233756358"],"related_works":["https://openalex.org/W2381408042","https://openalex.org/W33845589","https://openalex.org/W189387296","https://openalex.org/W4388276051","https://openalex.org/W2161286454","https://openalex.org/W2964273883","https://openalex.org/W2355184605","https://openalex.org/W2122202324","https://openalex.org/W4382583004","https://openalex.org/W4301903827"],"abstract_inverted_index":{"Finding":[0],"a":[1],"maximum-cardinality":[2,52],"or":[3],"maximum-weight":[4],"matching":[5],"in":[6,31,105,114,120],"(edge-weighted)":[7],"undirected":[8],"graphs":[9],"is":[10,112],"among":[11],"the":[12,27,56,65,79,82,98,108,115,121],"most":[13],"prominent":[14],"problems":[15],"of":[16,68,97],"algorithmic":[17],"graph":[18],"theory.":[19],"For":[20],"n":[21,35],"-vertex":[22],"and":[23,54,61,81,118],"m":[24,33],"-edge":[25],"graphs,":[26],"best-known":[28],"algorithms":[29],"run":[30],"\u00d5(":[32],"\u221a":[34],")":[36],"time.":[37],"We":[38],"build":[39],"on":[40,45],"recent":[41],"theoretical":[42,57],"work":[43],"focusing":[44],"linear-time":[46],"data":[47,74,91],"reduction":[48,75,92],"rules":[49,76,93],"for":[50,77,102],"finding":[51],"matchings":[53,104],"complement":[55],"results":[58],"by":[59],"presenting":[60],"analyzing":[62],"(thereby":[63],"employing":[64],"kernelization":[66],"methodology":[67],"parameterized":[69],"complexity":[70],"analysis)":[71],"new":[72],"(near-)linear-time":[73],"both":[78],"unweighted":[80,116],"positive-integer-weighted":[83],"case.":[84,123],"Moreover,":[85],"we":[86],"experimentally":[87],"demonstrate":[88],"that":[89],"these":[90],"provide":[94],"significant":[95],"speedups":[96],"state-of-the":[99],"art":[100],"implementations":[101],"computing":[103],"real-world":[106],"graphs:":[107],"average":[109],"speedup":[110],"factor":[111],"4.7":[113],"case":[117],"12.72":[119],"weighted":[122]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}