{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:29Z","timestamp":1771036349550,"version":"3.50.1"},"reference-count":50,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5951,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1016\/s0925-7721(96)00005-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"303-325","source":"Crossref","is-referenced-by-count":120,"title":["An experimental comparison of four graph drawing algorithms"],"prefix":"10.1016","volume":"7","author":[{"given":"Giuseppe","family":"Di Battista","sequence":"first","affiliation":[]},{"given":"Ashim","family":"Garg","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[]},{"given":"Emanuele","family":"Tassinari","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Vargiu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(96)00005-3_BIB1","series-title":"Conceptual Database Design, an Entity-Relationship Approach","author":"Batini","year":"1992"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB2","series-title":"Proc. 4th Internat. Conf. on the Entity Relationship Approach","article-title":"What is a good diagram? A pragmatic approach","author":"Batini","year":"1985"},{"issue":"4","key":"10.1016\/S0925-7721(96)00005-3_BIB3","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/TSE.1986.6312901","article-title":"A layout algorithm for data-flow diagrams","volume":"12","author":"Batini","year":"1986","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/S0925-7721(96)00005-3_BIB4","series-title":"Proc. 11th Ann. ACM Sympos. Comput. Geom.","first-page":"306","article-title":"An experimental comparison of three graph drawing algorithms","author":"Di Battista","year":"1995"},{"issue":"8","key":"10.1016\/S0925-7721(96)00005-3_BIB5","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/32.403790","article-title":"Parametric graph drawing","volume":"21","author":"Bertolazzi","year":"1995","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/S0925-7721(96)00005-3_BIB6","series-title":"Proc. 2nd Annu. European Sympos. Algorithms (ESA '94)","first-page":"24","article-title":"A better heuristic for orthogonal graph drawings","volume":"855","author":"Biedl","year":"1994"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB7","series-title":"Proc. Graph Drawing 1995","first-page":"76","article-title":"An experimental comparison of force-directed and randomized graph drawing algorithms","volume":"1027","author":"Brandenburg","year":"1996"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB8","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF00264230","article-title":"Drawing planar graphs nicely","volume":"22","author":"Chiba","year":"1985","journal-title":"Acta Inform."},{"key":"10.1016\/S0925-7721(96)00005-3_BIB9","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","article-title":"A linear-time algorithm for drawing planar graphs","volume":"54","author":"Chrobak","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(96)00005-3_BIB10","series-title":"Graph Drawing (Proc. GD '94)","first-page":"1","article-title":"Three-dimensional graph drawing","volume":"894","author":"Cohen","year":"1995"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB11","series-title":"Technical Report","article-title":"Drawing graphs nicely using simulated annealing","author":"Davidson","year":"1989"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB12","series-title":"Proc. 20th Ann. ACM Sympos. Theory Comput.","first-page":"426","article-title":"Small sets supporting Fary embeddings of planar graphs","author":"de Fraysseix","year":"1988"},{"issue":"5","key":"10.1016\/S0925-7721(96)00005-3_BIB13","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","article-title":"Algorithms for drawing graphs: an annotated bibliography","volume":"4","author":"Di Battista","year":"1994","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB14","series-title":"Proc. IEEE Workshop on Visual Languages (VL '90)","first-page":"60","article-title":"The architecture of Diagram Server","author":"Di Battista","year":"1990"},{"issue":"3","key":"10.1016\/S0925-7721(96)00005-3_BIB15","doi-asserted-by":"crossref","DOI":"10.1006\/jvlc.1995.1016","article-title":"Diagram Server","volume":"6","author":"Di Battista","year":"1995","journal-title":"J. Visual Languages and Computing"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB16","first-page":"147","article-title":"Planar embedding of planar graphs","volume":"Vol. 2","author":"Dolev","year":"1985"},{"issue":"11","key":"10.1016\/S0925-7721(96)00005-3_BIB17","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/spe.4380211102","article-title":"Graph drawing by force-directed placement","volume":"21","author":"Fruchterman","year":"1991","journal-title":"Softw.\u2014Pract. Exp."},{"key":"10.1016\/S0925-7721(96)00005-3_BIB18","series-title":"Structured Systems Analysis","author":"Gane","year":"1979"},{"issue":"11","key":"10.1016\/S0925-7721(96)00005-3_BIB19","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1002\/spe.4380181104","article-title":"DAG\u2014a program that draws directed graphs","volume":"18","author":"Gansner","year":"1988","journal-title":"Softw.\u2014Pract. Exp."},{"issue":"3","key":"10.1016\/S0925-7721(96)00005-3_BIB20","doi-asserted-by":"crossref","DOI":"10.1006\/jvlc.1995.1015","article-title":"Comparing and evaluating layout algorithms within GraphEd","volume":"6","author":"Himsolt","year":"1995","journal-title":"J. Visual Languages and Computing"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB21","series-title":"Graph Drawing (Proc. GD '94)","first-page":"182","article-title":"GraphEd: a graphical platform for the implementation of graph algorithms","volume":"894","author":"Himsolt","year":"1995"},{"issue":"4","key":"10.1016\/S0925-7721(96)00005-3_BIB22","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB23","article-title":"A note on planar graph drawing algorithms","author":"Jones","year":"1991"},{"issue":"1","key":"10.1016\/S0925-7721(96)00005-3_BIB24","doi-asserted-by":"crossref","DOI":"10.1007\/BF02086607","article-title":"Maximum planar subgraphs and nice embeddings: Practical layout tools","volume":"16","author":"J\u00fcnger","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB25","series-title":"Graph Drawing (Proc. GD '94)","first-page":"119","article-title":"The polyhedral approach to the maximum planar subgraph problem: New chances for related problems","volume":"894","author":"J\u00fcnger","year":"1995"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB26","series-title":"Proc. Graph Drawing 1995","first-page":"337","article-title":"Exact and heuristic algorithms for 2-layer straightline crossing minimization","volume":"1027","author":"J\u00fcnger","year":"1996"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB27","article-title":"Visualizing Abstract Objects and Relations","author":"Kamada","year":"1989","journal-title":"World Scientific Series in Computer Science"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB28","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","article-title":"An algorithm for drawing general undirected graphs","volume":"31","author":"Kamada","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0925-7721(96)00005-3_BIB29","article-title":"Algorithms for drawing planar graphs","author":"Kant","year":"1993"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB30","series-title":"Proc. 19th Internat. Workshop Graph-Theoret. Concepts Comput. Sci. (WG '93)","article-title":"A more compact visibility representation","author":"Kant","year":"1993"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB31","series-title":"Proc. 2nd Workshop Algorithms Data Struct.","first-page":"286","article-title":"Planar graph augmentation problems","volume":"519","author":"Kant","year":"1991"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB32","series-title":"Proc. 21st Ann. IEEE Sympos. Found. Comput. Sci.","first-page":"270","article-title":"Area-efficient graph layouts (for VLSI)","author":"Leiserson","year":"1980"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB33","article-title":"A fast algorithm for planarization of sparse diagrams","author":"Nardelli","year":"1984"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB34","series-title":"Graph Drawing (Proc. GD '94)","first-page":"40","article-title":"Improved algorithms and bounds for orthogonal drawings","volume":"894","author":"Papakostas","year":"1995"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB35","series-title":"Improved algorithms and bounds for orthogonal drawings","author":"Papakostas","year":"1995"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB36","first-page":"31","article-title":"New methods for drawing a planar graph given the cyclic order of the edges at each vertex","volume":"56","author":"Read","year":"1987"},{"issue":"4","key":"10.1016\/S0925-7721(96)00005-3_BIB37","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","article-title":"Rectilinear planar layouts and bipolar orientations of planar graphs","volume":"1","author":"Rosenstiehl","year":"1986","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"10.1016\/S0925-7721(96)00005-3_BIB38","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","article-title":"Methods for visual understanding of hierarchical systems","volume":"11","author":"Sugiyama","year":"1981","journal-title":"IEEE Trans. Systems Man Cybernet"},{"issue":"3","key":"10.1016\/S0925-7721(96)00005-3_BIB39","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","article-title":"On embedding a graph in the grid with the minimum number of bends","volume":"16","author":"Tamassia","year":"1987","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0925-7721(96)00005-3_BIB40","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/21.87055","article-title":"Automatic graph drawing and readability of diagrams","volume":"18","author":"Tamassia","year":"1988","journal-title":"IEEE Trans. Systems Man Cybernet"},{"issue":"4","key":"10.1016\/S0925-7721(96)00005-3_BIB41","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","article-title":"A unified approach to visibility representations of planar graphs","volume":"1","author":"Tamassia","year":"1986","journal-title":"Discrete Comput. Geom."},{"issue":"9","key":"10.1016\/S0925-7721(96)00005-3_BIB42","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1109\/31.34669","article-title":"Planar grid embedding in linear time","volume":"36","author":"Tamassia","year":"1989","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB43","series-title":"Graph Drawing (Proc. GD '94)","volume":"894","year":"1995"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB44","unstructured":"I.G. Tollis, Personal communication (1995)."},{"key":"10.1016\/S0925-7721(96)00005-3_BIB45","series-title":"Proc. Internat. Conf. on Electronic Publishing","first-page":"171","article-title":"Drag: A graph drawing system","author":"Trickey","year":"1988"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB46","first-page":"743","article-title":"How to draw a graph","volume":"13","author":"Tutte","year":"1963"},{"issue":"2","key":"10.1016\/S0925-7721(96)00005-3_BIB47","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","article-title":"Universality considerations in VLSI circuits","volume":"30","author":"Valiant","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"10.1016\/S0925-7721(96)00005-3_BIB48","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1002\/spe.4380200705","article-title":"A node-positioning algorithm for general trees","volume":"20","author":"Walker","year":"1990","journal-title":"Softw.\u2014Pract. Exp."},{"key":"10.1016\/S0925-7721(96)00005-3_BIB49","series-title":"Proc. 1st Ann. ACM Sympos. Comput. Geom.","first-page":"147","article-title":"Characterizing bar line-of-sight graphs","author":"Wismath","year":"1985"},{"key":"10.1016\/S0925-7721(96)00005-3_BIB50","article-title":"Drawing planar graphs","author":"Woods","year":"1982"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772196000053?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772196000053?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T23:27:16Z","timestamp":1555975636000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772196000053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":50,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0925772196000053"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(96)00005-3","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}