{"id":"https://openalex.org/W4390575854","doi":"https://doi.org/10.1137/1.9781611977912.126","title":"On Dynamic Graph Algorithms with Predictions","display_name":"On Dynamic Graph Algorithms with Predictions","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4390575854","doi":"https://doi.org/10.1137/1.9781611977912.126"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611977912.126","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611977912.126","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.vu.nl/en/publications/ca61c23d-eeb8-401d-866f-a1cf94d7c8cf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054956160","display_name":"Jan van den Brand","orcid":"https://orcid.org/0000-0001-8611-6896"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jan van den Brand","raw_affiliation_strings":["Georgia Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053481668","display_name":"Sebastian Forster","orcid":"https://orcid.org/0000-0002-2191-3381"},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Sebastian Forster","raw_affiliation_strings":["University of Salzburg"],"affiliations":[{"raw_affiliation_string":"University of Salzburg","institution_ids":["https://openalex.org/I182212641"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012259594","display_name":"Yasamin Nazari","orcid":"https://orcid.org/0000-0003-1315-9355"},"institutions":[{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Yasamin Nazari","raw_affiliation_strings":["VU Amsterdam"],"affiliations":[{"raw_affiliation_string":"VU Amsterdam","institution_ids":["https://openalex.org/I865915315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064315511","display_name":"Adam Polak","orcid":"https://orcid.org/0000-0003-4925-774X"},"institutions":[{"id":"https://openalex.org/I71209653","display_name":"Bocconi University","ror":"https://ror.org/05crjpb27","country_code":"IT","type":"education","lineage":["https://openalex.org/I71209653"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Adam Polak","raw_affiliation_strings":["Bocconi University"],"affiliations":[{"raw_affiliation_string":"Bocconi University","institution_ids":["https://openalex.org/I71209653"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5054956160"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":2.4496,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.87252554,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"3534","last_page":"3557"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9945999979972839,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9944000244140625,"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/algorithm","display_name":"Algorithm","score":0.6673056483268738},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.637599527835846},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5538898706436157},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5130006670951843},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.496599018573761},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.4829358458518982},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4793606400489807},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.43265625834465027},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4201299846172333},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30175352096557617},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23648732900619507},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10865998268127441}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6673056483268738},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.637599527835846},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5538898706436157},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5130006670951843},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.496599018573761},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.4829358458518982},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4793606400489807},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.43265625834465027},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4201299846172333},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30175352096557617},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23648732900619507},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10865998268127441},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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":3,"locations":[{"id":"doi:10.1137/1.9781611977912.126","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611977912.126","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/ca61c23d-eeb8-401d-866f-a1cf94d7c8cf","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/ca61c23d-eeb8-401d-866f-a1cf94d7c8cf","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"van den Brand, J, Forster, S, Nazari, Y & Polak, A 2024, On Dynamic Graph Algorithms with Predictions. in Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Proceedings series, SIAM, pp. 3534-3557, 35th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, United States, 7/01/24. https://doi.org/10.1137/1.9781611977912.126","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:research.vu.nl:openaire/ca61c23d-eeb8-401d-866f-a1cf94d7c8cf","is_oa":true,"landing_page_url":"https://hdl.handle.net/1871.1/ca61c23d-eeb8-401d-866f-a1cf94d7c8cf","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"van den Brand, J, Forster, S, Nazari, Y & Polak, A 2024, On Dynamic Graph Algorithms with Predictions. in Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Proceedings series, SIAM, pp. 3534-3557, 35th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, United States, 7/01/24. https://doi.org/10.1137/1.9781611977912.126","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/ca61c23d-eeb8-401d-866f-a1cf94d7c8cf","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/ca61c23d-eeb8-401d-866f-a1cf94d7c8cf","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"van den Brand, J, Forster, S, Nazari, Y & Polak, A 2024, On Dynamic Graph Algorithms with Predictions. in Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Proceedings series, SIAM, pp. 3534-3557, 35th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, United States, 7/01/24. https://doi.org/10.1137/1.9781611977912.126","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W1976468483","https://openalex.org/W1516574938","https://openalex.org/W2563912921","https://openalex.org/W2407611282"],"abstract_inverted_index":{"Dynamic":[0],"algorithms":[1,36,41,101,113],"operate":[2],"on":[3],"inputs":[4],"undergoing":[5],"updates,":[6,59],"e.g.,":[7],"insertions":[8],"or":[9,13],"deletions":[10],"of":[11,29,40,81],"edges":[12],"vertices.":[14],"After":[15],"processing":[16],"each":[17],"update,":[18],"the":[19,26,30,38,51,71,79,86,115],"algorithm":[20,52],"has":[21],"to":[22,69,124],"answer":[23],"queries":[24],"regarding":[25,57],"current":[27],"state":[28],"input":[31],"data.":[32],"We":[33,49],"study":[34,78],"dynamic":[35,82,100,112],"in":[37],"model":[39,95],"with":[42,114],"predictions":[43,56,65],"(also":[44],"known":[45,119],"as":[46,93],"learning-augmented":[47],"algorithms).":[48],"assume":[50],"is":[53,122],"given":[54],"imperfect":[55],"future":[58,107],"and":[60,110],"we":[61,77],"ask":[62],"how":[63],"such":[64],"can":[66,90],"be":[67,91],"used":[68],"improve":[70],"running":[72],"time.":[73],"In":[74],"other":[75],"words,":[76],"complexity":[80],"problems":[83],"parameterized":[84],"by":[85],"prediction":[87],"accuracy.":[88],"This":[89],"seen":[92],"a":[94],"interpolating":[96],"between":[97,133],"classic":[98],"online":[99],"-":[102,109],"which":[103,121],"know":[104],"nothing":[105],"about":[106],"updates":[108],"offline":[111],"whole":[116],"update":[117],"sequence":[118],"upfront,":[120],"similar":[123],"having":[125],"perfect":[126],"predictions.":[127],"Our":[128],"results":[129],"give":[130],"smooth":[131],"tradeoffs":[132],"these":[134],"two":[135],"extreme":[136],"settings.":[137]},"counts_by_year":[{"year":2025,"cited_by_count":3}],"updated_date":"2026-03-05T09:29:38.588285","created_date":"2025-10-10T00:00:00"}