Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. S.N. Bhatt, S.S. Cosmadakis, ”The complexity of minimizing wire lenghts in VLSI layouts”, Inform. Proc. Letters 25 (1987), 263–267
2. F.J. Brandenburg, ”On polynomial time graph grammars” Proc. 5 STACS, Lecture Notes in Computer Science 294 (1988), 227–236
3. F.J. Brandenburg, ”Nice drawings of graphs are computationally hard”, Proc. 7th Interdisciplinary Workshop in Informatics and Psychology, Lecture Notes in Computer Science (to appear)
4. B. Courcelle, ”An axiomatic definition of context-free rewriting and its application to NLC graph grammars”, Theoret. Comput. Sci. 55 (1987), 141–181
5. D. Dolev, F.T. Leighton, H. Trickey, ”Planar embedding of planar graphs”, Advances in Computing Research, vol. 2, F.P. Preparata (ed.), JAI Press Inc. 1984
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献