Publisher
Springer International Publishing
Reference34 articles.
1. Alamdari, S., et al.: How to morph planar graph drawings. SIAM J. Comput. 46(2), 824–852 (2017)
2. Alamdari, S., et al.: Morphing planar graph drawings with a polynomial number of steps. In: Khanna, S. (ed.) ACM-SIAM Symposium on Discrete Algorithms, (SODA 2013). pp. 1656–1667. SIAM (2013)
3. Albertson, M.O.: Chromatic number, independence ratio, and crossing number. Ars Math. Contemp. 1(1) (2008)
4. Angelini, P., Chaplick, S., Cornelsen, S., Lozzo, G.D., Roselli, V.: Morphing contact representations of graphs. In: Symposium on Computational Geometry (SoCG 2019). LIPIcs, vol. 129, pp. 10:1–10:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
5. Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: Morphing planar graph drawings optimally. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) International Colloquium on Automata, Languages, and Programming (ICALP 2014). LNCS, vol. 8572, pp. 126–137. Springer (2014)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献