{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:05:18Z","timestamp":1770062718545,"version":"3.49.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540543430","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0028270","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T05:52:14Z","timestamp":1132638734000},"page":"286-298","source":"Crossref","is-referenced-by-count":24,"title":["Planar graph augmentation problems"],"prefix":"10.1007","author":[{"given":"Goos","family":"Kant","sequence":"first","affiliation":[]},{"given":"Hans L.","family":"Bodlaender","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Di Battista, G., and R. Tamassia, Incremental planarity testing, Proc. 30th Annual IEEE Symp. on Found. on Comp. Science, North Carolina, 1989, pp. 436\u2013441.","DOI":"10.1109\/SFCS.1989.63515"},{"key":"27_CR2","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K.P. Eswaran","year":"1976","unstructured":"Eswaran, K.P., and R.E. Tarjan, Augmentation problems, SIAM J. Comput. 5 (1976), pp. 653\u2013665.","journal-title":"SIAM J. Comput."},{"key":"27_CR3","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"G.N. Frederickson","year":"1981","unstructured":"Frederickson, G.N., and J. Ja'Ja, Approximation algorithms for several graph augmentation problems, SIAM J. Comput. 10 (1981), pp. 270\u2013283.","journal-title":"SIAM J. Comput."},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Frank, A., Augmenting graphs to meet edge-connectivity requirements, Proc. 31th Annual IEEE Symp. on Found. on Comp. Science, St. Louis, 1990, pp. 708\u2013718.","DOI":"10.1109\/FSCS.1990.89593"},{"key":"27_CR5","unstructured":"Gabow, H.N., Data structures for weighted matching and nearest common ancestors with linking, in: Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms, San Fransisco (1990), pp. 434\u2013443."},{"key":"27_CR6","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F., Graph Theory, Addison-Wesley Publ. Comp., Reading, Mass., 1969."},{"key":"27_CR7","unstructured":"Kant, G., Optimal Linear Planar Augmentation Algorithms for Outerplanar Graphs, in preparation."},{"key":"27_CR8","unstructured":"Micali, S., and V.V. Vazirani, An O(\n                  \n                    \n                  \n                  \n$$\\sqrt V$$\n\n                \u00b7.E) algorithm for finding maximum matching in general graphs, in: Proc. 21st Annual IEEE Symp. Foundations of Computer Science, Syracuse (1980), pp. 17\u201327."},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Naor, D., D. Gusfield and C. Martel, A fast algorithm for optimally increasing the edge-connectivity, Proc. 31st Annual IEEE Symp. on Found. of Comp. Science, St. Louis, 1990, pp. 698\u2013707.","DOI":"10.1109\/FSCS.1990.89592"},{"key":"27_CR10","first-page":"31","volume":"56","author":"R.C. Read","year":"1987","unstructured":"Read, R.C., A new method for drawing a graph given the cyclic order of the edges at each vertex, Congr. Numer. 56 (1987), pp. 31\u201344.","journal-title":"Congr. Numer."},{"key":"27_CR11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1137\/0206003","volume":"6","author":"A. Rosenthal","year":"1977","unstructured":"Rosenthal, A., and A. Goldner, Smallest augmentations to biconnect a graph, SIAM J. Comput. 6 (1977), pp. 55\u201366.","journal-title":"SIAM J. Comput."},{"key":"27_CR12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0190(81)90009-0","volume":"12","author":"Y. Shiloach","year":"1981","unstructured":"Shiloach, Y., Another look at the degree constrained subgraph problem, Inf. Proc. Lett. 12 (1981), pp. 89\u201392.","journal-title":"Inf. Proc. Lett."},{"key":"27_CR13","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1112\/plms\/s3-10.1.304","volume":"10","author":"W.T. Tutte","year":"1960","unstructured":"Tutte, W.T., Convex representations of graphs, Proc. London Math. Soc., vol. 10 (1960), pp. 304\u2013320.","journal-title":"Proc. London Math. Soc."},{"key":"27_CR14","unstructured":"Woods, D., Drawing Planar Graphs, Ph.D. Dissertation, Computer Science Dept., Stanford University, CA, Tech. Rep. STAN-CS-82-943, 1982."}],"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\/BFb0028270.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:58:40Z","timestamp":1607551120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540543430"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0028270","relation":{},"subject":[]}}