{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T10:52:54Z","timestamp":1730285574632,"version":"3.28.0"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T00:00:00Z","timestamp":1714953600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,5,6]],"date-time":"2024-05-06T00:00:00Z","timestamp":1714953600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,5,6]]},"DOI":"10.1109\/noms59830.2024.10575579","type":"proceedings-article","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T17:23:51Z","timestamp":1719941031000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["Congestion-Free Rerouting of Network Flows: Hardness and an FPT Algorithm"],"prefix":"10.1109","author":[{"given":"Esra","family":"Ceylan","sequence":"first","affiliation":[{"name":"TU Berlin,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishnendu","family":"Chatterjee","sequence":"additional","affiliation":[{"name":"ISTA,Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"TU Berlin,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakub","family":"Svoboda","sequence":"additional","affiliation":[{"name":"ISTA,Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2019.2895553"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2896377.2901476"},{"key":"ref3","article-title":"Survey of consistent network updates","volume":"abs\/1609.02305","author":"Foerster","year":"2016","journal-title":"ArXiv Technical Report"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.23919\/IFIPNetworking46909.2019.8999391"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9781139506748.005"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/07070440X"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.05.008"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20514"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92182-0_6"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218382"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2740070.2626307"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486005"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2535771.2535791"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342427"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15509-8_26"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_9"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48314-6_25"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IFIPNetworking.2016.7497232"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN.2016.7568583"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767412"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2016.21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2670518.2673873"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524332"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486012"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2070562.2070569"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2015.33"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626307"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2491185.2491214"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218645"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524419"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524499"},{"article-title":"Congestion-free rerouting of flows on dags","volume-title":"International Colloquium on Automata, Languages, and Programming (ICALP)","author":"Amiri","key":"ref32"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3"},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","year":"1979","author":"Garey","key":"ref34"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00026"}],"event":{"name":"NOMS 2024-2024 IEEE Network Operations and Management Symposium","start":{"date-parts":[[2024,5,6]]},"location":"Seoul, Korea, Republic of","end":{"date-parts":[[2024,5,10]]}},"container-title":["NOMS 2024-2024 IEEE Network Operations and Management Symposium"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10574855\/10574897\/10575579.pdf?arnumber=10575579","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T04:57:09Z","timestamp":1720241829000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10575579\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,6]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/noms59830.2024.10575579","relation":{},"subject":[],"published":{"date-parts":[[2024,5,6]]}}}