{"id":"https://openalex.org/W4312757294","doi":"https://doi.org/10.1007/978-3-031-22832-2_4","title":"Online Ad Allocation in\u00a0Bounded-Degree Graphs","display_name":"Online Ad Allocation in\u00a0Bounded-Degree Graphs","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4312757294","doi":"https://doi.org/10.1007/978-3-031-22832-2_4"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-22832-2_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-22832-2_4","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":"conference-paper","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/A5074909595","display_name":"Susanne Albers","orcid":"https://orcid.org/0000-0001-5848-5360"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Susanne Albers","raw_affiliation_strings":["Department of Computer Science, Technical University of Munich, Boltzmannstr. 3, 85748, Garching, Germany","Department of Computer Science, Technical University of Munich, Boltzmannstr.\u00a03, 85748, Garching, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technical University of Munich, Boltzmannstr. 3, 85748, Garching, Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"Department of Computer Science, Technical University of Munich, Boltzmannstr.\u00a03, 85748, Garching, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103269021","display_name":"Sebastian Schubert","orcid":"https://orcid.org/0000-0002-3883-2297"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Sebastian Schubert","raw_affiliation_strings":["Department of Computer Science, Technical University of Munich, Boltzmannstr. 3, 85748, Garching, Germany","Department of Computer Science, Technical University of Munich, Boltzmannstr.\u00a03, 85748, Garching, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technical University of Munich, Boltzmannstr. 3, 85748, Garching, Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"Department of Computer Science, Technical University of Munich, Boltzmannstr.\u00a03, 85748, Garching, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103269021"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18824249,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"60","last_page":"77"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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.9991999864578247,"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"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9908999800682068,"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/bipartite-graph","display_name":"Bipartite graph","score":0.7650092244148254},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7178399562835693},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6713207364082336},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5665342807769775},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5143359899520874},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45783117413520813},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4168494939804077},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.41661444306373596},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.384962260723114},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3634134531021118},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3385993242263794},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.280818372964859},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2154284417629242},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.14668938517570496}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7650092244148254},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7178399562835693},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6713207364082336},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5665342807769775},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5143359899520874},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45783117413520813},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4168494939804077},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.41661444306373596},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.384962260723114},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3634134531021118},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3385993242263794},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.280818372964859},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2154284417629242},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.14668938517570496},{"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},{"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.1007/978-3-031-22832-2_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-031-22832-2_4","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1496647032","https://openalex.org/W2101199730","https://openalex.org/W2131951207","https://openalex.org/W2158268067","https://openalex.org/W2162656786","https://openalex.org/W2339454087","https://openalex.org/W2962711478","https://openalex.org/W3004983866","https://openalex.org/W3126370525","https://openalex.org/W6700441700"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2567825307","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W1592682627","https://openalex.org/W2583614279","https://openalex.org/W4295762832"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}