{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:39Z","timestamp":1759638519873,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002558"},{"type":"electronic","value":"9783030002565"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00256-5_3","type":"book-chapter","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T08:22:08Z","timestamp":1535790128000},"page":"27-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Edge Partitions of Optimal 2-plane and 3-plane Graphs"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bekos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emilio","family":"Di Giacomo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Didimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Montecchiani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chrysanthi","family":"Raftopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.dam.2014.05.025","volume":"175","author":"E Ackerman","year":"2014","unstructured":"Ackerman, E.: A note on 1-planar graphs. Discret. Appl. Math. 175, 104\u2013108 (2014)","journal-title":"Discret. Appl. Math."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Bekos, M., Di Giacomo, E., Didimo, W., Liotta, G., Montecchiani, F., Raftopoulou, C.: Edge partitions of optimal $$2$$-plane and $$3$$-plane graphs. CoRR, abs\/1802.10300 (2018)","DOI":"10.1007\/978-3-030-00256-5_3"},{"key":"3_CR3","unstructured":"Bekos, M.A., Kaufmann, M., Raftopoulou, C.N.: On optimal 2- and 3-planar graphs. In: SoCG 2017. LIPIcs, vol. 77, pp. 16:1\u201316:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0095-8956(71)90065-7","volume":"10","author":"G Chartrand","year":"1971","unstructured":"Chartrand, G., Geller, D., Hedetniemi, S.: Graphs with forbidden subgraphs. J. Comb. Theory Ser. B 10(1), 12\u201341 (1971)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"3_CR5","doi-asserted-by":"crossref","first-page":"P54","DOI":"10.37236\/2392","volume":"20","author":"J Czap","year":"2013","unstructured":"Czap, J., Hud\u00e1k, D.: On drawings and decompositions of 1-planar graphs. Electron. J. Comb. 20(2), P54 (2013)","journal-title":"Electron. J. Comb."},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.tcs.2017.12.024","volume":"713","author":"E Di Giacomo","year":"2018","unstructured":"Di Giacomo, E., et al.: New results on edge partitions of 1-plane graphs. Theor. Comput. Sci. 713, 78\u201384 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"3_CR7","doi-asserted-by":"publisher","first-page":"2345","DOI":"10.1007\/s00453-017-0324-2","volume":"80","author":"E Di Giacomo","year":"2018","unstructured":"Di Giacomo, E., et al.: Ortho-polygon visibility representations of embedded graphs. Algorithmica 80(8), 2345\u20132383 (2018)","journal-title":"Algorithmica"},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/jctb.2000.1962","volume":"79","author":"G Ding","year":"2000","unstructured":"Ding, G., Oporowski, B., Sanders, D.P., Vertigan, D.: Surfaces, tree-width, clique-minors, and partitions. J. Comb. Theory Ser. B 79(2), 221\u2013246 (2000)","journal-title":"J. Comb. Theory Ser. B"},{"key":"3_CR9","unstructured":"Durocher, S., Mondal, D.: Relating graph thickness to planar layers and bend complexity. In: ICALP 2016. LIPIcs, vol. 55, pp. 10:1\u201310:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"3","key":"3_CR10","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. Theor. Comput. Sci. 2(3), 339\u2013344 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, D.: Edge partition of planar graphs into two outerplanar graphs. In: STOC 2005, pp. 504\u2013512. ACM (2005)","DOI":"10.1145\/1060590.1060666"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jctb.1996.0043","volume":"67","author":"KS Kedlaya","year":"1996","unstructured":"Kedlaya, K.S.: Outerplanar partitions of planar graphs. J. Comb. Theory Ser. B 67(2), 238\u2013248 (1996)","journal-title":"J. Comb. Theory Ser. B"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.cosrev.2017.06.002","volume":"25","author":"SG Kobourov","year":"2017","unstructured":"Kobourov, S.G., Liotta, G., Montecchiani, F.: An annotated bibliography on 1-planarity. Comput. Sci. Rev. 25, 49\u201367 (2017)","journal-title":"Comput. Sci. Rev."},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2016.12.004","volume":"662","author":"WJ Lenhart","year":"2017","unstructured":"Lenhart, W.J., Liotta, G., Montecchiani, F.: On partitioning the edges of 1-plane graphs. Theor. Comput. Sci. 662, 59\u201365 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"s1\u201336","author":"CSA Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.S.A.: Edge-disjoint spanning trees of finite graphs. J. Lond. Math. Soc. s1\u201336(1), 445\u2013450 (1961)","journal-title":"J. Lond. Math. Soc."},{"issue":"3","key":"3_CR16","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427\u2013439 (1997)","journal-title":"Combinatorica"},{"key":"3_CR17","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: SODA 1990, pp. 138\u2013148. SIAM (1990)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Discret. Comput. Geom. 1, 321\u2013341 (1986)","journal-title":"Discret. Comput. Geom."}],"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-030-00256-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:24:10Z","timestamp":1710336250000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00256-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002558","9783030002565"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00256-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 September 2018","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":"Cottbus","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.wg2018.b-tu.de\/","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":"66","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":"30","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":"45% - 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":"4","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":"11,5","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)"}}]}}