{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:37:07Z","timestamp":1725457027731},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642352607"},{"type":"electronic","value":"9783642352614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35261-4_13","type":"book-chapter","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T01:59:41Z","timestamp":1355450381000},"page":"95-105","source":"Crossref","is-referenced-by-count":3,"title":["Fast and Simple Fully-Dynamic Cut Tree Construction"],"prefix":"10.1007","author":[{"given":"Tanja","family":"Hartmann","sequence":"first","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.: Multi-terminal network flows. Journal of the Society for Industrial and Applied Mathematics\u00a09(4), 551\u2013570 (1961)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1137\/0219009","volume":"19","author":"D. Gusfield","year":"1990","unstructured":"Gusfield, D.: Very simple methods for all pairs network flow analysis. SIAM Journal on Computing\u00a019(1), 143\u2013155 (1990)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"13_CR3","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1287\/opre.12.5.680","volume":"12","author":"S.E. Elmaghraby","year":"1964","unstructured":"Elmaghraby, S.E.: Sensitivity Analysis of Multiterminal Flow Networks. Operations Research\u00a012(5), 680\u2013688 (1964)","journal-title":"Operations Research"},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.disopt.2006.05.003","volume":"3","author":"D. Barth","year":"2006","unstructured":"Barth, D., Berthom\u00e9, P., Diallo, M., Ferreira, A.: Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations. Discrete Optimization\u00a03(3), 195\u2013205 (2006)","journal-title":"Discrete Optimization"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G. Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM Journal on Computing\u00a018(1), 30\u201355 (1989)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10479-006-0155-z","volume":"150","author":"M.G. Scutell\u00e0","year":"2006","unstructured":"Scutell\u00e0, M.G.: A note on the parametric maximum flow problem and some related reoptimization issues. Annals of Operations Research\u00a0150(1), 231\u2013244 (2006)","journal-title":"Annals of Operations Research"},{"unstructured":"Hartmann, T., Wagner, D.: Fast and Simple Fully-Dynamic Cut Tree Construction. Karlsruhe Reports in Informatics 2012-18, KIT Karlsruhe Institute of Technology (2012), \n                    \n                      http:\/\/digbib.ubka.uni-karlsruhe.de\/volltexte\/1000030004","key":"13_CR7"},{"unstructured":"G\u00f6rke, R., Holzer, M., Hopp, O., Theuerkorn, J., Scheibenberger, K.: Dynamic network of email communication at the Department of Informatics at Karlsruhe Institute of Technology, KIT (2011), \n                    \n                      http:\/\/i11www.iti.kit.edu\/projects\/spp1307\/emaildata","key":"13_CR8"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35261-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T00:02:20Z","timestamp":1557446540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35261-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642352607","9783642352614"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35261-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}