{"id":"https://openalex.org/W172120053","doi":"https://doi.org/10.1007/978-3-540-74456-6_37","title":"Dynamic Matchings in Convex Bipartite Graphs","display_name":"Dynamic Matchings in Convex Bipartite Graphs","publication_year":2007,"publication_date":"2007-08-14","ids":{"openalex":"https://openalex.org/W172120053","doi":"https://doi.org/10.1007/978-3-540-74456-6_37","mag":"172120053"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-74456-6_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-74456-6_37","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5039943336","display_name":"Gerth St\u00f8lting Brodal","orcid":"https://orcid.org/0000-0001-9054-915X"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Gerth St\u00f8lting Brodal","raw_affiliation_strings":["University of Aarhus, \u00c5rhus, Denmark","University of Aarhus, Arhus, Denmark#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Aarhus, \u00c5rhus, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"University of Aarhus, Arhus, Denmark#TAB#","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024478433","display_name":"Loukas Georgiadis","orcid":"https://orcid.org/0000-0002-9706-7409"},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Loukas Georgiadis","raw_affiliation_strings":["Hewlett-Packard Laboratories, Palo Alto, CA, USA","Hewlett-Packard Laboratories, Palo Alto. Ca#TAB#"],"affiliations":[{"raw_affiliation_string":"Hewlett-Packard Laboratories, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1324840837"]},{"raw_affiliation_string":"Hewlett-Packard Laboratories, Palo Alto. Ca#TAB#","institution_ids":["https://openalex.org/I1324840837"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055834958","display_name":"Kristoffer Arnsfelt Hansen","orcid":"https://orcid.org/0000-0002-1155-8072"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]},{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kristoffer Arnsfelt Hansen","raw_affiliation_strings":["University of Chicago, Chicago, IL, USA","University of Chicago, Chicago, IL"],"affiliations":[{"raw_affiliation_string":"University of Chicago, Chicago, IL, USA","institution_ids":["https://openalex.org/I40347166","https://openalex.org/I39422238"]},{"raw_affiliation_string":"University of Chicago, Chicago, IL","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028865873","display_name":"Irit Katriel","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Irit Katriel","raw_affiliation_strings":["Brown University, Providence, RI, USA","Brown University, Providence, RI,"],"affiliations":[{"raw_affiliation_string":"Brown University, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Brown University, Providence, RI,","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5039943336"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.0209,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.75010085,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"406","last_page":"417"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9934999942779541,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9934999942779541,"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/T11478","display_name":"Caching and Content Delivery","score":0.9750000238418579,"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/T12288","display_name":"Optimization and Search Problems","score":0.9639999866485596,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.864618182182312},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7927168011665344},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7004615664482117},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.6718236804008484},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6611315011978149},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5213162302970886},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5149760842323303},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.47461405396461487},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4590654671192169},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45405274629592896},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.45038700103759766},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4306689500808716},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37296968698501587},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3011605143547058}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.864618182182312},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7927168011665344},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7004615664482117},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.6718236804008484},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6611315011978149},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5213162302970886},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5149760842323303},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.47461405396461487},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4590654671192169},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45405274629592896},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.45038700103759766},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4306689500808716},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37296968698501587},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3011605143547058},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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":4,"locations":[{"id":"doi:10.1007/978-3-540-74456-6_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-74456-6_37","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.73.5237","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.5237","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.brics.dk/~gerth/Papers/mfcs07matching.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.83.8873","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.8873","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~lgeorgia/convex_matchings.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/6b7bb9e0-9d99-11dc-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/6b7bb9e0-9d99-11dc-bee9-02004c4f4f50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Brodal, G S, Georgiadis, L, Hansen, K A & Katriel, I 2007, Dynamic Matchings in Convex Bipartite Graphs. in L Kucera & A Kucera (eds), Proc. 32nd International Symposium on Mathematical Foundations of Computer Science. Springer, Lecture Notes in Computer Science, vol. 4708, pp. 406-417, 32nd International Symposium on Mathematical Foundations of Computer Science, Providence, RI, United States, 20/10/2007. https://doi.org/10.1007/978-3-540-74456-6_37","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1494735819","https://openalex.org/W1979740015","https://openalex.org/W1982765710","https://openalex.org/W2003813631","https://openalex.org/W2008908074","https://openalex.org/W2018665307","https://openalex.org/W2021615496","https://openalex.org/W2028503265","https://openalex.org/W2031592993","https://openalex.org/W2031966632","https://openalex.org/W2043765170","https://openalex.org/W2048652909","https://openalex.org/W2061080407","https://openalex.org/W2068928748","https://openalex.org/W2080090262","https://openalex.org/W2099450374","https://openalex.org/W2152506638","https://openalex.org/W2157529519","https://openalex.org/W2166645359","https://openalex.org/W2167464392","https://openalex.org/W2283413676","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W8290509","https://openalex.org/W2184537587","https://openalex.org/W2065411828","https://openalex.org/W3092127654","https://openalex.org/W1482484961","https://openalex.org/W4205704978","https://openalex.org/W2151412766","https://openalex.org/W2006811735","https://openalex.org/W2076407808","https://openalex.org/W4377371889"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}