{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:02Z","timestamp":1759638782341,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066771"},{"type":"electronic","value":"9783031066788"}],"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-06678-8_12","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"157-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3414-7444","authenticated-orcid":false,"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2565-090X","authenticated-orcid":false,"given":"Martin","family":"Gronemann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0543-8912","authenticated-orcid":false,"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0280-741X","authenticated-orcid":false,"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-36763-2_10","volume-title":"Graph Drawing","author":"S Alamdari","year":"2013","unstructured":"Alamdari, S., Biedl, T.: Open rectangle-of-influence drawings of non-triangulated planar graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 102\u2013113. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_10"},{"key":"12_CR2","unstructured":"B\u00e1r\u00e1ny, I., Rote, G.: Strictly convex drawings of planar graphs. Doc. Math. 11, 369\u2013391 (2006). http:\/\/eudml.org\/doc\/53043"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.7155\/jgaa.00078","volume":"8","author":"G Barequet","year":"2004","unstructured":"Barequet, G., Goodrich, M.T., Riley, C.: Drawing planar graphs with large vertices and thick edges. J. Graph Algorithms Appl. 8, 3\u201320 (2004). https:\/\/doi.org\/10.7155\/jgaa.00078","journal-title":"J. Graph Algorithms Appl."},{"issue":"10","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1016\/j.disc.2012.01.027","volume":"312","author":"L Barri\u00e8re","year":"2012","unstructured":"Barri\u00e8re, L., Huemer, C.: 4-labelings and grid embeddings of plane quadrangulations. Discret. Math. 312(10), 1722\u20131731 (2012). https:\/\/doi.org\/10.1016\/j.disc.2012.01.027","journal-title":"Discret. Math."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"101789","DOI":"10.1016\/j.comgeo.2021.101789","volume":"98","author":"MA Bekos","year":"2021","unstructured":"Bekos, M.A., Gronemann, M., Montecchiani, F., P\u00e1lv\u00f6lgyi, D., Symvonis, A., Theocharous, L.: Grid drawings of graphs with constant edge-vertex resolution. Comput. Geom. 98, 101789 (2021). https:\/\/doi.org\/10.1016\/j.comgeo.2021.101789","journal-title":"Comput. Geom."},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/3-540-46648-7_37","volume-title":"Graph Drawing","author":"T Biedl","year":"1999","unstructured":"Biedl, T., Bretscher, A., Meijer, H.: Rectangle of influence drawings of graphs without filled 3-cycles. In: Kratochv\u00edyl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 359\u2013368. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46648-7_37"},{"key":"12_CR7","unstructured":"Biedl, T.C., Lubiw, A., Mehrabi, S., Verdonschot, S.: Rectangle-of-influence triangulations. In: Shermer, T.C. (ed.) CCCG, pp. 237\u2013243 (2016)"},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s00453-006-0177-6","volume":"47","author":"N Bonichon","year":"2007","unstructured":"Bonichon, N., Felsner, S., Mosbah, M.: Convex drawings of 3-connected plane graphs. Algorithmica 47(4), 399\u2013420 (2007). https:\/\/doi.org\/10.1007\/s00453-006-0177-6","journal-title":"Algorithmica"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF00264230","volume":"22","author":"N Chiba","year":"1985","unstructured":"Chiba, N., Onoguchi, K., Nishizeki, T.: Drawing planar graphs nicely. Acta Inform. 22, 187\u2013201 (1985). https:\/\/doi.org\/10.1007\/BF00264230","journal-title":"Acta Inform."},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Chrobak, M., Goodrich, M.T., Tamassia, R.: Convex drawings of graphs in two and three dimensions (preliminary version). In: Whitesides, S. (ed.) SoCG, pp. 319\u2013328. ACM (1996). https:\/\/doi.org\/10.1145\/237218.237401","DOI":"10.1145\/237218.237401"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1142\/S0218195997000144","volume":"7","author":"M Chrobak","year":"1997","unstructured":"Chrobak, M., Kant, G.: Convex grid drawings of 3-connected planar graphs. Int. J. Comput. Geom. Appl. 7(3), 211\u2013223 (1997). https:\/\/doi.org\/10.1142\/S0218195997000144","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"4","key":"12_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0020-0190(95)00020-D","volume":"54","author":"M Chrobak","year":"1995","unstructured":"Chrobak, M., Payne, T.H.: A linear-time algorithm for drawing a planar graph on a grid. Inf. Process. Lett. 54(4), 241\u2013246 (1995). https:\/\/doi.org\/10.1016\/0020-0190(95)00020-D","journal-title":"Inf. Process. Lett."},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting F\u00e1ry embeddings of planar graphs. In: Simon, J. (ed.) STOC, pp. 426\u2013433. ACM (1988). https:\/\/doi.org\/10.1145\/62212.62254","DOI":"10.1145\/62212.62254"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-1-4614-0110-0_9","volume-title":"Thirty Essays on Geometric Graph Theory","author":"G Di Battista","year":"2013","unstructured":"Di Battista, G., Frati, F.: Drawing trees, outerplanar graphs, series-parallel graphs, and planar graphs in a small area. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 121\u2013165. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_9"},{"key":"12_CR15","unstructured":"Di Battista, G., Frati, F.: A survey on small-area planar graph drawing. CoRR, abs\/1410.1006 (2014)"},{"issue":"4","key":"12_CR16","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":"5","key":"12_CR17","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1142\/S0129054106004315","volume":"17","author":"CA Duncan","year":"2006","unstructured":"Duncan, C.A., Efrat, A., Kobourov, S.G., Wenk, C.: Drawing with fat edges. Int. J. Found. Comput. Sci. 17(5), 1143\u20131164 (2006). https:\/\/doi.org\/10.1142\/S0129054106004315","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1023\/A:1010604726900","volume":"18","author":"S Felsner","year":"2001","unstructured":"Felsner, S.: Convex drawings of planar graphs and the order dimension of 3-polytopes. Order 18(1), 19\u201337 (2001). https:\/\/doi.org\/10.1023\/A:1010604726900","journal-title":"Order"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Felsner, S.: Geometric Graphs and Arrangements. Advanced Lectures in Mathematics. Vieweg (2004). https:\/\/doi.org\/10.1007\/978-3-322-80303-0","DOI":"10.1007\/978-3-322-80303-0"},{"key":"12_CR20","first-page":"229","volume":"11","author":"I F\u00e1ry","year":"1948","unstructured":"F\u00e1ry, I.: On straight lines representation of planar graphs. Acta Sci. Math. (Szeged) 11, 229\u2013233 (1948)","journal-title":"Acta Sci. Math. (Szeged)"},{"issue":"3","key":"12_CR21","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/PL00009290","volume":"17","author":"X He","year":"1997","unstructured":"He, X.: Grid embedding of 4-connected plane graphs. Discrete Comput. Geom. 17(3), 339\u2013358 (1997). https:\/\/doi.org\/10.1007\/PL00009290","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"12_CR22","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16(1), 4\u201332 (1996). https:\/\/doi.org\/10.1007\/BF02086606","journal-title":"Algorithmica"},{"issue":"4","key":"12_CR23","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s00454-008-9098-2","volume":"41","author":"K Miura","year":"2008","unstructured":"Miura, K., Matsuno, T., Nishizeki, T.: Open rectangle-of-influence drawings of inner triangulated plane graphs. Discrete Comput. Geom. 41(4), 643\u2013670 (2008). https:\/\/doi.org\/10.1007\/s00454-008-9098-2","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"12_CR24","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00454-001-0004-4","volume":"26","author":"K Miura","year":"2001","unstructured":"Miura, K., Nakano, S., Nishizeki, T.: Grid drawings of 4-connected plane graphs. Discrete Comput. Geom. 26(1), 73\u201387 (2001). https:\/\/doi.org\/10.1007\/s00454-001-0004-4","journal-title":"Discrete Comput. Geom."},{"issue":"5","key":"12_CR25","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1142\/S012905410600425X","volume":"17","author":"K Miura","year":"2006","unstructured":"Miura, K., Nakano, S., Nishizeki, T.: Convex grid drawings of four-connected plane graphs. Int. J. Found. Comput. Sci. 17(5), 1031\u20131060 (2006). https:\/\/doi.org\/10.1142\/S012905410600425X","journal-title":"Int. J. Found. Comput. Sci."},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. Lecture Notes Series on Computing, vol. 12. World Scientific (2004). https:\/\/doi.org\/10.1142\/5648","DOI":"10.1142\/5648"},{"key":"12_CR27","unstructured":"Rote, G.: Strictly convex drawings of planar graphs. In: SODA, pp. 728\u2013734. SIAM (2005). http:\/\/dl.acm.org\/citation.cfm?id=1070432.1070535"},{"issue":"1","key":"12_CR28","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.comgeo.2010.07.001","volume":"44","author":"S Sadasivam","year":"2011","unstructured":"Sadasivam, S., Zhang, H.: Closed rectangle-of-influence drawings for irreducible triangulations. Comput. Geom. 44(1), 9\u201319 (2011). https:\/\/doi.org\/10.1016\/j.comgeo.2010.07.001","journal-title":"Comput. Geom."},{"key":"12_CR29","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: SODA, pp. 138\u2013148. SIAM (1990). http:\/\/dl.acm.org\/citation.cfm?id=320176.320191"},{"issue":"3","key":"12_CR30","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1090\/S0002-9939-1951-0041425-5","volume":"2","author":"SK Stein","year":"1951","unstructured":"Stein, S.K.: Convex maps. Proc. American Math. Soc. 2(3), 464\u2013466 (1951)","journal-title":"Proc. American Math. Soc."},{"key":"12_CR31","volume-title":"Vorlesungen \u00fcber die Theorie der Polyeder","author":"E Steinitz","year":"1934","unstructured":"Steinitz, E., Rademacher, H.: Vorlesungen \u00fcber die Theorie der Polyeder. Julius Springer, Berlin (1934)"},{"issue":"3","key":"12_CR32","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0095-8956(84)90057-1","volume":"37","author":"C Thomassen","year":"1984","unstructured":"Thomassen, C.: A refinement of Kuratowski\u2019s theorem. J. Comb. Theory Ser. B 37(3), 245\u2013253 (1984). https:\/\/doi.org\/10.1016\/0095-8956(84)90057-1","journal-title":"J. Comb. Theory Ser. B"},{"key":"12_CR33","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"WT Tutte","year":"1963","unstructured":"Tutte, W.T.: How to draw a graph. Proc. London Math. Soc. 13, 743\u2013768 (1963)","journal-title":"Proc. London Math. Soc."},{"issue":"9","key":"12_CR34","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/j.comgeo.2011.06.002","volume":"44","author":"MJ van Kreveld","year":"2011","unstructured":"van Kreveld, M.J.: Bold graph drawings. Comput. Geom. 44(9), 499\u2013506 (2011). https:\/\/doi.org\/10.1016\/j.comgeo.2011.06.002","journal-title":"Comput. Geom."},{"key":"12_CR35","unstructured":"Vismara, L.: Planar straight-line drawing algorithms. In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization, pp. 193\u2013222. Chapman and Hall\/CRC (2013)"},{"key":"12_CR36","first-page":"26","volume":"46","author":"K Wagner","year":"1936","unstructured":"Wagner, K.: Bemerkungen zum Vierfarbenproblem. Jahresber. Deutsch. Math.-Verein. 46, 26\u201332 (1936)","journal-title":"Jahresber. Deutsch. Math.-Verein."},{"key":"12_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-540-45078-8_43","volume-title":"Algorithms and Data Structures","author":"H Zhang","year":"2003","unstructured":"Zhang, H., He, X.: Compact visibility representation and straight-line grid embedding of plane graphs. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 493\u2013504. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45078-8_43"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06678-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:06:21Z","timestamp":1653779181000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_12","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":"29 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","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":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","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":"35","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":"41% - 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":"10","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)"}}]}}