{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T19:10:53Z","timestamp":1684005053581},"publisher-location":"Berlin, Heidelberg","reference-count":372,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540420620","type":"print"},{"value":"9783540449690","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44969-8_11","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T18:25:55Z","timestamp":1186683955000},"page":"274-281","source":"Crossref","is-referenced-by-count":0,"title":["Software Packages"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Willhalm","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,4,25]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Abbott, K. R., and Sarin, S. K. (1994). Experiences with workflow management: Issues for the next generation. In Proceedings of ACM Conference on Computer-Supported Cooperative Work, Workflow and Information Sharing (CSCW\u201994), pages 113\u2013120.","DOI":"10.1145\/192844.192886"},{"key":"11_CR2","unstructured":"Agarwal, P. K., and Erickson, J. (1997). Geometric range searching and its relatives. Technical Report CS 1997-11, Department of Computer Science, Duke."},{"issue":"3-4","key":"11_CR3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"P. K. Agarwal","year":"1998","unstructured":"Agarwal, P. K., van Kreveld, M., and Suri, S. (1998). Label placement by maximum independent set in rectangles. Computational Geometry: Theory and Applications, 11(3-4):209\u2013218.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"11_CR4","unstructured":"Aho, A., Hopcroft, J., and Ullman, J. (1974). The Design and Analysis of Computer Algorithms. Addison-Wesley."},{"key":"11_CR5","unstructured":"Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"C. J. Alpert","year":"1995","unstructured":"Alpert, C. J., and Kahng, A. B. (1995). Recent directions in netlist partitioning: a survey. INTEGRATION, the VLSI Journal, 19:1\u201381.","journal-title":"INTEGRATION, the VLSI Journal"},{"key":"11_CR7","series-title":"Technical Report Verbmobil-Report","volume-title":"What\u2019s in a word graph? Evaluation and enhancement of word lattices","author":"H. H. J. Amtrup","year":"1996","unstructured":"Amtrup, H. H. J., and Jost, U. (1996). What\u2019s in a word graph? Evaluation and enhancement of word lattices. Technical Report Verbmobil-Report 186, University Hamburg, Germany."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1070\/SM1970v010n03ABEH001677","volume":"10","author":"E. M. Andreev","year":"1970","unstructured":"Andreev, E. M. (1970a). On convex polyhedra in Lobacevskii spaces. Math. USSR-Sb., 10:413\u2013440.","journal-title":"Math. USSR-Sb."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1070\/SM1970v012n02ABEH000920","volume":"12","author":"E. M. Andreev","year":"1970","unstructured":"Andreev, E. M. (1970b). On convex polyhedra of finite volume in Lobacevskii space. Math. USSR-Sb., 12:255\u2013259.","journal-title":"Math. USSR-Sb."},{"issue":"3","key":"11_CR10","first-page":"517","volume":"10","author":"L. Auslander","year":"1961","unstructured":"Auslander, L., and Parter, S. V. (1961). On imbedding graphs in the plane. Journal of Mathematics and Mechanics, 10(3):517\u2013523.","journal-title":"Journal of Mathematics and Mechanics"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/net.3230020103","volume":"2","author":"K. A. Baker","year":"1971","unstructured":"Baker, K. A., Fishburn, P. C., and Roberts, F. S. (1971). Partial orders of dimension 2. Networks, 2:11\u201328.","journal-title":"Networks"},{"issue":"3","key":"11_CR12","first-page":"339","volume":"18","author":"V. Batagelj","year":"1992","unstructured":"Batagelj, V., Kerzic, D., and Pisanski, T. (1992). Automatic clustering of languages. Computational Linguistics, 18(3):339\u2013352.","journal-title":"Computational Linguistics"},{"key":"11_CR13","volume-title":"Graphs","author":"C. Berge","year":"1993","unstructured":"Berge, C. (1993). Graphs. North Holland, Amsterdam, 3rd edition.","edition":"3rd edition"},{"key":"11_CR14","unstructured":"Berger, B., and Shor, P. (1990). Approximation algorithms for the maximum acyclic subgraph problem. In Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA\u201990), pages 236\u2013243."},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1142\/S0218195994000215","volume":"4","author":"P. Bertolazzi","year":"1994","unstructured":"Bertolazzi, P., Cohen, R. F., Di Battista, G., Tamassia, R., and Tollis, I. G. (1994a). How to draw a series-parallel digraph. International Journal of Computational Geometry and Applications, 4:385\u2013402.","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"11_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/3-540-63307-3_72","volume-title":"Proceedings of the 5th Workshop on Algorithms and Data Structures (WADS\u201997)","author":"P. Bertolazzi","year":"1997","unstructured":"Bertolazzi, P., Di Battista, G., and Didimo, W. (1997). Computing orthogonal drawings with the minimum number of bends. In Proceedings of the 5th Workshop on Algorithms and Data Structures (WADS\u201997), Spinger LNCS 1272, pages 331\u2013344."},{"issue":"12","key":"11_CR17","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., and Mannino, C. (1994b). Upward drawings of triconnected digraphs. Algorithmica, 6(12):476\u2013497.","journal-title":"Algorithmica"},{"key":"11_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-57273-2_42","volume-title":"Proceedings of the 1st European Symposium on Algorithms (ESA\u201993)","author":"P. Bertolazzi","year":"1993","unstructured":"Bertolazzi, P., Di Battista, G., Mannino, C., and Tamassia, R. (1993). Optimal upward planarity testing of single-source digraphs. In Proceedings of the 1st European Symposium on Algorithms (ESA\u201993), Springer LNCS 726, pages 37\u201348."},{"key":"11_CR19","unstructured":"Bertsekas, D. P. (1998). Network Optimization: Continuous and Discrete Models. Athena Scientific."},{"issue":"4","key":"11_CR20","doi-asserted-by":"crossref","first-page":"63","DOI":"10.7155\/jgaa.00018","volume":"3","author":"T. Biedl","year":"1999","unstructured":"Biedl, T., Shermer, T., Whitesides, S., and Wismath, S. (1999). Bounds for orthogonal 3D graph drawing. Journal of Graph Algorithms and Applications, 3(4):63\u201379.","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"11_CR21","unstructured":"Biedl, T. C. (1997). Orthogonal Graph Visualization: The Three-Phase Method with Applications. PhD thesis, Rutgers University."},{"key":"11_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/3-540-37623-2_3","volume-title":"Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998)","author":"T. C. Biedl","year":"1998","unstructured":"Biedl, T. C. (1998). Three approaches to 3D-orthogonal box-drawings. In Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998). Springer LNCS 1547, pages 30\u201343."},{"key":"11_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/BFb0049394","volume-title":"Proceedings of the 2nd European Symposium on Algorithms (ESA\u201994)","author":"T. C. Biedl","year":"1994","unstructured":"Biedl, T. C., and Kant, G. (1994). A better heuristic for orthogonal graph drawing. In Proceedings of the 2nd European Symposium on Algorithms (ESA\u201994), Springer LNCS 855, pages 24\u201335."},{"key":"11_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-63397-9_4","volume-title":"Proceedings of the 5th European Symposium on Algorithms (ESA\u201997)","author":"T. C. Biedl","year":"1997","unstructured":"Biedl, T. C., and Kaufmann, M. (1997). Area-efficient static and incremental graph drawings. In Proceedings of the 5th European Symposium on Algorithms (ESA\u201997), Springer LNCS 1284, pages 37\u201352."},{"key":"11_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/3-540-63938-1_84","volume-title":"Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997)","author":"T. C. Biedl","year":"1997","unstructured":"Biedl, T. C., Madden, B. P., and Tollis, I. G. (1997a). The three-phase method: A unified approach to orthogonal graph drawing. In Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997). Springer LNCS 1353, pages 391\u2013402."},{"key":"11_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-63938-1_52","volume-title":"Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997)","author":"T. C. Biedl","year":"1997","unstructured":"Biedl, T. C., Shermer, T., Whitesides, S., and Wismath, S. (1997b). Orthogonal 3D graph drawing. In Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997). Springer LNCS 1353, pages 76\u201386."},{"key":"11_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/BFb0021789","volume-title":"Proceedings of the 3rd International Symposiom on Graph Drawing (GD\u201995)","author":"J. Blythe","year":"1996","unstructured":"Blythe, J., McGrath, C., and Krackhardt, D. (1996). The effect of graph layout on inference from social network data. In Proceedings of the 3rd International Symposiom on Graph Drawing (GD\u201995). Springer LNCS 1027, pages 40\u201351."},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Bohringer, K.-F., and Paulisch, F. N. (1990). Using constraints to achieve stability in automatic graph layout algorithms. In Proceedings of the ACM Human Factors in Computing Systems Conference (CHI\u201990), pages 43\u201351.","DOI":"10.1145\/97243.97250"},{"key":"11_CR29","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. S. Booth","year":"1976","unstructured":"Booth, K. S., and Lueker, G. S. (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":"11_CR30","doi-asserted-by":"crossref","unstructured":"Borgida, A., Brachman, R., McGuinness, D., and Resnick, L. (1989). CLASSIC: A structural data model for objects. In Proceedings of the 1989 ACMSIGMOD International Conference on Management of Data, pages 59\u201367.","DOI":"10.1145\/67544.66932"},{"key":"11_CR31","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995)","author":"P. Bose","year":"1996","unstructured":"Bose, P., Gomez, F., Ramos, P., and Toussaint, G. (1996). Drawings nice projections of objects in space. In Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995), Springer LNCS 1027, pages 52-63."},{"key":"11_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BFb0021792","volume-title":"Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995)","author":"F. J. Brandenburg","year":"1996","unstructured":"Brandenburg, F. J., Himsolt, M., and Rohrer, C. (1996). An experimental comparison of force-directed and randomized graph drawing algorithms. In Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995), Springer LNCS 1027, pages 76\u201387."},{"key":"11_CR33","unstructured":"Brandes, U. (1999). Layout of Graph Visualizations. PhD thesis, University of Konstanz. http:\/\/www.ub.uni-konstanz\/kops\/volltexte\/1999\/255\/."},{"issue":"1","key":"11_CR34","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1177\/0951692899011001004","volume":"11","author":"U. Brandes","year":"1999","unstructured":"Brandes, U., Kenis, P., Raab, J., Schneider, V., and Wagner, D. (1999). Explorations into the visualization of policy networks. Journal of Theoretical Politics, 11(1):75\u2013106.","journal-title":"Journal of Theoretical Politics"},{"key":"11_CR35","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1007\/3-540-63938-1_66","volume-title":"Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997)","author":"U. Brandes","year":"1997","unstructured":"Brandes, U., and Wagner, D. (1997). A Bayesian paradigm for dynamic graph layout. In Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997), Springer LNCS 1353, pages 236\u2013247."},{"key":"11_CR36","series-title":"Lect Notes Comput Sci","first-page":"89","volume-title":"Proceedings of the 9th Annual International Symposium on Algorithms and Computation (ISAAC\u201998)","author":"U. Brandes","year":"1998","unstructured":"Brandes, U., and Wagner, D. (1998a). Dynamic grid embedding with few bends and changes. In Proceedings of the 9th Annual International Symposium on Algorithms and Computation (ISAAC\u201998), Springer LNCS 1533, pages 89\u201398."},{"key":"11_CR37","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/3-540-37623-2_4","volume-title":"Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998)","author":"U. Brandes","year":"1998","unstructured":"Brandes, U., and Wagner, D. (1998b). Using graph layout to visualize train interconnection data. In Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998), Springer LNCS 1547, pages 44\u201356."},{"key":"11_CR38","unstructured":"Branke, J., Bucher, F., and Schmeck, H. (1997). A genetic algorithm for drawing undirected graphs. In Proceedings of the 3rd Nordic Workshop on Genetic Algorithms and their Applications, pages 193\u2013206."},{"issue":"1","key":"11_CR39","doi-asserted-by":"crossref","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., and Vismara, L. (2000). Turn-regularity and optimal area drawings for orthogonal representations. Computational Geometry: Theory and Applications, 16(1):53\u201393.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"11_CR40","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/3-540-63938-1_73","volume-title":"Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997)","author":"S. Bridgeman","year":"1997","unstructured":"Bridgeman, S., Fanto, J., Garg, A., Tamassia, R., and Vismara, L. (1997). InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. In Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997), Springer LNCS 1353, pages 303\u2013308."},{"key":"11_CR41","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/3-540-37623-2_5","volume-title":"Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998)","author":"S. Bridgeman","year":"1998","unstructured":"Bridgeman, S., and Tamassia, R. (1998). Difference metrics for interactive orthogonal graph drawing algorithms. In Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998), Springer LNCS 1457, pages 57\u201371."},{"key":"11_CR42","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0021794","volume-title":"Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995)","author":"I. Bru\u00df","year":"1996","unstructured":"Bru\u00df, I., and Frick, A. (1996). Fast interactive 3-D graph visualization. In Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995), Springer LNCS 1027, pages 99\u2013110."},{"key":"11_CR43","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1137\/0222068","volume":"22","author":"J. Cai","year":"1993","unstructured":"Cai, J., Han, X., and Tarjan, R. E. (1993). An O(m log n)-time algorithm for the maximal planar subgraph problem. SIAM Journal on Computing, 22:1142\u20131162.","journal-title":"SIAM Journal on Computing"},{"issue":"11","key":"11_CR44","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1109\/TSMC.1980.4308390","volume":"SMC-10","author":"M. J. Carpano","year":"1980","unstructured":"Carpano, M. J. (1980b). Automatic display of hierarchized graphs for computer aided decision analysis. IEEE Transactions on Systems, Man, and Cybernetics, SMC-10(11):705\u2013715.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"issue":"3","key":"11_CR45","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/21.364865","volume":"25","author":"T. Catarci","year":"1995","unstructured":"Catarci, T. (1995). The assignment heuristic for crossing reduction. IEEE Trans. Syst. Man Cybern., 25(3):515\u2013521.","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"11_CR46","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0097-3165(78)90067-5","volume":"24","author":"S. Chaiken","year":"1978","unstructured":"Chaiken, S., and Kleitman, D. J. (1978). Matrix tree theorems. Journal of Combinatorial Theory, Series A, 24:377\u2013381.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"11_CR47","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/3-540-61440-0_117","volume-title":"Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996)","author":"T. Chan","year":"1996","unstructured":"Chan, T., Goodrich, M. T., Kosaraju, S. R., and Tamassia, R. (1996). Optimizing area and aspect ration in straight-line orthogonal tree drawings. In Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996). Springer LNCS 1190, pages 63\u201375."},{"key":"11_CR48","unstructured":"Chan, T. M. (1999). A near-linear area bound for drawing binary trees. In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA\u201999), pages 161\u2013168."},{"key":"11_CR49","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., and Ozawa, T. (1985). A linear time algorithm for embedding planar graphs using PQ-trees. Journal of Computer and System Sciences, 30:54\u201376.","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR50","doi-asserted-by":"crossref","unstructured":"Christensen, J., Friedman, S., Marks, J., and Shieber, S. (1997). Empirical testing of algorithms for variable-sized label placement. In Proceedings of the 13th Annual ACM Symposium on Computational Geometry, pages 415\u2013417.","DOI":"10.1145\/262839.263039"},{"key":"11_CR51","first-page":"75","volume":"1","author":"J. Christensen","year":"1993","unstructured":"Christensen, J., Marks, J., and Shieber, S. (1993). Algorithms for cartographic label placement. In Proceedings of the American Congress on Surveying and Mapping 1, pages 75\u201389.","journal-title":"Proceedings of the American Congress on Surveying and Mapping"},{"issue":"3","key":"11_CR52","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1145\/212332.212334","volume":"14","author":"J. Christensen","year":"1995","unstructured":"Christensen, J., Marks, J., and Shieber, S. (1995). An empirical study of algorithms for point-feature label placement. ACM Transactions on Graphics, 14(3):203\u2013232.","journal-title":"ACM Transactions on Graphics"},{"issue":"3","key":"11_CR53","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"7","author":"M. Chrobak","year":"1997","unstructured":"Chrobak, M., and Kant, G. (1997). Convex grid drawings of 3-connected planar graphs. International Journal of Computational Geometry and Applications, 7(3):211\u2013224.","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"11_CR54","unstructured":"Chv\u00e1tal, V. (1983a). Linear Programming. W. H. Freeman."},{"key":"11_CR55","unstructured":"Closson, M., Everett, H., Gartshore, S., and Wismath, S. (1998). Arrangepak, orthopak and vispak 2.0. Technical Report TR-CS-98, University of Lethbridge."},{"key":"11_CR56","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"E. G. Coffman","year":"1972","unstructured":"Coffman, E. G., and Graham, R. L. (1972). Optimal scheduling for two processor systems. Acta Informatica, 1:200\u2013213.","journal-title":"Acta Informatica"},{"issue":"3","key":"11_CR57","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1145\/264645.264657","volume":"4","author":"J. D. Cohen","year":"1997","unstructured":"Cohen, J. D. (1997). Drawing graphs to convey proximity: An incremental arrangement method. ACM Transactions on Computer-Human Interaction, 4(3):197\u2013229.","journal-title":"ACM Transactions on Computer-Human Interaction"},{"issue":"5","key":"11_CR58","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1137\/S0097539792235724","volume":"24","author":"R. F. Cohen","year":"1995","unstructured":"Cohen, R. F., Di Battista, G., Tamassia, R., and Tollis, I. G. (1995). Dynamic graph drawings: Trees, series-parallel digraphs, and planar st-digraphs. SIAM Journal on Computing, 24(5):970\u20131001.","journal-title":"SIAM Journal on Computing"},{"key":"11_CR59","doi-asserted-by":"crossref","unstructured":"Cohen, R. F., Di Battista, G., Tamassia, R., Tollis, I. G., and Bertolazzi, P. (1992). A framework for dynamic graph drawing. In Proceedings of the 8th ACM Annual Symposium on Computational Geometry (SCG\u201992), pages 261\u2013270.","DOI":"10.1145\/142675.142728"},{"key":"11_CR60","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1515\/form.1989.1.395","volume":"1","author":"Y. Colin Verdi\u00e8re de","year":"1989","unstructured":"Colin de Verdi\u00e8re, Y. (1989). Empilements de cercles: convergence d\u2019une methode de point fixe. Forum Mathematicum, 1:395\u2013402.","journal-title":"Forum Mathematicum"},{"key":"11_CR61","unstructured":"Cormen, T., Leiserson, C., and Rivest, R. (1990). Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series. The MIT Press and McGraw-Hill Book Company."},{"key":"11_CR62","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0925-7721(92)90021-J","volume":"2","author":"P. Crescenzi","year":"1992","unstructured":"Crescenzi, P., Di Battista, G., and Piperno, A. (1992). A note on optimal area algorithms for upward drawings of binary trees. Computational Geometry: Theory and Applications, 2:187\u2013200.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"11_CR63","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/3-540-58950-3_386","volume-title":"Proceedings of the DIMACS International Workshop on Graph Drawing (GD\u201994)","author":"P. Crescenzi","year":"1995","unstructured":"Crescenzi, P., and Piperno, A. (1995). Optimal-area upward drawings of AVLtrees. In Proceedings of the DIMACS International Workshop on Graph Drawing (GD\u201994). Springer LNCS 894, pages 307\u2013317."},{"key":"11_CR64","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/BFb0021800","volume-title":"Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995)","author":"I. F. Cruz","year":"1996","unstructured":"Cruz, I. F., and Twarog, J. P. (1996). 3D graph drawing with simulated annealing. In Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995), Springer LNCS 1027, pages 162\u2013165."},{"key":"11_CR65","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF01580379","volume":"11","author":"W. H. Cunningham","year":"1976","unstructured":"Cunningham, W. H. (1976). A network simplex method. Mathematical Programming, 11:105\u2013116.","journal-title":"Mathematical Programming"},{"key":"11_CR66","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0097-3165(91)90025-C","volume":"56","author":"J. Czyzowicz","year":"1991","unstructured":"Czyzowicz, J. (1991). Lattice diagrams with few slopes. Journal of Combinatorial Theory, Series A, 56:96\u2013108.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"11_CR67","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0012-365X(90)90201-R","volume":"82","author":"J. Czyzowicz","year":"1990","unstructured":"Czyzowicz, J., Pelc, A., and Rival, I. (1990). Drawing orders with few slopes. Discrete Mathematics, 82:233\u2013250.","journal-title":"Discrete Mathematics"},{"key":"11_CR68","unstructured":"Dai, W. W.-M., and Kuh, E. S. (1987). Global spacing of building-block layout. In Proceedings of the IFIP International Conference on Very Large Scale Integration (VLSI\u201987), pages 193\u2013205."},{"key":"11_CR69","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/3-540-57155-8_254","volume-title":"Proceedings of the 3rd Workshop on Algorithms and Data Structures (WADS\u201993)","author":"A. Datta","year":"1993","unstructured":"Datta, A., Lenhof, H.-P., Schwarz, C., and Smid, M. H. M. (1993). Static and dynamic algorithms for k-point clustering problems. In Proceedings of the 3rd Workshop on Algorithms and Data Structures (WADS\u201993), Springer LNCS 709, pages 265\u2013276."},{"issue":"4","key":"11_CR70","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R. Davidson","year":"1996","unstructured":"Davidson, R., and Harel, D. (1996). Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics, 15(4):301\u2013331.","journal-title":"ACM Transactions on Graphics"},{"key":"11_CR71","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"de Fraysseix, H., Pach, J., and Pollack, R. (1990). How to draw a planar graph on a grid. Combinatorica, 10:41\u201351.","journal-title":"Combinatorica"},{"key":"11_CR72","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"Di Battista, G., Eades, P., Tamassia, R., and Tollis, I. G. (1994). Algorithms for drawing graphs: An annotated bibliography. Computational Geometry, 4:235\u2013282.","journal-title":"Computational Geometry"},{"key":"11_CR73","unstructured":"Di Battista, G., Eades, P., Tamassia, R., and Tollis, I. G. (1999). Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall."},{"issue":"6","key":"11_CR74","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1137\/S0097539794262847","volume":"27","author":"G. Battista Di","year":"1998","unstructured":"Di Battista, G., Liotta, G., and Vargiu, F. (1998a). Spirality and optimal orthogonal drawings. SIAM Journal on Computing, 27(6):1764\u20131811.","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"11_CR75","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0020-0190(90)90045-Y","volume":"36","author":"G. Battista Di","year":"1990","unstructured":"Di Battista, G., Liu, W. P., and Rival, I. (1990). Bipartite graphs, upward drawings, and planarity. Information Processing Letters, 36(6):317\u2013322.","journal-title":"Information Processing Letters"},{"key":"11_CR76","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998)","author":"G. Battista Di","year":"1998","unstructured":"Di Battista, G., Patrignani, M., and Vargiu, F. (1998b). A split & push approach to 3-D orthogonal drawing. In Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998). Springer LNCS 1547, pages 87-101."},{"issue":"2-3","key":"11_CR77","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"Di Battista, G., and Tamassia, R. (1988). Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science, 61(2-3):175\u2013198.","journal-title":"Theoretical Computer Science"},{"key":"11_CR78","doi-asserted-by":"crossref","unstructured":"Di Battista, G., and Tamassia, R. (1989). Incremental planarity testing. In Proceedings of the 30th Symposium on the Foundations of Computer Science (FOCS\u201989), pages 436\u2013441.","DOI":"10.1109\/SFCS.1989.63515"},{"key":"11_CR79","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/BFb0032061","volume-title":"Proceedings of the 17th International Colloqium on Automata, Languages and Programming (ICALP\u201990)","author":"G. Battista Di","year":"1990","unstructured":"Di Battista, G., and Tamassia, R. (1990). On-line graph algorithms with SPQR-trees. In Proceedings of the 17th International Colloqium on Automata, Languages and Programming (ICALP\u201990), Springer LNCS 443, pages 598\u2013611."},{"issue":"5","key":"11_CR80","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., and Tamassia, R. (1996). On-line planarity testing. SIAM Journal on Computing, 25(5):956\u2013997.","journal-title":"SIAM Journal on Computing"},{"key":"11_CR81","unstructured":"Di Battista, G., and Vismara, L. (1993). Angles of planar triangulated graphs. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (STOC\u201993), pages 431\u2013437."},{"issue":"3","key":"11_CR82","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/S0895480194264010","volume":"9","author":"G. Battista Di","year":"1996","unstructured":"Di Battista, G., and Vismara, L. (1996). Angles of planar triangulated graphs. SIAM Journal on Discrete Mathematics, 9(3):349\u2013359.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"11_CR83","series-title":"Lect Notes Comput Sci","first-page":"79","volume-title":"Proceedings of the 9th Annual International Symposium on Algorithms and Computation (ISAAC\u201998)","author":"W. Didimo","year":"1998","unstructured":"Didimo, W., and Liotta, G. (1998). Computing orthogonal drawings in a variable embedding setting. In Proceedings of the 9th Annual International Symposium on Algorithms and Computation (ISAAC\u201998), Springer LNCS 1533, pages 79\u201388."},{"key":"11_CR84","doi-asserted-by":"crossref","unstructured":"Dietz, P. F., and Sleator, D. D. (1987). Two algorithms for maintaining order in a list. In Proceedings of the 19th Annual ACM Symposium of Theory of Computing (STOC\u201987), pages 365\u2013372.","DOI":"10.1145\/28395.28434"},{"key":"11_CR85","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/3-540-60220-8_77","volume-title":"Proceedings of the 4th Workshop on Algorithms and Data Structures (WADS\u201995)","author":"H. N. Djidjev","year":"1995","unstructured":"Djidjev, H. N. (1995). A linear algorithm for the maximal planar subgraph problem. In Proceedings of the 4th Workshop on Algorithms and Data Structures (WADS\u201995). Springer LNCS 955, pages 369\u2013380."},{"key":"11_CR86","unstructured":"Doddi, S., Mararthe, M. V., Mirzaian, A., Moret, B. M. E., and Zhu, B. (1999). Map labeling and its generalizations. Technical Report LA-UR-96-2411, Los Alamos National Labatory."},{"key":"11_CR87","unstructured":"Doddi, S., Marathe, M. V., Mirzaian, A., Moret, B.M. E., and Zhu, B. (1997). Map labeling and its generalizations. In Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms (SODA\u201997), pages 148\u2013157."},{"key":"11_CR88","doi-asserted-by":"crossref","unstructured":"Dresbach, S. (1995). A new heuristic layout algorithm for directed acyclic graphs. In Operations Research Proceedings 1994, pages 121\u2013126.","DOI":"10.1007\/978-3-642-79459-9_23"},{"key":"11_CR89","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-37623-2_9","volume-title":"Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998)","author":"C. A. Duncan","year":"1998","unstructured":"Duncan, C. A., Goodrich, M. T., and Kobourov, S. G. (1998). Balanced aspect ratio trees and their use for drawing very large graphs. In Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998). Springer LNCS 1547, pages 111\u2013124."},{"key":"11_CR90","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":"11_CR91","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/3-540-63938-1_77","volume-title":"Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997)","author":"P. Eades","year":"1997","unstructured":"Eades, P., Cohen, R. F., and Huang, M. L. (1997a). Online animated graph drawing for Web navigation. In Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997), Springer LNCS 1353, pages 330\u2013335."},{"key":"11_CR92","series-title":"Lect Notes Comput Sci","first-page":"101","volume-title":"Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996)","author":"P. Eades","year":"1996","unstructured":"Eades, P., and Feng, Q. W. (1996). Multilevel visualization of clustered graphs. In Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996). Springer LNCS 1190, pages 101\u2013112."},{"key":"11_CR93","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/3-540-63938-1_58","volume-title":"Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997)","author":"P. Eades","year":"1997","unstructured":"Eades, P., and Feng, Q. W. (1997). Drawing clustered graphs on an orthogonal grid. In Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997). Springer LNCS 1353, pages 146\u2013157."},{"key":"11_CR94","series-title":"Lect Notes Comput Sci","first-page":"113","volume-title":"Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996)","author":"P. Eades","year":"1996","unstructured":"Eades, P., Feng, Q.W., and Lin, X. (1996a). Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996). Springer LNCS 1190, pages 113\u2013128."},{"issue":"4","key":"11_CR95","doi-asserted-by":"crossref","first-page":"3","DOI":"10.7155\/jgaa.00016","volume":"3","author":"P. Eades","year":"1999","unstructured":"Eades, P., Feng, Q., and Nagamochi, H. (1999). Drawing clustered graphs on an orthogonal grid. Journal on Graph Algorithms and Applications, 3(4):3\u201329.","journal-title":"Journal on Graph Algorithms and Applications"},{"key":"11_CR96","doi-asserted-by":"crossref","unstructured":"Eades, P., Huang, M. L., and Wang, J. (1997b). Online animated graph drawing using a modified spring algorithm. Technical Report 97-05, Department of Computer Science and Software Engineering, University of Newcastle.","DOI":"10.1007\/3-540-63938-1_77"},{"key":"11_CR97","first-page":"89","volume":"21.A","author":"P. Eades","year":"1986","unstructured":"Eades, P., and Kelly, D. (1986). Heuristics for reducing crossings in 2-layered networks. Ars Combinatorica, 21.A:89\u201398.","journal-title":"Ars Combinatorica"},{"key":"11_CR98","unstructured":"Eades, P., Lai, W., Misue, K., and Sugiyama, K. (1991). Preserving the mental map of a diagram. In Proceedings of Compugraphics\u2019 91, pages 24\u201333."},{"key":"11_CR99","first-page":"15","volume":"12","author":"P. Eades","year":"1995","unstructured":"Eades, P., and Lin, X. (1995). A new heuristic for the feedback arc set problem. Australian Journal of Combinatorics, 12:15\u201326.","journal-title":"Australian Journal of Combinatorics"},{"key":"11_CR100","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., and 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":"11_CR101","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-58950-3_365","volume-title":"Proceedings of the DIMACS International Workshop on Graph Drawing (GD\u201994)","author":"P. Eades","year":"1995","unstructured":"Eades, P., and Marks, J. (1995). Graph drawing contest report. In Proceedings of the DIMACS International Workshop on Graph Drawing (GD\u201994), Springer LNCS 894, pages 143\u2013146."},{"key":"11_CR102","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/BFb0021806","volume-title":"Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995)","author":"P. Eades","year":"1996","unstructured":"Eades, P., and Marks, J. (1996). Graph-drawing contest report. In Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995), Springer LNCS 1027, pages 224\u2013233."},{"key":"11_CR103","series-title":"Lect Notes Comput Sci","first-page":"129","volume-title":"Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996)","author":"P. Eades","year":"1996","unstructured":"Eades, P., Marks, J., and North, S. C. (1996). Graph-drawing contest report. In Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996), Springer LNCS 1190, pages 129\u2013138."},{"key":"11_CR104","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/3-540-63938-1_88","volume-title":"Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997)","author":"P. Eades","year":"1997","unstructured":"Eades, P., Marks, J., and North, S. C. (1997c). Graph-drawing contest report. In Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997), Springer LNCS 1353, pages 438\u2013445."},{"key":"11_CR105","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/3-540-37623-2_34","volume-title":"Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998)","author":"P. Eades","year":"1998","unstructured":"Eades, P., Marks, J., Mutzel, P., and North, S. C. (1998). Graph drawing contest report. In Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998), Springer LNCS 1547, pages 423\u2013435."},{"key":"11_CR106","unstructured":"Eades, P., Nagamochi, H., and Feng, Q. (1998). Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Technical Report 98-03, Department of Computer Science and Software Engineering, University of Newcastle, Australia. Available at ftp:\/\/ftp.cs.newcastle.edu.au\/pub\/techreports\/tr98-03.ps.Z ."},{"issue":"2","key":"11_CR107","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0020-0190(96)00133-0","volume":"60","author":"P. Eades","year":"1996","unstructured":"Eades, P., Stirk, C., and Whitesides, S. (1996). The techniques of Kolmogorov and Bardzin for three-dimensional orthogonal graph drawing. Information Processing Letters, 60(2):97\u2013103. University.","journal-title":"Information Processing Letters"},{"key":"11_CR108","first-page":"424","volume":"13","author":"P. Eades","year":"1990","unstructured":"Eades, P., and Sugiyama, K. (1990). How to draw a directed graph. Journal of Information Processing, 13:424\u2013437.","journal-title":"Journal of Information Processing"},{"key":"11_CR109","series-title":"Lect Notes Comput Sci","first-page":"139","volume-title":"Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996)","author":"P. Eades","year":"1996","unstructured":"Eades, P., Symvonis, A., and Whitesides, S. (1996b). Two algorithms for three dimensional orthogonal graph drawing. In Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996). Springer LNCS 1190, pages 139\u2013154."},{"issue":"1-3","key":"11_CR110","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0166-218X(00)00172-4","volume":"103","author":"P. Eades","year":"2000","unstructured":"Eades, P., Symvonis, A., and Whitesides, S. (2000). Three-dimensional orthogonal graph drawing. Discrete Applied Mathematics, 103(1-3):55\u201387.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"11_CR111","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(94)90179-1","volume":"131","author":"P. Eades","year":"1994","unstructured":"Eades, P., and Whitesides, S. (1994). Drawing graphs in two layers. Theoretical Computer Science, 131(2):361\u2013374.","journal-title":"Theoretical Computer Science"},{"key":"11_CR112","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0166-218X(90)90110-X","volume":"28","author":"P. Eades","year":"1990","unstructured":"Eades, P., and Wormald, N. C. (1990). Fixed edge-length graph drawing is NP-hard. Discrete Applied Mathematics, 28:111\u2013134.","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"11_CR113","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P. Eades","year":"1994","unstructured":"Eades, P., and Wormald, N. C. (1994). Edge crossings in drawings of bipartite graphs. Algorithmica, 11(4):379\u2013403.","journal-title":"Algorithmica"},{"issue":"4","key":"11_CR114","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3138\/U3N2-6363-130N-H870","volume":"33","author":"S. Edmondson","year":"1997","unstructured":"Edmondson, S., Christensen, J., Marks, J., and Shieber, S. (1997). A general cartographic labeling algorithm. Cartographica, 33(4):13\u201323.","journal-title":"Cartographica"},{"key":"11_CR115","unstructured":"Eiglsperger, M., Fo\u00dfmeier, U., and Kaufmann, M. (2000). Orthogonal graph drawing with constraints. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), pages 3\u201311."},{"key":"11_CR116","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02574012","volume":"11","author":"D. Eppstein","year":"1994","unstructured":"Eppstein, D., and Erickson, J. (1994). Iterated nearest neighbors and finding minimal polytopes. Discrete Computational Geometry, 11:321\u2013350.","journal-title":"Discrete Computational Geometry"},{"key":"11_CR117","unstructured":"Even, S. (1979). Graph Algorithms. Pitman."},{"key":"11_CR118","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"Even, S., and Tarjan, R. E. (1976). Computing an st-numbering. Theoretical Computer Science, 2:436\u2013441.","journal-title":"Theoretical Computer Science"},{"key":"11_CR119","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/10692760_23","volume-title":"Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG\u201998)","author":"L. Faria","year":"1998","unstructured":"Faria, L., De Figueiredo, C. M. H., and Mendonca, C. F. X. (1998). Splitting number is NP-complete. Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG\u201998), Springer LNCS 1517, pages 285\u2013297."},{"issue":"1","key":"11_CR120","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218195999000029","volume":"9","author":"S. P. Fekete","year":"1999","unstructured":"Fekete, S. P., and Meijer, H. (1999). Rectangle and box visibility graphs in 3D. International Journal of Computational Geometry and Applications, 9(1):1\u201327.","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"11_CR121","unstructured":"Feng, Q. (1997). Algorithms for Drawing Clustered Graphs. PhD thesis, University of Newcastle. http:\/\/www.cs.newcastle.edu.au\/Dept\/theses.html ."},{"key":"11_CR122","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-60313-1_145","volume-title":"Proceedings of the 3rd European Symposium on Algorithms (ESA\u201995)","author":"Q.-W. Feng","year":"1995","unstructured":"Feng, Q.-W., Cohen, R. F., and Eades, P. (1995). Planarity for clustered graphs. In Proceedings of the 3rd European Symposium on Algorithms (ESA\u201995). Springer LNCS 979, pages 213\u2013226."},{"key":"11_CR123","unstructured":"Fialko, S., and Mutzel, P. (1998). A new approximation algorithm for the planar augmentation problem. In Proceedings of the 9th Annual ACMSIAM Symposium on Discrete Algorithms (SODA\u201998), pages 260\u2013269."},{"issue":"11","key":"11_CR124","doi-asserted-by":"publisher","first-page":"1971","DOI":"10.1109\/PROC.1967.6027","volume":"55","author":"C. J. Fisk","year":"1967","unstructured":"Fisk, C. J., Caskey, D. L., and West, L. E. (1967). ACCEL: Automated circuit card etching layout. Proceedings of the IEEE, 55(11):1971\u20131982.","journal-title":"Proceedings of the IEEE"},{"key":"11_CR125","unstructured":"Foley, J. D., van Dam, A., Feiner, S. K., and Hughes, J. F. (1990). Computer Graphics, 2nd edition. Addison-Wesley."},{"key":"11_CR126","unstructured":"Force, A. C. G. I. T. (1996). Application challenges to computational geometry. Technical Report TR-521-96, Princeton University."},{"key":"11_CR127","doi-asserted-by":"crossref","unstructured":"Formann, M., Hagerup, T., Haralambides, J., Kaufmann, M., Leighton, F. T., Simvonis, A., Welzl, E., and Woeginger, G. (1990). Drawing graphs in the plane with high resolution. In Proceedings of the 31st Symposium on the Foundations of Computer Science (FOCS\u201990), pages 86\u201395.","DOI":"10.1109\/FSCS.1990.89527"},{"key":"11_CR128","doi-asserted-by":"crossref","unstructured":"Formann, M., and Wagner, F. (1991). A packing problem with applications to lettering of maps. In Proceedings of the 7th Annual Symposium on Computational Geometry (SCG\u2019 91), pages 281\u2013288.","DOI":"10.1145\/109648.109680"},{"key":"11_CR129","series-title":"Lect Notes Comput Sci","first-page":"242","volume-title":"Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995)","author":"A. Formella","year":"1995","unstructured":"Formella, A., and Keller, J. (1995). Generalized fisheye views of graphs. In Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995). Springer LNCS 1027, pages 242\u2013253."},{"key":"11_CR130","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-63938-1_55","volume-title":"Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997)","author":"U. Fo\u00dfmeier","year":"1997","unstructured":"Fo\u00dfmeier, U. (1997a). Interactive orthogonal graph drawing: Algorithms and bounds. In Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997). Springer LNCS 1353, pages 111\u2013123."},{"key":"11_CR131","unstructured":"Fo\u00dfmeier, U. (1997b). Orthogonale Visualisierungstechniken fur Graphen. PhD thesis, Eberhard-Karls-Universitat zu Tubingen."},{"key":"11_CR132","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/3-540-37623-2_10","volume-title":"Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998)","author":"U. Fo\u00dfmeier","year":"1998","unstructured":"Fo\u00dfmeier, U., He\u00df, C., and Kaufmann, M. (1998). On improving orthogonal drawings: The 4M-algorithm. In Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998). Springer LNCS 1547, pages 125\u2013137."},{"key":"11_CR133","series-title":"Lect Notes Comput Sci","first-page":"155","volume-title":"Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996)","author":"U. Fo\u00dfmeier","year":"1996","unstructured":"Fo\u00dfmeier, U., Kant, G., and Kaufmann, M. (1996). 2-visibility drawings of planar graphs. In Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996). Springer LNCS 1190, pages 155\u2013168."},{"key":"11_CR134","series-title":"Lect Notes Comput Sci","first-page":"254","volume-title":"Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995)","author":"U. Fo\u00dfmeier","year":"1995","unstructured":"Fo\u00dfmeier, U., and Kaufmann, M. (1995). Drawing high degree graphs with low bend numbers. In Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995). Springer LNCS 1027, pages 254\u2013266."},{"key":"11_CR135","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1287\/opre.33.5.1091","volume":"33","author":"L. R. Foulds","year":"1985","unstructured":"Foulds, L. R., Gibbons, P. B., and Giffin, J. W. (1985). Facilities layout adjacency determination: An experimental comparison of three graph theoretic heuristics Operations Research, 33:1091\u20131106.","journal-title":"Operations Research"},{"key":"11_CR136","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/00207547808929997","volume":"16","author":"L. R. Foulds","year":"1978","unstructured":"Foulds, L. R., and Robinson, D. F. (1978). Graph theoretic heuristics for the plant layout problem. International Journal of Production Research, 16:27\u201337.","journal-title":"International Journal of Production Research"},{"issue":"3","key":"11_CR137","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R. J. Fowler","year":"1981","unstructured":"Fowler, R. J., Paterson, M. S., and Tanimoto, S. L. (1981). Optimal packing and covering in the plane are NP-complete. Information Processing Letters, 12(3):133\u2013137.","journal-title":"Information Processing Letters"},{"key":"11_CR138","unstructured":"Freeman, L. C. (1999a). The social network graphics source. School of Social Science, University of California Irvine. http:\/\/eclectic.ss.uci.edu\/~lin\/gallery.html ."},{"key":"11_CR139","unstructured":"Freeman, L. C. (1999b). Using molecular modeling software in social network analysis: A practicum. School of Social Science, University of California Irvine. http:\/\/eclectic.ss.uci.edu\/~lin\/chem.html ."},{"issue":"1-3","key":"11_CR140","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","volume":"58","author":"E. C. Freuder","year":"1992","unstructured":"Freuder, E. C., and Wallace, R. J. (1992). Partial constraint satisfaction. Artificial Intelligence, 58(1-3):21\u201370.","journal-title":"Artificial Intelligence"},{"key":"11_CR141","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-62495-3_46","volume-title":"Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996)","author":"A. Frick","year":"1997","unstructured":"Frick, A. (1997). Upper bounds on the number of hidden nodes in Sugiyama\u2019s algorithm. In Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996). Springer LNCS 1190, pages 169\u2013183."},{"key":"11_CR142","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/3-540-58950-3_393","volume-title":"Proceedings of the DIMACS International Workshop on Graph Drawing (GD\u201994)","author":"A. Frick","year":"1995","unstructured":"Frick, A., Ludwig, A., and Mehldau, H. (1995). A fast adaptive layout algorithm for undirected graphs. In Proceedings of the DIMACS International Workshop on Graph Drawing (GD\u201994). Springer LNCS 894, pages 388\u2013403."},{"issue":"11","key":"11_CR143","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T. M. J. Fruchterman","year":"1991","unstructured":"Fruchterman, T. M. J., and Reingold, E. M. (1991). Graph-drawing by forcedirected placement. Software-Practice and Experience, 21(11):1129\u20131164.","journal-title":"Software-Practice and Experience"},{"issue":"3","key":"11_CR144","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"E. R. Gansner","year":"1993","unstructured":"Gansner, E. R., Koutsofios, E., North, S. C., and Vo, K.-P. (1993). A technique for drawing directed graphs. IEEE Transactions on Software Engineering, 19(3):214\u2013230.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"11_CR145","doi-asserted-by":"crossref","unstructured":"Ganter, B., and Wille, R. (1999). Formal Concept Analysis-Mathematical Foundations. Springer.","DOI":"10.1007\/978-3-642-59830-2"},{"issue":"3","key":"11_CR146","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M. R. Garey","year":"1983","unstructured":"Garey, M. R., and Johnson, D. S. (1983). Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods, 4(3):312\u2013316.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"11_CR147","unstructured":"Garey, M. R., and Johnson, D. S. (1991). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co."},{"key":"11_CR148","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1142\/S0218195996000228","volume":"6","author":"A. Garg","year":"1996","unstructured":"Garg, A., Goodrich, M. T., and Tamassia, R. (1996). Planar upward tree drawings with optimal area. International Journal Computational Geometry and Applications, 6:333\u2013356.","journal-title":"International Journal Computational Geometry and Applications"},{"key":"11_CR149","unstructured":"Garg, A., and Tamassia, R. (1993). Efficient computation of planar straightline upward drawings. In Graph Drawing\u2019 93 (Proc. ALCOM Workshop on Graph Drawing)."},{"key":"11_CR150","series-title":"Lect Notes Comput Sci","first-page":"12","volume-title":"Proceedings of the 2nd European Symposium on Algorithms (ESA\u201994)","author":"A. Garg","year":"1994","unstructured":"Garg, A., and Tamassia, R. (1994). Planar drawings and angular resolution: Algorithms and bounds. In Proceedings of the 2nd European Symposium on Algorithms (ESA\u201994). Springer LNCS 855, pages 12\u201323."},{"key":"11_CR151","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/3-540-58950-3_384","volume-title":"Proceedings of the DIMACS International Workshop on Graph Drawing (GD\u201994)","author":"A. Garg","year":"1995","unstructured":"Garg, A., and Tamassia, R. (1995a). On the computational complexity of upward and rectilinear planarity testing. In Proceedings of the DIMACS International Workshop on Graph Drawing (GD\u201994). Springer LNCS 894, pages 286\u2013297."},{"key":"11_CR152","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01108622","volume":"12","author":"A. Garg","year":"1995","unstructured":"Garg, A., and Tamassia, R. (1995b). Upward planarity testing. Order, 12:109\u2013133.","journal-title":"Order"},{"key":"11_CR153","series-title":"Lect Notes Comput Sci","first-page":"193","volume-title":"Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996)","author":"A. Garg","year":"1996","unstructured":"Garg, A., and Tamassia, R. (1996a). GIOTTO3D: A system for visualizing hierarchical structures in 3D. In Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996). Springer LNCS 1190, pages 193\u2013200."},{"key":"11_CR154","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996)","author":"A. Garg","year":"1996","unstructured":"Garg, A., and Tamassia, R. (1996b). A new minimum cost flow algorithm with applications to graph drawing. In Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996). Springer LNCS 1190, pages 201-216."},{"key":"11_CR155","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996)","author":"A. Garg","year":"1997","unstructured":"Garg, A., and Tamassia, R. (1997). A new minimum cost flow algorithm with applications to graph drawing. In Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996). Springer LNCS 1190, pages 201-216."},{"issue":"2","key":"11_CR156","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01277643","volume":"3","author":"D. Georgakopoulos","year":"1995","unstructured":"Georgakopoulos, D., Hornick, M., and Sheth, A. (1995). An overview of workflow management: From process modeling to workflow automation infrastructure. Distributed and Parallel Databases, 3(2):119\u2013153.","journal-title":"Distributed and Parallel Databases"},{"key":"11_CR157","unstructured":"German Research Center for Artificial Intelligence GmbH (1999). The Verbmobil project. http:\/\/www.dfki.de\/verbmobil ."},{"key":"11_CR158","doi-asserted-by":"crossref","unstructured":"Godehardt, E. (1988). Graphs as Structural Models, Advances in System Analysis 4. Vieweg.","DOI":"10.1007\/978-3-322-96310-9"},{"key":"11_CR159","first-page":"153","volume":"71","author":"A. V. Goldberg","year":"1995","unstructured":"Goldberg, A. V., and Kennedy, R. (1995). An efficient cost scaling algorithm for the assignment problem. Mathematical Programming, 71:153\u2013178.","journal-title":"Mathematical Programming"},{"key":"11_CR160","unstructured":"Goldstein, A. J. (1963). An efficient and constructive algorithm for testing whether a graph can be embedded in a plane. In Graph and Combinatorics Conference, Contract No. NONR 1858-(21). Princeton University."},{"issue":"1","key":"11_CR161","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BF01582009","volume":"33","author":"M. Grotschel","year":"1985","unstructured":"Grotschel, M., Junger, M., and Reinelt, G. (1985). On the acyclic subgraph polytope. Mathematical Programming, 33(1):28\u201342.","journal-title":"Mathematical Programming"},{"key":"11_CR162","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/3-540-37623-2_13","volume-title":"Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998)","author":"C. Gutwenger","year":"1998","unstructured":"Gutwenger, C., and Mutzel, P. (1998). Planar polyline drawings with good angular resolution. In Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998). Springer LNCS 1547, pages 167\u2013182."},{"key":"11_CR163","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/3-540-37623-2_14","volume-title":"Proceedings of the 6th International Symposium on Graph Drawing","author":"K. Hayashi","year":"1998","unstructured":"Hayashi, K., Inoue, M., Masuzawa, T., and Fujiwara, H. (1998). A layout adjustment problem for disjoint rectangles preserving orthogonal order. In Proceedings of the 6th International Symposium on Graph Drawing, number 1547 in LNCS, pages 183\u2013197."},{"issue":"4","key":"11_CR164","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1009771921595","volume":"3","author":"W. He","year":"1998","unstructured":"He, W., and Marriott, K. (1998). Constrained graph layout. Constraints, 3(4):289\u2013314.","journal-title":"Constraints"},{"key":"11_CR165","unstructured":"Herdeg, W., editor (1981). Diagrams. Graphis Press Corporation."},{"key":"11_CR166","unstructured":"Hermansson, K., and Ojamae, L. (1994). MOVIEMOL-An easy-to-use molecular display and animation program. Technical Report UUIC-B19-500, Institute of Chemistry, University of Uppsala."},{"key":"11_CR167","volume-title":"Approximation Algorithms for NP-hard Problems","author":"D. S. Hochbaum","year":"1995","unstructured":"Hochbaum, D. S. (1995). Approximation Algorithms for NP-hard Problems. PWS Publishing Company, Boston."},{"issue":"1","key":"11_CR168","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D. S. Hochbaum","year":"1985","unstructured":"Hochbaum, D. S., and Maass, W. (1985). Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM, 32(1):130\u2013136.","journal-title":"Journal of the ACM"},{"key":"11_CR169","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/3-540-37623-2_15","volume-title":"Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998)","author":"S.-H. Hong","year":"1998","unstructured":"Hong, S.-H., Eades, P., Quigley, A., and Lee, S.-H. (1998). Drawing algorithms for series-parallel digraphs in two and three dimensions. In Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998). Springer LNCS 1547, pages 198\u2013209."},{"key":"11_CR170","unstructured":"Hong, S.-H., Eades, P., Quigley, A., and Lee, S.-H. (1999a). Drawing seriesparallel digraphs symmetrically. To appear in International Journal of Computational Geometry and Applications."},{"key":"11_CR171","doi-asserted-by":"crossref","unstructured":"Hong, S.-H., Eades, P., Quigley, A., and Lee, S.-H. (1999b). A three dimensional drawing algorithm for series-parallel graphs. Manuscript.","DOI":"10.1007\/3-540-37623-2_15"},{"key":"11_CR172","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J., and Tarjan, R. E. (1974). Efficient planarity testing. Journal of the ACM, 21:549\u2013568.","journal-title":"Journal of the ACM"},{"issue":"3","key":"11_CR173","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"Hopcroft, J. E., and Tarjan, R. E. (1973). Dividing a graph into triconnected components. SIAM Journal on Computing, 2(3):135\u2013158.","journal-title":"SIAM Journal on Computing"},{"key":"11_CR174","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/BFb0015441","volume-title":"Proceedings of the 6th International Symposium on Algorithms and Computation (ISAAC\u201995)","author":"W.-L. Hsu","year":"1995","unstructured":"Hsu, W.-L. (1995). A linear time algorithm for finding maximal planar subgraphs. In Proceedings of the 6th International Symposium on Algorithms and Computation (ISAAC\u201995). Springer LNCS 1004, pages 352\u2013361."},{"key":"11_CR175","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/3-540-37623-2_29","volume-title":"Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998)","author":"M. L. Huang","year":"1998","unstructured":"Huang, M. L., and Eades, P. (1998a). A fully animated interactive system for clustering and navigating huge graphs. In Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998), Springer LNCS 1547, pages 374\u2013383."},{"key":"11_CR176","unstructured":"Hughes, J. G. (1993). Object-Oriented Databases. International Series in Computer Science. Prentice-Hall."},{"issue":"1","key":"11_CR177","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0263-7855(96)00018-5","volume":"14","author":"W. Humphrey","year":"1996","unstructured":"Humphrey, W., Dalke, A., and Schulten, K. (1996). VMD-Visual molecular dynamics. Journal of Molecular Graphics, 14(1):33\u201338.","journal-title":"Journal of Molecular Graphics"},{"key":"11_CR178","unstructured":"Hutton, M. D., and Lubiw, A. (1991). Upward planar drawing of single source acyclic digraphs. In Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms (SODA\u201991), pages 203\u2013211."},{"key":"11_CR179","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/0196-6774(83)90012-3","volume":"4","author":"H. Imai","year":"1983","unstructured":"Imai, H., and Asano, T. (1983). Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. Journal of Algorithms, 4:310\u2013323.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"11_CR180","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1137\/0215033","volume":"15","author":"H. Imai","year":"1986","unstructured":"Imai, H., and Asano, T. (1986). Efficient algorithms for geometric graph search problems. SIAM Journal on Computing, 15(2):478\u2013494.","journal-title":"SIAM Journal on Computing"},{"key":"11_CR181","first-page":"93","volume":"2","author":"E. Imhof","year":"1962","unstructured":"Imhof, E. (1962). Die Anordnung der Namen in der Karte. International Yearbook of Cartography, 2:93\u2013129.","journal-title":"International Yearbook of Cartography"},{"issue":"2","key":"11_CR182","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1559\/152304075784313304","volume":"2","author":"E. Imhof","year":"1975","unstructured":"Imhof, E. (1975). Positioning names on maps. The American Cartographer, 2(2):128\u2013144.","journal-title":"The American Cartographer"},{"key":"11_CR183","unstructured":"Indermark, K., Thomas, W., Huch, F., Leucker, M., and Noll, T. (1999). Various texts about the TRUTH system for modelling concurrent systems, Lehrstuhl fur Informatik II, RWTH Aachen. < http:\/\/www-i2.informatik.rwth-aachen.de\/Forschung\/MCS\/ >."},{"issue":"3","key":"11_CR184","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MS.1987.230394","volume":"4","author":"S. Isoda","year":"1987","unstructured":"Isoda, S., Shimomura, T., and Ono, Y. (1987). VIPS: A visual debugger. IEEE Software, 4(3):8\u201319.","journal-title":"IEEE Software"},{"key":"11_CR185","unstructured":"Iturriaga, C., and Lubiw, A. (1997). NP-hardness of some map labeling problems. Technical Report CS-97-18, University of Waterloo."},{"key":"11_CR186","unstructured":"Jain, A. K., and Dubes, R. C. (1988). Algorithms for Clustering Data. Prentice Hall."},{"key":"11_CR187","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0196-6774(82)90011-6","volume":"3","author":"D. S. Johnson","year":"1982","unstructured":"Johnson, D. S. (1982). The NP-completeness column: An ongoing guide. Journal of Algorithms, 3:89\u201399.","journal-title":"Journal of Algorithms"},{"key":"11_CR188","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/3-540-63938-1_46","volume-title":"Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997)","author":"M. Junger","year":"1997","unstructured":"Junger, M., Lee, E. K., Mutzel, P., and Odenthal, T. (1997). A polyhedral approach to the multi-layer crossing minimization problem. In Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997). Springer LNCS 1353, pages 13\u201324."},{"key":"11_CR189","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02086607","volume":"16","author":"M. Junger","year":"1996","unstructured":"Junger, M., and Mutzel, P. (1996). Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica, 16:33\u201359.","journal-title":"Algorithmica"},{"issue":"1","key":"11_CR190","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M. Junger","year":"1997","unstructured":"Junger, M., and Mutzel, P. (1997). 2-Layer straightline crossing minimization: Performance of exact and heuristic algorithms. Journal on Graph Algorithms and Applications, 1(1):1\u201325.","journal-title":"Journal on Graph Algorithms and Applications"},{"key":"11_CR191","series-title":"Lect Notes Comput Sci","first-page":"241","volume-title":"Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996)","author":"K. G. Kakoulis","year":"1996","unstructured":"Kakoulis, K. G., and Tollis, I. G. (1996). On the edge label placement problem. In Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996). Springer LNCS 1190, pages 241\u2013256."},{"key":"11_CR192","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-63938-1_60","volume-title":"Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997)","author":"K. G. Kakoulis","year":"1997","unstructured":"Kakoulis, K. G., and Tollis, I. G. (1997). An algorithm for labeling edges of hierarchical drawings. In Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997). Springer LNCS 1353, pages 169\u2013180."},{"key":"11_CR193","unstructured":"Kakoulis, K. G., and Tollis, I. G. (1998a). On the multiple label placement problem. In Proceedings of the 10th Canadian Conference on Computational Geometry (CCCG\u201998), pages 66\u201367."},{"key":"11_CR194","doi-asserted-by":"crossref","unstructured":"Kakoulis, K. G., and Tollis, I. G. (1998b). A unified approach to labeling graphical features. In Proceedings of the 14th Annual ACM Symposium on Computional Geometry (SCG\u201998), pages 347\u2013356.","DOI":"10.1145\/276884.276923"},{"key":"11_CR195","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0734-189X(88)90116-8","volume":"41","author":"T. Kamada","year":"1988","unstructured":"Kamada, T., and Kawai, S. (1988). A simple method for computing general positions in displaying three-dimensional objects. Computer Vision, Graphics and Image Processing, 41:43\u201356.","journal-title":"Computer Vision, Graphics and Image Processing"},{"key":"11_CR196","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":"11_CR197","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G. Kant","year":"1996","unstructured":"Kant, G. (1996). Drawing planar graphs using the canonical ordering. Algorithmica, 16:4\u201332.","journal-title":"Algorithmica"},{"key":"11_CR198","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/BFb0028270","volume-title":"Proceedings of the 2nd Workshop on Algorithms and Data Structures (WADS\u201991)","author":"G. Kant","year":"1991","unstructured":"Kant, G., and Bodlaender, H. L. (1991). Planar graph augmentation problems. In Proceedings of the 2nd Workshop on Algorithms and Data Structures (WADS\u201991), Springer LNCS 519, pages 286\u2013298."},{"key":"11_CR199","doi-asserted-by":"crossref","unstructured":"Karp, R. (1972). Reducibility among combinatorical problems. In Complexity of Computer Computations, pages 85\u2013103. Plenum Press.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"11_CR200","unstructured":"Kato, T., and Imai, H. (1988). The NP-completeness of the character placement problem of 2 or 3 degrees of freedom. In Record of Joint Conference of Electrical and Electronic Engineers in Kyushu, page 1138."},{"key":"11_CR201","doi-asserted-by":"crossref","unstructured":"Keahey, T. A., and Robertson, E. (1996). Techniques for non-linear maginifaction transformations. In Proceedings of the IEEE Symposium on Information Visualization (InfoVis\u201996), pages 38\u201345.","DOI":"10.1109\/INFVIS.1996.559214"},{"issue":"1","key":"11_CR202","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/TCAD.1984.1270052","volume":"CAD-3","author":"G. Kedem","year":"1984","unstructured":"Kedem, G., and Watanabe, H. (1984). Graph optimization techniques for IC-layout and compaction. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, CAD-3(1):12\u201320.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"11_CR203","doi-asserted-by":"crossref","first-page":"636","DOI":"10.4153\/CJM-1975-074-0","volume":"27","author":"D. Kelly","year":"1975","unstructured":"Kelly, D., and Rival, I. (1975). Planar lattices. Canadian Journal of Mathematics, 27:636\u2013665.","journal-title":"Canadian Journal of Mathematics"},{"key":"11_CR204","unstructured":"Kenis, P. (1999). Analysing social network data by means of visualisation techniques. Paper presented at the 19th International Conference on Social Network Analysis (Sunbelt XIX), Charleston."},{"issue":"2","key":"11_CR205","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. W. Kernighan","year":"1970","unstructured":"Kernighan, B. W., and Lin, S. (1970). An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291\u2013307.","journal-title":"The Bell System Technical Journal"},{"key":"11_CR206","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1002\/andp.18471481202","volume":"72","author":"G. R. Kirchhoff","year":"1847","unstructured":"Kirchhoff, G. R. (1847). Uber die Auflosung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Strome gefuhrt wird. Annalen der Physik und Chemie, 72:497\u2013508.","journal-title":"Annalen der Physik und Chemie"},{"key":"11_CR207","series-title":"Technical Report","volume-title":"Quasi-orthogonal drawing of planar graphs","author":"G. W. Klau","year":"1998","unstructured":"Klau, G. W., and Mutzel, P. (1998). Quasi-orthogonal drawing of planar graphs. Technical Report 98-1-013, Max-Planck-Institut fur Informatik, Saarbrucken."},{"key":"11_CR208","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/3-540-46648-7_3","volume-title":"Proceedings of the 7th International Symposium on Graph Drawing (GD\u201999)","author":"G. W. Klau","year":"1999","unstructured":"Klau, G. W., and Mutzel, P. (1999a). Combining graph labeling and compaction. In Proceedings of the 7th International Symposium on Graph Drawing (GD\u201999). Springer LNCS 1731, pages 27\u201337."},{"key":"11_CR209","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/3-540-48777-8_23","volume-title":"Integer Programming and Combinatorial Optimization (IPCO\u201999)","author":"G. W. Klau","year":"1999","unstructured":"Klau, G. W., and Mutzel, P. (1999b). Optimal compaction of orthogonal grid drawings. In Integer Programming and Combinatorial Optimization (IPCO\u201999). Springer LNCS 1610, pages 304\u2013319."},{"key":"11_CR210","unstructured":"Knipping, L. (1998). Beschriftung von Linienzugen. Diplomarbeit, Fachbereich Mathematik und Informatik, Freie Universitat Berlin."},{"issue":"3","key":"11_CR211","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1137\/0405033","volume":"5","author":"D. E. Knuth","year":"1992","unstructured":"Knuth, D. E., and Raghunathan, A. (1992). The problem of compatible representatives. SIAM Journal on Discrete Mathematics, 5(3):422\u2013427.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"11_CR212","first-page":"141","volume":"88","author":"P. Koebe","year":"1936","unstructured":"Koebe, P. (1936). Kontaktprobleme auf der konformen Abbildung. Berichte uber die Verhandlungen der Sachsischen Akademie der Wissenschaften zu Leipzig, Mathematisch-Physikalische Klasse, 88:141\u2013164.","journal-title":"Berichte uber die Verhandlungen der Sachsischen Akademie der Wissenschaften zu Leipzig, Mathematisch-Physikalische Klasse"},{"key":"11_CR213","unstructured":"Kolmogorov, A. N., and Bardzin, Y. M. (1967). About realization of sets in 3-dimensional space. Problems in Cybernetics, pages 261\u2013268."},{"issue":"3","key":"11_CR214","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1109\/21.278993","volume":"24","author":"C. Kosak","year":"1994","unstructured":"Kosak, C., Marks, J., and Shieber, S. (1994). Automating the layout of network diagrams with specified visual organization. IEEE Transactions on Systems, Man and Cybernetics, 24(3):440\u2013454.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"issue":"2","key":"11_CR215","first-page":"53","volume":"17","author":"D. Krackhardt","year":"1994","unstructured":"Krackhardt, D., Blythe, J., and McGrath, C. (1994). KrackPlot 3.0: An improved network drawing program. Connections, 17(2):53\u201355.","journal-title":"Connections"},{"key":"11_CR216","doi-asserted-by":"crossref","unstructured":"Kruskal, J. B., and Wish, M. (1978). Multidimensional Scaling. Sage University Paper Series on Quantitative Applications in the Social Sciences 07\u2013011.","DOI":"10.4135\/9781412985130"},{"key":"11_CR217","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/3-540-56503-5_32","volume-title":"Proceedings of the 10th Symposium on the Theoretical Aspects of Computer Science (STACS\u201993)","author":"L. Kucera","year":"1993","unstructured":"Kucera, L., Mehlhorn, K., Preis, B., and Schwarzenecker, E. (1993). Exact algorithms for a geometric packing problem. Proceedings of the 10th Symposium on the Theoretical Aspects of Computer Science (STACS\u201993). Springer LNCS 665, pages 317\u2013322."},{"key":"11_CR218","unstructured":"Kumar, A., and Fowler, R. H. (1994). A spring modelling algorithm to position nodes of an undirected graph in three dimensions. Technical report, Department of Computer Science, University of Texas."},{"issue":"1","key":"11_CR219","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M. Laguna","year":"1999","unstructured":"Laguna, M., and Mart\u00ed, R. (1999). Grasp and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing, 11(1):44\u201352.","journal-title":"INFORMS Journal on Computing"},{"issue":"12","key":"11_CR220","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1016\/S0305-0548(96)00083-4","volume":"24","author":"M. Laguna","year":"1997","unstructured":"Laguna, M., Mart\u00ed, R., and Valls, V. (1997). Arc crossing minimization in hierarchical digraphs with tabu search. Computers and Operations Research, 24(12):1175\u20131186.","journal-title":"Computers and Operations Research"},{"key":"11_CR221","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1137\/0206037","volume":"6","author":"S. Lam","year":"1977","unstructured":"Lam, S., and Sethi, R. (1977). Worst case analysis of two scheduling problems. SIAM Journal on Computing, 6:518\u2013536.","journal-title":"SIAM Journal on Computing"},{"key":"11_CR222","doi-asserted-by":"crossref","unstructured":"LaPaugh, A. S. (1998). VLSI Layout Algorithms. In Algorithms and Theory of Computation Handbook. CRC Press.","DOI":"10.1201\/9781420049503-c24"},{"key":"11_CR223","unstructured":"Leiserson, C. E. (1980). Area-efficient graph layouts (for VLSI). In Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201980), pages 270\u2013281."},{"issue":"4","key":"11_CR224","first-page":"339","volume":"CT-13","author":"A. Lempel","year":"1966","unstructured":"Lempel, A., and Cederbaum, I. (1966). Minimum feedback arc and vertex sets of a directed graph. IEEE Transactions on Circuit Theory, CT-13(4):339\u2013403.","journal-title":"IEEE Transactions on Circuit Theory"},{"key":"11_CR225","unstructured":"Lempel, A., Even, S., and Cederbaum, I. (1967). An algorithm for planarity testing of graphs. In Theory of Graphs: International Symposium (Rome 1966), pages 215\u2013232. Gordon and Breach."},{"key":"11_CR226","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1145\/65950.65952","volume":"36","author":"T. Lengauer","year":"1989","unstructured":"Lengauer, T. (1989). Hierarchical planarity testing algorithms. Journal of the ACM, 36:474\u2013509.","journal-title":"Journal of the ACM"},{"key":"11_CR227","doi-asserted-by":"crossref","unstructured":"Lengauer, T. (1990). Combinatorial Algorithms for Integrated Circuit Layout. Applicable Theory in Computer Science. B. G. Teubner and John Wiley & Sons.","DOI":"10.1007\/978-3-322-92106-2"},{"issue":"4","key":"11_CR228","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1287\/mnsc.38.4.594","volume":"38","author":"J. Leung","year":"1992","unstructured":"Leung, J. (1992). A new graph-theoretic heuristic for facility layout. Management Science, 38(4):594\u2013605.","journal-title":"Management Science"},{"issue":"2","key":"11_CR229","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"J. M. Lewis","year":"1980","unstructured":"Lewis, J. M., and Yannakakis, M. (1980). The node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences, 20(2):219\u2013230.","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR230","unstructured":"Liebers, A. (1996). Methods for planarizing graphs-A survey and annotated bibliography. Technical Report Konstanzer Schriften in Mathematik und Informatik Nr. 12, Fakultat fur Mathematik und Informatik, Universitat Konstanz. ISSN 1430-3558. To appear in Journal on Graph Algorithms and Applications."},{"key":"11_CR231","unstructured":"Lin, X. (1992). Analysis of Algorithms for Drawing Graphs. PhD thesis, University of Queensland."},{"key":"11_CR232","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0377-2217(95)00356-8","volume":"90","author":"P. Lino","year":"1996","unstructured":"Lino, P., Mart\u00ed, R., and Valls, V. (1996). A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs. Journal of Operational Research, 90:303\u2013319.","journal-title":"Journal of Operational Research"},{"key":"11_CR233","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"R. J. Lipton","year":"1979","unstructured":"Lipton, R. J., Rose, D. J., and Tarjan, R. E. (1979). Generalized nested dissection. SIAM Journal on Numerical Analysis, 16:346\u2013358.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"11_CR234","unstructured":"Lipton, R. J., and Tarjan, R. E. (1970). A seperator theorem for planar graphs. In Proceedings of the Conference on Theoretical Computer Science, pages 1\u201310."},{"key":"11_CR235","unstructured":"Liu, P. C., and Geldmacher, R. C. (1977). On the deletion of nonplanar edges of a graph. In Proceedings of the 10th Southeastern Conference on Combinatorics, Graph Theory, and Computing, pages 727\u2013738."},{"key":"11_CR236","unstructured":"Lyons, K. A. (1992). Cluster busting in anchored graph drawing. In Proceedings of the\u2019 92 CAS Conference (CASCON\u201992), pages 7\u201317."},{"issue":"1","key":"11_CR237","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00004","volume":"2","author":"K. A. Lyons","year":"1998","unstructured":"Lyons, K. A., Meijer, H., and Rappaport, D. (1998). Algorithms for cluster busting in anchored graph drawing. Journal on Graph Algorithms and Applications, 2(1):1\u201324.","journal-title":"Journal on Graph Algorithms and Applications"},{"issue":"1","key":"11_CR238","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","volume":"25","author":"A. K. Mackworth","year":"1985","unstructured":"Mackworth, A. K., and Freuder, E. C. (1985). The complexity of some polynomial network consistency algorithms for constraint satisfaction problem. Artificial Intelligence, 25(1):65\u201374.","journal-title":"Artificial Intelligence"},{"key":"11_CR239","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/00207169008803921","volume":"36","author":"E. Makinen","year":"1990","unstructured":"Makinen, E. (1990). Experiments on drawing 2-level hierarchical graphs. International Journal of Computer and Mathematics, 36:175\u2013181.","journal-title":"International Journal of Computer and Mathematics"},{"key":"11_CR240","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/00207169408804322","volume":"53","author":"E. Makinen","year":"1994","unstructured":"Makinen, E., and Sieranta, M. (1994). Genetic algorithms for drawing bipartite graphs. Internatonal Journal of Computer Mathematics, 53:157\u2013166.","journal-title":"Internatonal Journal of Computer Mathematics"},{"key":"11_CR241","doi-asserted-by":"crossref","unstructured":"Malitz, S., and Papakostas, A. (1992). On the angular resolution of planar graphs. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (STOC\u201992), pages 527\u2013538.","DOI":"10.1145\/129712.129764"},{"issue":"2","key":"11_CR242","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/S0895480193242931","volume":"7","author":"S. Malitz","year":"1994","unstructured":"Malitz, S., and Papakostas, A. (1994). On the angular resolution of planar graphs. SIAM Journal on Discrete Mathematics, 7(2):172\u2013183.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"11_CR243","unstructured":"Manning, J. (1990). Geometric Symmetry in Graphs. PhD thesis, Purdue University."},{"key":"11_CR244","unstructured":"Marks, J., and Shieber, S. (1991). The computational complexity of cartographic label placement. Technical Report TR-05-91, Harvard University Computer Science."},{"key":"11_CR245","unstructured":"Masuda, S., Kimura, S., Kashiwabara, T., and Fujisawa, T. (1983). On the Manhattan wiring problem. Technical Report CAS 83-20, Institute of Electronics and Communication Engineers of Japan."},{"key":"11_CR246","doi-asserted-by":"crossref","unstructured":"Masui, T. (1992). Graphic object layout with interactive genetic algorithms. In Proceedings of the 1992 IEEE Workshop on Visual Languages (VL\u201992), pages 74\u201387.","DOI":"10.1109\/WVL.1992.275781"},{"key":"11_CR247","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/3-540-46648-7_22","volume-title":"Proceedings of the 7th Symposium on Graph Drawing (GD\u201999)","author":"C. Matuszewski","year":"1999","unstructured":"Matuszewski, C., Schonfeld, R., and Molitor, P. (1999). Using sifting for klayer straightline crossing minimization. Proceedings of the 7th Symposium on Graph Drawing (GD\u201999). Springer LNCS 1731, pages 217\u2013224."},{"issue":"2","key":"11_CR248","first-page":"22","volume":"19","author":"C. McGrath","year":"1996","unstructured":"McGrath, C., Blythe, J., and Krackhardt, D. (1996). Seeing groups in graph layouts. Connections, 19(2):22\u201329.","journal-title":"Connections"},{"key":"11_CR249","unstructured":"McGrath, C., and Borgatti, S. P. (1999). The International Network for Social Network Analysis Homepage. http:\/\/www.heinz.cmu.edu\/project\/INSNA\/ ."},{"key":"11_CR250","unstructured":"Mehlhorn, K. (1984). Data Structures and Algorithms. Volume 2: Graph Algorithms and NP-Completeness. EATCS Monographs on Theoretical Computer Science. Springer."},{"key":"11_CR251","unstructured":"Mehlhorn, K., and Naher, S. (1999). The Leda Platform of Combinatorial and Geometric Computing. Cambridge University Press. Project home page at < http:\/\/www.mpi-sb.mpg.de\/LEDA\/ >."},{"issue":"1","key":"11_CR252","first-page":"1","volume":"SMC-21","author":"E. B. Messinger","year":"1991","unstructured":"Messinger, E. B., Rowe, L. A., and Henry, R. H. (1991). A divide-andconquer algorithm for the automatic layout of large directed graphs. IEEE Transactions on Systems, Man, and Cybernetics, SMC-21(1):1\u201312.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"11_CR253","doi-asserted-by":"crossref","unstructured":"Miriyala, K., Hornik, S. W., and Tamassia, R. (1993). An incremental approach to aesthetic graph layout. In Proceedings of the 6th International Workshop on Computer-Aided Software Engineering (CASE\u201993), pages 297\u2013308.","DOI":"10.1109\/CASE.1993.634832"},{"key":"11_CR254","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K. Misue","year":"1995","unstructured":"Misue, K., Eades, P., Lai, W., and Sugiyama, K. (1995). Layout adjustment and the mental map. Journal of Visual Languages and Computing, 6:183\u2013210.","journal-title":"Journal of Visual Languages and Computing"},{"key":"11_CR255","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/52.56447","volume":"7","author":"S. Moen","year":"1990","unstructured":"Moen, S. (1990). Drawing dynamic trees. IEEE Software, 7:21\u201328.","journal-title":"IEEE Software"},{"key":"11_CR256","series-title":"Lect Notes Comput Sci","first-page":"396","volume-title":"Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995)","author":"B. Monien","year":"1995","unstructured":"Monien, B., Ramme, F., and Salmen, H. (1995). A parallel simulated annealing algorithm for generating 3D layouts of undirected graphs. In Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995). Springer LNCS 1027, pages 396\u2013408."},{"key":"11_CR257","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/BFb0021823","volume-title":"Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995)","author":"B. Monien","year":"1996","unstructured":"Monien, B., Ramme, F., and Salmen, H. (1996). A parallel simulated annealing algorithm for generating 3d layouts of undirected graphs. In Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995). Springer LNCS 1027, pages 396\u2013408."},{"key":"11_CR258","unstructured":"]MTA (1999). MTA New York City subway map. http:\/\/www.mta.nyc.ny.us\/nyct\/images\/sub1a.gif and < http:\/\/www.mta.nyc.ny.us\/nyct\/images\/sub2a.gif >."},{"key":"11_CR259","doi-asserted-by":"crossref","unstructured":"Mukherjea, S., Foley, J., and Hudson, S. (1994). Interactive clustering for navigating in hypermedia systems. In Proceedings of the ACM European Conference on Hypermedia Tehcnologie.","DOI":"10.1145\/192757.192787"},{"key":"11_CR260","unstructured":"Mutzel, P. (1994). The Maximum Planar Subgraph Problem. PhD thesis, Universitat zu Koln."},{"key":"11_CR261","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1007\/3-540-60313-1_166","volume-title":"Proceedings of the 3rd European Symposium on Algorithms (ESA\u201995)","author":"P. Mutzel","year":"1995","unstructured":"Mutzel, P. (1995). A polyhedral approach to planar augmentation and related problems. In Proceedings of the 3rd European Symposium on Algorithms (ESA\u201995). Springer LNCS 979, pages 494\u2013507."},{"key":"11_CR262","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-62495-3_57","volume-title":"Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996)","author":"P. Mutzel","year":"1997","unstructured":"Mutzel, P. (1997). An alternative method to crossing minimization on hierarchical graphs. In Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996). Springer LNCS 1190, pages 318\u2013333."},{"key":"11_CR263","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997)","author":"S. Nakano","year":"1997","unstructured":"Nakano, S., Rahman, M. S., and Nishizeki, T. (1997). A linear-time algorithm for four-partitioning four-connected planar graphs. In Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997). Springer LNCS 1353, pages 334-344."},{"key":"11_CR264","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1057\/palgrave.jors.0430507","volume":"43","author":"G. L. Nemhauser","year":"1992","unstructured":"Nemhauser, G. L., and Sigismondi, G. (1992). A strong cutting plane\/branchand-bound algorithm for node packing. Journal of the Operational Research Society, 43:443\u2013457.","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"11_CR265","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1145\/77481.77483","volume":"33","author":"J. Nielsen","year":"1990","unstructured":"Nielsen, J. (1990). The art of navigating throuh hypertext. Communications of the ACM, 33(3):296\u2013310.","journal-title":"Communications of the ACM"},{"key":"11_CR266","unstructured":"Nishizeki, T., and Chiba, N. (1988). Planar Graphs: Theory and Algorithms. North-Holland Mathematics Studies 140\/32."},{"key":"11_CR267","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BFb0021824","volume-title":"Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995)","author":"S. C. North","year":"1996","unstructured":"North, S. C. (1996). Incremental layout with DynaDag. In Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995). Springer LNCS 1027, pages 409\u2013418."},{"key":"11_CR268","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1109\/ICASSP.1993.319246","volume":"II","author":"M. Oerder","year":"1993","unstructured":"Oerder, M., and Ney, H. (1993). Word graphs: An efficient interface between continuous-speech recognition and language understanding. In Proceedings of the International Conference on Acoustics, Speech and Signal Processing (ICASSP\u201993), volume II, pages 119\u2013122.","journal-title":"Proceedings of the International Conference on Acoustics, Speech and Signal Processing (ICASSP\u201993)"},{"key":"11_CR269","unstructured":"Ostry, D. (1996). Some three-dimensional graph drawing algorithms. Master\u2019s thesis, University of Newcastle."},{"key":"11_CR270","unstructured":"Otten, R. H. J. M., and vanWijk, J. G. (1978). Graph representation in interactive layout design. In Proceedings of the IEEE International Symposium on Circuits and Systems, pages 914\u2013918."},{"key":"11_CR271","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/3-540-58950-3_385","volume-title":"Proceedings of the DIMACS International Workshop on Graph Drawing (GD\u201994)","author":"A. Papakostas","year":"1995","unstructured":"Papakostas, A. (1995). Upward planarity testing of outerplanar dags. In Proceedings of the DIMACS International Workshop on Graph Drawing (GD\u201994). Springer LNCS 894, pages 298\u2013306."},{"key":"11_CR272","series-title":"Lect Notes Comput Sci","first-page":"371","volume-title":"Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996)","author":"A. Papakostas","year":"1996","unstructured":"Papakostas, A., Six, J. M., and Tollis, I. G. (1996). Experimental and theoretical results in interactive orthogonal graph drawing. In Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996). Springer LNCS 1190, pages 371\u2013386."},{"key":"11_CR273","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-63938-1_50","volume-title":"Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997)","author":"A. Papakostas","year":"1997","unstructured":"Papakostas, A., and Tollis, I. G. (1997a). Incremental orthogonal graph drawing in three dimensions. In Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997). Springer LNCS 1353, pages 52\u201363."},{"key":"11_CR274","doi-asserted-by":"crossref","unstructured":"Papakostas, A., and Tollis, I. G. (1997b). Incremental orthogonal graph drawing in three-dimensions. Technical Report UTDCS-02-97, Dept. of Computer Sciencs, University of Texas at Dallas.","DOI":"10.1007\/3-540-63938-1_50"},{"key":"11_CR275","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/3-540-63307-3_74","volume-title":"Proceedings of the 5th Workshop on Algorithms and Data Structures (WADS\u201997)","author":"A. Papakostas","year":"1997","unstructured":"Papakostas, A., and Tollis, I. G. (1997c). Orthogonal drawing of high degree graphs with small area and few bends. In Proceedings of the 5th Workshop on Algorithms and Data Structures (WADS\u201997). Springer LNCS 1272, pages 354\u2013367."},{"key":"11_CR276","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/3-540-63307-3_74","volume-title":"Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996)","author":"A. Papakostas","year":"1997","unstructured":"Papakostas, A., and Tollis, I. G. (1997d). A pairing technique for area-efficient orthogonal drawings. In Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996). Springer LNCS 1190, pages 354\u2013370."},{"issue":"11","key":"11_CR277","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1109\/12.736444","volume":"47","author":"A. Papakostas","year":"1998","unstructured":"Papakostas, A., and Tollis, I. G. (1998). Interactive orthogonal graph drawing. IEEE Transactions on Computers, 47(11):1297\u20131309.","journal-title":"IEEE Transactions on Computers"},{"key":"11_CR278","unstructured":"Patrignani, M. (1999a). On the complexity of orthogonal compaction. Technical Report RT-DIA-39-99, Dipartimento di Informatica e Automazione, Universit\u00e0 degli Studi di Roma Tre."},{"key":"11_CR279","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/3-540-48447-7_7","volume-title":"Proceedings of the 6th Workshop on Algorithms and Data Structures (WADS\u201999)","author":"M. Patrignani","year":"1999","unstructured":"Patrignani, M. (1999b). On the complexity of orthogonal compaction. Proceedings of the 6th Workshop on Algorithms and Data Structures (WADS\u201999). Springer LNCS 1663, pages 56\u201361."},{"key":"11_CR280","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/3-540-63938-1_70","volume-title":"Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997)","author":"M. Patrignani","year":"1997","unstructured":"Patrignani, M., and Vargiu, F. (1997). 3DCube: A tool for the three dimensional graph drawing. In Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997). Springer LNCS 1353, pages 284\u2013290."},{"key":"11_CR281","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0019371","volume-title":"The Design of an Extendible Graph Editor","author":"F. N. Paulish","year":"1993","unstructured":"Paulish, F. N. (1993). The Design of an Extendible Graph Editor. Springer LNCS 704."},{"key":"11_CR282","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/0095-8956(76)90024-1","volume":"21","author":"C. Platt","year":"1976","unstructured":"Platt, C. (1976). Planar lattices and planar graphs. Journal of Combinatorial Theory, Series B, 21:30\u201339.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"11_CR283","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0020-0190(98)00002-7","volume":"65","author":"C. K. Poon","year":"1998","unstructured":"Poon, C. K., Zhu, B., and Chin, F. (1998). A polynomial time solution for labeling a rectilinear map. Information Processing Letters, 65:201\u2013207.","journal-title":"Information Processing Letters"},{"key":"11_CR284","unstructured":"Poutr\u2019e, J. A. L. (1994). Alpha-algorithms for incremental planarity testing. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computation (STOC\u201994), pages 706\u2013715."},{"key":"11_CR285","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-63938-1_67","volume-title":"Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997)","author":"H. C. Purchase","year":"1997","unstructured":"Purchase, H. C. (1997). Which aesthetic has the greatest effect on human understanding? In Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997). Springer LNCS 1353, pages 248\u2013261."},{"key":"11_CR286","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/BFb0021827","volume-title":"Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995)","author":"H. C. Purchase","year":"1996","unstructured":"Purchase, H. C., Cohen, R. F., and James, M. (1996). Validating graph drawing aesthetics. In Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995). Springer LNCS 1027, pages 435\u2013446."},{"key":"11_CR287","doi-asserted-by":"crossref","unstructured":"Purchase, H. C., Cohen, R. F., and James, M. (1997). An experimental study of the basis for graph drawing algorithms. ACM Journal of Experimental Algorithmics, 2(4).","DOI":"10.1145\/264216.264222"},{"issue":"6","key":"11_CR288","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/TCS.1979.1084652","volume":"26","author":"N. R. Quinn","year":"1979","unstructured":"Quinn, N. R., and Breuer, M. A. (1979). A force directed component placement procedure for printed circuit boards. IEEE Transactions on Circuits and Systems, 26(6):377\u2013388.","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"11_CR289","unstructured":"Reeves, C. M. (1995). Modern Heuristic Techniques for Combinatorial Problems. McGraw-Hill."},{"issue":"1","key":"11_CR290","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/21.87050","volume":"18","author":"M. G. Reggiani","year":"1988","unstructured":"Reggiani, M. G., and Marchetti, F. E. (1988). A proposed method for representing hierarchies. IEEE Transactions on Systems, Man, and Cybernetics, 18(1):2\u20138.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"11_CR291","unstructured":"Reinelt, G. (1985). The linear ordering problem: algorithms and applications. Research and Exposition in Mathematics 8, Heldermann."},{"issue":"2","key":"11_CR292","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"7","author":"E. M. Reingold","year":"1981","unstructured":"Reingold, E. M., and Tilford, J. S. (1981). Tidier drawings of trees. IEEE Transactions on Software Engineering, 7(2):223\u2013228.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"11_CR293","unstructured":"Rival, I. (1985). The diagram. In Graphs and Order, NATO ASI Series, pages 103\u2013133. Reidel Publishing."},{"key":"11_CR294","unstructured":"Robertson, G. G., Mackinlay, J. D., and Card, S. K. (1993). Cone trees: Animated 3d visualizations of hierarchical information. In Proceedings of the ACM Conference on Human Factors in Computing Systems, pages 189\u2013193."},{"issue":"4","key":"11_CR295","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., and Tarjan, R. E. (1986). Rectilinear planar layouts of planar graphs and bipolar orientations. Discrete & Computational Geometry, 1(4):342\u2013351.","journal-title":"Discrete & Computational Geometry"},{"key":"11_CR296","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/3-540-63938-1_71","volume-title":"Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997)","author":"T. Roxborough","year":"1997","unstructured":"Roxborough, T., and Sen, A. (1997). Graph clustering using multiway ratio cut. In Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997). Springer LNCS 1353, pages 291\u2013296."},{"key":"11_CR297","doi-asserted-by":"crossref","unstructured":"Rudell, R. (1993). Dynamic variable ordering for ordered binary decision diagrams. In Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design (ICCAD\u201993), pages 42\u201347.","DOI":"10.1109\/ICCAD.1993.580029"},{"key":"11_CR298","series-title":"Lect Notes Comput Sci","first-page":"395","volume-title":"Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996)","author":"R. Sablowski","year":"1996","unstructured":"Sablowski, R., and Frick, A. (1996). Automatic graph clustering. In Proceedings of the 4th International Symposium on Graph Drawing (GD\u201996). Springer LNCS 1190, pages 395\u2013400."},{"key":"11_CR299","unstructured":"Sander, G. (1994). Graph layout through the VCG tool. Technical Report A03\/94, Universitat des Saarlandes."},{"key":"11_CR300","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/BFb0021828","volume-title":"Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995)","author":"G. Sander","year":"1996","unstructured":"Sander, G. (1996a). A fast heuristic for hierarchical Manhattan layout. In Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995). Springer LNCS 1027, pages 447\u2013458."},{"key":"11_CR301","unstructured":"Sander, G. (1996b). Graph layout for applications in compiler construction. Technical Report A\/01\/96, FB 14 Informatik, Universitat des Saarlandes."},{"issue":"12","key":"11_CR302","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/198366.198384","volume":"37","author":"M. Sarkar","year":"1994","unstructured":"Sarkar, M., and Brown, M. H. (1994). Graphical fisheye views. Communications of the ACM, 37(12):73\u201384.","journal-title":"Communications of the ACM"},{"key":"11_CR303","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0167-9260(83)80019-4","volume":"1","author":"M. Schlag","year":"1983","unstructured":"Schlag, M., Liao, Y.-Z., and Wong, C. K. (1983). An algorithm for optimal two-dimensional compaction of VLSI layouts. Integration, the VLSI Journal, 1:179\u2013209.","journal-title":"Integration, the VLSI Journal"},{"key":"11_CR304","unstructured":"Schnyder, W. (1990). Embedding planar graphs on the grid. In Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA\u201990), pages 138\u2013148."},{"key":"11_CR305","unstructured":"Schrijver, A. (1986). Theory of Linear and Integer Programming. Wiley-Interscience."},{"key":"11_CR306","unstructured":"Sedgewick, R. (1988). Algorithms, pages 438\u2013441. Addison-Wesley, 2nd edition."},{"key":"11_CR307","unstructured":"Shiloach, Y. (1976). Arrangements of planar graphs on the planar lattice. PhD thesis, Weizmann Institute of Science."},{"key":"11_CR308","unstructured":"Sim, S. (1996). Automatic graph drawing algorithms. Manuscript, available at http:\/\/www.cs.toronto.edu\/~simsuz\/papers\/grafdraw.ps.gz ."},{"key":"11_CR309","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/3-540-37623-2_23","volume-title":"Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998)","author":"J. M. Six","year":"1998","unstructured":"Six, J. M., Kakoulis, K. G., and Tollis, I. G. (1998). Refinement of orthogonal graph drawings. In Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998). Springer LNCS 1547, pages 302\u2013315."},{"issue":"1","key":"11_CR310","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0020-0190(98)00190-2","volume":"69","author":"T. Strijk","year":"1999","unstructured":"Strijk, T., and van Kreveld, M. (1999). Labeling a rectilinear map more efficiently. Information Processing Letters, 69(1):25\u201330.","journal-title":"Information Processing Letters"},{"key":"11_CR311","unstructured":"Strijk, T., and Wolf, A. (1999). Labeling points with circles. Technical Report TR-99-08, Institut fur Informatik, Freie Universitat Berlin."},{"key":"11_CR312","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1007\/3-540-58950-3_399","volume-title":"Proceedings of the DIMACS International Workshop on Graph Drawing (GD\u201994)","author":"G. Stumme","year":"1995","unstructured":"Stumme, G., and Wille, R. (1995). A geometrical heuristic for drawing concept lattices. In Proceedings of the DIMACS International Workshop on Graph Drawing (GD\u201994). Springer LNCS 894, pages 452\u2013460."},{"issue":"6","key":"11_CR313","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1080\/01969728708902150","volume":"18","author":"K. Sugiyama","year":"1987","unstructured":"Sugiyama, K. (1987). A cognitive approach for graph drawing. Cybernetic Systems, 18(6):447\u2013488.","journal-title":"Cybernetic Systems"},{"issue":"4","key":"11_CR314","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1109\/21.108304","volume":"21","author":"K. Sugiyama","year":"1991","unstructured":"Sugiyama, K., and Misue, K. (1991). Visualisation of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Systems, Man, and Cybernetics, 21(4):876\u2013892.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"11_CR315","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/3-540-58950-3_391","volume-title":"Proceedings of the DIMACS International Workshop on Graph Drawing (GD\u201994)","author":"K. Sugiyama","year":"1995","unstructured":"Sugiyama, K., and Misue, K. (1995). A simple and unified method for drawing graphs: Magnetic-spring algorithm. In Proceedings of the DIMACS International Workshop on Graph Drawing (GD\u201994). Springer LNCS 894, pages 364\u2013375."},{"issue":"2","key":"11_CR316","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., and Toda, M. (1981). Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics, 11(2):109\u2013125.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"11_CR317","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF00289576","volume":"18","author":"K. J. Supowit","year":"1983","unstructured":"Supowit, K. J., and Reingold, E. M. (1983). The complexity of drawing trees nicely. Acta Informatica, 18:377\u2013392.","journal-title":"Acta Informatica"},{"issue":"3","key":"11_CR318","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"},{"issue":"1","key":"11_CR319","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1009760732249","volume":"3","author":"R. Tamassia","year":"1998","unstructured":"Tamassia, R. (1998). Constraints in graph drawing algorithms. Constraints, 3(1):87\u2013120.","journal-title":"Constraints"},{"issue":"1","key":"11_CR320","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., and Batini, C. (1988). Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man, and Cybernetics, 18(1):61\u201379.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"issue":"4","key":"11_CR321","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"Tamassia, R., and Tollis, I. G. (1986). A unified approach to visibility representations of planar graphs. Discrete & Computational Geometry, 1(4):321\u2013341.","journal-title":"Discrete & Computational Geometry"},{"issue":"9","key":"11_CR322","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"36","author":"R. Tamassia","year":"1989","unstructured":"Tamassia, R., and Tollis, I. G. (1989). Planar grid embedding in linear time. IEEE Transactions on Circuits and Systems, 36(9):1230\u20131234.","journal-title":"IEEE Transactions on Circuits and Systems"},{"issue":"1","key":"11_CR323","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0020-0190(91)90059-Q","volume":"39","author":"R. Tamassia","year":"1991","unstructured":"Tamassia, R., Tollis, I. G., and Vitter, J. S. (1991). Lower bounds for planar orthogonal drawings of graphs. Information Processing Letters, 39(1):35\u201340.","journal-title":"Information Processing Letters"},{"key":"11_CR324","unstructured":"Tanenbaum, A. S. (1995). Distributed Operating Systems. Prentice Hall."},{"key":"11_CR325","doi-asserted-by":"crossref","unstructured":"Tarjan, R. E. (1983). Data structures and network algorithms CBMS-NSF Regional Conference Series in Applied Mathematics 44, SIAM.","DOI":"10.1137\/1.9781611970265"},{"key":"11_CR326","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0095-8956(80)90083-0","volume":"29","author":"C. Thomassen","year":"1980","unstructured":"Thomassen, C. (1980). Planarity and duality of finite and infinite planar graphs. Journal of Combinatorial Theory, Series B, 29:244\u2013271.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"11_CR327","unstructured":"Thompson, C. D. (1980). A Complexity Theory for VLSI. PhD thesis, Carnegie Mellon University."},{"key":"11_CR328","unstructured":"Tunkelang, D. (1994). A practical approach to drawing undirected graphs. Technical Report CMU-CS-94-161, School of Computer Science, Carnegie Mellon University."},{"key":"11_CR329","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1112\/plms\/s3-10.1.304","volume":"10","author":"W. T. Tutte","year":"1960","unstructured":"Tutte, W. T. (1960). Convex representations of graphs. Proceedings of the London Mathematical Society, Third Series, 10:304\u2013320.","journal-title":"Proceedings of the London Mathematical Society, Third Series"},{"key":"11_CR330","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W. T. 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, Third Series"},{"key":"11_CR331","unstructured":"Ullman, J. (1989). Principles of Database and Knowledgebase Systems, volume 1. Computer Science Press."},{"key":"11_CR332","unstructured":"Utech, J., Branke, J., Schmeck, H., and Eades, P. (1998). An evolutionary algorithm for drawing directed graphs. In Proceedings of the International Conference on Imaging Science, Systems, and Technology, pages 154\u2013160."},{"key":"11_CR333","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R. E., and Lawler, E. L. (1982). The recognition of series parallel digraphs. SIAM Journal on Computing, 11:298\u2013313.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"11_CR334","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"C-30","author":"L. Valiant","year":"1981","unstructured":"Valiant, L. (1981). Universality considerations in VLSI circuits. IEEE Transactions on Computers, C-30(2):135\u2013140.","journal-title":"IEEE Transactions on Computers"},{"key":"11_CR335","doi-asserted-by":"crossref","unstructured":"van Kreveld, M., Strijk, T., and Wolff, A. (1998). Point set labeling with sliding labels. In Proceedings of the 14th Annual ACM Symposium on Computational Geometry (SCG\u201998), pages 337\u2013346.","DOI":"10.1145\/276884.276922"},{"key":"11_CR336","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/3-540-48481-7_37","volume-title":"Proceedings of the 7th European Symposium on Algorithms (ESA\u201999)","author":"B. Verweij","year":"1999","unstructured":"Verweij, B., and Aardal, K. (1999). An optimisation algorithm for maximum independent set with applications in map labelling. In Proceedings of the 7th European Symposium on Algorithms (ESA\u201999). Springer LNCS 1643, pages 426\u2013437."},{"key":"11_CR337","doi-asserted-by":"crossref","unstructured":"Vogt, F. (1996). Formale Begriffsanalyse mit C++: Datenstrukturen und Algorithmen. Springer.","DOI":"10.1007\/978-3-642-86738-5"},{"key":"11_CR338","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/3-540-58950-3_374","volume-title":"Proceedings of the DIMACS International Workshop on Graph Drawing (GD\u201994)","author":"F. Vogt","year":"1995","unstructured":"Vogt, F., and Wille, R. (1995). TOSCANA-a graphical tool for analyzing and exploring data. In Proceedings of the DIMACS International Workshop on Graph Drawing (GD\u201994). Springer LNCS 894, pages 226\u2013233."},{"key":"11_CR339","unstructured":"Vossen, G. (1991). Datenbankmodelle, Datenbanksprachen und Datenbankmanagement-Systeme. Addison-Wesley."},{"issue":"3","key":"11_CR340","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0020-0190(94)90001-9","volume":"52","author":"F. Wagner","year":"1994","unstructured":"Wagner, F. (1994). Approximate map labeling is in \u03a9(n log n). Information Processing Letters, 52(3):161\u2013165.","journal-title":"Information Processing Letters"},{"key":"11_CR341","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/3-540-60313-1_160","volume-title":"Proceedings of the 3rd European Symposium on Algorithms (ESA\u201995)","author":"F. Wagner","year":"1995","unstructured":"Wagner, F., and Wolff, A. (1995a). An efficient and effective approximation algorithm for the map labeling problem. In Proceedings of the 3rd European Symposium on Algorithms (ESA\u201995). Springer LNCS 979, pages 420\u2013433."},{"key":"11_CR342","doi-asserted-by":"crossref","unstructured":"Wagner, F., and Wolff, A. (1995b). Map labeling heuristics: Provably good and practically useful. In Proceedings of the 11th Annual ACM Symposium on Computational Geometry (SCG\u201995), pages 109\u2013118.","DOI":"10.1145\/220279.220291"},{"key":"11_CR343","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/S0925-7721(96)00007-7","volume":"7","author":"F. Wagner","year":"1997","unstructured":"Wagner, F., and Wolff, A. (1997). A practical map labeling algorithm. Computational Geometry: Theory and Applications, 7:387\u2013404.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"11_CR344","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-37623-2_24","volume-title":"Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998)","author":"F. Wagner","year":"1998","unstructured":"Wagner, F., and Wolff, A. (1998). A combinatorial framework for map labeling. In Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998). Springer LNCS 1547, pages 316\u2013331."},{"key":"11_CR345","series-title":"Lect Notes Comput Sci","first-page":"504","volume-title":"Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995)","author":"X. Wang","year":"1995","unstructured":"Wang, X., and Miyamoto, I. (1995). Generating cunstomized layouts. In Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995). Springer LNCS 1027, pages 504\u2013515."},{"key":"11_CR346","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1007\/BFb0021835","volume-title":"Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995)","author":"X. Wang","year":"1996","unstructured":"Wang, X., and Miyamoto, I. (1996). Generating customized layouts. In Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995). Springer LNCS 1027, pages 504\u2013515."},{"issue":"7","key":"11_CR347","first-page":"502","volume":"SMC-7","author":"J. Warfield","year":"1977","unstructured":"Warfield, J. (1977). Crossing theory and hierarchy mapping. IEEE Transactions on Systems, Man, and Cybernetics, SMC-7(7):502\u2013523.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"11_CR348","doi-asserted-by":"crossref","unstructured":"Warnke, V., Kompe, R., Niemann, H., and Noth, E. (1997). Integrated dialog act segmentation and classification using prosodic features and language models. Technical Report Verbmobil-Report 218, Lehrstuhl fur Mustererkennung 5, Universitat Erlangen-Nurnberg.","DOI":"10.21437\/Eurospeech.1997-79"},{"key":"11_CR349","doi-asserted-by":"crossref","unstructured":"Wasserman, S., and Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press.","DOI":"10.1017\/CBO9780511815478"},{"key":"11_CR350","unstructured":"Watanabe, H. (1984). IC Layout Generation and Compaction Using Mathematical Optimization. PhD thesis, University of Rochester."},{"key":"11_CR351","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0166-218X(83)90101-4","volume":"6","author":"T. Watanabe","year":"1983","unstructured":"Watanabe, T., Ae, T., and Nakamura, A. (1983). On the NP-hardness of edge-deletion and-contraction problems. Discrete Applied Mathematics, 6:63\u201378.","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR352","series-title":"Lect Notes Comput Sci","first-page":"87","volume-title":"Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997)","author":"R. Webber","year":"1997","unstructured":"Webber, R. (1997). Finding the best viewpoints for three-dimensional graph drawings. In Proceedings of the 5th International Symposium on Graph Drawing (GD\u201997). Springer LNCS 1353, pages 87\u201398."},{"key":"11_CR353","unstructured":"Webber, R. (1998). Finding the Best Viewpoint for Three-Dimensional Graph Drawings. PhD thesis, University of Newcastle. http:\/\/www.cs.mu.oz. au\/~rwebber\/research\/thesis\/ ."},{"issue":"7","key":"11_CR354","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/43.87601","volume":"10","author":"Y.-C. Wei","year":"1991","unstructured":"Wei, Y.-C., and Cheng, C.-K. (1991). Ratio cut partitioning for hierarchical designs. IEEE Transactions on Computer-Aided Design, 10(7):911\u2013921.","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"11_CR355","unstructured":"West, D. (1996). Introduction to Graph Theory. Prentice Hall."},{"key":"11_CR356","unstructured":"White, D. (1999). Pgraph of Canaan genealogy made by Pajek program. Manuscript. http:\/\/eclectic.ss.uci.edu\/~drwhite\/pgraph\/p-graphs.html ."},{"key":"11_CR357","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1007\/3-540-37623-2_47","volume-title":"Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998)","author":"R. Wiese","year":"1998","unstructured":"Wiese, R., and Kaufmann, M. (1998). Adding constraints to an algorithm for orthogonal graph drawing. In Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998). Springer LNCS 1547, pages 462\u2013463."},{"key":"11_CR358","doi-asserted-by":"crossref","unstructured":"Wille, R. (1989). Lattices in data analysis: How to draw them with a computer. In Algorithms and Order, NATO ASI Series, pages 33\u201358. Kluwer Academic Publishers.","DOI":"10.1007\/978-94-009-2639-4_2"},{"key":"11_CR359","first-page":"39","volume-title":"Modelli e modellizzazione. Models and modelling","author":"R. Wille","year":"1997","unstructured":"Wille, R. (1997). Introduction to formal concept analysis. In Modelli e modellizzazione. Models and modelling. Consiglio Nazionale delle Ricerche, Instituto di Studi sulli Ricerca e Documentazione Scientifica, Roma, pages 39\u201351."},{"key":"11_CR360","unstructured":"Winter, A., and Schurr, A. (1997). Modules and updatable graph views for programmed graph rewriting systems. Technical Report AIB 97-3, Lehrstuhl fur Informatik III, RWTH Aachen."},{"key":"11_CR361","unstructured":"Wolff, A. (1999). Map Labeling in Theory and Practice. PhD thesis, Freie Universitat Berlin."},{"key":"11_CR362","unstructured":"Wolff, A., Knipping, L., van Kreveld, M., Strijk, T., and Agarwal, P. K. (1999). A simple and efficient algorithm for high-quality line labeling. In Proceedings of GISRUK\u201999."},{"key":"11_CR363","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-37623-2_25","volume-title":"Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998)","author":"D. Wood","year":"1998","unstructured":"Wood, D. (1998a). An algorithm for three-dimensional orthogonal graph drawing. In Proceedings of the 6th International Symposium on Graph Drawing (GD\u201998). Springer LNCS 1547, pages 332\u2013346."},{"key":"11_CR364","unstructured":"Wood, D. (1998b). Two-bend three-dimensional orthogonal grid drawing of maximum degree five graphs. Technical Report 98\/03, Monash University."},{"key":"11_CR365","doi-asserted-by":"crossref","unstructured":"Wood, D. R. (1999a). Multi-dimensional orthogonal graph drawing in the general position model. Technical Report 99\/38, Monash University.","DOI":"10.1007\/3-540-46648-7_32"},{"key":"11_CR366","unstructured":"Wood, D. R. (1999b). A new algorithm and open problems in three-dimensional orthogonal graph drawing. In Proceedings of the 10th Australasian Workshop on Combinatorical Algorithms (AWOCA\u201999), pages 157\u2013167."},{"key":"11_CR367","unstructured":"Wood, D. R. (2000). Three-Dimensional Orthogonal Graph Drawing. PhD thesis, Monash University."},{"key":"11_CR368","doi-asserted-by":"crossref","unstructured":"Yannakakis, M. (1978). Node-an d edge-deletion NP-complete problems. In Proceedings 10th Annual ACM Symposium on the Theory of Computing (STOC\u201978), pages 253\u2013264.","DOI":"10.1145\/800133.804355"},{"key":"11_CR369","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1179\/caj.1972.9.2.99","volume":"9","author":"P. Yoeli","year":"1972","unstructured":"Yoeli, P. (1972). The logic of automated map lettering. The Cartographic Journal, 9:99\u2013108.","journal-title":"The Cartographic Journal"},{"issue":"1","key":"11_CR370","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/249094.249108","volume":"31","author":"A. Zeller","year":"1996","unstructured":"Zeller, A., and Lutkehaus, D. (1996). DDD-A free graphical front-end for UNIX debuggers. ACM SIGPLAN Notices, 31(1):22\u201327.","journal-title":"ACM SIGPLAN Notices"},{"issue":"3","key":"11_CR371","doi-asserted-by":"crossref","first-page":"16","DOI":"10.3138\/9258-63QL-3988-110H","volume":"23","author":"S. Zoraster","year":"1986","unstructured":"Zoraster, S. (1986). Integer programming applied to the map label placement problem. Cartographica, 23(3):16\u201327.","journal-title":"Cartographica"},{"issue":"5","key":"11_CR372","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1287\/opre.38.5.752","volume":"38","author":"S. Zoraster","year":"1990","unstructured":"Zoraster, S. (1990). The solution of large 0-1 integer programming problems encountered in automated cartography. Operations Research, 38(5):752\u2013759.","journal-title":"Operations Research"}],"container-title":["Drawing Graphs","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44969-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T18:56:15Z","timestamp":1684004175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44969-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540420620","9783540449690"],"references-count":372,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-44969-8_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}