Funder
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference31 articles.
1. Annexstein, F., Berman, K., Swaminathan, R.: Independent spanning trees with small stretch factors. Technical Report 96-13, DIMACS (June 1996)
2. Badent, M., Brandes, U., Cornelsen, S.: More canonical ordering. J. Graph Algorithms Appl. 15(1), 97–126 (2011)
3. Bender, M.A., Cole, R., Demaine, E.D., Farach-Colton, M., Zito, J.: Two simplified algorithms for maintaining order in a list. In: Proceedings of the 10th European Symposium on Algorithms (ESA’02), pp. 152–164 (2002)
4. Biedl, T., Derka, M.: The (3,1)-ordering for 4-connected planar triangulations. J. Graph Algorithms Appl. 20(2), 347–362 (2016)
5. Biedl, T., Schmidt, J.M.: Small-area orthogonal drawings of 3-connected graphs. In: Proceedings of the 23rd International Symposium on Graph Drawing (GD’15), pp. 153–165 (2015)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献