{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:43:23Z","timestamp":1730209403035,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/codit.2019.8820635","type":"proceedings-article","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T01:09:32Z","timestamp":1567472972000},"page":"1746-1751","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Flows in Directed Planar Dynamic Networks"],"prefix":"10.1109","author":[{"given":"Eleonor","family":"Ciurea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Camelia","family":"Schiopu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF03012192","article-title":"An algorithm for minimal dynamic flow","volume":"7","author":"ciurea","year":"2000","journal-title":"Korean J Comput Appl Math"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.15837\/ijccc.2016.2.2444"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2011.11.067"},{"key":"ref13","first-page":"305","article-title":"Minimum flows in directed s-t planar networks","volume":"101","author":"ciurea","year":"2010","journal-title":"Bult Math de la Soc des Scien Math de Roumanie"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2018-1737"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76796-1_21"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1515\/9781400875184","author":"ford","year":"1962","journal-title":"Flows in Networks"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90120-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0208012"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01240733"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0214045"},{"journal-title":"Time-varying Network Optimization","year":"2007","author":"cai","key":"ref2"},{"journal-title":"Network Flows Theory Algorithms and Applications","year":"1993","author":"ahuja","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502798"}],"event":{"name":"2019 6th International Conference on Control, Decision and Information Technologies (CoDIT)","start":{"date-parts":[[2019,4,23]]},"location":"Paris, France","end":{"date-parts":[[2019,4,26]]}},"container-title":["2019 6th International Conference on Control, Decision and Information Technologies (CoDIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8806019\/8820291\/08820635.pdf?arnumber=8820635","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:20:38Z","timestamp":1658262038000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8820635\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/codit.2019.8820635","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}