Author:
Bonichon Nicolas,Le Saëc Bertrand,Mosbah Mohamed
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference19 articles.
1. A layout algorithm for data-flow diagrams;Batini;IEEE Trans. Software Eng.,1986
2. C. Batini, M. Talamo, R. Tamassia, Computer aided layout of entity-relationship diagrams, J. Systems and Software (1984) 163–173.
3. T. Beidl, M. Kaufmann, Area-efficient static and incremental graph drawings, in: Proceedings of the Fifth European Symposium on Algorithms (ESA’97), Lecture Notes in Computer Science, Vol. 1284, Springer, Berlin, 1997, pp. 37–52.
4. N. Bonichon, B. Le Saëc, M. Mosbah, Wagner's theorem on realizers, in: International Colloquium on Automata, Languages, and ProgrammingA2002 (ICALP2002), 2002.
5. Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu, Orderly spanning trees with applications to graph encoding and graph drawing, in: Proceedings of the 12th Symposium on Discrete Algorithms, ACM and SIAM, 2001, pp. 506–515.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献