{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:43:18Z","timestamp":1725489798189},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739487"},{"type":"electronic","value":"9783540739517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73951-7_8","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T10:18:03Z","timestamp":1187605083000},"page":"77-88","source":"Crossref","is-referenced-by-count":0,"title":["Edges and Switches, Tunnels and Bridges"],"prefix":"10.1007","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[]},{"given":"Elena","family":"Mumford","sequence":"additional","affiliation":[]},{"given":"Bettina","family":"Speckmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1007\/11841036_64","volume-title":"Algorithms \u2013 ESA 2006","author":"S. Cabello","year":"2006","unstructured":"Cabello, S., Haverkort, H., van Kreveld, M., Speckmann, B.: Algorithmic aspects of proportional symbol maps. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 720\u2013731. Springer, Heidelberg (2006)"},{"issue":"5","key":"8_CR2","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TCS.1983.1085357","volume":"30","author":"R.-W. Chen","year":"1983","unstructured":"Chen, R.-W., Kajitani, Y., Chan, S.-P.: A graph-theoretic via minimization algorithm for two-layer printed circuit boards. IEEE Transactions on Circuits and Systems\u00a030(5), 284\u2013299 (1983)","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"8_CR3","first-page":"853","volume-title":"Proc. 15th ACM-SIAM Symposium on Discrete Algorithms","author":"D. Eppstein","year":"2004","unstructured":"Eppstein, D.: Testing bipartiteness of geometric intersection graphs. In: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, pp. 853\u2013861. ACM Press, New York (2004)"},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing\u00a05(4), 691\u2013703 (1976)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1145\/115234.115366","volume":"38","author":"H.N. Gabow","year":"1991","unstructured":"Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for general graph-matching problems. Journal of the ACM\u00a038(4), 815\u2013853 (1991)","journal-title":"Journal of the ACM"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM Journal on Computing\u00a011(2), 329\u2013343 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR7","volume-title":"Computational Geometry: An Introduction through Randomized Algorithms","author":"K. Mulmuley","year":"1994","unstructured":"Mulmuley, K.: Computational Geometry: An Introduction through Randomized Algorithms. Prentice-Hall, Englewood Cliffs (1994)"},{"issue":"6","key":"8_CR8","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BF01190155","volume":"9","author":"J. Pach","year":"1993","unstructured":"Pach, J., Pollack, R., Welzl, E.: Weaving patterns of lines and line segments in space. Algorithmica\u00a09(6), 561\u2013571 (1993)","journal-title":"Algorithmica"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.dam.2003.07.007","volume":"143","author":"V. Venkateswaran","year":"2004","unstructured":"Venkateswaran, V.: Minimizing maximum indegree. Discrete Applied Mathematics\u00a0143, 374\u2013378 (2004)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73951-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T12:19:09Z","timestamp":1550837949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73951-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540739487","9783540739517"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73951-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}