Author:
Clementi Andrea E. F.,Penna Paolo,Silvestri Riccardo
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Lecture Notes in Computer Science;P. Alimonti,1997
2. Arikan, E.: Some complexity results about packet radio networks. IEEE Transactions on Information Theory IT-30, 456–461 (1984)
3. Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. Journal of ACM 41, 153–180 (1994)
4. Berman, P., Karpinski, M.: On some tighter inapproximability results. Electronic Colloquium on Computational Complexity 29 (1998)
5. Eades, P., Symvonis, A., Whitesides, S.: Two algorithms for three dimensional orthogonal graph drawing. In: Graph Drawing 1996. LNCS, vol. 1190, pp. 139–154 (1996)
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献