{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:24Z","timestamp":1725541824775},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108402"},{"type":"electronic","value":"9783642108419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10841-9_40","type":"book-chapter","created":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T17:14:44Z","timestamp":1260292484000},"page":"438-446","source":"Crossref","is-referenced-by-count":5,"title":["Wiretapping a Hidden Network"],"prefix":"10.1007","author":[{"given":"Haris","family":"Aziz","sequence":"first","affiliation":[]},{"given":"Oded","family":"Lachish","sequence":"additional","affiliation":[]},{"given":"Mike","family":"Paterson","sequence":"additional","affiliation":[]},{"given":"Rahul","family":"Savani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Aziz, H., Lachish, O., Paterson, M., Savani, R.: Power indices in spanning connectivity games. In: AAIM: Algorithmic Aspects in Information and Management, pp. 55\u201367 (2009)","DOI":"10.1007\/978-3-642-02158-9_7"},{"key":"40_CR2","unstructured":"Aziz, H., Lachish, O., Paterson, M., Savani, R.: Wiretapping a hidden network. Technical report (2009), \n                    \n                      http:\/\/arxiv.org\/abs\/0909.5293"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Mehta, A., Vazirani, V.V.: Design is as easy as optimization. In: ICALP: International Colloquium on Automata, Languages and Programming, pp. 477\u2013488 (2006)","DOI":"10.1007\/11786986_42"},{"issue":"3","key":"40_CR4","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/3828.3829","volume":"32","author":"W.H. Cunningham","year":"1985","unstructured":"Cunningham, W.H.: Optimal attack and reinforcement of a network. J. ACM\u00a032(3), 549\u2013561 (1985)","journal-title":"J. ACM"},{"key":"40_CR5","series-title":"Annals of Discrete Mathematics","volume-title":"Submodular Functions and Optimization","author":"S. Fujishige","year":"2005","unstructured":"Fujishige, S.: Submodular Functions and Optimization. Annals of Discrete Mathematics, vol.\u00a058. Elsevier, Amsterdam (2005)"},{"issue":"2","key":"40_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0020-0190(83)90031-5","volume":"16","author":"D. Gusfield","year":"1983","unstructured":"Gusfield, D.: Connectivity and edge-disjoint spanning trees. Inf. Process. Lett.\u00a016(2), 87\u201389 (1983)","journal-title":"Inf. Process. Lett."},{"key":"40_CR7","unstructured":"Narayanan, H.: Theory of matroids and network analysis. PhD thesis, IIT, Bombay (1974)"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C.S.A. Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.S.A.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc.\u00a036, 445\u2013450 (1961)","journal-title":"J. London Math. Soc."},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-44450-5_7","volume-title":"FST TCS: Foundations of Software Technology and Theoretical Computer Science","author":"S. Patkar","year":"2000","unstructured":"Patkar, S., Narayanan, H.: Fast on-line\/off-line algorithms for optimal reinforcement of a network and its connections with principal partition. In: FST TCS: Foundations of Software Technology and Theoretical Computer Science, pp. 94\u2013105. Springer, Heidelberg (2000)"},{"issue":"1","key":"40_CR10","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/moor.17.1.164","volume":"17","author":"J.A.M. Potters","year":"1992","unstructured":"Potters, J.A.M., Tijs, S.H.: The nucleolus of a matrix game and other nucleoli. Math. Oper. Res.\u00a017(1), 164\u2013174 (1992)","journal-title":"Math. Oper. Res."},{"issue":"A","key":"40_CR11","first-page":"1","volume":"59","author":"N. Tomizawa","year":"1976","unstructured":"Tomizawa, N.: Strongly irreducible matroids and principal partition of a matroid into strongly irreducible minors. Electron. and Commun.\u00a059(A), 1\u201310 (1976)","journal-title":"Electron. and Commun."},{"key":"40_CR12","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W.T. Tutte","year":"1961","unstructured":"Tutte, W.T.: On the problem of decomposing a graph into n connected factors. J. London Math. Soc.\u00a036, 221\u2013230 (1961)","journal-title":"J. London Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10841-9_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:42:31Z","timestamp":1619782951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10841-9_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108402","9783642108419"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10841-9_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}