{"id":"https://openalex.org/W2113654320","doi":"https://doi.org/10.1007/978-3-642-02930-1_42","title":"Algorithms for Secretary Problems on Graphs and Hypergraphs","display_name":"Algorithms for Secretary Problems on Graphs and Hypergraphs","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2113654320","doi":"https://doi.org/10.1007/978-3-642-02930-1_42","mag":"2113654320"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-02930-1_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02930-1_42","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/A5009276272","display_name":"Nitish Korula","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nitish Korula","raw_affiliation_strings":["Dept. of Computer Science, University of Illinois, Urbana, IL, 61801, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Illinois, Urbana, IL, 61801, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064235715","display_name":"Martin P\u00e1l","orcid":"https://orcid.org/0000-0002-1563-5426"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin P\u00e1l","raw_affiliation_strings":["Google Inc., 76 9th Avenue, New York, NY, 10011, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google Inc., 76 9th Avenue, New York, NY, 10011, USA","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":10.5408,"has_fulltext":false,"cited_by_count":154,"citation_normalized_percentile":{"value":0.9906755,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"508","last_page":"520"},"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.9861999750137329,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9456999897956848,"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/secretary-problem","display_name":"Secretary problem","score":0.6718180179595947},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6254240274429321},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6080178022384644},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.6068325042724609},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5795542597770691},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.576071560382843},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5523145198822021},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5489096641540527},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.46129879355430603},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.41050010919570923},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4051641821861267},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3798080384731293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36875638365745544},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3661186397075653},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.24018916487693787},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.21863189339637756}],"concepts":[{"id":"https://openalex.org/C183211740","wikidata":"https://www.wikidata.org/wiki/Q1372364","display_name":"Secretary problem","level":3,"score":0.6718180179595947},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6254240274429321},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6080178022384644},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.6068325042724609},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5795542597770691},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.576071560382843},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5523145198822021},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5489096641540527},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.46129879355430603},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.41050010919570923},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4051641821861267},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3798080384731293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36875638365745544},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3661186397075653},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.24018916487693787},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21863189339637756},{"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/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"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":2,"locations":[{"id":"doi:10.1007/978-3-642-02930-1_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02930-1_42","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.763.9333","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.763.9333","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0807.1139.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1536154726","https://openalex.org/W1578891227","https://openalex.org/W1601470474","https://openalex.org/W1931679055","https://openalex.org/W2022013502","https://openalex.org/W2061418963","https://openalex.org/W2085480884","https://openalex.org/W2128718641","https://openalex.org/W2150582214","https://openalex.org/W2164792208","https://openalex.org/W4213075821","https://openalex.org/W4246580564"],"related_works":["https://openalex.org/W4288283660","https://openalex.org/W4214843198","https://openalex.org/W2951941558","https://openalex.org/W3129885107","https://openalex.org/W1819914325","https://openalex.org/W2958813701","https://openalex.org/W2052130355","https://openalex.org/W1568448158","https://openalex.org/W2022013502","https://openalex.org/W3137340669"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":19},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":9}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}