{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:49:44Z","timestamp":1742921384741,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"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_32","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"416-429","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Drawing Planar Graphs with Few Segments on a Polynomial Grid"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5764-7719","authenticated-orcid":false,"given":"Philipp","family":"Kindermann","sequence":"first","affiliation":[]},{"given":"Tamara","family":"Mchedlidze","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Schneck","sequence":"additional","affiliation":[]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"issue":"1","key":"32_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7155\/jgaa.00249","volume":"16","author":"P Angelini","year":"2012","unstructured":"Angelini, P., Colasante, E., Battista, G.D., Frati, F., Patrignani, M.: Monotone drawings of graphs. J. Graph Algorithms Appl. 16(1), 5\u201335 (2012). https:\/\/doi.org\/10.7155\/jgaa.00249","journal-title":"J. Graph Algorithms Appl."},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1007\/3-540-45465-9_89","volume-title":"Automata, Languages and Programming","author":"N Bonichon","year":"2002","unstructured":"Bonichon, N., Le Sa\u00ebc, B., Mosbah, M.: Wagner\u2019s theorem on realizers. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 1043\u20131053. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_89"},{"key":"32_CR3","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":"32_CR4","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.) WADS 2017. LNCS, vol. 10389, pp. 265\u2013276. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_23"},{"issue":"4","key":"32_CR5","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1137\/s0097539702411381","volume":"34","author":"YT Chiang","year":"2005","unstructured":"Chiang, Y.T., Lin, C.C., Lu, H.I.: Orderly spanning trees with applications. SIAM J. Comput. 34(4), 924\u2013945 (2005). https:\/\/doi.org\/10.1137\/s0097539702411381","journal-title":"SIAM J. Comput."},{"issue":"4","key":"32_CR6","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/PL00009264","volume":"23","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Tamassia, R., Vismara, L.: Output-sensitive reporting of disjoint paths. Algorithmica 23(4), 302\u2013340 (1999). https:\/\/doi.org\/10.1007\/PL00009264","journal-title":"Algorithmica"},{"issue":"3","key":"32_CR7","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":"32_CR8","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":"32_CR9","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.I., 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":"32_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00454-007-9027-9","volume":"40","author":"S Felsner","year":"2008","unstructured":"Felsner, S., Zickfeld, F.: Schnyder woods and orthogonal surfaces. Discret. Comput. Geom. 40(1), 103\u2013126 (2008). https:\/\/doi.org\/10.1007\/s00454-007-9027-9","journal-title":"Discret. Comput. Geom."},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.tcs.2015.09.004","volume":"607","author":"MI Hossain","year":"2015","unstructured":"Hossain, M.I., Rahman, M.S.: Good spanning trees in graph drawing. Theor. Comput. Sci. 607, 149\u2013165 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2015.09.004","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"32_CR12","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":"32_CR13","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":"32_CR14","doi-asserted-by":"crossref","unstructured":"Kindermann, P., Mchedlidze, T., Schneck, T., Symvonis, A.: Drawing planar graphs with few segments on a polynomial grid. arXiv report (2019). http:\/\/arxiv.org\/abs\/1903.08496","DOI":"10.1007\/978-3-030-35802-0_32"},{"issue":"3","key":"32_CR15","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."},{"key":"32_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-319-27261-0_50","volume-title":"Graph Drawing and Network Visualization","author":"SG Kobourov","year":"2015","unstructured":"Kobourov, S.G., Mchedlidze, T., Vonessen, L.: Gestalt principles in graph drawing. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 558\u2013560. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_50"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-74180-2_14","volume-title":"Algorithms and Discrete Applied Mathematics","author":"M Kryven","year":"2018","unstructured":"Kryven, M., Ravsky, A., Wolff, A.: Drawing graphs on few circles and few spheres. In: Panda, B.S., Goswami, P.P. (eds.) CALDAM 2018. LNCS, vol. 10743, pp. 164\u2013178. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-74180-2_14"},{"issue":"01","key":"32_CR18","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1142\/s0129054105002905","volume":"16","author":"K Miura","year":"2005","unstructured":"Miura, K., Azuma, M., Nishizeki, T.: Canonical decomposition, realizer, schnyder labeling and orderly spanning trees of plane graphs. Int. J. Found. Comput. Sci. 16(01), 117\u2013141 (2005). https:\/\/doi.org\/10.1142\/s0129054105002905","journal-title":"Int. J. Found. Comput. Sci."},{"key":"32_CR19","unstructured":"Mondal, D.: Visualizing graphs: optimization and trade-offs. Ph.d. thesis, University of Manitoba (2016). http:\/\/hdl.handle.net\/1993\/31673"},{"issue":"3","key":"32_CR20","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."},{"key":"32_CR21","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Johnson, D.S. (ed.) SODA 1990, pp. 138\u2013148. SIAM (1990). http:\/\/dl.acm.org\/citation.cfm?id=320191"},{"issue":"1","key":"32_CR22","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."},{"issue":"2","key":"32_CR23","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1093\/comjnl\/37.2.139","volume":"37","author":"GA Wade","year":"1994","unstructured":"Wade, G.A., Chu, J.: Drawability of complete graphs using a minimal slope set. Comput. J. 37(2), 139\u2013142 (1994). https:\/\/doi.org\/10.1093\/comjnl\/37.2.139","journal-title":"Comput. J."}],"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_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:05:05Z","timestamp":1701133505000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_32","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"}]}}