{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T06:24:56Z","timestamp":1725690296840},"publisher-location":"Wiesbaden","reference-count":19,"publisher":"Vieweg+Teubner Verlag","isbn-type":[{"type":"print","value":"9783519026464"},{"type":"electronic","value":"9783322912305"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/978-3-322-91230-5_7","type":"book-chapter","created":{"date-parts":[[2012,7,4]],"date-time":"2012-07-04T21:46:58Z","timestamp":1341438418000},"page":"114-127","source":"Crossref","is-referenced-by-count":1,"title":["Visualisierungstechniken f\u00fcr den Compilerbau"],"prefix":"10.1007","author":[{"given":"Georg","family":"Sander","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Brandenburg, F.J., ed.: Proc. Symposium on Graph Drawing, GD\u201995, Lecture Notes in Computer Science 1027, Springer, 1996","DOI":"10.1007\/BFb0021783"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0004-3702(87)90091-9","volume":"32","author":"E Davis","year":"1987","unstructured":"Davis, E.: Constraint Propagation with Interval Labels, Artificial Intelligence 32, pp. 281\u2013331, 1987","journal-title":"Artificial Intelligence"},{"key":"7_CR3","volume-title":"Drawing Graphs Nicely Using Simulated Annealing, Technical Report CS89-13, Department of Applied Mathematics and Computer Science","author":"R Davidson","year":"1989","unstructured":"Davidson, R.; Harel, D.: Drawing Graphs Nicely Using Simulated Annealing, Technical Report CS89\u201313, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, 1989"},{"key":"7_CR4","first-page":"149","volume":"41","author":"P Eades","year":"1984","unstructured":"Eades, P.: A Heuristic for Graph Drawing, Congressus Numerantium 41, pp. 149\u2013160, 1984.","journal-title":"Congressus Numerantium"},{"issue":"4","key":"7_CR5","first-page":"424","volume":"13","author":"P Eades","year":"1990","unstructured":"Eades, P.; Sugiyama, K.: How to Draw a Directed Graph, Journal of Information Processing, 13 (4), pp. 424\u2013437, 1990","journal-title":"Journal of Information Processing"},{"key":"7_CR6","volume-title":"The Median Heuristic for Drawing 2-Layers Networks, Technical Report 69","author":"P Eades","year":"1986","unstructured":"Eades, P.; Wormald N.: The Median Heuristic for Drawing 2-Layers Networks, Technical Report 69, Department of Computer Science, University of Queensland, 1986"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Frick, A.; Ludwig, A.; Mehldau, H.: A Fast Adaptive Layout Algorithm for Undirected Graphs, in [18], pp. 388\u2013403, 1995","DOI":"10.1007\/3-540-58950-3_393"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J.; Reingold, E.M.: Graph Drawing by Force-Directed Placement, Software \u2014 Practice and Experience 21, pp. 1129\u20131164, 1991","journal-title":"Software \u2014 Practice and Experience"},{"issue":"3","key":"7_CR9","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"E.R. Gansner","year":"1993","unstructured":"Gansner, E.R.; Koutsofios, E.; North, S.C.; Vo, K.-P.: A Technique for Drawing Directed Graphs, IEEE Trans. on Software Engineering, 19(3), pp. 214\u2013230, 1993","journal-title":"IEEE Trans. on Software Engineering"},{"key":"7_CR10","unstructured":"Green, T.R.; Petre, M.; Bellamy, R.K.E.: Comprehensibility of Visual and Textual Programs: A Test of Superlativism Against the Match-Mismatch Conjecture, Fourth Workshop on Empirical Studies of Programmers, pp. 121\u2013146, 1991"},{"key":"7_CR11","unstructured":"Hyrskykari, A.: Development of Program Visualization Systems, Report, Department of Computer Science, University of Tampere, Finland, pr\u00e4sentiert auf dem 2nd Czech British Symposium of Visual Aspects of Man-Machine Systems, Prag, 1993"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Sander, G.: Graph Layout through the VCG Tool, Technical Report A0394, FB 14 Informatik, University of Saarbr\u00fccken, Germany, 1994, eine erweiterte Zusammenfassung ist in [18], pp. 194\u2013205, 1995.","DOI":"10.1007\/3-540-58950-3_371"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Sander, G.; Alt, M; Ferdinand. C; Wilhelm, R.: CLaX\u2013A Visualized Compiler in [1], pp. 459\u2013462, 1996.","DOI":"10.1007\/BFb0021829"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Sander, G.: A Fast Heuristic for Hierarchical Manhattan Layout, in [1], pp. 447\u2013458, 1996","DOI":"10.1007\/BFb0021828"},{"issue":"12","key":"7_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/198366.198384","volume":"37","author":"M Sarkar","year":"1994","unstructured":"Sarkar, M.; Brown, M. H.: Graphical Fisheye Views, Communications of the ACM, vol. 37, no. 12, pp. 73\u201384, 1994","journal-title":"Communications of the ACM"},{"issue":"2","key":"7_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K Sugiyama","year":"1981","unstructured":"Sugiyama, K.; Tagawa, S.; Toda, M.: Methods for Visual Understanding of Hierarchical Systems, IEEE Trans. Sys., Man, and Cybernetics, SMC 11 (2), pp. 109\u2013125, 1981.","journal-title":"IEEE Trans. Sys., Man, and Cybernetics, SMC"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Sugiyama, K.; Misue, K.: A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm, in [18], pp. 364\u2013375, 1995","DOI":"10.1007\/3-540-58950-3_391"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Tamassia, R.; Tollis, I.G., eds.: Graph Drawing, Proc. DIMACS Intern. Workshop GD\u201994, Lecture Notes in Computer Science 894, Springer, 1995.","DOI":"10.1007\/3-540-58950-3"},{"issue":"7","key":"7_CR19","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1109\/TSMC.1977.4309760","volume":"7","author":"JN Warfield","year":"1977","unstructured":"Warfield, J. N.: Crossing Theory and Hierarchy Mapping, IEEE Trans. Sys., Man, and Cybernetics, SMC 7 (7), pp. 505\u2013523, 1977.","journal-title":"IEEE Trans. Sys., Man, and Cybernetics, SMC"}],"container-title":["Ausgezeichnete Informatikdissertationen 1996"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-322-91230-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T14:21:32Z","timestamp":1558102892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-322-91230-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783519026464","9783322912305"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-322-91230-5_7","relation":{},"subject":[],"published":{"date-parts":[[1998]]}}}