Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Biedl, T., Vatshelle, M.: The point-set embeddability problem for plane graphs. International Journal of Computational Geometry and Applications (in press, 2014)
2. Brandenburg, F.: Drawing planar graphs on (8/9)*n2 area. Electronic Notes in Discrete Mathematics 31, 37–40 (2008)
3. Dorn, F.: Dynamic programming and planarity: Improved tree-decomposition based algorithms. Discrete Applied Mathematics 158(7), 800–808 (2010)
4. Fáry, I.: On straight line representation of planar graphs. Acta Scientiarum Mathematicarum (Szeged) 11(4), 229–233 (1948)
5. Felsner, S., Liotta, G., Wismath, S.: Straight-line drawings on restricted integer grids in two and three dimensions. Journal of Graph Algorithms and Applications 7(4), 335–362 (2003)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A SAT Approach to Branchwidth;ACM Transactions on Computational Logic;2019-07-16
2. On Upward Drawings of Trees on a Given Grid;Lecture Notes in Computer Science;2018