{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T12:09:35Z","timestamp":1773922175052,"version":"3.50.1"},"reference-count":67,"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)00270-9","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"175-214","source":"Crossref","is-referenced-by-count":16,"title":["Graph layout for applications in compiler construction"],"prefix":"10.1016","volume":"217","author":[{"given":"G.","family":"Sander","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00270-9_BIB1","series-title":"Highly Parallel Computing","author":"Almasi","year":"1989"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB2","series-title":"Compiler Construction, Proc. 5th Internat. Conf. CC'94","first-page":"278","article-title":"Compiler phase embedding with the CoSy compiler model","volume":"Vol. 786","author":"Alt","year":"1994"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB3","series-title":"Tech. Report MIP 9405","article-title":"Hierarchical graph design using HiGraD","author":"Bachl","year":"1994"},{"issue":"4","key":"10.1016\/S0304-3975(98)00270-9_BIB4","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/TSE.1986.6312901","article-title":"A layout algorithm for data flow diagrams","volume":"SE-12","author":"Batini","year":"1986","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0304-3975(98)00270-9_BIB5","series-title":"Numerical Methods","author":"Boehm","year":"1991"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB6","series-title":"Graph drawing, Proc. DIMACS Internat. Workshop 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)00270-9_BIB7","series-title":"Proc. Symp. on Graph Drawing, GD'95","volume":"vol. 1027","year":"1996"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB8","series-title":"Proc. Symp. on Graph Drawing, 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)00270-9_BIB9","series-title":"Parallele Programmierung, Eine Einf\u00fchrung","author":"Br\u00e4unl","year":"1993"},{"issue":"11","key":"10.1016\/S0304-3975(98)00270-9_BIB10","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1109\/TSMC.1980.4308390","article-title":"Automatic display of hierarchized graphs for computer aided decision analysis","volume":"10","author":"Carpano","year":"1980","journal-title":"IEEE Trans. Systems Man Cybernet. SMC"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB11","series-title":"Proc. Symp. on Graph Drawing, GD'95","first-page":"127","article-title":"Graph folding: extending detail and context viewing into a tool for subgraph comparisons","volume":"vol. 1027","author":"Carpendale","year":"1996"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB12","series-title":"Tech. Report CS89-13","article-title":"Drawing graphs nicely using simulated annealing","author":"Davidson","year":"1989"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB13","first-page":"149","article-title":"A heuristic for graph drawing","volume":"41","author":"Eades","year":"1984"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB14","first-page":"89","article-title":"Heuristics for reducing crossings in 2-layered networks","volume":"21-A","author":"Eades","year":"1986","journal-title":"Ars Combin."},{"issue":"4","key":"10.1016\/S0304-3975(98)00270-9_BIB15","first-page":"424","article-title":"How to draw a directed graph","volume":"13","author":"Eades","year":"1990","journal-title":"J. Inform. Process."},{"key":"10.1016\/S0304-3975(98)00270-9_BIB16","article-title":"The median heuristic for drawing 2-layers networks","author":"Eades","year":"1986"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB17","series-title":"Proc. Symp. on Graph Drawing, GD'95","first-page":"254","article-title":"Drawing high degree graphs with low bend numbers","volume":"vol. 1027","author":"F\u00f6\u03b2meier","year":"1996"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB18_1","series-title":"Proc. Symp. on Graph Drawing, GD'95","first-page":"254","article-title":"Generalized fisheye views of graphs","volume":"vol. 1027","author":"Formella","year":"1996"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB18_2","series-title":"Proc. Symp. on Graph Drawing, GD'95","first-page":"242","article-title":"Generalized fisheye views of graphs","volume":"vol. 1027","author":"Formella","year":"1996"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB19","series-title":"Graph drawing, Proc. DIMACS Internat. Workshop GD'94","first-page":"388","article-title":"A fast adaptive layout algorithm for undirected graphs","volume":"vol. 894","author":"Frick","year":"1995"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB20","article-title":"Das interaktive graph visualisierungssytem daVinci V1.2","author":"Fr\u00f6hlich","year":"1993"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB21","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 Practice and Experience"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB22","series-title":"Proc. ACM SIGCHI'86 Conf. on Human Factors in Computing Systems","first-page":"16","article-title":"Generalized fisheye views","author":"Furnas","year":"1986"},{"issue":"3","key":"10.1016\/S0304-3975(98)00270-9_BIB23","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/32.221135","article-title":"A technique for drawing directed graphs","volume":"19","author":"Gansner","year":"1993","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0304-3975(98)00270-9_BIB24","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"3","key":"10.1016\/S0304-3975(98)00270-9_BIB25","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","article-title":"Crossing number is NP-complete","volume":"4","author":"Garey","year":"1983","journal-title":"SIAM J. Algebraic Discrete Meth."},{"key":"10.1016\/S0304-3975(98)00270-9_BIB26","article-title":"On the computational complexity of upward and rectilinear planarity testing","author":"Garg","year":"1994"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB27","series-title":"4th Workshop on Empirical Studies of Programmers","first-page":"121","article-title":"Comprehensibility of visual and textual programs: a test of superlativism against the match-mismatch conjecture","author":"Green","year":"1991"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB28","article-title":"Randomized graph drawing with heavy-duty preprocessing","author":"Harel","year":"1993"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB29","doi-asserted-by":"crossref","DOI":"10.1145\/120782.120788","article-title":"Interactive graph layout: the exploration of large graphs","author":"Henry","year":"1992"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB30","series-title":"Graph drawing, Proc. DIMACS Internat. Workshop GD'94","first-page":"182","article-title":"GraphEd \u2014 a graphical platform for the implementation of graph algorithms","volume":"vol. 894","author":"Himsolt","year":"1995"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB31_1","unstructured":"A. Hyrskykari, Development of program visualization systems, Report, Department of Computer Science, University of Tampere, Finland."},{"key":"10.1016\/S0304-3975(98)00270-9_BIB31_2","series-title":"Presented at the 2nd Czech British Symp. of Visual Aspects of Man-Machine Systems","author":"Hyrskykari","year":"1993"},{"issue":"1","key":"10.1016\/S0304-3975(98)00270-9_BIB32","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0196-6774(82)90011-6","article-title":"The NP-completeness column: an ongoing guide","volume":"3","author":"Johnson","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB33","series-title":"Proc. Symp. on Graph Drawing, GD'95","first-page":"337","article-title":"Exact and heuristic algorithms for 2-layer straightline crossing minimization","volume":"vol. 1027","author":"J\u00fcnger","year":"1996"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB34","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\/S0304-3975(98)00270-9_BIB35","series-title":"Graph drawing, Proc. DIMACS Intern. Workshop GD'94","first-page":"278","article-title":"A simple algorithm for drawing large graphs on small screens","volume":"894","author":"Kaugars","year":"1995"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB36","series-title":"Proc. ACM SIGCHI'91 conf. on Human Factors in Computing Systems","first-page":"173","article-title":"The perspective wall: detail and context smoothly integrated","author":"Mackinlay","year":"1991"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB37","series-title":"Proc. Symp. on Graph Drawing, GD'95","first-page":"385","article-title":"Portable graph layout and editing","volume":"vol. 1027","author":"Madden","year":"1996"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB38","series-title":"Proc. IEEE Workshop on Visual Languages","first-page":"74","article-title":"Graphic object layout with interactive genetic algorithms","author":"Masui","year":"1992"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB39","series-title":"Graph Drawing, Proc. DIMACS Internat. Workshop GD'94","first-page":"270","article-title":"CG: a graph drawing system using graph grammar parsing","volume":"894","author":"McCreary","year":"1995"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB40","article-title":"Data Structures and Algorithms","volume":"vol. 2","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB41","series-title":"Proc. 4th Internat. Conf. on Human-Computer Interaction","first-page":"834","article-title":"Multi-viewpoint perspective display methods: formulation and application to compound graphs, Human aspects in computing","author":"Misue","year":"1991"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB42","series-title":"Proc. IEEE Symp. on Visual Languages","first-page":"336","article-title":"Layout-independent fisheye views of nested graphs","author":"Noik","year":"1993"},{"issue":"S1","key":"10.1016\/S0304-3975(98)00270-9_BIB43","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1002\/spe.4380201307","article-title":"EDGE: an extendible graph editor","volume":"20","author":"Paulisch","year":"1990","journal-title":"Software \u2014 Practice and Experience"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB44","article-title":"A graphical interface for evaluating a genetic algorithm for graph layout","author":"Pazel","year":"1989"},{"issue":"1","key":"10.1016\/S0304-3975(98)00270-9_BIB45","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/32.67575","article-title":"Towards the automatic generation of software diagrams","volume":"17","author":"Protsko","year":"1991","journal-title":"IEEE Trans. Software Eng."},{"issue":"6","key":"10.1016\/S0304-3975(98)00270-9_BIB46","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/TCS.1979.1084652","article-title":"A force directed component placement procedure for printed circuit boards","volume":"CAS-26","author":"Quinn","year":"1979","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB47_1","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-58950-3_371","article-title":"Graph layout through the VCG tool","author":"Sander","year":"1994"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB47_2","series-title":"Graph drawing, Proc. DIMACS Internat. Workshop GD'94","first-page":"194","volume":"vol. 894","author":"Sander","year":"1995"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB48","series-title":"Proc. Symp. on Graph Drawing, GD'95","first-page":"447","article-title":"A fast heuristic for hierarchical manhattan layout","volume":"vol. 1027","author":"Sander","year":"1996"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB49","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-91230-5_7","article-title":"Visualisierungstechniken f\u00fcr den Compilerbau","author":"Sander","year":"1996"},{"issue":"12","key":"10.1016\/S0304-3975(98)00270-9_BIB50","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/198366.198384","article-title":"Graphical fisheye views","volume":"37","author":"Sarkar","year":"1994","journal-title":"Commun. ACM"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB51","article-title":"A survey of graph drawing systems","author":"Scott","year":"1995"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB52","series-title":"Proc. Symp. on Graph Drawing, GD'95","first-page":"472","article-title":"Directed graphs drawing by clan-based decomposition","volume":"vol. 1027","author":"Shieh","year":"1996"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB53","series-title":"Proc. Symp. on Graph Drawing, GD'95","first-page":"487","article-title":"Graph layout adjustment strategies","volume":"vol. 1027","author":"Storey","year":"1996"},{"issue":"4","key":"10.1016\/S0304-3975(98)00270-9_BIB54","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1109\/21.108304","article-title":"Visualization of structural information: automatic drawing of compound digraphs","volume":"21","author":"Sugiyama","year":"1991","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"10.1016\/S0304-3975(98)00270-9_BIB55","doi-asserted-by":"crossref","DOI":"10.1006\/jvlc.1995.1013","article-title":"Graph drawing by magnetic-spring model","author":"Sugiyama","year":"1994"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB56","series-title":"Graph drawing, Proc. DIMACS Internat. Workshop GD'94","first-page":"364","article-title":"A simple and unified method for drawing graphs: magnetic-spring algorithm","volume":"vol. 894","author":"Sugiyama","year":"1995"},{"issue":"2","key":"10.1016\/S0304-3975(98)00270-9_BIB57","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. SMC"},{"issue":"3","key":"10.1016\/S0304-3975(98)00270-9_BIB58","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":"9","key":"10.1016\/S0304-3975(98)00270-9_BIB59","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\/S0304-3975(98)00270-9_BIB60","series-title":"Graph drawing, Proc. DIMACS Internat. Workshop GD'94","volume":"vol. 894","year":"1995"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB61","article-title":"An aesthetic layout algorithm for undirected graphs","author":"Tunkelang","year":"1992"},{"issue":"7","key":"10.1016\/S0304-3975(98)00270-9_BIB62","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/TSMC.1977.4309760","article-title":"Crossing theory and hierarchy mapping","volume":"7","author":"Warfield","year":"1977","journal-title":"IEEE Trans. Systems Man Cybernet. SMC"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB63","series-title":"Compiler Design","author":"Wilhelm","year":"1995"},{"key":"10.1016\/S0304-3975(98)00270-9_BIB64","series-title":"Tech. Report STAN-CS-82-943","article-title":"Drawing planar graphs","author":"Woods","year":"1982"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002709?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002709?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:20:41Z","timestamp":1555420841000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002709"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":67,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0304397598002709"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00270-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}