{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:20:13Z","timestamp":1742617213550,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540624950"},{"type":"electronic","value":"9783540680482"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62495-3_39","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:39:07Z","timestamp":1330295947000},"page":"76-91","source":"Crossref","is-referenced-by-count":6,"title":["Drawing directed acyclic graphs: An experimental study"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Battista","sequence":"first","affiliation":[]},{"given":"Ashim","family":"Garg","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Armando","family":"Parise","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[]},{"given":"Emanuele","family":"Tassinari","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Vargiu","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Vismara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1142\/S0218195994000215","volume":"4","author":"P. Bertolazzi","year":"1994","unstructured":"P. Bertolazzi, R. F. Cohen, G. Di Battista, R. Tamassia, and I. G. Tollis. How to draw a series-parallel digraph. Internat. J. Comput. Geom. Appl., 4:385\u2013402, 1994.","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"7_CR2","doi-asserted-by":"crossref","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, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science, pages 76\u201387. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021792"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"L. Buti, G. Di Battista, G. Liotta, E. Tassinari, F. Vargiu, and L. Vismara. GD-Workbench: A system for prototyping and testing graph drawing algorithms. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of LNCS, pages 111\u2013122. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021795"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"M. Chrobak, M. T. Goodrich, and R. Tamassia. Convex drawings of graphs in two and three dimensions. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 319\u2013328, 1996.","DOI":"10.1145\/237218.237401"},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: An annotated bibliography. Comput. Geom. Theory Appl., 4:235\u2013282, 1994.","journal-title":"Comput. Geom. Theory Appl."},{"key":"7_CR6","unstructured":"G. Di Battista, A. Garg, G. Liotta, A. Parise, R. Tamassia, E. Tassinari, F. Vargiu, and L. Vismara. Drawing directed graphs: An experimental study. Technical Report CS-96-24, Center for Geometric Computing, Dept. Computer Science, Brown Univ., 1996. ftp:\/\/ftp.cs.brown.edu\/pub\/techreports\/96\/ cs96-24.ps.Z."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of three graph drawing algorithms. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 306\u2013315, 1995.","DOI":"10.1145\/220279.220312"},{"key":"7_CR8","unstructured":"G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl., 1996 (to appear). http:\/\/www.cs.brown.edu\/cgc\/papers\/ dglttv-ecfgd-96.ps.gz."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"G. Di Battista, E. Pietrosanti, R. Tamassia, and I. G. Tollis. Automatic layout of PERT diagrams with XPERT. In Proc. IEEE Workshop on Visual Languages (VL'89), pages 171\u2013176, 1989.","DOI":"10.1109\/WVL.1989.77060"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G. Battista Di","year":"1988","unstructured":"G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoret. Comput. Sci., 61:175\u2013198, 1988.","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR11","doi-asserted-by":"crossref","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."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(92)90072-4","volume":"41","author":"G. Battista Di","year":"1992","unstructured":"G. Di Battista, R. Tamassia, and I. G. Tollis. Constrained visibility representations of graphs. Inform. Process. Lett., 41:1\u20137, 1992.","journal-title":"Inform. Process. Lett."},{"key":"7_CR13","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:214\u2013230, 1993.","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"11","key":"7_CR14","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1002\/spe.4380181104","volume":"18","author":"E. R. Gansner","year":"1988","unstructured":"E. R. Gansner, S. C. North, and K. P. Vo. DAG \u2014 A program that draws directed graphs. Softw. \u2014 Pract. Exp., 18(11):1047\u20131062, 1988.","journal-title":"Softw. \u2014 Pract. Exp."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"A. Garg and R. Tamassia. Planar drawings and angular resolution: Algorithms and bounds. In J. van Leeuwen, editor, Algorithms (Proc. ESA '94), volume 855 of Lecture Notes in Computer Science, pages 12\u201323. Springer-Verlag, 1994.","DOI":"10.1007\/BFb0049393"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01108622","volume":"12","author":"A. Garg","year":"1995","unstructured":"A. Garg and R. Tamassia. Upward planarity testing. Order, 12:109\u2013133, 1995.","journal-title":"Order"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"M. Himsolt. Comparing and evaluating layout algorithms within GraphEd. J. Visual Lang. Comput., 6(3), 1995. (Special Issue on Graph Visualization, I. F. Cruz and P. Eades, editors).","DOI":"10.1006\/jvlc.1995.1015"},{"key":"7_CR18","unstructured":"S. Jones, P. Eades, A. Moran, N. Ward, G. Delott, and R. Tamassia. A note on planar graph drawing algorithms. Technical Report 216, Department of Computer Science, University of Queensland, 1991."},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"M. J\u00fcnger and P. Mutzel. Exact and heuristic algorithms for 2-layer straightline crossing minimization. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science, pages 337\u2013348. Springer-Verlag, 1996.","DOI":"10.1007\/BFb0021817"},{"key":"7_CR20","unstructured":"E. Koutsofios and S. North. Drawing graphs with dot, 1993. dot user's manual. ftp:\/\/ftp.research.att.com\/dist\/drawdag\/."},{"key":"7_CR21","unstructured":"S. North. 5114 directed graphs, 1995. Manuscript. ftp:\/\/ftp.research.att.com\/dist\/drawdag\/."},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"I. Rival. Reading, drawing, and order. In I. G. Rosenberg and G. Sabidussi, editors, Algebras and Orders, pages 359\u2013404. Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-94-017-0697-1_9"},{"issue":"2","key":"7_CR23","doi-asserted-by":"crossref","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":"4","key":"7_CR24","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"R. Tamassia and I. G. Tollis. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom., 1(4):321\u2013341, 1986.","journal-title":"Discrete Comput. Geom."},{"issue":"9","key":"7_CR25","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1109\/31.34669","volume":"CAS-36","author":"R. Tamassia","year":"1989","unstructured":"R. Tamassia and I. G. Tollis. Planar grid embedding in linear time. IEEE Trans. Circuits Syst., CAS-36(9):1230\u20131234, 1989.","journal-title":"IEEE Trans. Circuits Syst."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62495-3_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:29:12Z","timestamp":1742599752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62495-3_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540624950","9783540680482"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-62495-3_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}