Goessmann, I., Klawitter, J., Klemz, B., Klesen, F., Kobourov, S., Kryven, M., Wolff, A., and Zink, J.. The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. Retrieved from https://par.nsf.gov/biblio/10354864. 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG) . Web. doi:10.1007/978-3-031-15914-5_20.

Goessmann, I., Klawitter, J., Klemz, B., Klesen, F., Kobourov, S., Kryven, M., Wolff, A., & Zink, J.. The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs. 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), (). Retrieved from https://par.nsf.gov/biblio/10354864. https://doi.org/10.1007/978-3-031-15914-5_20

Goessmann, I., Klawitter, J., Klemz, B., Klesen, F., Kobourov, S., Kryven, M., Wolff, A., and Zink, J.. "The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs". 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG) (). Country unknown/Code not available. https://doi.org/10.1007/978-3-031-15914-5_20. https://par.nsf.gov/biblio/10354864.

@article{osti_10354864,
place = {Country unknown/Code not available}, title = {The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs}, url = {https://par.nsf.gov/biblio/10354864}, DOI = {10.1007/978-3-031-15914-5_20}, abstractNote = {}, journal = {48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG)}, author = {Goessmann, I. and Klawitter, J. and Klemz, B. and Klesen, F. and Kobourov, S. and Kryven, M. and Wolff, A. and Zink, J.}, }