{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:20:09Z","timestamp":1742394009642},"reference-count":100,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"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":5221,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,4]]},"DOI":"10.1016\/s0304-3975(98)00272-2","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"235-254","source":"Crossref","is-referenced-by-count":10,"title":["Advances in the theory and practice of graph drawing"],"prefix":"10.1016","volume":"217","author":[{"given":"Roberto","family":"Tamassia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00272-2_BIB1","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1142\/S0218195994000215","article-title":"How to draw a series-parallel digraph","volume":"4","author":"Bertolazzi","year":"1994","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB2","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","article-title":"A framework for solving VLSI graph layout problems","volume":"28","author":"Bhatt","year":"1984","journal-title":"J. Comput. Systems. Sci."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","article-title":"A better heuristic for orthogonal graph drawings","volume":"9","author":"Biedl","year":"1998","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB4","series-title":"Graph Drawing (Proc. GD '94)","first-page":"416","article-title":"Designing graph drawings by layout graph grammars","volume":"vol. 894","author":"Brandenburg","year":"1995"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB5","series-title":"Graph Drawing (Proc. GD '95)","volume":"vol. 1027","year":"1996"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB6","series-title":"Graph Drawing (Proc. GD '95)","first-page":"76","article-title":"An experimental comparison of force-directed and randomized graph drawing algorithms","volume":"vol. 1027","author":"Brandenburg","year":"1996"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB7","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/0020-0190(80)90034-4","article-title":"On the area of binary tree layouts","volume":"11","author":"Brent","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB8","series-title":"Proc. 12th Ann. ACM Symp. Comput. Geom.","first-page":"319","article-title":"Convex drawings of graphs in two and three dimensions","author":"Chrobak","year":"1996"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB9","series-title":"Graph Drawing (Proc. GD '94)","first-page":"1","article-title":"Three-dimensional graph drawing","volume":"vol. 894","author":"Cohen","year":"1995"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01404753","article-title":"Rigidity and energy","volume":"66","author":"Connelly","year":"1982","journal-title":"Invent. Math."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB11","first-page":"42","article-title":"Statics of frameworks and motions of panel structures, a projective geometric introduction","volume":"6","author":"Crapo","year":"1982","journal-title":"Struct. Topol."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB12","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0925-7721(92)90021-J","article-title":"A note on optimal area algorithms for upward drawings of binary trees","volume":"2","author":"Crescenzi","year":"1992","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB13","series-title":"Proc. ACM SIGMOD Conf. on Management of Data","first-page":"71","article-title":"DOODLE: a visual language for object-oriented databases","author":"Cruz","year":"1992"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB14","series-title":"Special Issue on Graph Visualization","volume":"6","year":"1995"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB15","series-title":"Graph Drawing (Proc. GD '94)","first-page":"404","article-title":"Drawing graphs by example efficiently: trees and planar acyclic digraphs","volume":"vol. 894","author":"Cruz","year":"1995"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB16","series-title":"Efficient constraint resolution in visual graph drawing","author":"Cruz","year":"1996"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB17","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0925-7721(97)00006-0","article-title":"On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees","volume":"8","author":"Das","year":"1997","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"10.1016\/S0304-3975(98)00272-2_BIB18","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1145\/234535.234538","article-title":"Drawing graphics nicely using simulated annealing","volume":"15","author":"Davidson","year":"1996","journal-title":"ACM Trans. Graph."},{"issue":"1","key":"10.1016\/S0304-3975(98)00272-2_BIB19","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","article-title":"How to draw a planar graph on a grid","volume":"10","author":"de Fraysseix","year":"1990","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB20","series-title":"Proc. IEEE Symp. on Visual Languages","first-page":"330","article-title":"Constraint-driven diagram layout","author":"Dengler","year":"1993"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB21","series-title":"Graph Drawing (Proc. GD '97)","volume":"vol. 1353","year":"1998"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB22","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":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB23","series-title":"Graph Drawing","author":"Di Battista","year":"1998"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB24","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","article-title":"An experimental comparison of four graph drawing algorithms","volume":"7","author":"Di Battista","year":"1997","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB25","series-title":"Graph Drawing (Proc. GD '94)","first-page":"328","article-title":"Proximity drawability: a survey","volume":"vol. 894","author":"Di Battista","year":"1995"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB26","unstructured":"G. Di Battista, P. Mutzel (Eds.), Special Issue on Selected Papers from the 1997 Symposium on Graph Drawing, J. Graph Algorithms Appl., to appear."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB27","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","article-title":"Algorithms for plane representations of acyclic digraphs","volume":"61","author":"Di Battista","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB28","series-title":"Special Issue on Graph Drawing","volume":"vol. 16","year":"1996"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB29","series-title":"Special Issue on Geometric Representations of Graphs","volume":"vol. 9","year":"1998"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB30","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF02187850","article-title":"Area requirement and symmetry display of planar upward drawings","volume":"7","author":"Di Battista","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(92)90072-4","article-title":"Constrained visibility representations of graphs","volume":"41","author":"Di Battista","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB32","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1142\/S0218195995000039","article-title":"A linear-time algorithm for testing the inscribability of trivalent polyhedra","volume":"5","author":"Dillencourt","year":"1995","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB33","series-title":"Graph Drawing (Proc. GD '95)","article-title":"Drawing stressed planar graphs in three dimensions","volume":"vol. 1027","author":"Eades","year":"1996"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB34","series-title":"Proc. IEEE Workshop on Visual Languages","first-page":"13","article-title":"How to draw a directed graph","author":"Eades","year":"1989"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB35","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0020-0190(96)00133-0","article-title":"The techniques of Kolmogorov and Bardzin for three dimensional orthogonal graph drawings","volume":"60","author":"Eades","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB36","article-title":"Rectilinear planar drawings with few bends in each edge","author":"Even","year":"1994"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB37","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/0222063","article-title":"Drawing graphs in the plane with high resolution","volume":"22","author":"Formann","year":"1993","journal-title":"SIAM J. Comput."},{"issue":"11","key":"10.1016\/S0304-3975(98)00272-2_BIB38","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":"Software \u2014 Pract. Exp."},{"issue":"11","key":"10.1016\/S0304-3975(98)00272-2_BIB39","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1002\/spe.4380181104","article-title":"DAG \u2014 A program that draws directed graphs","volume":"18","author":"Gansner","year":"1988","journal-title":"Software \u2014 Pract. Exp."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB40","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1142\/S0218195996000228","article-title":"Planar upward tree drawings with optimal area","volume":"6","author":"Garg","year":"1996","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB41","series-title":"Graph Drawing '93, Proc. ALCOM Workshop on Graph Drawing","article-title":"Efficient computation of planar straight-line upward drawings","author":"Garg","year":"1993"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB42","series-title":"Proc. 2nd Ann. Eur. Symp. Algorithms","first-page":"12","article-title":"Planar drawings and angular resolution: algorithms and bounds","volume":"vol. 855","author":"Garg","year":"1994"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB43","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01108622","article-title":"Upward planarity testing","volume":"12","author":"Garg","year":"1995","journal-title":"Order"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB44","series-title":"Convex Polytopes","author":"Gr\u00fcnbaum","year":"1967"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB45","series-title":"Proc. Workshop on Orders, Algorithms and Applications","first-page":"53","article-title":"Upward drawings to fit surfaces","volume":"vol. 831","author":"Hashemi","year":"1994"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB46","series-title":"Graph Drawing (Proc. GD '94)","first-page":"96","article-title":"Regular edge labelings and drawings of planar graphs","volume":"vol. 894","author":"He","year":"1995"},{"issue":"3","key":"10.1016\/S0304-3975(98)00272-2_BIB47","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1006\/jvlc.1995.1015","volume":"6","author":"Himsolt","year":"1995","journal-title":"J. Visual Lang. Comput."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB48","series-title":"Graph Drawing (Proc. GD '94)","first-page":"182","article-title":"GraphEd: a graphical platform for the implementation of graph algorithms","volume":"vol. 894","author":"Himsolt","year":"1995"},{"issue":"2","key":"10.1016\/S0304-3975(98)00272-2_BIB49","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1090\/S0273-0979-1992-00303-8","article-title":"A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere","volume":"27","author":"Hodgson","year":"1992","journal-title":"Bull. (New Series) Amer. Maths. Soc."},{"issue":"3","key":"10.1016\/S0304-3975(98)00272-2_BIB50","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","article-title":"Dividing a graph into triconnected components","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/S0304-3975(98)00272-2_BIB51","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"},{"issue":"4","key":"10.1016\/S0304-3975(98)00272-2_BIB52","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF01758769","article-title":"A paradigm for robust geometric algorithms","volume":"7","author":"Hopcroft","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB53","series-title":"Graph Drawing (Proc. GD '94)","first-page":"25","article-title":"3D layout of reachability graphs of communicating processes","volume":"vol. 894","author":"J\u00e9ron","year":"1995"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB54","article-title":"A note on planar graph drawing algorithms","author":"Jones","year":"1991"},{"issue":"1","key":"10.1016\/S0304-3975(98)00272-2_BIB55","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02086607","volume":"16","author":"J\u00fcnger","year":"1996","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/S0304-3975(98)00272-2_BIB56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","article-title":"2-Layer straightline crossing minimization: performance of exact and heuristic algorithms","volume":"1","author":"J\u00fcnger","year":"1997","journal-title":"J. Graph Algorithms Appl."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB57","article-title":"Visualizing Abstract Objects and Relations","author":"Kamada","year":"1989","journal-title":"World Scientific Series in Computer Science"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB58","article-title":"Algorithms for drawing planar graphs","author":"Kant","year":"1993"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB59","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"Kant","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB60","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(87)90008-2","article-title":"Fundamentals of planar ordered sets","volume":"63","author":"Kelly","year":"1987","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/S0304-3975(98)00272-2_BIB61","doi-asserted-by":"crossref","first-page":"636","DOI":"10.4153\/CJM-1975-074-0","article-title":"Planar lattices","volume":"27","author":"Kelly","year":"1975","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB62","series-title":"Proc. 21st Ann. IEEE Symp. Found. Comput. Sci.","first-page":"270","article-title":"Area-efficient graph layouts (for VLSI)","author":"Leiserson","year":"1980"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB63","series-title":"Graph Drawing (Proc. GD '94)","first-page":"376","article-title":"Integration of declarative and algorithmic approaches for layout creation","volume":"vol. 894","author":"Lin","year":"1995"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB64","series-title":"Proc. 4th Workshop Algorithms Data Struct.","first-page":"239","article-title":"Computing proximity drawings of trees in the 3-dimensional space","volume":"vol. 955","author":"Liotta","year":"1995"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB65","unstructured":"G. Liotta, S. Whitesides (Eds.) Special Issue on Selected Papers from the 1998 Symp. on Graph Drawing, J. Graph Algorithms Appl., to appear."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB66","doi-asserted-by":"crossref","DOI":"10.1007\/BF02006154","article-title":"Theoretical results on at most I-bend embeddability of graphs","author":"Liu","year":"1990"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB67","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02006104","article-title":"General theoretical results on rectilinear embeddability of graphs","volume":"7","author":"Liu","year":"1991","journal-title":"Acta Math. Appl. Sinica"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB68","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/S0895480193242931","article-title":"On the angular resolution of planar graphs","volume":"7","author":"Malitz","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB69","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S1045-926X(05)80006-0","article-title":"A formal specification for network diagrams that facilitates automated design","volume":"2","author":"Marks","year":"1991","journal-title":"J. Visual Lang. Comput."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB70","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1080\/14786446408643663","article-title":"On reciprocal figures and diagrams of forces","volume":"27","author":"Maxwell","year":"1864","journal-title":"Philos. Mag. Ser."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB71","series-title":"Graph Drawing (Proc. GD '96)","volume":"vol. 1190","year":"1997"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB72","first-page":"125","article-title":"A quantitative Steinitz' theorem","volume":"35","author":"Onn","year":"1994","journal-title":"Beitr\u00e4ge zur Algebra und Geometric"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(98)00272-2_BIB73","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0925-7721(97)00017-5","article-title":"Algorithms for area-efficient orthogonal drawings","volume":"9","author":"Papakostas","year":"1998","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB74","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"issue":"2","key":"10.1016\/S0304-3975(98)00272-2_BIB75","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TSE.1981.234519","article-title":"Tidier drawing of trees","volume":"SE-7","author":"Reingold","year":"1981","journal-title":"IEEE Trans. Software. Eng."},{"issue":"3","key":"10.1016\/S0304-3975(98)00272-2_BIB76","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1006\/jvlc.1995.1017","volume":"6","author":"Reiss","year":"1995","journal-title":"J. Visual Lang. Comput."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB77","series-title":"Algorithms and Order","first-page":"3","article-title":"Graphical data structures for ordered sets","author":"Rival","year":"1989"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB78","series-title":"Algebras and Orders","first-page":"359","article-title":"Reading, drawing, and order","author":"Rival","year":"1993"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB79","series-title":"Proc. ACM Conf. on Human Factors in Computing Systems","first-page":"189","article-title":"Cone trees: animated 3D visualizations of hierarchical information","author":"Robertson","year":"1991"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB80","series-title":"Proc. 1st ACM-SIAM Symp. Discrete Algorithms","first-page":"138","article-title":"Embedding planar graphs on the grid","author":"Schnyder","year":"1990"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB81","series-title":"Graph Drawing (Proc. GD '94)","first-page":"131","article-title":"Crossing numbers of graphs, lower bound techniques and algorithms: a survey","volume":"vol. 894","author":"Shahrokhi","year":"1995"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB82","article-title":"Arrangements of Planar Graphs on the Planar Lattice","author":"Shiloach","year":"1976"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB83","series-title":"Vorlesungen \u00fcber die Theorie der Polyeder","author":"Steinitz","year":"1934"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB84","article-title":"Graph drawing","author":"Tamassia","year":"1998"},{"issue":"3","key":"10.1016\/S0304-3975(98)00272-2_BIB85","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."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB86","first-page":"217","article-title":"Drawing algorithms for planar st-graphs","volume":"2","author":"Tamassia","year":"1990","journal-title":"Aust. J. Combin."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB87","series-title":"Proc. IEEE Internat. Symp. on Circuits Systems","article-title":"Planar orthogonal drawings of graphs","author":"Tamassia","year":"1990"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB88","first-page":"815","article-title":"Graph drawing","author":"Tamassia","year":"1997"},{"issue":"1","key":"10.1016\/S0304-3975(98)00272-2_BIB89","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/A:1009760732249","article-title":"Constraints in graph drawing algorithms","volume":"3","author":"Tamassia","year":"1998","journal-title":"Constraints"},{"issue":"1","key":"10.1016\/S0304-3975(98)00272-2_BIB90","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/21.87055","article-title":"Automatic graph drawing and readability of diagrams","volume":"SMC-18","author":"Tamassia","year":"1988","journal-title":"IEEE Trans. Systems. Man Cybernet."},{"issue":"4","key":"10.1016\/S0304-3975(98)00272-2_BIB91","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\/S0304-3975(98)00272-2_BIB92","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1109\/31.34669","article-title":"Planar grid embedding in linear time","volume":"CAS-36","author":"Tamassia","year":"1989","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB93","series-title":"Proc. 27th Allerton Conf. Commun. Control Comput.","first-page":"48","article-title":"Tessellation representations of planar graphs","author":"Tamassia","year":"1989"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB94","series-title":"Graph Drawing (Proc. GD '94)","volume":"vol. 894","year":"1995"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB95","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0020-0190(91)90059-Q","article-title":"Lower bounds for planar orthogonal drawings of graphs","volume":"39","author":"Tamassia","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB96","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\/S0304-3975(98)00272-2_BIB97","first-page":"304","article-title":"Convex representations of graphs","volume":"10","author":"Tutte","year":"1960"},{"key":"10.1016\/S0304-3975(98)00272-2_BIB98","first-page":"743","article-title":"How to draw a graph","volume":"13","author":"Tutte","year":"1963"},{"issue":"2","key":"10.1016\/S0304-3975(98)00272-2_BIB99","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","article-title":"Universality considerations in VLSI circuits","volume":"C-30","author":"Valiant","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(98)00272-2_BIB100","first-page":"13","article-title":"Motions and stresses of projected polyhedra","volume":"7","author":"Whitney","year":"1982","journal-title":"Struct. Topology"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002722?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002722?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T14:17:52Z","timestamp":1580825872000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002722"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":100,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0304397598002722"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00272-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}