{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:08:17Z","timestamp":1740100097340,"version":"3.37.3"},"reference-count":52,"publisher":"IEEE","funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund (FWF)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001821","name":"Vienna Science and Technology Fund (WWTF)","doi-asserted-by":"publisher","award":["ICT19-045 (WHATIF"],"award-info":[{"award-number":["ICT19-045 (WHATIF"]}],"id":[{"id":"10.13039\/501100001821","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,21]]},"DOI":"10.23919\/ifipnetworking52078.2021.9472803","type":"proceedings-article","created":{"date-parts":[[2021,7,9]],"date-time":"2021-07-09T20:09:00Z","timestamp":1625861340000},"page":"1-9","source":"Crossref","is-referenced-by-count":3,"title":["On the Complexity of Weight-Dynamic Network Algorithms"],"prefix":"10.23919","author":[{"given":"Monika","family":"Henzinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ami","family":"Paz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/75247.75252"},{"key":"ref38","article-title":"Semi-oblivious traffic engineering: The road not taken","author":"kumar","year":"0","journal-title":"Proc USENIX NSDI"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"ref33"},{"key":"ref32","first-page":"48:1","article-title":"On the hardness of partially dynamic graph problems and connections to diameter","author":"dahlgaard","year":"0","journal-title":"Proc ICALP"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/361011.361064"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.156"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447256"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICIEA.2006.257220"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2491185.2491198"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.43"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.154"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3218657"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.155"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486019"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2670518.2673868"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2005.01.003"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743464"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746609"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/090776573"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9401-5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897638"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/140957299"},{"key":"ref50","article-title":"Fast dynamic cuts, distances and effective resistances via vertex sparsifiers","volume":"abs 2005 2368","author":"chen","year":"2020","journal-title":"CoRR"},{"journal-title":"The expander hierarchy and its applications to dynamic graph algorithms","year":"2020","author":"goranci","key":"ref51"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.32"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1368436.1368438"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018473"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/318951.319004"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73117-9_3"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1048"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.70"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/201019.201022"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_62"},{"key":"ref19","first-page":"239","article-title":"Near linear time approximation schemes for uncapacitated and capacitated b-matching problems in nonbi-partite graphs","author":"ahn","year":"0","journal-title":"Proc ACM-SIAM SODA"},{"key":"ref4","article-title":"On the complexity of traffic traces and implications","author":"avin","year":"0","journal-title":"Proc ACM SIGMETRICS"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2992"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3359989.3365430"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1592681.1592692"},{"journal-title":"Why (and how) networks should run themselves","year":"2017","author":"feamster","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2019.2895553"},{"key":"ref49","article-title":"Simple dynamic algorithms for maximal independent set and other problems","volume":"abs 1804 1823","author":"gupta","year":"2018","journal-title":"CoRR"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/3402413.3402416","article-title":"Path persistence in the cloud: A study of the effects of inter-region traffic engineering in a large cloud provider's network","volume":"50","author":"reda","year":"0","journal-title":"ACM SIGCOMM"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch53"},{"journal-title":"Dynamic maintanance of low-stretch probabilistic tree embeddings with applications","year":"2020","author":"forster","key":"ref45"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_52"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/15M1050987"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039492"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2005.12.003"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00035"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_33"}],"event":{"name":"2021 IFIP Networking Conference (IFIP Networking)","start":{"date-parts":[[2021,6,21]]},"location":"Espoo and Helsinki, Finland","end":{"date-parts":[[2021,6,24]]}},"container-title":["2021 IFIP Networking Conference (IFIP Networking)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9472750\/9472195\/09472803.pdf?arnumber=9472803","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T11:34:39Z","timestamp":1643283279000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9472803\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,21]]},"references-count":52,"URL":"https:\/\/doi.org\/10.23919\/ifipnetworking52078.2021.9472803","relation":{},"subject":[],"published":{"date-parts":[[2021,6,21]]}}}