{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:18:50Z","timestamp":1725581930501},"publisher-location":"Berlin, Heidelberg","reference-count":53,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642622144"},{"type":"electronic","value":"9783642186387"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-642-18638-7_7","type":"book-chapter","created":{"date-parts":[[2011,4,23]],"date-time":"2011-04-23T02:57:24Z","timestamp":1303527444000},"page":"149-172","source":"Crossref","is-referenced-by-count":2,"title":["AGD \u2014 A Library of Algorithms for Graph Drawing"],"prefix":"10.1007","author":[{"given":"Michael","family":"J\u00fcnger","sequence":"first","affiliation":[]},{"given":"Gunnar W.","family":"Klau","sequence":"additional","affiliation":[]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[]},{"given":"Ren\u00e9","family":"Weiskircher","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"AGD User Manual (Version 1.2) (2000) Max-Planck-Institut Saarbr\u00fccken, Technische Universit\u00e4t Wien, Universit\u00e4t zu K\u00f6ln, Universit\u00e4t Trier. See also http:\/\/www.ads.tuwien.ac.at\/AGD\/"},{"issue":"4","key":"7_CR2","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1109\/TSE.1986.6312901","volume":"SE-12","author":"C Batini","year":"1986","unstructured":"Batini, C, Nardelli, E., Tamassia, R. (1986) A layout algorithm for data flow diagrams. IEEE Transactions on Software Engineering SE-12(4), 538\u2013546","journal-title":"IEEE Transactions on Software Engineering"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0164-1212(84)90006-2","volume":"4","author":"C Batini","year":"1984","unstructured":"Batini, C, Talamo, M., Tamassia, R. (1984) Computer aided layout of entity relationship diagrams. Journal of System and Software 4, 163\u2013173","journal-title":"Journal of System and Software"},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0925-7721(99)00054-1","volume":"16","author":"S Bridgeman","year":"2000","unstructured":"Bridgeman, S., Di Battista, G., Didimo, W., Liotta, G., Tamassia, R., Vismara, L. (2000) Turn-regularity and optimal area drawings of orthogonal representations. Computational Geometry: Theory and Application 16(1), 53\u201393","journal-title":"Computational Geometry: Theory and Application"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Buchheim, C, J\u00fcnger, M., Leipert, S. (2000) A fast layout algorithm for k-level graphs. In: J. Marks (ed.) Graph Drawing\u2019 00, Lecture Notes in Computer Science 1984, Springer-Verlag, 229\u2013240","DOI":"10.1007\/3-540-44541-2_22"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"7","author":"M Chrobak","year":"1997","unstructured":"Chrobak, M., 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":"7_CR7","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"EG Coffman","year":"1972","unstructured":"Coffman, E. G., Graham, R. L. (1972) Optimal scheduling for two processor systems. Acta Informatica 1, 200\u2013213","journal-title":"Acta Informatica"},{"issue":"1","key":"7_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H Praysseix De","year":"1990","unstructured":"De Praysseix, H., Pach, J., Pollack, R. (1990) How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351","journal-title":"Combinatorica"},{"issue":"5","key":"7_CR9","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G Battista Di","year":"1996","unstructured":"Di Battista, G., Tamassia, R. (1996) On-line planarity testing. SIAM Journal on Computing 25(5), 956\u2013997","journal-title":"SIAM Journal on Computing"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"G Battista Di","year":"1992","unstructured":"Di Battista, G., Tamassia, R., Tollis, I. G. (1992) Area requirement and symmetry display of planar upward drawings. Discrete and Computational Geometry 7, 381\u2013401","journal-title":"Discrete and Computational Geometry"},{"key":"7_CR11","volume-title":"Automatic Levelling and Layout of Data Flow Diagrams","author":"M Doorley","year":"1995","unstructured":"Doorley, M. (1995) Automatic Levelling and Layout of Data Flow Diagrams. PhD thesis, University of Limerick, Ireland"},{"issue":"A","key":"7_CR12","first-page":"89","volume":"21","author":"P Eades","year":"1986","unstructured":"Eades P., Kelly, D. (1986) Heuristics for reducing crossings in 2-layered networks. Ars Combinatoria 21(A), 89\u201398","journal-title":"Ars Combinatoria"},{"key":"7_CR13","first-page":"15","volume":"12","author":"P Eades","year":"1995","unstructured":"Eades, P., 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":"7_CR14","unstructured":"Eades, P., Wormald, N. (1986) The median heuristic for drawing 2-layers networks. Technical Report 69, Department of Computer Science, University of Queensland"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Eschbach, T., G\u00fcnther, W., Drechsler, R., Becker, B. (2002) Crossing reduction by windows optimization. In: M. T. Goodrich and S. G. Kobourov (eds.) Graph Drawing\u2019 02, Lecture Notes in Computer Science 2528, Springer-Verlag, 285\u2013294","DOI":"10.1007\/3-540-36151-0_27"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Feng, Q. W., Cohen, R. F., Eades, P. (1995) Planarity for clustered graphs. In: P. Spirakis (ed.) Algorithms \u2014 ESA\u2019 95, Third Annual European Symposium, Lecture Notes in Computer Science 979, Springer-Verlag, 213\u2013226","DOI":"10.1007\/3-540-60313-1_145"},{"key":"7_CR17","volume-title":"Das planare Augmentierungsproblem","author":"S Fialko","year":"1997","unstructured":"Fialko, S. (1997) Das planare Augmentierungsproblem. Master\u2019s thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken"},{"key":"7_CR18","first-page":"260","volume-title":"Proc. Ninth Annual ACM-SIAM Symp","author":"S Fialko","year":"1998","unstructured":"Fialko, S., Mutzel, P. (1998) A new approximation algorithm for the planar augmentation problem. In: Proc. Ninth Annual ACM-SIAM Symp. Discrete Algorithms (SODA\u2019 98), San Francisco, California, ACM Press, 260\u2013269"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"F\u00f6\u00dfmeier, U., Kaufmann, M. (1996) Drawing high degree graphs with low bend numbers. In: F. J. Brandenburg (ed.) Graph Drawing\u2019 95, Lecture Notes in Computer Science 1027, Springer-Verlag, 254\u2013266","DOI":"10.1007\/BFb0021809"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchtermann","year":"1991","unstructured":"Fruchtermann, T. M. J., Reingold, E. M. (1991) Graph Drawing by force-directed placement. Software \u2014actice and Experience 21, 1129\u20131164","journal-title":"Software \u2014actice and Experience"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"ER Gansner","year":"1993","unstructured":"Gansner, E. R., Koutsofios, E., North, S. C, Vo, K. P. (1993) A technique for drawing directed graphs. IEEE Transactions on Software Engineering 19, 214\u2013230","journal-title":"IEEE Transactions on Software Engineering"},{"key":"7_CR22","unstructured":"Graph Drawing Toolkit: An object-oriented library for handling and drawing graphs, http:\/\/www.dia.uniroma3.it\/~gdt"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Gelfand, N., Tamassia, R. (1998) Algorithmic patterns for orthogonal graph drawing. In: S. Whitesides (ed.) Graph Drawing\u2019 98, Lecture Notes in Computer Science 1547, Springer-Verlag, 138\u2013152","DOI":"10.1007\/3-540-37623-2_11"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BF01582009","volume":"33","author":"M Gr\u00f6tschel","year":"1985","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G. (1985) On the acyclic subgraph polytope. Mathematical Programming 33, 28\u201342","journal-title":"Mathematical Programming"},{"key":"7_CR25","volume-title":"Grid embedding of biconnected planar graphs","author":"C Gutwenger","year":"1997","unstructured":"Gutwenger, C., Mutzel, P. (1997) Grid embedding of biconnected planar graphs. Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Gutwenger, C., Mutzel, P. (1998) Planar polyline drawings with good angular resolution. In: S. Whitesides (ed.) Graph Drawing\u2019 98, Lecture Notes in Computer Science 1547, Springer-Verlag, 167\u2013182","DOI":"10.1007\/3-540-37623-2_13"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Gutwenger, C, Mutzel, P. (2000) C. Gutwenger and P. Mutzel. A linear-time implementation of SPQR-trees. In: J. Marks (ed.) Graph Drawing\u2019 00, Lecture Notes in Computer Science 1984, Springer-Verlag, 77\u201390","DOI":"10.1007\/3-540-44541-2_8"},{"key":"7_CR28","first-page":"246","volume-title":"Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u2019 2001)","author":"C Gutwenger","year":"2001","unstructured":"Gutwenger, C, Mutzel, P., Weiskircher, R. (2001) Inserting an edge into a planar graph. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u2019 2001), Washington, DC, ACM Press, 246\u2013255"},{"key":"7_CR29","unstructured":"Himsolt, M. (1997) GML: A portable graph file format. Technical report, Universit\u00e4t Passau, see also http:\/\/www.unipassau.de\/Graphlet\/GML"},{"key":"7_CR30","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/43.709399","volume":"17","author":"M J\u00fcnger","year":"1998","unstructured":"J\u00fcnger, M., Leipert, S., Mutzel, P. (1998) A note on computing a maximal planar subgraph using PQ-trees. IEEE Transactions of Computer-Aided Design and Integrated Circuits and Systems 17, 609\u2013612","journal-title":"IEEE Transactions of Computer-Aided Design and Integrated Circuits and Systems"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"J\u00fcnger, M., Mutzel, P. (1994) The polyhedral approach to the maximum planar subgraph problem: New chances for related problems. In: R. Tamassia and I. G. Tollis (eds.) Graph Drawing\u2019 94, Lecture Notes in Computer Science 894, Springer-Verlag, 119\u2013130","DOI":"10.1007\/3-540-58950-3_363"},{"key":"7_CR32","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02086607","volume":"16","author":"M J\u00fcnger","year":"1996","unstructured":"J\u00fcnger, M., Mutzel, P. (1996) Maximum planar subgraphs and nice embeddings: practical layout tools. Algorithmica 16, 33\u201359","journal-title":"Algorithmica"},{"key":"7_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M J\u00fcnger","year":"1997","unstructured":"J\u00fcnger, M., Mutzel, P. (1997) 2-layer straight line crossing minimization: performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications 1, 1\u201325","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"J\u00fcnger, M., Mutzel, P. (2003) Automatic Graph Drawing: Exact optimization helps! To appear in: M. Gr\u00f6tschel (ed.) The Sharpest Cut \u2014 Festschrift zum 60. Geburtstag von Manfred Padberg, MPS-SIAM Series on Optimization","DOI":"10.1137\/1.9780898718805.ch19"},{"key":"7_CR35","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T","volume":"30","author":"M J\u00fcnger","year":"2000","unstructured":"J\u00fcnger, M., Thienel, S. (2000) The ABACUS system for branch-and-cut and price algorithms in integer programming and combinatorial optimization. Software \u2014 Practice and Experience 30, 1325\u20131352","journal-title":"Software \u2014 Practice and Experience"},{"issue":"1","key":"7_CR36","first-page":"4","volume":"16","author":"G Kant","year":"1996","unstructured":"Kant, G. (1996) Drawing planar graphs using the canonical ordering. Algorithmica, Special Issue on Graph Drawing 16(1), 4\u201332","journal-title":"Algorithmica, Special Issue on Graph Drawing"},{"key":"7_CR37","volume-title":"Quasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken","author":"GW Klau","year":"1997","unstructured":"Klau, G. W. (1997) Quasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken. Master\u2019s thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken"},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"Klau, G. W., Klein, K., Mutzel P. (2001) An Experimental Comparison of Orthogonal Compaction Algorithms. In: J. Marks (ed.) Graph Drawing\u2019 00, Lecture Notes in Computer Science 1984, Springer-Verlag, 37\u201351","DOI":"10.1007\/3-540-44541-2_5"},{"key":"7_CR39","series-title":"Technical Report","volume-title":"Quasi-orthogonal drawing of planar graphs","author":"GW Klau","year":"1998","unstructured":"Klau, G. W., Mutzel, P. (1998) Quasi-orthogonal drawing of planar graphs. Technical Report MPI-1-98-1-013, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken"},{"key":"7_CR40","doi-asserted-by":"crossref","unstructured":"Klau, G. W., Mutzel P. (1999) Optimal compaction of orthogonal grid drawings. In: G. Cornuejols, R. E. Burkard, and G. J. Woeginger (eds.) Integer Programming and Combinatorial Optimization (IPCO\u2019 99), Lecture Notes in Computer Science 1610, Springer-Verlag, 304\u2013319","DOI":"10.1007\/3-540-48777-8_23"},{"key":"7_CR41","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T Lengauer","year":"1990","unstructured":"Lengauer, T. (1990) Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, New York"},{"key":"7_CR42","doi-asserted-by":"crossref","unstructured":"Matuszewski, C, Sch\u00f6nfeld, R., Molitor, P. (1999) Using sifting for k-layer crossing minimization. In J. Kratochvil (ed.) Graph Drawing\u2019 99, Lecture Notes in Computer Science 1731, Springer-Verlag, 217\u2013224","DOI":"10.1007\/3-540-46648-7_22"},{"key":"7_CR43","unstructured":"Mehlhorn, K., N\u00e4her, S. (1999) The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press"},{"key":"7_CR44","doi-asserted-by":"crossref","unstructured":"Mutzel, P. (1995) A polyhedral approach to planar augmentation and related problems. In P. Spirakis (ed.) Algorithms \u2014 ESA\u2019 95, Third Annual European Symposium, Lecture Notes in Computer Science 979, Springer-Verlag, 494\u2013507","DOI":"10.1007\/3-540-60313-1_166"},{"key":"7_CR45","volume-title":"Fallstudien zum Datenbankentwurf","author":"O Rauh","year":"1997","unstructured":"Rauh, O., Stickel, E. (1997) Fallstudien zum Datenbankentwurf. Th. Gabler, Wiesbaden"},{"key":"7_CR46","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"7","author":"E Reingold","year":"1981","unstructured":"Reingold, E., Tilford, J. (1981) Tidier drawing of trees. IEEE Transactions on Software Engineering 7, 223\u2013228","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"4","key":"7_CR47","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R. E. (1986) Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete and Computational Geometry 1(4), 343\u2013353","journal-title":"Discrete and Computational Geometry"},{"key":"7_CR48","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M. (1981) Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics 11, 109\u2013125","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"issue":"3","key":"7_CR49","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R Tamassia","year":"1987","unstructured":"Tamassia, R. (1987) On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing 16(3), 421\u2013444","journal-title":"SIAM Journal on Computing"},{"key":"7_CR50","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R Tamassia","year":"1988","unstructured":"Tamassia, R., Di Battista, G., Batini, C. (1988) Automatic Graph Drawing and readability of diagrams. IEEE Transactions on Systems, Man, and Cybernetics 18, 61\u201379","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"7_CR51","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"WT Tutte","year":"1963","unstructured":"Tutte, W. T. (1963) How to draw a graph. In: Proceedings of the London Mathematical Society, Third Series 13, 743\u2013768","journal-title":"Proceedings of the London Mathematical Society"},{"key":"7_CR52","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1002\/spe.4380200705","volume":"20","author":"JQ Walker II","year":"1990","unstructured":"Walker II, J. Q. (1990) A node-positioning algorithm for general trees. Software \u2014 Practice and Experience 20, 685\u2013705","journal-title":"Software \u2014 Practice and Experience"},{"key":"7_CR53","unstructured":"Ziegler, T. (2001) Crossing minimization in automatic Graph Drawing. Doctoral Thesis, Technische Fakult\u00e4t der Universit\u00e4t des Saarlandes"}],"container-title":["Mathematics and Visualization","Graph Drawing Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18638-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:07:24Z","timestamp":1606187244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18638-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783642622144","9783642186387"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18638-7_7","relation":{},"ISSN":["1612-3786"],"issn-type":[{"type":"print","value":"1612-3786"}],"subject":[],"published":{"date-parts":[[2004]]}}}