{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:44:04Z","timestamp":1742381044148},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540415541"},{"type":"electronic","value":"9783540445418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44541-2_12","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:01:32Z","timestamp":1184601692000},"page":"127-138","source":"Crossref","is-referenced-by-count":2,"title":["Fast Layout Methods for Timetable Graphs"],"prefix":"10.1007","author":[{"given":"Ulrik","family":"Brandes","sequence":"first","affiliation":[]},{"given":"Galina","family":"Shubina","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"12_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BFb0054318","volume-title":"Short and smooth polygonal paths","author":"J. Abello","year":"1998","unstructured":"J. Abello and E. R. Gansner. Short and smooth polygonal paths. Proc. LATIN\u2019 98, Springer LNCS 1380, pp. 151\u2013162, 1998."},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/2945.468391","volume":"1","author":"R. A. Becker","year":"1995","unstructured":"R. A. Becker, S. G. Eick, and A. R. Wilks. Visualizing network data. IEEE Transactions on Visualization and Graphics, 1(1):16\u201328, 1995.","journal-title":"IEEE Transactions on Visualization and Graphics"},{"key":"12_CR3","unstructured":"P. B\u00e9zier. Numerical Control. John Wiley & Sons, 1972."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"U. Brandes, G. Shubina, and R. Tamassia. Improving angular resolution in visualizations of geographic networks. Data Visualization 2000. Proc. VisSym\u2019 00, pp. 23\u201332. Springer, 2000.","DOI":"10.1007\/978-3-7091-6783-0_3"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"U. Brandes and D. Wagner. Using graph layout to visualize train interconnection data. Journal of Graph Algorithms and Applications, 2000. To appear.","DOI":"10.7155\/jgaa.00028"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1215\/S0012-7094-40-00718-9","volume":"7","author":"R. L. Brooks","year":"1940","unstructured":"R. L. Brooks, C. A. B. Smith, A. H. Stone, and W. T. Tutte. The dissection of rectangles into squares. Duke Mathematical Journal, 7:312\u2013340, 1940.","journal-title":"Duke Mathematical Journal"},{"key":"12_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/3-540-46648-7_12","volume-title":"Drawing planar graphs with circular arcs","author":"C. C. Cheng","year":"1999","unstructured":"C. C. Cheng, C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Drawing planar graphs with circular arcs. Proc. GD\u2019 99, Springer LNCS 1731, pp. 117\u2013126, 1999."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41\u201351, 1990.","journal-title":"Combinatorica"},{"key":"12_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/3-540-63938-1_68","volume-title":"Implementing a general-purpose edge router","author":"D. P. Dobkin","year":"1997","unstructured":"D. P. Dobkin, E. R. Gansner, E. Koutsofios, and S. C. North. Implementing a general-purpose edge router. Proc. GD\u2019 97, Springer LNCS 1353, pp. 262\u2013271, 1997."},{"key":"12_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/3-540-37623-2_28","volume-title":"Improved force-directed layouts","author":"E. R. Gansner","year":"1998","unstructured":"E. R. Gansner and S. C. North. Improved force-directed layouts. Proc. GD\u2019 98, Springer LNCS 1547, pp. 364\u2013373, 1998."},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1002\/spe.4380181104","volume":"17","author":"E. R. Gansner","year":"1988","unstructured":"E. R. Gansner, S. C. North, and K.-P. Vo. DAG-A program that draws directed graphs. Software-Practice and Experience, 17(1):1047\u20131062, 1988.","journal-title":"Software-Practice and Experience"},{"key":"12_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/3-540-37623-2_12","volume-title":"A framework for drawing planar graphs with curves and polylines","author":"M. T. Goodrich","year":"1998","unstructured":"M. T. Goodrich and C. G. Wagner. A framework for drawing planar graphs with curves and polylines. Proc. GD\u2019 98, Springer LNCS 1547, pp. 153\u2013166, 1998."},{"key":"12_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/3-540-37623-2_13","volume-title":"Planar polyline drawings with good angular resolution","author":"C. Gutwenger","year":"1998","unstructured":"C. Gutwenger and P. Mutzel. Planar polyline drawings with good angular resolution. Proc. GD\u2019 98, Springer LNCS 1547, pp. 167\u2013182, 1998."},{"key":"12_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/3-540-46784-X_31","volume-title":"On the hardness of recognizing bundels in time table graphs","author":"A. Liebers","year":"1999","unstructured":"A. Liebers, D. Wagner, and K. Weihe. On the hardness of recognizing bundels in time table graphs. Proc. WG\u2019 99, Springer LNCS 1665, pp. 325\u2013337, 1999."},{"key":"12_CR15","unstructured":"K. Mehlhorn and S. N\u00e4her. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"T. Munzner, E. Hoffman, K. Claffy, and B. Fenner. Visualizing the global topology of the MBone. Proc. IEEE InfoVis\u2019 96, pp. 85\u201392, 1996.","DOI":"10.1109\/INFVIS.1996.559226"},{"key":"12_CR17","series-title":"Lect Notes Comput Sci","first-page":"110","volume-title":"Dijkstra\u2019s algorithm on-line: An empirical case study from public railroad transport","author":"F. Schulz","year":"1990","unstructured":"F. Schulz, D. Wagner, and K. Weihe. Dijkstra\u2019s algorithm on-line: An empirical case study from public railroad transport. Proc. WAE\u2019 99, Springer LNCS 1668, pp. 110\u2013123, 1990."},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"W. T. Tutte. How to draw a graph. Proceedings of the London Mathematical Society, Third Series, 13:743\u2013768, 1963.","DOI":"10.1112\/plms\/s3-13.1.743"},{"key":"12_CR19","unstructured":"K. Weihe. Covering trains by stations or the power of data reduction. Electronic Proc. ALEX\u2019 98, pp. 1\u20138, 1998. \n                    http:\/\/rtm.science.unitn.it\/alex98\/proceedings.html\n                    \n                  ."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44541-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T23:44:36Z","timestamp":1550447076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44541-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44541-2_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}