{"id":"https://openalex.org/W2897485334","doi":"https://doi.org/10.1016/j.tcs.2018.10.015","title":"On extensions of the deterministic online model for bipartite matching and max-sat","display_name":"On extensions of the deterministic online model for bipartite matching and max-sat","publication_year":2018,"publication_date":"2018-10-17","ids":{"openalex":"https://openalex.org/W2897485334","doi":"https://doi.org/10.1016/j.tcs.2018.10.015","mag":"2897485334"},"language":"en","primary_location":{"id":"doi:10.1016/j.tcs.2018.10.015","doi":"https://doi.org/10.1016/j.tcs.2018.10.015","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2018.10.015","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-b","cwts-core","dongbi-c","jufo-2","ki-jl-2","norway-2","poland-100","russia-white-list-3","vabb-shw"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://doi.org/10.1016/j.tcs.2018.10.015","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"N. Pena","orcid":"https://orcid.org/0000-0002-7157-5691","observed_orcids":["https://orcid.org/0000-0002-7157-5691"]},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"N. Pena","raw_affiliation_strings":["Dept of Computer Science, University of Toronto, Canada"],"raw_orcid":"https://orcid.org/0000-0002-7157-5691","affiliations":[{"raw_affiliation_string":"Dept of Computer Science, University of Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109583026","display_name":"Allan Borodin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"A. Borodin","raw_affiliation_strings":["Dept of Computer Science, University of Toronto, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept of Computer Science, University of Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109583026"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":{"value":2880,"currency":"USD","value_usd":2880},"apc_paid":null,"fwci":0.4674,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7059786,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":94},"biblio":{"volume":"770","issue":null,"first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9965999722480774,"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.9965999722480774,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0017000000225380063,"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/T11269","display_name":"Algorithms and Data Compression","score":0.0005000000237487257,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/online-bipartite-matching","display_name":"online bipartite matching","score":0.9660000205039978},{"id":"https://openalex.org/keywords/maxsat","display_name":"MaxSAT","score":0.9309999942779541},{"id":"https://openalex.org/keywords/deterministic-online-algorithms","display_name":"deterministic online algorithms","score":0.7400000095367432},{"id":"https://openalex.org/keywords/approximation-lower-bounds","display_name":"approximation lower bounds","score":0.75},{"id":"https://openalex.org/keywords/priority-model","display_name":"priority model","score":0.5379999876022339},{"id":"https://openalex.org/keywords/advice-complexity","display_name":"advice complexity","score":0.8339999914169312},{"id":"https://openalex.org/keywords/derandomization","display_name":"derandomization","score":0.8379999995231628},{"id":"https://openalex.org/keywords/submodular-optimization","display_name":"submodular optimization","score":0.7459999918937683}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6715319752693176},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6327562928199768},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.6151185631752014},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.5434922575950623},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5414744019508362},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4934639036655426},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.49122971296310425},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47423312067985535},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4435630142688751},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4367194175720215},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.43547362089157104},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4271785020828247},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4203091263771057},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37456393241882324},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12771210074424744},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.tcs.2018.10.015","doi":"https://doi.org/10.1016/j.tcs.2018.10.015","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2018.10.015","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-b","cwts-core","dongbi-c","jufo-2","ki-jl-2","norway-2","poland-100","russia-white-list-3","vabb-shw"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.tcs.2018.10.015","doi":"https://doi.org/10.1016/j.tcs.2018.10.015","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2018.10.015","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-b","cwts-core","dongbi-c","jufo-2","ki-jl-2","norway-2","poland-100","russia-white-list-3","vabb-shw"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G216330294","display_name":"Design, analysis and Theory of Algorithms","funder_award_id":"rgpin-2017-06551","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":91,"referenced_works":["https://openalex.org/W8905951","https://openalex.org/W122351777","https://openalex.org/W231554978","https://openalex.org/W330735796","https://openalex.org/W1522394790","https://openalex.org/W1554012027","https://openalex.org/W1564025554","https://openalex.org/W1589175915","https://openalex.org/W1593314081","https://openalex.org/W1606268560","https://openalex.org/W1639030016","https://openalex.org/W1731888680","https://openalex.org/W1769120835","https://openalex.org/W1825657983","https://openalex.org/W1955698431","https://openalex.org/W1965972569","https://openalex.org/W1992753463","https://openalex.org/W1995484833","https://openalex.org/W2001564241","https://openalex.org/W2005908084","https://openalex.org/W2010060477","https://openalex.org/W2011730242","https://openalex.org/W2014257304","https://openalex.org/W2024650545","https://openalex.org/W2029945631","https://openalex.org/W2032261213","https://openalex.org/W2040924621","https://openalex.org/W2041645394","https://openalex.org/W2048837158","https://openalex.org/W2079669094","https://openalex.org/W2104224720","https://openalex.org/W2109659895","https://openalex.org/W2110009764","https://openalex.org/W2120954276","https://openalex.org/W2133352257","https://openalex.org/W2136026170","https://openalex.org/W2146319320","https://openalex.org/W2153838160","https://openalex.org/W2157529519","https://openalex.org/W2158557760","https://openalex.org/W2162656786","https://openalex.org/W2165753192","https://openalex.org/W2170675255","https://openalex.org/W2179494254","https://openalex.org/W2180060229","https://openalex.org/W2182988742","https://openalex.org/W2401584318","https://openalex.org/W2501008390","https://openalex.org/W2505516498","https://openalex.org/W2507673992","https://openalex.org/W2592989345","https://openalex.org/W2606892140","https://openalex.org/W2627898316","https://openalex.org/W2754549065","https://openalex.org/W2911985665","https://openalex.org/W2949076628","https://openalex.org/W2949565166","https://openalex.org/W2951400471","https://openalex.org/W2951971373","https://openalex.org/W2963487804","https://openalex.org/W3136693265","https://openalex.org/W4233090147","https://openalex.org/W4250340495","https://openalex.org/W4250390881","https://openalex.org/W6600377904","https://openalex.org/W6604994480","https://openalex.org/W6631169433","https://openalex.org/W6633014062","https://openalex.org/W6635120070","https://openalex.org/W6636778933","https://openalex.org/W6638079091","https://openalex.org/W6638193490","https://openalex.org/W6640901046","https://openalex.org/W6648752552","https://openalex.org/W6650788953","https://openalex.org/W6652949834","https://openalex.org/W6653197670","https://openalex.org/W6653858015","https://openalex.org/W6658569848","https://openalex.org/W6675398894","https://openalex.org/W6680090024","https://openalex.org/W6683190411","https://openalex.org/W6683885168","https://openalex.org/W6685252657","https://openalex.org/W6685822970","https://openalex.org/W6685975683","https://openalex.org/W6712827839","https://openalex.org/W6722533923","https://openalex.org/W6724543136","https://openalex.org/W6724720915","https://openalex.org/W6740546306"],"related_works":["https://openalex.org/W2950365512","https://openalex.org/W1608444752","https://openalex.org/W3204684126","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W4299354108","https://openalex.org/W2777812223","https://openalex.org/W4299302777","https://openalex.org/W2279830512","https://openalex.org/W2567853751"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2025-10-10T00:00:00"}