{"id":"https://openalex.org/W4238076645","doi":"https://doi.org/10.1007/978-3-642-22012-8_38","title":"Online Graph Exploration: New Results on Old and New Algorithms","display_name":"Online Graph Exploration: New Results on Old and New Algorithms","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W4238076645","doi":"https://doi.org/10.1007/978-3-642-22012-8_38"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-22012-8_38","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-22012-8_38","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/A5073490534","display_name":"Nicole Megow","orcid":"https://orcid.org/0000-0002-3531-7644"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Nicole Megow","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010961023","display_name":"Kurt Mehlhorn","orcid":"https://orcid.org/0000-0003-4020-4334"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Kurt Mehlhorn","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017685495","display_name":"Pascal Schweitzer","orcid":"https://orcid.org/0009-0001-3585-8213"},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Pascal Schweitzer","raw_affiliation_strings":["The Australian National University, Canberra, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Australian National University, Canberra, Australia","institution_ids":["https://openalex.org/I118347636"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.7161,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.85644207,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"478","last_page":"489"},"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9869999885559082,"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/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.9732999801635742,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/competitive-analysis","display_name":"Competitive analysis","score":0.7155808210372925},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6525219082832336},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6498913764953613},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.5948886871337891},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5758903622627258},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5481045246124268},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5264242887496948},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5032936930656433},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.45830538868904114},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4468190371990204},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4347361922264099},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4318881332874298},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42654576897621155},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.41669604182243347},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.4142357110977173},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3859316110610962},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3242759108543396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28725892305374146},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2408328354358673}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7155808210372925},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6525219082832336},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6498913764953613},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.5948886871337891},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5758903622627258},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5481045246124268},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5264242887496948},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5032936930656433},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.45830538868904114},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4468190371990204},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4347361922264099},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4318881332874298},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42654576897621155},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.41669604182243347},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.4142357110977173},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3859316110610962},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3242759108543396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28725892305374146},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2408328354358673},{"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-22012-8_38","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-22012-8_38","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:edoc.mpg.de:618681","is_oa":false,"landing_page_url":"http://edoc.mpg.de/618681","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Aceto, Luca; Henzinger, Monika; Sgall, Ji\u0159\u00ed: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, Springer, 478-489 (2011)","raw_type":"Conference-Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1491456385","https://openalex.org/W1501351249","https://openalex.org/W1552828154","https://openalex.org/W1569088102","https://openalex.org/W1571087346","https://openalex.org/W1588736092","https://openalex.org/W1834556589","https://openalex.org/W1873892361","https://openalex.org/W1980155648","https://openalex.org/W1989793404","https://openalex.org/W1992876208","https://openalex.org/W2008110774","https://openalex.org/W2011318188","https://openalex.org/W2017716370","https://openalex.org/W2019729116","https://openalex.org/W2025264288","https://openalex.org/W2032799093","https://openalex.org/W2065818036","https://openalex.org/W2101753085","https://openalex.org/W2113529358","https://openalex.org/W2149735608","https://openalex.org/W2154255883","https://openalex.org/W2175742361","https://openalex.org/W2956015669","https://openalex.org/W3136290985","https://openalex.org/W4229970255","https://openalex.org/W4240538936"],"related_works":["https://openalex.org/W2797291190","https://openalex.org/W2902879940","https://openalex.org/W2786956989","https://openalex.org/W2887020706","https://openalex.org/W2007113317","https://openalex.org/W1821961669","https://openalex.org/W1978615272","https://openalex.org/W4254594467","https://openalex.org/W4252596799","https://openalex.org/W4230405657"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}