{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T09:23:20Z","timestamp":1582104200574},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540415541","type":"print"},{"value":"9783540445418","type":"electronic"}],"license":[{"URL":"http:\/\/www.springer.com\/tdm","start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"delay-in-days":0,"content-version":"tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44541-2_5","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:01:32Z","timestamp":1184601692000},"page":"37-51","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An Experimental Comparison of Orthogonal Compaction Algorithms"],"prefix":"10.1007","author":[{"given":"Gunnar W.","family":"Klau","sequence":"first","affiliation":[]},{"given":"Karsten","family":"Klein","sequence":"additional","affiliation":[]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/TSE.1986.6312901","volume":"SE\u201312","author":"C. Batini","year":"1986","unstructured":"C. Batini, E. Nardelli, and R. Tamassia. A layout algorithm for data-ow diagrams. IEEE Trans. Soft. Eng., SE\u201312(4):538\u2013546, 1986.","journal-title":"IEEE Trans. Soft. Eng."},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/21.87055","volume":"SMC\u201318","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\u201318(1):61\u201379, 1988.","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"1","key":"5_CR3","first-page":"33","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, Special Issue on Graph Drawing, 16(1):33\u201359, 1996.","journal-title":"Algorithmica, Special Issue on Graph Drawing"},{"key":"5_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/3-540-48777-8_27","volume-title":"Integer Programming and Combinatorial Optimization (IPCO\u2019 99)","author":"P. Mutzel","year":"1999","unstructured":"P. Mutzel and R. Weiskircher. Optimizing over all combinatorial embeddings of a planar graph. In G. P. Cornu\u00e9jols, R. E. Burkard, and G. J. Woeginger, editors, Integer Programming and Combinatorial Optimization (IPCO\u2019 99), volume 1610 of LNCS, pages 361\u2013376. Springer-Verlag, 1999."},{"key":"5_CR5","unstructured":"C. Gutwenger, P. Mutzel, and R. Weiskircher. Inserting an edge into a planar graph. Technical report, Technische Universit\u00e4t Wien, 2000. Submitted for publication."},{"key":"5_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/BFb0021809","volume-title":"Drawing high degree graphs with low bend numbers","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 (Proc. GD\u2019 95), volume 1027 of LNCS, pages 254\u2013266. Springer-Verlag, 1996."},{"key":"5_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/3-540-63307-3_72","volume-title":"Computing orthogonal drawings with the minimum number of bends","author":"P. Bertolazzi","year":"1997","unstructured":"P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum number of bends. In Proc. 5th Workshop Algorithms Data Struct. (WADS\u2019 97), volume 1272 of LNCS, pages 331\u2013344, 1997."},{"key":"5_CR8","unstructured":"M. Eiglsperger, U. F\u00f6\u00dfmeier, and M. Kaufmann. Orthogonal graph drawing with constraints. In Proc. 11th Symposium on Discrete Algorithms (SODA\u2019 00). ACMSIAM, 2000."},{"key":"5_CR9","unstructured":"G. W. Klau and P. Mutzel. Quasi-orthogonal drawing of planar graphs. Technical Report MPI\u2013I\u201398\u20131\u2013013, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, 1998."},{"key":"5_CR10","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). To appear."},{"key":"5_CR11","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\u2019 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\u2019 99), volume 1610 of LNCS, pages 304\u2013319. Springer-Verlag, 1999."},{"key":"5_CR12","unstructured":"C. Gutwenger, M. J\u00fcnger, G. W. Klau, and P. Mutzel. Graph drawing algorithm engineering with AGD. Technical report, Technische Universit\u00e4t Wien, 2000."},{"key":"5_CR13","unstructured":"AGD. AGD User Manual. Max-Planck-Institut Saarbr\u00fccken, Universit\u00e4t Halle, Universit\u00e4t K\u00f6ln, 1999. \n http:\/\/www.mpi-sb.mpg.de\/AGD\n \n ."},{"key":"5_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/3-540-37623-2_11","volume-title":"Algorithmic patterns for orthogonal graph drawing","author":"N. Gelfand","year":"1998","unstructured":"N. Gelfand and R. Tamassia. Algorithmic patterns for orthogonal graph drawing. In S. Whitesides, editor, Graph Drawing (Proc. GD\u2019 98), volume 1547 of Lecture Notes in Computer Science, pages 138\u2013152. Springer-Verlag, 1998."},{"key":"5_CR15","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"G. Battista Di","year":"1997","unstructured":"G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Computational Geometry: Theory and Applications, 7:303\u2013316, 1997.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"5_CR16","unstructured":"G. Di Battista, A. Garg, and G. Liotta. An experimental comparison of three graph drawing algorithms. In Proceedings of the 11th Annual Symposium on Computational Geometry (SoCG\u201995), pages 306\u2013315, 1995.","DOI":"10.1145\/220279.220312","doi-asserted-by":"crossref"},{"key":"5_CR17","series-title":"Lect Notes Comput Sci","first-page":"337","volume-title":"Exact and heuristic algorithms for 2-layer straightline crossing minimization","author":"M. J\u00fcnger","year":"1995","unstructured":"M. J\u00fcnger and P. Mutzel. Exact and heuristic algorithms for 2-layer straightline crossing minimization. In F. J. Brandenburg, editor, Proceedings of the 3rd International Symposium on Graph Drawing (GD\u201995), volume 1027 of LNCS, pages 337\u2013348. Springer-Verlag, 1995."},{"key":"5_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BFb0021792","volume-title":"An experimental comparison of force-directed and randomized graph drawing algorithms","author":"F. J. Brandenburg","year":"1996","unstructured":"F. J. Brandenburg, M. Himsolt, and C. Rohrer. An experimental comparison of force-directed and randomized graph drawing algorithms. In F. J. Brandenburg, editor, Proceedings of the 3rd International Symposium on Graph Drawing (GD\u2019 95), volume 1027 of LNCS, pages 76\u201387. Springer-Verlag, 1996."},{"issue":"3","key":"5_CR19","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."},{"key":"5_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/3-540-48447-7_7","volume-title":"On the complexity of orthogonal compaction","author":"M. Patrignani","year":"1999","unstructured":"M. Patrignani. On the complexity of orthogonal compaction. In F. Dehne, A. Gupta, J.-R. Sack, and R. Tamassia, editors, Proc. 6th International Workshop on Algorithms and Data Structures (WADS\u2019 99), volume 1663 of LNCS, pages 56\u201361. Springer-Verlag, 1999."},{"key":"5_CR21","unstructured":"T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, New York, 1990.","DOI":"10.1007\/978-3-322-92106-2_3","doi-asserted-by":"crossref"},{"key":"5_CR22","unstructured":"G. W. Klau, K. Klein, and P. Mutzel. An experimental comparison of orthogonal compaction algorithms. Technical Report TR-186\u20131\u201300\u201303, Technische Universit\u00e4t Wien, 2000. Online version at \n http:\/\/www.ads.tuwien.ac.at\/publications\/TR\/TR-186-1-00-03\n \n ."}],"container-title":["Graph Drawing","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44541-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T23:31:05Z","timestamp":1558481465000},"score":1.0,"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540415541","9783540445418"],"references-count":22,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-44541-2_5","relation":{"cites":[]},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"assertion":[{"value":"27 May 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}