{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:52:24Z","timestamp":1725483144068},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425601"},{"type":"electronic","value":"9783540448082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44808-x_10","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T20:32:08Z","timestamp":1178224328000},"page":"132-144","source":"Crossref","is-referenced-by-count":7,"title":["Travel Planning with Self-Made Maps"],"prefix":"10.1007","author":[{"given":"Ulrik","family":"Brandes","sequence":"first","affiliation":[]},{"given":"Frank","family":"Schulz","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Willhalm","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,11]]},"reference":[{"key":"10_CR1","unstructured":"R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows. Prentice-Hall, 1993."},{"key":"10_CR2","unstructured":"J. Branke, F. Bucher, and H. Schmeck. A genetic algorithm for drawing undirected graphs. Proc. 3rd Nordic Workshop on Genetic Algorithms and their Applications, pp. 193\u2013206, 1997."},{"key":"10_CR3","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":"10_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/BFb0021800","volume-title":"Proc. 3rd Intl. Symp. Graph Drawing (GD\u2019 95)","author":"I. F. Cruz","year":"1996","unstructured":"I. F. Cruz and J. P. Twarog. 3D graph drawing with simulated annealing. Proc. 3rd Intl. Symp. Graph Drawing (GD\u2019 95), Springer LNCS 1027, pp. 162\u2013165, 1996."},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R. Davidson","year":"1996","unstructured":"R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics, 15(4):301\u2013331, 1996.","journal-title":"ACM Transactions on Graphics"},{"key":"10_CR6","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149\u2013160, 1984.","journal-title":"Congressus Numerantium"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0166-218X(90)90110-X","volume":"28","author":"P. Eades","year":"1990","unstructured":"P. Eades and N. C. Wormald. Fixed edge-length graph drawing is np-hard. Discrete Applied Mathematics, 28:111\u2013134, 1990.","journal-title":"Discrete Applied Mathematics"},{"issue":"11","key":"10_CR8","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T. M. Fruchterman","year":"1991","unstructured":"T. M. Fruchterman and E. M. Reingold. Graph-drawing by force-directed placement. Software\u2014Practice and Experience, 21(11):1129\u20131164, 1991.","journal-title":"Software\u2014Practice and Experience"},{"key":"10_CR9","unstructured":"P. Gajer, M. T. Goodrich, and S. G. Kobourov. A fast multi-dimensional algorithm for drawing large graphs. Proc. Graph Drawing 2000. To appear."},{"key":"10_CR10","unstructured":"G. H. Golub and C. F. van Loan. Matrix Computations. Johns Hopkins University Press, 3rd edition, 1996."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"D. Harel and Y. Koren. A fast multi-scale method for drawing large graphs. Proc. Graph Drawing 2000. To appear.","DOI":"10.1145\/345513.345353"},{"key":"10_CR12","unstructured":"S. Jung and S. Pramanik. HiTi graph model of topographical road maps in navigation systems. Proc. 12th IEEE Int. Conf. Data Eng., pp. 76\u201384, 1996."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T. Kamada","year":"1989","unstructured":"T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7\u201315, 1989.","journal-title":"Information Processing Letters"},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1109\/21.278993","volume":"24","author":"C. Kosak","year":"1994","unstructured":"C. Kosak, J. Marks, and S. Shieber. Automating the layout of network diagrams with specified visual organization. IEEE Transactions on Systems, Man and Cybernetics, 24(3):440\u2013454, 1994.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"10_CR15","unstructured":"P. Kosmol. Methoden zur numerischen Behandlung nichtlinearer Gleichungen und Optimierungsaufgaben. Teubner Verlag, 1993."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Wiley, 1990.","DOI":"10.1007\/978-3-322-92106-2_3"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/0377-2217(94)E0349-G","volume":"83","author":"K. Nachtigall","year":"1995","unstructured":"K. Nachtigall. Time depending shortest-path problems with applications to railway networks. European Journal of Operational Research 83:154\u2013166, 1995.","journal-title":"European Journal of Operational Research"},{"key":"10_CR18","unstructured":"T. Preu\u00df and J.-H. Syrbe. An integrated traffic information system. Proc. 6th Intl. EuropIA Conf. Appl. Computer Networking in Architecture, Construction, Design, Civil Eng., and Urban Planning. Europia Productions, 1997."},{"key":"10_CR19","series-title":"Lect Notes Comput Sci","first-page":"110","volume-title":"Proc. 3rd Workshop on Algorithm Engineering (WAE\u2019 99)","author":"F. Schulz","year":"1998","unstructured":"F. Schulz, D. Wagner, and K. Weihe. Dijkstra\u2019s algorithm on-line: an empirical case study from public railroad transport. Proc. 3rd Workshop on Algorithm Engineering (WAE\u2019 99), Springer LNCS 1668, pp. 110\u2013123, 1998."},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01840435","volume":"1","author":"R. Sedgewick","year":"1986","unstructured":"R. Sedgewick and J. S. Vitter. Shortest paths in euclidean space. Algorithmica 1:31\u201348, 1986.","journal-title":"Algorithmica"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"S. Shekhar, A. Kohli, and M. Coyle. Path computation algorithms for advanced traveler information system (ATIS). Proc. 9th IEEE Intl. Conf. Data Eng., pp. 31\u201339, 1993.","DOI":"10.1109\/ICDE.1993.344080"},{"key":"10_CR22","unstructured":"L. Sikl\u00f3ssy and E. Tulp. TRAINS, an active time-table searcher. Proc. 8th European Conf. Artificial Intelligence, pp. 170\u2013175, 1988."},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"P. Spellucci. Numerische Verfahren der nichtlinearen Optimierung. Birkh\u00e4user Verlag, 1993.","DOI":"10.1007\/978-3-0348-7214-0"},{"key":"10_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/3-540-37623-2_33","volume-title":"Proc. 6th Intl. Symp. Graph Drawing (GD\u2019 98)","author":"D. Tunkelang","year":"1998","unstructured":"D. Tunkelang. JIGGLE: Java interactive general graph layout environment. Proc. 6th Intl. Symp. Graph Drawing (GD\u2019 98), Springer LNCS 1547, pp. 413\u2013422, 1998."},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W. T. Tutte","year":"1963","unstructured":"W. T. Tutte. How to draw a graph. Proceedings of the London Mathematical Society, Third Series, 13:743\u2013768, 1963.","journal-title":"Proceedings of the London Mathematical Society, Third Series"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"C. Walshaw. A multilevel algorithm for force-directed graph drawing. Proc. Graph Drawing 2000. To appear.","DOI":"10.1007\/3-540-44541-2_17"}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering and Experimentation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44808-X_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:17:00Z","timestamp":1556374620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44808-X_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425601","9783540448082"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-44808-x_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}