{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T14:01:16Z","timestamp":1754488876459,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492747"},{"type":"electronic","value":"9783031492754"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49275-4_7","type":"book-chapter","created":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:02:46Z","timestamp":1704715366000},"page":"97-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Parametrized Complexity of the Segment Number"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1688-394X","authenticated-orcid":false,"given":"Sabine","family":"Cornelsen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-5174","authenticated-orcid":false,"given":"Giordano","family":"Da Lozzo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2463-3772","authenticated-orcid":false,"given":"Luca","family":"Grilli","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4671-9822","authenticated-orcid":false,"given":"Siddharth","family":"Gupta","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2620-6133","authenticated-orcid":false,"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,6]]},"reference":[{"key":"7_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"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Balko, M., Chaplick, S., Gupta, S., Hoffmann, M., Valtr, P., Wolff, A.: Bounding and computing obstacle numbers of graphs. In: Chechik, S., Navarro, G., Rotenberg, E., Herman, G. (eds.) Proceedings of 30th European Symposium Algorithms (ESA 2022). LIPIcs, vol. 244, pp. 11:1\u201313. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2022.11","DOI":"10.4230\/LIPIcs.ESA.2022.11"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Berger, M.: Geometry Revealed: A Jacob\u2019s Ladder to Modern Higher Geometry. Springer, Cham (2010). https:\/\/doi.org\/10.1007\/978-3-540-70997-8","DOI":"10.1007\/978-3-540-70997-8"},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"603","DOI":"10.7155\/jgaa.00526","volume":"24","author":"S Bhore","year":"2020","unstructured":"Bhore, S., Ganian, R., Montecchiani, F., N\u00f6llenburg, M.: Parameterized algorithms for book embedding problems. J. Graph Algorithms Appl. 24(4), 603\u2013620 (2020). https:\/\/doi.org\/10.7155\/jgaa.00526","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"335","DOI":"10.7155\/jgaa.00597","volume":"26","author":"S Bhore","year":"2022","unstructured":"Bhore, S., Ganian, R., Montecchiani, F., N\u00f6llenburg, M.: Parameterized algorithms for queue layouts. J. Graph Algorithms Appl. 26(3), 335\u2013352 (2022). https:\/\/doi.org\/10.7155\/jgaa.00597","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"7_CR6","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.: Drawing graphs 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":"6","key":"7_CR7","doi-asserted-by":"publisher","first-page":"459","DOI":"10.7155\/jgaa.00630","volume":"27","author":"S Chaplick","year":"2023","unstructured":"Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: The complexity of drawing graphs on few lines and few planes. J. Graph Algorithms Appl. 27(6), 459\u2013488 (2023). https:\/\/doi.org\/10.7155\/jgaa.00630","journal-title":"J. Graph Algorithms Appl."},{"issue":"40\u201342","key":"7_CR8","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40\u201342), 3736\u20133756 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2010.06.026","journal-title":"Theor. Comput. Sci."},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Cornelsen, S., Da Lozzo, G., Grilli, L., Gupta, S., Kratochv\u00edl, J., Wolff, A.: The parametrized complexity of the segment number. Technical report. arXiv:2308.15416, Cornell University Library (2023). https:\/\/doi.org\/10.48550\/arXiv.2308.15416","DOI":"10.48550\/arXiv.2308.15416"},{"key":"7_CR10","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. 38, 194\u2013212 (2007). https:\/\/doi.org\/10.1016\/j.comgeo.2006.09.002","journal-title":"Comput. Geom."},{"key":"7_CR11","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. 77, 27\u201339 (2019). https:\/\/doi.org\/10.1016\/j.comgeo.2018.02.003","journal-title":"Comput. Geom."},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.7155\/jgaa.00295","volume":"17","author":"S Durocher","year":"2013","unstructured":"Durocher, S., Mondal, D., Nishat, R., Whitesides, S.: A note on minimum-segment drawings of planar graphs. J. Graph Algorithms Appl. 17(3), 301\u2013328 (2013). https:\/\/doi.org\/10.7155\/jgaa.00295","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF02579200","volume":"7","author":"A Frank","year":"1987","unstructured":"Frank, A., Tardos, \u00c9.: An application of simultaneous Diophantine approximation in combinatorial optimization. Combinatorica 7(1), 49\u201365 (1987). https:\/\/doi.org\/10.1007\/BF02579200","journal-title":"Combinatorica"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Goe\u00dfmann, I., et al.: The segment number: algorithms and universal lower bounds for some classes of planar graphs. In: Bekos, M.A., Kaufmann, M. (eds.) WG 2022. LNCS, vol. 13453, pp. 271\u2013286. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15914-5_20","DOI":"10.1007\/978-3-031-15914-5_20"},{"issue":"2","key":"7_CR15","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 Algorithms Appl. 22(2), 357\u2013387 (2018). https:\/\/doi.org\/10.7155\/jgaa.00473","journal-title":"J. Graph Algorithms Appl."},{"issue":"4","key":"7_CR16","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":"7_CR17","doi-asserted-by":"publisher","unstructured":"Lenstra, J., H.W.L.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983). https:\/\/doi.org\/10.1287\/moor.8.4.538","DOI":"10.1287\/moor.8.4.538"},{"issue":"3","key":"7_CR18","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987). https:\/\/doi.org\/10.1287\/moor.12.3.415","journal-title":"Math. Oper. Res."},{"key":"7_CR19","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-030-35802-0_32"},{"issue":"3","key":"7_CR20","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 Algorithms Appl. 22(3), 501\u2013518 (2018). https:\/\/doi.org\/10.7155\/jgaa.00474","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"7_CR21","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 Algorithms Appl. 23(2), 371\u2013391 (2019). https:\/\/doi.org\/10.7155\/jgaa.00495","journal-title":"J. Graph Algorithms Appl."},{"key":"7_CR22","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-030-35802-0_33"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals. J. Symb. Comput. 13(3), 255\u2013299 (1992). https:\/\/doi.org\/10.1016\/S0747-7171(10)80003-3","DOI":"10.1016\/S0747-7171(10)80003-3"},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. Part II: The general decision problem. Preliminaries for quantifier elimination. J. Symb. Comput. 13(3), 301\u2013327 (1992). https:\/\/doi.org\/10.1016\/S0747-7171(10)80004-5","DOI":"10.1016\/S0747-7171(10)80004-5"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination. J. Symb. Comput. 13(3), 329\u2013352 (1992). https:\/\/doi.org\/10.1016\/S0747-7171(10)80005-7","DOI":"10.1016\/S0747-7171(10)80005-7"},{"key":"7_CR26","doi-asserted-by":"publisher","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, Cham (2008). https:\/\/doi.org\/10.1007\/978-3-642-00219-9_40","DOI":"10.1007\/978-3-642-00219-9_40"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"Schaefer, M.: Complexity of some geometric and topological problems. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 334\u2013344. Springer-Verlag, Cham (2010). https:\/\/doi.org\/10.1007\/978-3-642-11805-0_32","DOI":"10.1007\/978-3-642-11805-0_32"},{"issue":"1","key":"7_CR28","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 Algorithms Appl. 19(1), 393\u2013412 (2015). https:\/\/doi.org\/10.7155\/jgaa.00366","journal-title":"J. Graph Algorithms Appl."},{"key":"7_CR29","doi-asserted-by":"publisher","unstructured":"Scott, A., Seymour, P.: Induced subgraphs of graphs with large chromatic number. VI. Banana trees. J. Combin. Theory Ser. B. 145, 487\u2013510 (2020). https:\/\/doi.org\/10.1016\/j.jctb.2020.01.004","DOI":"10.1016\/j.jctb.2020.01.004"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49275-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:03:25Z","timestamp":1704715405000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49275-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492747","9783031492754"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49275-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"6 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Isola delle Femmine, Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2023.ing.unipg.it\/\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"100","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":"31","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":"7","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":"31% - 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":"13","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)"}},{"value":"11 posters, 2 abstracts of invited talks, and 1 contest report are also included in the GD 2023 proceedings","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}