{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:18:43Z","timestamp":1725581923952},"publisher-location":"Berlin, Heidelberg","reference-count":71,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642622144"},{"type":"electronic","value":"9783642186387"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-642-18638-7_2","type":"book-chapter","created":{"date-parts":[[2011,4,23]],"date-time":"2011-04-23T02:57:24Z","timestamp":1303527444000},"page":"9-53","source":"Crossref","is-referenced-by-count":1,"title":["Technical Foundations"],"prefix":"10.1007","author":[{"given":"Michael","family":"J\u00fcnger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Barth, W., J\u00fcnger, M., Mutzel, P. (2002) Simple and efficient bilayer cross counting. In: M. Goodrich and S. Kobourov (eds.) Graph Drawing\u2019 02, Lecture Notes in Computer Science 2528, Springer-Verlag, 130\u2013141","DOI":"10.1007\/3-540-36151-0_13"},{"issue":"4","key":"2_CR2","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1109\/TSE.1986.6312901","volume":"SE-12","author":"C Batini","year":"1986","unstructured":"Batini, C, Nardelli, E., Tamassia, R. (1986) A layout algorithm for data flow diagrams. IEEE Transactions on Software Engineering SE-12(4), 538\u2013546","journal-title":"IEEE Transactions on Software Engineering"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bertolazzi, P., Di Battista, G., Didimo, W. (1998) Quasi-upward planarity. In: S. H. Whitesides (ed.) Graph Drawing\u2019 98, Lecture Notes in Computer Science 1547, Springer-Verlag, 15\u201329","DOI":"10.1007\/3-540-37623-2_2"},{"issue":"8","key":"2_CR4","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1109\/12.868028","volume":"49","author":"P Bertolazzi","year":"2000","unstructured":"Bertolazzi, P., Di Battista, G., Didimo, W. (2000) Computing orthogonal drawings with the minimum number of bends. IEEE Transactions on Computers 49(8), 826\u2013840","journal-title":"IEEE Transactions on Computers"},{"issue":"12","key":"2_CR5","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/BF01188716","volume":"6","author":"P Bertolazzi","year":"1994","unstructured":"Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C. (1994) Upward drawings of triconnected digraphs. Algorithmica 6(12), 476\u2013497","journal-title":"Algorithmica"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539794279626","volume":"27","author":"P Bertolazzi","year":"1998","unstructured":"Bertolazzi, P., Di Battista, G., Mannino, C, Tamassia, R. (1998) Optimal upward planarity testing of single-source digraphs. SIAM Journal on Computing 27, 132\u2013169","journal-title":"SIAM Journal on Computing"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K Booth","year":"1976","unstructured":"Booth, K., Lueker, G. (1976) Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences 13, 335\u2013379","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Brandenburg, F. J., Himsolt, M., Rohrer, C. (1996) An experimental comparison of force-directed and randomized graph drawing algorithms. In: F.-J. Brandenburg (ed.) Graph Drawing\u2019 95, Lecture Notes in Computer Science 1027, Springer-Verlag, 76\u201387","DOI":"10.1007\/BFb0021792"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Brandes, U. (2001) Drawing on Physical Analogies. In: M. Kaufmann and D. Wagner (eds.) Drawing Graphs, Lecture Notes in Computer Science 2025, Springer-Verlag, 71\u201386","DOI":"10.1007\/3-540-44969-8_4"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Brandes, U., K\u00f6pf, B. (2002) Fast and simple horizontal coordinate assignment. In: P. Mutzel, M. J\u00fcnger, S. Leipert (eds.) Graph Drawing\u2019 01, Lecture Notes in Computer Science 2265, Springer-Verlag, 31\u201344","DOI":"10.1007\/3-540-45848-4_3"},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.7155\/jgaa.00028","volume":"4","author":"IL Brandes","year":"2000","unstructured":"Brandes, IL, Wagner, D. (2000) Using graph layout to visualize train interconnection data. J. Graph Algorithms and Applications 4(3), 135\u2013155","journal-title":"J. Graph Algorithms and Applications"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0925-7721(99)00054-1","volume":"16","author":"S Bridgeman","year":"2000","unstructured":"Bridgeman, S., Di Battista, G., Didimo, W., Liotta, G., Tamassia, R., Vismara, L. (2000) Turn-regularity and optimal area drawings of orthogonal representations. Computational Geometry: Theory and Applications, 16, 53\u201393","journal-title":"Computational Geometry: Theory and Applications"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Bru\u00df, I., Frick, A. (1996) Fast interactive 3-D graph visualization. In: F.-J. Brandenburg (ed.) Graph Drawing\u2019 95, Lecture Notes in Computer Science 1027, Springer-Verlag, 99\u2013110","DOI":"10.1007\/BFb0021794"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Buchheim, C, J\u00fcnger, M., Leipert, S. (2001) A fast layout algorithm for k-level graphs. In: J. Marks (ed.) Graph Drawing\u2019 00, Lecture Notes in Computer Science 1984, Springer-Verlag, 229\u2013240","DOI":"10.1007\/3-540-44541-2_22"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Buchheim, C, J\u00fcnger, M., Leipert, S. (2002) Improving Walker\u2019s algorithm to run in linear time. In: M. Goodrich and S. Kobourov (eds.) Graph Drawing\u2019 02, Lecture Notes in Computer Science 2528, Springer-Verlag, 344\u2013353","DOI":"10.1007\/3-540-36151-0_32"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1137\/0222068","volume":"22","author":"J Cai","year":"1993","unstructured":"Cai, J., Han, X., Tarjan, R. E. (1993) An O(mlog n)-time algorithm for the maximal planar subgraph problem. SIAM Journal on Computing 22, 1142\u20131164","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/0022-0000(85)90004-2","volume":"30","author":"N Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T., Abe, S., Ozawa T. (1985) A linear algorithm for embedding planar graphs using PQ-trees. Journal of Computer System Science 30(1), 54\u201376","journal-title":"Journal of Computer System Science"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Cook, W. J., Cunningham, W. H., Pulleyblank, W. R., Schrijver, A. (1998) Combinatorial Optimization. John Wiley & Sons","DOI":"10.1002\/9781118033142"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"EG Coffman","year":"1972","unstructured":"Coffman, E. G., Graham, R. L. (1972) Optimal scheduling for two processor systems. Acta Informatica 1, 200\u2013213","journal-title":"Acta Informatica"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Cruz, I. F., and Twarog, J. P. (1996) 3D Graph Drawing with simulated annealing. In: F.-J. Brandenburg (ed.) Graph Drawing\u2019 95, Lecture Notes in Computer Science 1027, Springer-Verlag, 162\u2013165","DOI":"10.1007\/BFb0021800"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Dahlhaus, E. (1998) A linear time algorithm to recognize clustered graphs and its parallelization. In: C. L. Lucchesi and A. V. Moura (eds.) Latin\u2019 98, Lecture Notes in Computer Science 1380, Springer-Verlag, 239\u2013248","DOI":"10.1007\/BFb0054325"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R Davidson","year":"1996","unstructured":"Davidson, R., Harel, D. (1996) Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics 15, 301\u2013331","journal-title":"ACM Transactions on Graphics"},{"key":"2_CR23","volume-title":"Graph Drawing: Algorithms for the visualization of graphs","author":"G Battista Di","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I. G. (1999) Graph Drawing: Algorithms for the visualization of graphs. Prentice Hall, New Jersey"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Di Battista, G., Garg, A., Liotta, G., Parise, A., Tamassia, R., Tassinari, E., Vargiu, F., Vismara, L. (1997) Drawing Directed Graphs: an Experimental Study. In: S. North (ed.) Graph Drawing\u2019 96, Lecture Notes in Computer Science 1190, Springer-Verlag, 76\u201391","DOI":"10.1007\/3-540-62495-3_39"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G Battista Di","year":"1997","unstructured":"Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F. (1997) Computational Geometry: Theory and Applications 7, 303\u2013316","journal-title":"Computational Geometry: Theory and Applications"},{"key":"2_CR26","unstructured":"Di Battista, G., Didimo, W., Patrignani, M., Pizzonia M. (1999) Orthogonal and quasiupward drawings with vertices of arbitrary size. In: J. Kratochvil (ed.) Graph Drawing\u2019 99, Lecture Notes in Computer Science 1731, Springer-Verlag, 297\u2013310"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Djidjev, H. N. (1995) A linear algorithm for the maximal planar subgraph problem. In: Proceedings of the 4th Workshop Algorithms Data Struct., Lecture Notes in Computer Science, Springer-Verlag","DOI":"10.1007\/3-540-60220-8_77"},{"key":"2_CR28","first-page":"149","volume":"42","author":"P Eades","year":"1984","unstructured":"Eades, P. (1984) A heuristic for Graph Drawing. Congressus Numerantium 42, 149\u2013160","journal-title":"Congressus Numerantium"},{"key":"2_CR29","first-page":"10","volume":"5","author":"P Eades","year":"1992","unstructured":"Eades, P. (1992) Drawing free trees. Bulletin of the Institute for Combinatorics and its Applications 5, 10\u201336","journal-title":"Bulletin of the Institute for Combinatorics and its Applications"},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0020-0190(93)90079-O","volume":"47","author":"P Eades","year":"1993","unstructured":"Eades, P., Lin, X., Smyth, W. F. (1993) A fast and effective heuristic for the feedback arc set problem. Information Processing Letters 47, 319\u2013323","journal-title":"Information Processing Letters"},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P Eades","year":"1994","unstructured":"Eades, P., Wormald, N. (1994) Edge crossings in drawings of bipartite graphs. Algorithmica 11, 379\u2013403","journal-title":"Algorithmica"},{"key":"2_CR32","unstructured":"Eades, P., Cohen, R. F., Huang, M. L. (1997) Online animated Graph Drawing for web animation. In: G. Di Battista (ed.) Graph Drawing\u2019 97, Lecture Notes in Computer Science 1353, Springer-Verlag, 330\u2013335"},{"key":"2_CR33","unstructured":"Elf, M., Gutwenger, C, J\u00fcnger, M., Rinaldi, G. (2001) Branch-and-cut algorithms and their implementation in ABACUS. In: M. J\u00fcnger and D. Naddef (eds.) Computational Combinatorial Optimization, Lecture Notes in Computer Science 2241, Springer-Verlag, 157\u2013222"},{"key":"2_CR34","first-page":"140","volume":"4","author":"L Euler","year":"1750","unstructured":"Euler, L. (1750) Demonstratio nonnullarum insignium proprietatum quibus solida hedris planis inclusa sunt praedita. Novi Comm. Acad. Sei. Imp. Petropol. 4 (1752\u20133, published 1758), 140\u2013160, also: Opera Omnia (1) 26, 94\u2013108","journal-title":"Novi Comm. Acad. Sei. Imp. Petropol."},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Feng, Q. W., Cohen, R. F., Eades, P. (1995) Planarity for clustered graphs. In: P Spirakis (ed.) Algorithms \u2014 ESA\u2019 95, Lecture Notes in Computer Science 979, Springer-Verlag, 213\u2013226","DOI":"10.1007\/3-540-60313-1_145"},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M. (1996) Drawing high degree graphs with low bend numbers. In: F. J. Brandenburg (ed.) Graph Drawing\u2019 95, Lecture Notes in Computer Science 1027, Springer-Verlag, 254\u2013266","DOI":"10.1007\/BFb0021809"},{"key":"2_CR37","unstructured":"Frick, A., Ludwig, A., Mehldau, H. (1995) A fast adaptive layout algorithm for undirected graphs. In: R. Tamassia and I. G. Tollis (eds.) Graph Drawing\u2019 94, Lecture Notes in Computer Science 894, Springer-Verlag, 388\u2013403"},{"key":"2_CR38","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchtermann","year":"1991","unstructured":"Fruchtermann, T. M. J., Reingold, E. M. (1991) Graph Drawing by force-directed placement. Software \u2014 Practice and Experience 21, 1129\u20131164","journal-title":"Software \u2014 Practice and Experience"},{"key":"2_CR39","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey, M. R., Johnson, D. S. (1983) Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods 4, 312\u2013316","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"2_CR40","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"ER Gansner","year":"1993","unstructured":"Gansner, E. R., Koutsofios, E., North, S. C, Vo, K. P. (1993) A technique for drawing directed graphs. IEEE Transactions on Software Engineering 19, 214\u2013230","journal-title":"IEEE Transactions on Software Engineering"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"Garg, A., Tamassia, R. (1995) On the computational complexity of upward and rectilinear planarity testing. In: R. Tamassia and I. G. Tollis (eds.) Graph Drawing\u2019 94, Lecture Notes in Computer Science 894, Springer-Verlag, 286\u2013297","DOI":"10.1007\/3-540-58950-3_384"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"Garg, A., Tamassia, R. (1997) A New Minimum Cost Flow Algorithm with Applications to Graph Drawing. In: S. North (ed.) Graph Drawing\u2019 96, Lecture Notes in Computer Science 1190, Springer-Verlag, 201\u2013216","DOI":"10.1007\/3-540-62495-3_49"},{"key":"2_CR43","unstructured":"Gutwenger, C, Mutzel, P., Weiskircher, R. (2001) Inserting an edge into a planar graph. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), ACM Press, 246\u2013255"},{"key":"2_CR44","doi-asserted-by":"crossref","unstructured":"Healy, P., Kuusik, A. (1999) The vertex-exchange graph: a new concept for multi-level crossing minimization. In: J. Kratochvil (ed.) Graph Drawing\u2019 99, Lecture Notes in Computer Science 1731, Springer-Verlag, 205\u2013216","DOI":"10.1007\/3-540-46648-7_21"},{"key":"2_CR45","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R. E. (1974) Efficient planarity testing. Journal of the ACM 21, 549\u2013568","journal-title":"Journal of the ACM"},{"key":"2_CR46","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/43.21845","volume":"8","author":"R Jayakumar","year":"1989","unstructured":"Jayakumar, R., Thulasiraman, K., Swamy, M. N. S. (1989) O(n\n                2) algorithms for graph planarization. IEEE Transactions on Computer Aided Design 8, 257\u2013267","journal-title":"IEEE Transactions on Computer Aided Design"},{"key":"2_CR47","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/43.709399","volume":"17","author":"M J\u00fcnger","year":"1998","unstructured":"J\u00fcnger, M., Leipert, S., Mutzel, P. (1998) A note on computing a maximal planar subgraph using PQ-trees. IEEE Transactions of Computer-Aided Design and Integrated Circuits and Systems 17, 609\u2013612","journal-title":"IEEE Transactions of Computer-Aided Design and Integrated Circuits and Systems"},{"key":"2_CR48","first-page":"33","volume":"16","author":"M J\u00fcnger","year":"1996","unstructured":"J\u00fcnger, M., Mutzel, P. (1996) Maximum planar subgraphs and nice embeddings: practical layout tools. Algorithmica 16, 33\u201359","journal-title":"Maximum planar subgraphs and nice embeddings: practical layout tools. Algorithmica"},{"key":"2_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M J\u00fcnger","year":"1997","unstructured":"J\u00fcnger, M., Mutzel, P. (1997) 2-layer straight line crossing minimization: performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications 1, 1\u201325","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"2_CR50","doi-asserted-by":"crossref","unstructured":"J\u00fcnger, M., Reinelt, G., Thienel, S. (1995) Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization. In: W. Cook, L. Lov\u00e1sz, P. Seymour (eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 111\u2013152","DOI":"10.1090\/dimacs\/020\/02"},{"key":"2_CR51","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T Kamada","year":"1989","unstructured":"Kamada, T., and Kawai, S. (1989) An algorithm for drawing general undirected graphs. Information Processing Letters 31, 7\u201315","journal-title":"Information Processing Letters"},{"key":"2_CR52","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Wagner, D. (eds.) (2001) Drawing Graphs: Methods and Models. Lecture Notes in Computer Science 2025, Springer-Verlag","DOI":"10.1007\/3-540-44969-8"},{"key":"2_CR53","doi-asserted-by":"crossref","unstructured":"Klau, G. W., Klein, K., Mutzel P. (2001) An Experimental Comparison of Orthogonal Compaction Algorithms. In: J. Marks (ed.) Graph Drawing\u2019 00, Lecture Notes in Computer Science 1984, Springer-Verlag, 37\u201351","DOI":"10.1007\/3-540-44541-2_5"},{"key":"2_CR54","unstructured":"Klau, G. W., Mutzel P. (1999) Optimal compaction of orthogonal grid drawings. In: G. Cornuejols, R. E. Burkard, and G. J. Woeginger (eds.), Integer Programming and Combinatorial Optimization (IPCO\u2019 99), Lecture Notes in Computer Science 1610, Springer-Verlag, 304\u2013319"},{"key":"2_CR55","first-page":"215","volume-title":"Theory of Graphs: International Symposium: Rome, July 1966","author":"A Lempel","year":"1967","unstructured":"Lempel, A., Even, S., Cederbaum, I. (1967) An algorithm for planarity testing of graphs. Theory of Graphs: International Symposium: Rome, July 1966, Gordon and Breach, New York, 215\u2013232"},{"key":"2_CR56","first-page":"727","volume-title":"Proceedings of the 10th S-E Conference on Comb., Graph Theory, and Comp.","author":"PC Liu","year":"1977","unstructured":"Liu, P.C., Geldmacher, R. C. (1977) On the deletion of nonplanar edges of a graph. Proceedings of the 10th S-E Conference on Comb., Graph Theory, and Comp., Boca Raton, FL, 727\u2013738"},{"key":"2_CR57","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01940648","volume":"16","author":"K Mehlhorn","year":"1996","unstructured":"Mehlhorn K., Mutzel, P. (1996) On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm. Algorithmica 16, 233\u2013242","journal-title":"Algorithmica"},{"key":"2_CR58","doi-asserted-by":"crossref","unstructured":"Mutzel, P., Weiskircher, R. (2002) Bend Minimization in Orthogonal Drawings Using Integer Programming. In: O. Ibarra and L. Zhang (eds.) Computing and Combinatorics, Eighth Annual International Conference (COCOON 2002), Lecture Notes in Computer Science 2387, Springer-Verlag, 484\u2013493","DOI":"10.1007\/3-540-45655-4_52"},{"issue":"1","key":"2_CR59","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0925-7721(01)00010-4","volume":"19","author":"M Patrignani","year":"2001","unstructured":"Patrignani, M. (2001) On the complexity of orthogonal compaction. Computational Geometry: Theory and Applications 19(1), 47\u201367","journal-title":"Computational Geometry: Theory and Applications"},{"key":"2_CR60","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"7","author":"E Reingold","year":"1981","unstructured":"Reingold, E., Tilford, J. (1981) Tidier drawing of trees. IEEE Transactions on Software Engineering 7, 223\u2013228","journal-title":"IEEE Transactions on Software Engineering"},{"key":"2_CR61","volume-title":"Visualisierungstechniken f\u00fcr den Compilerbau","author":"G Sander","year":"1996","unstructured":"Sander, G. (1996) Visualisierungstechniken f\u00fcr den Compilerbau. Pirrot Verlag & Druck, Saarbr\u00fccken"},{"key":"2_CR62","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M. (1981) Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics 11, 109\u2013125","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"issue":"21","key":"2_CR63","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1109\/21.108304","volume":"4","author":"K Sugiyama","year":"1991","unstructured":"Sugiyama, K., Misue, K. (1991) Visualization of structural information: automatic drawing of compound digraphs. IEEE Transactions on Systems, Man, and Cybernetics 4(21), 876\u2013893","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"2_CR64","doi-asserted-by":"crossref","unstructured":"Sugiyama, K., Misue, K. (1995) A simple and unified method for drawing graphs: magnetic-spring algorithm. In: R. Tamassia and I. G. Tollis (eds.) Graph Drawing\u2019 94, Lecture Notes in Computer Science 894, Springer-Verlag, 364\u2013375","DOI":"10.1007\/3-540-58950-3_391"},{"key":"2_CR65","first-page":"377","volume":"18","author":"KJ Supowit","year":"1983","unstructured":"Supowit, K. J., Reingold, E. M. (1983) The complexity of drawing trees nicely. Acta Inform. 18, 377\u2013392","journal-title":"The complexity of drawing trees nicely. Acta Inform"},{"issue":"3","key":"2_CR66","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R. (1987) On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing 16(3), 421\u2013444","journal-title":"SIAM Journal on Computing"},{"key":"2_CR67","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R Tamassia","year":"1988","unstructured":"Tamassia, R., Di Battista, G., Batini, C. (1988) Automatic Graph Drawing and readability of diagrams. IEEE Transactions on Systems, Man, and Cybernetics 18, 61\u201379","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"2_CR68","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"WT Tutte","year":"1963","unstructured":"Tutte, W. T. (1963) How to draw a graph. Proceedings of the London Mathematical Society, Third Series 13, 743\u2013768","journal-title":"Proceedings of the London Mathematical Society"},{"key":"2_CR69","doi-asserted-by":"crossref","unstructured":"Waddle, V., Malhotra, A. (1999) An E log E line crossing algorithm for levelled graphs. In: J. Kratochvil (ed.) Graph Drawing\u2019 99, Lecture Notes in Computer Science 1731, Springer-Verlag, 59\u201370","DOI":"10.1007\/3-540-46648-7_6"},{"key":"2_CR70","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1002\/spe.4380200705","volume":"20","author":"JQ Walker II","year":"1990","unstructured":"Walker II, J. Q. (1990) A node-positioning algorithm for general trees. Software \u2014 Practice and Experience 20, 685\u2013705","journal-title":"Software \u2014 Practice and Experience"},{"key":"2_CR71","unstructured":"Ziegler, T. (2001) Crossing minimization in automatic Graph Drawing. Doctoral Thesis, Technische Fakult\u00e4t der Universit\u00e4t des Saarlandes"}],"container-title":["Mathematics and Visualization","Graph Drawing Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18638-7_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:07:22Z","timestamp":1606187242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18638-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783642622144","9783642186387"],"references-count":71,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18638-7_2","relation":{},"ISSN":["1612-3786"],"issn-type":[{"type":"print","value":"1612-3786"}],"subject":[],"published":{"date-parts":[[2004]]}}}