{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:55:38Z","timestamp":1743108938825,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030358013"},{"type":"electronic","value":"9783030358020"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_33","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"430-443","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Variants of the Segment Number of\u00a0a\u00a0Graph"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9826-7074","authenticated-orcid":false,"given":"Yoshio","family":"Okamoto","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Ravsky","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":[[2019,11,28]]},"reference":[{"issue":"6","key":"33_CR1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1142\/S0218195903001281","volume":"13","author":"P Bose","year":"2003","unstructured":"Bose, P., Everett, H., Wismath, S.K.: Properties of arrangement graphs. Int. J. Comput. Geom. Appl. 13(6), 447\u2013462 (2003). https:\/\/doi.org\/10.1142\/S0218195903001281","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-319-50106-2_14","volume-title":"Graph Drawing and Network Visualization","author":"S Chaplick","year":"2016","unstructured":"Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: Drawing graphs on few lines and few planes. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 166\u2013180. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_14"},{"key":"33_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":"S Chaplick","year":"2017","unstructured":"Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: The complexity of drawing graphs on few lines and few planes. In: Ellen, F., Kolokolova, A., Sack, J.R. (eds.) Algorithms and Data Structures. LNCS, vol. 10389, pp. 265\u2013276. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_23. arxiv.org\/1607.06444"},{"key":"33_CR4","volume-title":"Chromatic Graph Theory","author":"G Chartrand","year":"2008","unstructured":"Chartrand, G., Zhang, P.: Chromatic Graph Theory, 1st edn. Chapman & Hall\/CRC, Boca Raton (2008)","edition":"1"},{"issue":"3","key":"33_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":"33_CR6","unstructured":"Durocher, S., Mondal, D.: Drawing plane triangulations with few segments. In: Proceedings Canadian Conference on Computational Geometry (CCCG 2014), pp. 40\u201345 (2014). http:\/\/cccg.ca\/proceedings\/2014\/papers\/paper06.pdf"},{"issue":"3","key":"33_CR7","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":"2","key":"33_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.7155\/jgaa.00319","volume":"18","author":"D Eppstein","year":"2014","unstructured":"Eppstein, D.: Drawing arrangement graphs in small grids, or how to play planarity. J. Graph Algorithms Appl. 18(2), 211\u2013231 (2014). https:\/\/doi.org\/10.7155\/jgaa.00319","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"33_CR9","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S Even","year":"1976","unstructured":"Even, S., Tarjan, R.E.: Computing an $$st$$-numbering. Theoret. Comput. Sci. 2(3), 339\u2013344 (1976). https:\/\/doi.org\/10.1016\/0304-3975(76)90086-4","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"33_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.7155\/jgaa.00411","volume":"21","author":"U Hoffmann","year":"2017","unstructured":"Hoffmann, U.: On the complexity of the planar slope number problem. J. Graph Algorithms Appl. 21(2), 183\u2013193 (2017). https:\/\/doi.org\/10.7155\/jgaa.00411","journal-title":"J. Graph Algorithms Appl."},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-319-68705-6_24","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G H\u00fcltenschmidt","year":"2017","unstructured":"H\u00fcltenschmidt, G., Kindermann, P., Meulemans, W., Schulz, A.: Drawing planar graphs with few geometric primitives. In: Bodlaender, H.L., Woeginger, G.J. (eds.) WG 2017. LNCS, vol. 10520, pp. 316\u2013329. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_24"},{"issue":"4","key":"33_CR12","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 and experiments. J. Graph Algorithms Appl. 21(4), 561\u2013588 (2017). https:\/\/doi.org\/10.7155\/jgaa.00430","journal-title":"J. Graph Algorithms Appl."},{"key":"33_CR13","doi-asserted-by":"crossref","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:\/\/arxiv.org\/abs\/1903.08496","DOI":"10.1007\/978-3-030-35802-0_32"},{"issue":"2","key":"33_CR14","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02662066","volume":"9","author":"Y Liu","year":"1994","unstructured":"Liu, Y., Marchioro, P., Petreschi, R.: At most single-bend embeddings of cubic graphs. Appl. Math. 9(2), 127\u2013142 (1994). https:\/\/doi.org\/10.1007\/BF02662066","journal-title":"Appl. Math."},{"key":"33_CR15","unstructured":"Matou\u0161ek, J.: Intersection graphs of segments and $$\\exists \\mathbb{R}$$. ArXiv report (2014). http:\/\/arxiv.org\/abs\/1406.2636"},{"issue":"3","key":"33_CR16","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.S.: 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."},{"issue":"9","key":"33_CR17","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1016\/j.comgeo.2009.01.005","volume":"42","author":"P Mukkamala","year":"2009","unstructured":"Mukkamala, P., Szegedy, M.: Geometric representation of cubic graphs with four directions. Comput. Geom. Theory Appl. 42(9), 842\u2013851 (2009). https:\/\/doi.org\/10.1016\/j.comgeo.2009.01.005","journal-title":"Comput. Geom. Theory Appl."},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-11805-0_32","volume-title":"Graph Drawing","author":"M Schaefer","year":"2010","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, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11805-0_32"},{"issue":"1","key":"33_CR19","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":"33_CR20","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Stretchability of pseudolines is NP-hard. In: Gritzmann, P., Sturmfels, B. (eds.) Applied Geometry and Discrete Mathematics-The Victor Klee Festschrift. DIMACS Series in Mathematics and Theoretical Computer Science, vol. 4, pp. 531\u2013554. American Mathematical Society (1991)","DOI":"10.1090\/dimacs\/004\/41"}],"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-030-35802-0_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:05:25Z","timestamp":1701133525000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 November 2019","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","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":"113","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":"34","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":"8","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":"30% - 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.11","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.55","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}