%0 Conference Paper %1 gkkkkkwz-snaul-WG22 %A Goeßmann, Ina %A Klawitter, Jonathan %A Klemz, Boris %A Klesen, Felix %A Kobourov, Stephen G. %A Kryven, Myroslav %A Wolff, Alexander %A Zink, Johannes %B Proc. 48th Int. Workshop Graph-Theoretic Concepts Comput. Sci. (WG'22) %D 2022 %E Bekos, Michael %E Kaufmann, Michael %I Springer-Verlag %K arc_number convex_drawings graph_drawing myown segment_number universal_lower_bounds visual_complexity %P 16 pages %R 10.1007/978-3-031-15914-5_20 %T The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs %V 13453

@inproceedings{gkkkkkwz-snaul-WG22, added-at = {2024-02-18T09:53:56.000+0100}, arxiv = {https://arxiv.org/abs/2202.11604}, author = {Goe{\ss}mann, Ina and Klawitter, Jonathan and Klemz, Boris and Klesen, Felix and Kobourov, Stephen G. and Kryven, Myroslav and Wolff, Alexander and Zink, Johannes}, biburl = {https://www.bibsonomy.org/bibtex/2b7b35afcaf5a4686c45ca648beda97dc/awolff}, booktitle = {Proc. 48th Int. Workshop Graph-Theoretic Concepts Comput. Sci. (WG'22)}, doi = {10.1007/978-3-031-15914-5_20}, editor = {Bekos, Michael and Kaufmann, Michael}, interhash = {66ef25f2df21f996e1f6ef16a250cd01}, intrahash = {b7b35afcaf5a4686c45ca648beda97dc}, keywords = {arc_number convex_drawings graph_drawing myown segment_number universal_lower_bounds visual_complexity}, pages = {16 pages}, publisher = {Springer-Verlag}, series = {Lecture Notes in Computer Science}, slides = {http://www1.pub.informatik.uni-wuerzburg.de/pub/wolff/slides/gkkkkkwz-snaul-WG22-slides.pdf}, timestamp = {2024-04-27T23:03:22.000+0200}, title = {The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs}, volume = 13453, year = 2022 }