{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:04:44Z","timestamp":1725487484541},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433231"},{"type":"electronic","value":"9783540458753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45875-1_24","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:17:29Z","timestamp":1184588249000},"page":"307-323","source":"Crossref","is-referenced-by-count":5,"title":["Graph Drawing Algorithm Engineering with AGD"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Gutwenger","sequence":"first","affiliation":[]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[]},{"given":"Gunnar W.","family":"Klau","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Leipert","sequence":"additional","affiliation":[]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,10]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"S. Bridgeman, G. Di Battista, W. Didimo, G. Liotta, R. Tamassia, and L. Vismara. Turn-regularity and optimal area drawings for orthogonal representations. Computational Geometry Theory and Applications (CGTA), 2000. To appear.","DOI":"10.1016\/S0925-7721(99)00054-1"},{"key":"24_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-44541-2_22","volume-title":"Graph Drawing 2000","author":"C. Buchheim","year":"2000","unstructured":"C. Buchheim, M. J\u00fcnger, and S. Leipert. A fast layout algorithm for klevel graphs. In J. Marks, editor, Graph Drawing 2000, volume 1984 of LNCS, pages 229\u2013240. Springer-Verlag, 2000."},{"issue":"4","key":"24_CR3","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/TSE.1986.6312901","volume":"SE-12","author":"C. Batini","year":"1986","unstructured":"C. Batini, E. Nardelli, and R. Tamassia. A layout algorithm for data-flow diagrams. IEEE Trans. Soft. Eng., SE-12(4):538\u2013546, 1986.","journal-title":"IEEE Trans. Soft. Eng."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0164-1212(84)90006-2","volume":"4","author":"C. Batini","year":"1984","unstructured":"C. Batini, M. Talamo, and R. Tamassia. Computer aided layout of entity relationship diagrams. J. Syst. and Softw., 4:163\u2013173, 1984.","journal-title":"J. Syst. and Softw."},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"E. G. Coffman","year":"1972","unstructured":"E. G. Coffman and R. L. Graham. Optimal scheduling for two processor systems. Acta Informatica, 1:200\u2013213, 1972.","journal-title":"Acta Informatica"},{"issue":"3","key":"24_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"7","author":"M. Chrobak","year":"1997","unstructured":"M. Chrobak and G. Kant. Convex grid drawings of 3-connected planar graphs. Internat. Journal on Computational Geometry and Applications, 7(3):211\u2013224, 1997.","journal-title":"Internat. Journal on Computational Geometry and Applications"},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix De","year":"1990","unstructured":"H. De Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10(1):41\u201351, 1990.","journal-title":"Combinatorica"},{"issue":"5","key":"24_CR8","doi-asserted-by":"publisher","first-page":"956","DOI":"10.1137\/S0097539794280736","volume":"25","author":"G. Battista Di","year":"1996","unstructured":"G. Di Battista and R. Tamassia. On-line planarity testing. SIAM J. Comput., 25(5):956\u2013997, 1996.","journal-title":"SIAM J. Comput."},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"G. Battista Di","year":"1992","unstructured":"G. Di Battista, R. Tamassia, and I. G. Tollis. Area requirement and symmetry display of planar upward drawings. Discrete Comput. Geom., 7:381\u2013401, 1992.","journal-title":"Discrete Comput. Geom."},{"issue":"A","key":"24_CR10","first-page":"89","volume":"21","author":"P. Eades","year":"1986","unstructured":"P. Eades and D. Kelly. Heuristics for reducing crossings in 2-layered networks. Ars Combinatoria, 21(A):89\u201398, 1986.","journal-title":"Ars Combinatoria"},{"key":"24_CR11","first-page":"15","volume":"12","author":"P. Eades","year":"1995","unstructured":"P. Eades and X. Lin. A new heuristic for the feedback arc set problem. Australian Journal of Combinatorics, 12:15\u201326, 1995.","journal-title":"Australian Journal of Combinatorics"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"P. Eades and P. Mutzel. Graph drawing algorithms. In M. Atallah, editor, CRC Handbook of Algorithms and Theory of Computation, chapter 9, pages 9\u20131\u20139\u201326. CRC Press, 1999.","DOI":"10.1201\/9781420049503-c10"},{"key":"24_CR13","unstructured":"P. Eades and N. Wormald. The median heuristic for drawing 2-layers networks. Technical Report69, Dept. of Comp. Sci., University of Queensland, 1986."},{"key":"24_CR14","unstructured":"S. Fialko. Das planare Augmentierungsproblem. Master\u2019s thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, 1997."},{"key":"24_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0021809","volume-title":"Graph Drawing '95","author":"U. F\u00f6\u00dfmeier","year":"1996","unstructured":"U. F\u00f6\u00dfmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F.J. Brandenburg, editor, Graph Drawing '95), volume 1027 of LNCS, pages 254\u2013266. Springer, 1996."},{"key":"24_CR16","unstructured":"S. Fialko and P. Mutzel. A new approximation algorithm for the planar augmentation problem. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '98), pages 260\u2013269, San Francisco, California, 1998. ACM Press."},{"issue":"11","key":"24_CR17","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T. Fruchterman","year":"1991","unstructured":"T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Softw.-Pract. Exp., 21(11):1129\u20131164, 1991.","journal-title":"Softw.-Pract. Exp."},{"key":"24_CR18","unstructured":"Graph Drawing Toolkit: An object-oriented library for handling and drawing graphs. http:\/\/www.dia.uniroma3.it\/~gdt."},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BF01582009","volume":"33","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger, and G. Reinelt. On the acyclic subgraph polytope. Mathematical Programming, 33:28\u201342, 1985.","journal-title":"Mathematical Programming"},{"issue":"3","key":"24_CR20","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"E. R. Gansner","year":"1993","unstructured":"E. R. Gansner, E. Koutsofios, S. C. North, and K. P. Vo. A technique for drawing directed graphs. IEEE Trans. Softw. Eng., 19(3):214\u2013230, 1993.","journal-title":"IEEE Trans. Softw. Eng."},{"key":"24_CR21","unstructured":"C. Gutwenger and P. Mutzel. Grid embedding of biconnected planar graphs. Extended Abstract, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany, 1997."},{"key":"24_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-37623-2_13","volume-title":"Graph Drawing '98","author":"C. Gutwenger","year":"1998","unstructured":"C. Gutwenger and P. Mutzel. Planar polyline drawings with good angular resolution. In S. Whitesides, editor, Graph Drawing '98, volume 1547 of LNCS, pages 167\u2013182. Springer-Verlag, 1998."},{"key":"24_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-44541-2_8","volume-title":"Graph Drawing 2000","author":"C. Gutwenger","year":"2000","unstructured":"C. Gutwenger and P. Mutzel. A linear-time implementation of SPQRtrees. In J. Marks, editor, Graph Drawing 2000, volume 1984 of LNCS, pages 77\u201390. Springer-Verlag, 2000."},{"key":"24_CR24","unstructured":"C. Gutwenger, P. Mutzel, and R. Weiskircher. Inserting an edge into a planar graph. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '2001), pages 246\u2013255, Washington, DC, 2001. ACM Press."},{"key":"24_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/3-540-37623-2_11","volume-title":"Graph Drawing '98","author":"N. Gelfand","year":"1998","unstructured":"N. Gelfand and R. Tamassia. Algorithmic patterns for orthogonal graph drawing. In S. Whitesides, editor, Graph Drawing '98, volume 1547 of LNCS, pages 138\u2013152. Springer-Verlag, 1998."},{"key":"24_CR26","unstructured":"M. Himsolt. GML: A portable graph file format. Technical report, Universit \u00e4t Passau, 1997. See also http:\/\/www.uni-passau.de\/Graphlet\/GML."},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"M. J\u00fcnger, S. Leipert, and P. Mutzel. A note on computing a maximal planar subgraph using PQ-trees. IEEE Trans. on Computer-Aided Design, 17(7), 1998.","DOI":"10.1109\/43.709399"},{"key":"24_CR28","series-title":"Lect Notes Comput Sci","first-page":"119","volume-title":"DIMACS Graph Drawing '94","author":"M. J\u00fcnger","year":"1994","unstructured":"M. J\u00fcnger and P. Mutzel. The polyhedral approach to the maximum planar subgraph problem: New chances for related problems. In DIMACS Graph Drawing '94, volume 894 of LNCS, pages 119\u2013130. Springer-Verlag, 1994."},{"issue":"1","key":"24_CR29","first-page":"1","volume":"1","author":"M. J\u00fcnger","year":"1996","unstructured":"M. J\u00fcnger and P. Mutzel. 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. J. Graph Algorithms and Applications (JGAA) ( http:\/\/www.cs.brown.edu\/publications\/jgaa\/ ), 1(1):1\u201325, 1996.","journal-title":"J. Graph Algorithms and Applications (JGAA)"},{"issue":"1","key":"24_CR30","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02086607","volume":"16","author":"M. J\u00fcnger","year":"1996","unstructured":"M. J\u00fcnger and P. Mutzel. Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica, 16(1):33\u201359, 1996.","journal-title":"Algorithmica"},{"key":"24_CR31","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":"M. J\u00fcnger and S. Thienel. The ABACUS system for branch-and-cut and price algorithms in integer programming and combinatorial optimization. Software-Practice and Experience, 30:1325\u20131352, 2000.","journal-title":"Software-Practice and Experience"},{"issue":"1","key":"24_CR32","first-page":"4","volume":"16","author":"G. Kant","year":"1996","unstructured":"G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, Special Issue on Graph Drawing, 16(1):4\u201332, 1996.","journal-title":"Algorithmica, Special Issue on Graph Drawing"},{"key":"24_CR33","series-title":"Lect Notes Comput Sci","volume-title":"An experimental comparison of orthogonal compaction algorithms","author":"G. W. Klau","year":"2001","unstructured":"G. W. Klau, K. Klein, and P. Mutzel. An experimental comparison of orthogonal compaction algorithms. In Graph Drawing (Proc. 2000), LNCS. Springer Verlag, 2001."},{"key":"24_CR34","unstructured":"G. Klau and P. Mutzel. Quasi-orthogonal drawing of planar graphs. Technical Report MPI-I-98-1-013, Max-Planck-Institut f. Informatik, Saarbr\u00fccken, 1998."},{"key":"24_CR35","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 '99)","author":"G. W. Klau","year":"1999","unstructured":"G. W. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. In G. P. Cornu\u00e9jols, R. E. Burkard, and G. J. Woeginger, editors, Integer Programming and Combinatorial Optimization (IPCO '99), volume 1610 of LNCS, pages 304\u2013319. Springer, 1999."},{"key":"24_CR36","doi-asserted-by":"crossref","unstructured":"T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, New York, 1990.","DOI":"10.1007\/978-3-322-92106-2_3"},{"key":"24_CR37","unstructured":"K. Mehlhorn and S. N\u00e4her. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999."},{"key":"24_CR38","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-46648-7_22","volume-title":"Graph Drawing '99","author":"C. Matuszewski","year":"1999","unstructured":"C. Matuszewski, R. Sch\u00f6nfeld, and P. Molitor. Using sifting for k-layer crossing minimization. In J. Kratochvil, editor, Graph Drawing '99, volume 1731 of LNCS, pages 217\u2013224. Springer-Verlag, 1999."},{"key":"24_CR39","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1007\/3-540-60313-1_166","volume-title":"A polyhedral approach to planar augmentation and related problems","author":"P. Mutzel","year":"1995","unstructured":"P. Mutzel. A polyhedral approach to planar augmentation and related problems. In Paul Spirakis, editor, Annual European Symposium on Algorithms (ESA-3): Corfu, Greece, September 25\u201327, 1995; proceedings, volume 979 of LNCS, pages 494\u2013507, Berlin, 1995. Springer."},{"issue":"2","key":"24_CR40","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"SE-7","author":"E. Reingold","year":"1981","unstructured":"E. Reingold and J. Tilford. Tidier drawing of trees. IEEE Trans. Softw. Eng., SE-7(2):223\u2013228, 1981.","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"4","key":"24_CR41","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"P. Rosenstiehl and R. E. Tarjan. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom., 1(4):343\u2013353, 1986.","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"24_CR42","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"SMC-11","author":"K. Sugiyama","year":"1981","unstructured":"K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. Syst. Man Cybern., SMC-11(2):109\u2013125, 1981.","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"3","key":"24_CR43","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421\u2013444, 1987.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"24_CR44","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"SMC-18","author":"R. Tamassia","year":"1988","unstructured":"R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61\u201379, 1988.","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"24_CR45","doi-asserted-by":"crossref","unstructured":"W. T. Tutte. How to draw a graph. Proceedings London Mathematical Society, 13(3):743\u2013768, 1963.","DOI":"10.1112\/plms\/s3-13.1.743"},{"issue":"7","key":"24_CR46","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1002\/spe.4380200705","volume":"20","author":"J. Q. Walker II","year":"1990","unstructured":"J. Q. Walker II. A node-positioning algorithm for general trees. Software \u2014 Practice and Experiments, 20(7):685\u2013705, 1990.","journal-title":"Software \u2014 Practice and Experiments"}],"container-title":["Lecture Notes in Computer Science","Software Visualization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45875-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T07:14:50Z","timestamp":1629357290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45875-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433231","9783540458753"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/3-540-45875-1_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}