{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:13Z","timestamp":1725663373256},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_47","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:07:47Z","timestamp":1330186067000},"page":"563-576","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Augmentation problems on hierarchically defined graphs"],"prefix":"10.1007","author":[{"given":"David","family":"Fern\u00e1ndez-Baca","sequence":"first","affiliation":[]},{"given":"Mark A.","family":"Williams","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"47_CR1","first-page":"127","volume":"1","author":"J. L. Bentley","year":"1983","unstructured":"J. L. Bentley, T. Ottmann and P. Widmayer, The Complexity of Manipulating Hierarchically Defined Sets of Rectangles, Advances in Computing Research, Vol. 1, pp. 127\u2013158, 1983.","journal-title":"Advances in Computing Research"},{"issue":"5","key":"47_CR2","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K. P. Eswaran","year":"1976","unstructured":"K. P. Eswaran and R. E. Tarjan, Augmentation Problems, SIAM Journal on Computing, Vol. 5, No. 5, pp. 653\u2013665, December 1976.","journal-title":"SIAM Journal on Computing"},{"key":"47_CR3","unstructured":"H. Galperin and A. Widgerson. Succinct Representations of Graphs, Information and Control No. 56 (1983), 143\u2013157."},{"key":"47_CR4","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0196-6774(87)90042-3","volume":"8","author":"T. Lengauer","year":"1987","unstructured":"T. Lengauer. Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs. Journal of Algorithms No. 8 (1987), 260\u2013284.","journal-title":"Journal of Algorithms"},{"key":"47_CR5","unstructured":"T. Lengauer and K. Wagner. The correlation between the complexities of the non-hierarchical and hierarchical versions of graph properties. Proceedings of STACS 87 (F.J. Brandenburg et al. eds.), Springer LNCS No. 247 (1987), 100\u2013113."},{"issue":"6","key":"47_CR6","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1137\/0217068","volume":"17","author":"T. Lengauer","year":"1989","unstructured":"T. Lengauer and E. Wanke. Efficient solution of connectivity problems on hierarchically defined graphs. SIAM J. Comput Vol. 17, No. 6, pp. 1063\u20131080, (1989).","journal-title":"SIAM J. Comput"},{"key":"47_CR7","series-title":"Theoretische Informatik","volume-title":"Decision Problems on Cellular Graph Grammars","author":"T. Lengauer","year":"1987","unstructured":"T. Lengauer and E. Wanke. Decision Problems on Cellular Graph Grammars, Theoretische Informatik No. 45, University of Paderborn, Paderborn, West Germany, October 1987."},{"key":"47_CR8","unstructured":"T. Lengauer and E. Wanke. Efficient processing of hierarchical graphs for engineering design. EATCS Bulletin, No 35 (1988)."},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"J. B. Orlin. Some problems on dynamic\/periodic graphs. Progress in Combinatorial Optimization, 1984.","DOI":"10.1016\/B978-0-12-566780-7.50022-2"},{"key":"47_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0019-9958(86)80009-2","volume":"71","author":"C. Papadimitriou","year":"1986","unstructured":"C. Papadimitriou and M. Yannakakis. A note on succinct representation of graphs. Information and Control\n71 (1986), 181\u2013185.","journal-title":"Information and Control"},{"issue":"1","key":"47_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1137\/0206003","volume":"6","author":"A. Rosenthal","year":"1977","unstructured":"A. Rosenthal and Anita Goldner. Smallest Augmentations to Biconnect a Graph, SIAM Journal on Computing, Vol. 6, No. 1, pp. 55\u201366, March 1977.","journal-title":"SIAM Journal on Computing"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"K. Wagner. The complexity of problems concerning graphs with regularities. Proceedings of MFCS 84 (M.P Chytil and V. Koubek, eds.), Springer LNCS No. 176 (1984), 544\u2013552.","DOI":"10.1007\/BFb0030338"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T19:15:32Z","timestamp":1578510932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_47"}},"subtitle":["Preliminary version"],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"26 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}