{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:15Z","timestamp":1725511995578},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709039"},{"type":"electronic","value":"9783540709046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-70904-6_8","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T11:44:43Z","timestamp":1179402283000},"page":"66-76","source":"Crossref","is-referenced-by-count":1,"title":["Schematisation of Tree Drawings"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Gudmundsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"van Kreveld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damian","family":"Merrick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"8_CR1","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. Journal of Comp. and Sys. Sciences\u00a07(4), 448\u2013461 (1973)","journal-title":"Journal of Comp. and Sys. Sciences"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36151-0_1","volume-title":"Graph Drawing","author":"U. Brandes","year":"2002","unstructured":"Brandes, U., Eiglsperger, M., Kaufmann, M., Wagner, D.: Sketch-driven orthogonal graph drawing. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 1\u201311. Springer, Heidelberg (2002)"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.comgeo.2004.11.002","volume":"30","author":"S. Cabello","year":"2005","unstructured":"Cabello, S., de Berg, M., van Kreveld, M.: Schematization of networks. Computational Geometry and Applications\u00a030, 223\u2013238 (2005)","journal-title":"Computational Geometry and Applications"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s00453-003-1033-6","volume":"37","author":"S. Cabello","year":"2003","unstructured":"Cabello, S., van Kreveld, M.: Approximation algorithms for aligning points. Algorithmica\u00a037, 211\u2013232 (2003)","journal-title":"Algorithmica"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44969-8_6","volume-title":"Drawing Graphs","author":"M. Eiglsperger","year":"2001","unstructured":"Eiglsperger, M., Fekete, S.P., Klau, G.W.: Orthogonal graph drawing. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol.\u00a02025, pp. 121\u2013171. Springer, Heidelberg (2001)"},{"key":"8_CR6","first-page":"434","volume-title":"Proc. ACM-SIAM Symp. Discrete Alg.","author":"H.N. Gabow","year":"1990","unstructured":"Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proc. ACM-SIAM Symp. Discrete Alg., pp. 434\u2013443. ACM Press, New York (1990)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1007\/978-3-540-31843-9_50","volume-title":"Graph Drawing","author":"S.-H. Hong","year":"2005","unstructured":"Hong, S.-H., Merrick, D., do Nascimento, H.A.D.: The metro map layout problem. In: Pach, J. (ed.) GD 2004. LNCS, vol.\u00a03383, pp. 482\u2013491. Springer, Heidelberg (2005)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/3-540-45848-4_48","volume-title":"Graph Drawing","author":"U. Lauther","year":"2002","unstructured":"Lauther, U., St\u00fcbinger, A.: Generating schematic cable plans using springembedder methods. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol.\u00a02265, pp. 465\u2013466. Springer, Heidelberg (2002)"},{"key":"8_CR9","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. Elsevier, Amsterdam (1986)"},{"key":"8_CR10","unstructured":"Merrick, D., Gudmundsson, J.: Path simplification for metro map layout. Submitted to Graph Drawing (June 2006)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Neyer, G.: Line simplification in restricted orientations. In: Proc. of the 6th International workshop on Algorithms and Data Structures, pp. 13\u201324 (1999)","DOI":"10.1007\/3-540-48447-7_2"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/11618058_29","volume-title":"Graph Drawing","author":"M. N\u00f6llenburg","year":"2006","unstructured":"N\u00f6llenburg, M., Wolff, A.: A mixed-integer program for drawing high-quality metro maps. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 321\u2013333. Springer, Heidelberg (2006)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Stott, J.M., Rodgers, P.: Metro map layout using multicriteria optimization. In: Proc. Information Visualisation, pp. 355\u2013362 (2004)","DOI":"10.1109\/IV.2004.1320168"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70904-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T14:19:27Z","timestamp":1550326767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70904-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540709039","9783540709046"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70904-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}