Author:
Chaplick Steven,Da Lozzo Giordano,Di Giacomo Emilio,Liotta Giuseppe,Montecchiani Fabrizio
Publisher
Springer International Publishing
Reference23 articles.
1. Angelini, P., et al.: Small universal point sets for k-outerplanar graphs. Discrete Comput. Geometry 60(2), 430–470 (2018). https://doi.org/10.1007/s00454-018-0009-x
2. Lecture Notes in Computer Science;P Angelini,2011
3. Barát, J., Matousek, J., Wood, D.R.: Bounded-degree graphs have arbitrarily large geometric thickness. Electr. J. Comb. 13(1), 1–14 (2006)
4. Bekos, M.A., Bruckdorfer, T., Kaufmann, M., Raftopoulou, C.N.: The book thickness of 1-planar graphs is constant. Algorithmica 79(2), 444–465 (2016). https://doi.org/10.1007/s00453-016-0203-2
5. Bekos, M.A., Da Lozzo, G., Griesbach, S., Gronemann, M., Montecchiani, F., Raftopoulou, C.N.: Book embeddings of nonplanar graphs with small faces in few pages. In: Cabello, S., Chen, D.Z. (eds.) 36th International Symposium on Computational Geometry, SoCG 2020. LIPIcs, vol. 164, pp. 16:1–16:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020). https://doi.org/10.4230/LIPIcs.SoCG.2020.16
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献