Author:
Buchheim Christoph,Ebner Dietmar,Jünger Michael,Klau Gunnar W.,Mutzel Petra,Weiskircher René
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Batini, C., Talamo, M., Tamassia, R.: Computer aided layout of entity-relationship diagrams. Journal of Systems and Software 4, 163–173 (1984)
2. Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. Journal of Computer and System Sciences 28, 300–343 (1984)
3. Bodlaender, H., Grigoriev, A.: Algorithms for graphs embeddable with few crossings per edge. Research Memoranda 036, Maastricht: METEOR, Maastricht Research School of Economics of Technology and Organization (2004)
4. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences 13(3), 335–379 (1976)
5. Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Computational Geometry: Theory and Applications 7(5-6), 303–325 (1997)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献