{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:32:24Z","timestamp":1742913144366,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031159138"},{"type":"electronic","value":"9783031159145"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15914-5_20","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"271-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Segment Number: Algorithms and\u00a0Universal Lower Bounds for\u00a0Some Classes of\u00a0Planar Graphs"],"prefix":"10.1007","author":[{"given":"Ina","family":"Goe\u00dfmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8917-5269","authenticated-orcid":false,"given":"Jonathan","family":"Klawitter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4532-3765","authenticated-orcid":false,"given":"Boris","family":"Klemz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1136-5673","authenticated-orcid":false,"given":"Felix","family":"Klesen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0477-2724","authenticated-orcid":false,"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4778-3703","authenticated-orcid":false,"given":"Myroslav","family":"Kryven","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7398-718X","authenticated-orcid":false,"given":"Johannes","family":"Zink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"key":"20_CR1","unstructured":"Adnan, M.A.: Minimum segment drawings of outerplanar graphs. Master\u2019s thesis, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), Dhaka (2008). http:\/\/lib.buet.ac.bd:8080\/xmlui\/bitstream\/handle\/123456789\/1565\/Full%20%20Thesis%20.pdf?sequence=1 &isAllowed=y"},{"issue":"5","key":"20_CR2","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1002\/jgt.3190170508","volume":"17","author":"HJ Broersma","year":"1993","unstructured":"Broersma, H.J., Duijvestijn, A.J.W., G\u00f6bel, F.: Generating all 3-connected 4-regular planar graphs from the octahedron graph. J. Graph Theory 17(5), 613\u2013620 (1993). https:\/\/doi.org\/10.1002\/jgt.3190170508","journal-title":"J. Graph Theory"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-319-62127-2_23","volume-title":"Algorithms and Data Structures","author":"Steven Chaplick","year":"2017","unstructured":"Chaplick, Steven, Fleszar, Krzysztof, Lipp, Fabian, Ravsky, Alexander, Verbitsky, Oleg, Wolff, Alexander: The complexity of drawing graphs on few lines and few planes. In: Ellen, F., Kolokolova, A., Sack, J.-R. (eds.) WADS 2017. LNCS, vol. 10389, pp. 265\u2013276. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_23"},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"433","DOI":"10.20382\/jocg.v11i1a17","volume":"11","author":"S Chaplick","year":"2020","unstructured":"Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: Drawinggraphs on few lines and few planes. J. Comput. Geom 11(1), 433\u2013475 (2020). https:\/\/doi.org\/10.20382\/jocg.v11i1a17","journal-title":"J. Comput. Geom"},{"issue":"3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.comgeo.2006.09.002","volume":"38","author":"V Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Eppstein, D., Suderman, M., Wood, D.R.: Drawings of planar graphs with few slopes and segments. Comput. Geom. Theory Appl. 38(3), 194\u2013212 (2007). https:\/\/doi.org\/10.1016\/j.comgeo.2006.09.002","journal-title":"Comput. Geom. Theory Appl."},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.comgeo.2018.02.003","volume":"77","author":"S Durocher","year":"2019","unstructured":"Durocher, S., Mondal, D.: Drawing plane triangulations with few segments. Comput. Geom. Theory Appl. 77, 27\u201339 (2019). https:\/\/doi.org\/10.1016\/j.comgeo.2018.02.003","journal-title":"Comput. Geom. Theory Appl."},{"key":"20_CR7","unstructured":"Goe\u00dfmann, I., et al.: The segment number: Algorithms and universal lower bounds for some classes of planar graphs. arXiv preprint (2022). https:\/\/arxiv.org\/abs\/2202.11604"},{"issue":"12","key":"20_CR8","doi-asserted-by":"publisher","first-page":"2368","DOI":"10.1016\/j.dam.2007.10.012","volume":"156","author":"S Hong","year":"2008","unstructured":"Hong, S., Nagamochi, H.: Convex drawings of graphs with non-convex boundary constraints. Discret. Appl. Math. 156(12), 2368\u20132380 (2008). https:\/\/doi.org\/10.1016\/j.dam.2007.10.012","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"20_CR9","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.jda.2009.05.003","volume":"8","author":"S Hong","year":"2010","unstructured":"Hong, S., Nagamochi, H.: Convex drawings of hierarchical planar graphs and clustered planar graphs. J. Discrete Algorithms 8(3), 282\u2013295 (2010). https:\/\/doi.org\/10.1016\/j.jda.2009.05.003","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"20_CR10","doi-asserted-by":"publisher","first-page":"357","DOI":"10.7155\/jgaa.00473","volume":"22","author":"G H\u00fcltenschmidt","year":"2018","unstructured":"H\u00fcltenschmidt, G., Kindermann, P., Meulemans, W., Schulz, A.: Drawing planar graphs with few geometric primitives. J. Graph Alg. Appl. 22(2), 357\u2013387 (2018). https:\/\/doi.org\/10.7155\/jgaa.00473","journal-title":"J. Graph Alg. Appl."},{"issue":"4","key":"20_CR11","doi-asserted-by":"publisher","first-page":"561","DOI":"10.7155\/jgaa.00430","volume":"21","author":"A Igamberdiev","year":"2017","unstructured":"Igamberdiev, A., Meulemans, W., Schulz, A.: Drawing planar cubic 3-connected graphs with few segments: Algorithms & experiments. J. Graph Algorithms Appl. 21(4), 561\u2013588 (2017). https:\/\/doi.org\/10.7155\/jgaa.00430","journal-title":"J. Graph Algorithms Appl."},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-030-35802-0_32","volume-title":"Graph Drawing and Network Visualization","author":"P Kindermann","year":"2019","unstructured":"Kindermann, P., Mchedlidze, T., Schneck, T., Symvonis, A.: Drawing planar graphs with few segments on a polynomial grid. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 416\u2013429. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_32"},{"issue":"3","key":"20_CR13","doi-asserted-by":"publisher","first-page":"501","DOI":"10.7155\/jgaa.00474","volume":"22","author":"P Kindermann","year":"2018","unstructured":"Kindermann, P., Meulemans, W., Schulz, A.: Experimental analysis of the accessibility of drawings with few segments. J. Graph Alg. Appl. 22(3), 501\u2013518 (2018). https:\/\/doi.org\/10.7155\/jgaa.00474","journal-title":"J. Graph Alg. Appl."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.comgeo.2019.07.007","volume":"84","author":"L Kleist","year":"2019","unstructured":"Kleist, L., Klemz, B., Lubiw, A., Schlipf, L., Staals, F., Strash, D.: Convexity-increasing morphs of planar graphs. Comput. Geom. 84, 69\u201388 (2019). https:\/\/doi.org\/10.1016\/j.comgeo.2019.07.007","journal-title":"Comput. Geom."},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"Klemz, B.: Convex drawings of hierarchical graphs in linear time, with applications to planar graph morphing. In: Mutzel, P., Pagh, R., Herman, G., (eds.) Proceedings of 29th Annual European Symposium on Algorithms (ESA 2021), vol. 204 of LIPIcs, pp. 57:1\u201357:15. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2021.57","DOI":"10.4230\/LIPIcs.ESA.2021.57"},{"issue":"2","key":"20_CR16","doi-asserted-by":"publisher","first-page":"371","DOI":"10.7155\/jgaa.00495","volume":"23","author":"M Kryven","year":"2019","unstructured":"Kryven, M., Ravsky, A., Wolff, A.: Drawing graphs on few circles and few spheres. J. Graph Alg. Appl. 23(2), 371\u2013391 (2019). https:\/\/doi.org\/10.7155\/jgaa.00495","journal-title":"J. Graph Alg. Appl."},{"issue":"3","key":"20_CR17","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/s10878-011-9390-6","volume":"25","author":"D Mondal","year":"2013","unstructured":"Mondal, D., Nishat, R.I., Biswas, S., Rahman, M.: Minimum-segment convex drawings of 3-connected cubic plane graphs. J. Comb. Optim. 25(3), 460\u2013480 (2013). https:\/\/doi.org\/10.1007\/s10878-011-9390-6","journal-title":"J. Comb. Optim."},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-030-35802-0_33","volume-title":"Graph Drawing and Network Visualization","author":"Y Okamoto","year":"2019","unstructured":"Okamoto, Y., Ravsky, A., Wolff, A.: Variants of the segment number of a graph. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 430\u2013443. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35802-0_33"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-642-00219-9_40","volume-title":"Graph Drawing","author":"MAH Samee","year":"2009","unstructured":"Samee, M.A.H., Alam, M.J., Adnan, M.A., Rahman, M.S.: Minimum segment drawings of series-parallel graphs with the maximum degree three. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 408\u2013419. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00219-9_40"},{"issue":"1","key":"20_CR20","doi-asserted-by":"publisher","first-page":"393","DOI":"10.7155\/jgaa.00366","volume":"19","author":"A Schulz","year":"2015","unstructured":"Schulz, A.: Drawing graphs with few arcs. J. Graph Alg. Appl. 19(1), 393\u2013412 (2015). https:\/\/doi.org\/10.7155\/jgaa.00366","journal-title":"J. Graph Alg. Appl."},{"key":"20_CR21","unstructured":"Thomassen, C.: Plane representations of graphs. In: Bondy, J.A., Murty, U.S.R., (eds.) Progress in Graph Theory, pp. 43\u201369. Academic Press (1984)"},{"key":"20_CR22","doi-asserted-by":"publisher","unstructured":"Tutte, W.T.: Convex representations of graphs. Proc. London Math. Soc. s3\u201310(1), 304\u2013320 (1960). https:\/\/doi.org\/10.1112\/plms\/s3-10.1.304","DOI":"10.1112\/plms\/s3-10.1.304"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15914-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:17:41Z","timestamp":1664536661000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.inf.uni-tuebingen.de\/wg2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"96","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}