{"id":"https://openalex.org/W3201331607","doi":"https://doi.org/10.1007/s00453-023-01190-4","title":"Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model","display_name":"Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model","publication_year":2023,"publication_date":"2023-11-28","ids":{"openalex":"https://openalex.org/W3201331607","doi":"https://doi.org/10.1007/s00453-023-01190-4","mag":"3201331607"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-023-01190-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-023-01190-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5077772086","display_name":"Moran Feldman","orcid":"https://orcid.org/0000-0002-1535-2979"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Moran Feldman","raw_affiliation_strings":["Department of Computer Science, University of Haifa, Haifa, Israel"],"raw_orcid":"https://orcid.org/0000-0002-1535-2979","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Haifa, Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026874461","display_name":"Ariel Szarf","orcid":null},"institutions":[{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ariel Szarf","raw_affiliation_strings":["Department of Mathematics and Computer Science, Open University of Israel, Ra\u2019anana, Israel","Department of Mathematics and Computer Science, Open University of Israel, Ra'anana, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Open University of Israel, Ra\u2019anana, Israel","institution_ids":["https://openalex.org/I164950643"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, Open University of Israel, Ra'anana, Israel","institution_ids":["https://openalex.org/I164950643"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077772086"],"corresponding_institution_ids":["https://openalex.org/I91203450"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.5903,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.65852136,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"86","issue":"4","first_page":"1173","last_page":"1209"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9983999729156494,"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/matching","display_name":"Matching (statistics)","score":0.7293215990066528},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6308139562606812},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6286184787750244},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5538100004196167},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.5481545925140381},{"id":"https://openalex.org/keywords/approx","display_name":"Approx","score":0.5052939057350159},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.46933403611183167},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4613795876502991},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43850621581077576},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.3718712329864502},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34725087881088257},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3380199670791626},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.23690393567085266},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08958473801612854}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7293215990066528},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6308139562606812},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6286184787750244},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5538100004196167},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.5481545925140381},{"id":"https://openalex.org/C2777894999","wikidata":"https://www.wikidata.org/wiki/Q4781758","display_name":"Approx","level":2,"score":0.5052939057350159},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.46933403611183167},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4613795876502991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43850621581077576},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.3718712329864502},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34725087881088257},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3380199670791626},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.23690393567085266},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08958473801612854},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-023-01190-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-023-01190-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7746946551","display_name":null,"funder_award_id":"1357/16","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W1498807656","https://openalex.org/W1514707655","https://openalex.org/W1595640791","https://openalex.org/W1639030016","https://openalex.org/W1871809785","https://openalex.org/W2062308245","https://openalex.org/W2107600509","https://openalex.org/W2157529519","https://openalex.org/W2165753192","https://openalex.org/W2242407666","https://openalex.org/W2295466155","https://openalex.org/W2327315803","https://openalex.org/W2555191299","https://openalex.org/W2568420557","https://openalex.org/W2584943837","https://openalex.org/W2594795300","https://openalex.org/W2762990162","https://openalex.org/W2781827254","https://openalex.org/W2785415528","https://openalex.org/W2889287172","https://openalex.org/W2889431167","https://openalex.org/W2904319175","https://openalex.org/W2949572027","https://openalex.org/W2952341094","https://openalex.org/W2962933030","https://openalex.org/W2963373149","https://openalex.org/W3037335885","https://openalex.org/W3101104511","https://openalex.org/W3114238887","https://openalex.org/W3120953703","https://openalex.org/W3127944880","https://openalex.org/W3157430405","https://openalex.org/W3165922329","https://openalex.org/W3170971397","https://openalex.org/W3184317293","https://openalex.org/W3186013818","https://openalex.org/W4206353945","https://openalex.org/W4234540089","https://openalex.org/W4246633356","https://openalex.org/W4252630569","https://openalex.org/W4282006258","https://openalex.org/W4285518354","https://openalex.org/W4376639570","https://openalex.org/W4380874235","https://openalex.org/W4383604977","https://openalex.org/W4384807658"],"related_works":["https://openalex.org/W2295466155","https://openalex.org/W4234540089","https://openalex.org/W1500270910","https://openalex.org/W2352066879","https://openalex.org/W2348257368","https://openalex.org/W2184969544","https://openalex.org/W2054458431","https://openalex.org/W1592682627","https://openalex.org/W4295762832","https://openalex.org/W4287990693"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}