{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:46:04Z","timestamp":1742917564129,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319741796"},{"type":"electronic","value":"9783319741802"}],"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-319-74180-2_14","type":"book-chapter","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T15:12:55Z","timestamp":1516029175000},"page":"164-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Drawing Graphs on Few Circles and Few Spheres"],"prefix":"10.1007","author":[{"given":"Myroslav","family":"Kryven","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":[[2018,1,16]]},"reference":[{"key":"14_CR1","first-page":"405","volume":"30","author":"J Akiyama","year":"1980","unstructured":"Akiyama, J., Exoo, G., Harary, F.: Covering and packing ingraphs III: cyclic and acyclic invariants. Math. Slovaca 30, 405\u2013417 (1980)","journal-title":"Math. Slovaca"},{"doi-asserted-by":"crossref","unstructured":"Bernhart, F., Kainen, P.C.: The book thickness of a graph. J. Combin. Theory Ser. B 27(3), 320\u2013331 (1979). http:\/\/www.sciencedirect.com\/science\/article\/pii\/0095895679900212","key":"14_CR2","DOI":"10.1016\/0095-8956(79)90021-2"},{"key":"14_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807503","volume-title":"Geometry","author":"DA Brannan","year":"1999","unstructured":"Brannan, D.A.: Geometry. Cambridge University Press, Cambridge (1999)"},{"key":"14_CR4","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":"14_CR5","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G Di Battista","year":"1999","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Upper Saddle River (1999)"},{"key":"14_CR6","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.: Drawings of planar graphs with few slopes and segments. Comput. Geom. Theory Appl. 38, 194\u2013212 (2007)","journal-title":"Comput. Geom. Theory Appl."},{"doi-asserted-by":"crossref","unstructured":"Duncan, C.A.: On graph thickness, geometric thickness, and separator theorems. Comput. Geom. Theory Appl. 44(2), 95\u201399 (2011). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0925772110000738","key":"14_CR7","DOI":"10.1016\/j.comgeo.2010.09.005"},{"unstructured":"Edelsbrunner, H.: Lecture notes for Computational Topology (CPS296.1) (2006). http:\/\/www.cs.duke.edu\/courses\/fall06\/cps296.1\/Lectures\/sec-III-3.pdf","key":"14_CR8"},{"key":"14_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parametrized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parametrized Complexity Theory. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1111\/j.1749-6632.1970.tb56470.x","volume":"175","author":"F Harary","year":"1970","unstructured":"Harary, F.: Covering and packing in graphs I. Ann. N.Y. Acad. Sci. 175, 198\u2013205 (1970)","journal-title":"Ann. N.Y. Acad. Sci."},{"key":"14_CR11","volume-title":"A Seminar on Graph Theory","author":"F Harary","year":"2015","unstructured":"Harary, F.: A Seminar on Graph Theory. Dover Publications, New York (2015)"},{"unstructured":"Hoffmann, M., van Kreveld, M., Kusters, V., Rote, G.: Quality ratios of measures for graph drawing styles. In: CCCG 2014, pp. 33\u201339 (2014). http:\/\/www.cccg.ca\/proceedings\/2014\/papers\/paper05.pdf","key":"14_CR12"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-319-27261-0_10","volume-title":"Graph Drawing and Network Visualization","author":"A Igamberdiev","year":"2015","unstructured":"Igamberdiev, A., Meulemans, W., Schulz, A.: Drawing planar cubic 3-connected graphs with few segments: algorithms and experiments. In: Di Giacomo, E., Lubiw, A. (eds.) GD 2015. LNCS, vol. 9411, pp. 113\u2013124. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27261-0_10"},{"unstructured":"Kindermann, P., Meulemans, W., Schulz, A.: Experimental analysis of the accessibility of drawings with few segments. In: Frati, F., Ma, K.L. (eds.) GD 2017. LNCS, vol. 10692. Springer (to appear, 2018). arxiv.org\/abs\/1708.09815","key":"14_CR14"},{"doi-asserted-by":"crossref","unstructured":"Kostochka, A.V., Melnikov, L.S.: On a lower bound for the isoperimetric number of cubic graphs. In: Proceedings of the 3rd International Petrozavodsk Conference on Probabilistic Methods in Discrete Mathematics, pp. 251\u2013265. TVP, VSP, Moskva, Utrecht (1993)","key":"14_CR15","DOI":"10.1515\/9783112318980-020"},{"doi-asserted-by":"crossref","unstructured":"Kryven, M., Ravsky, A., Wolff, A.: Drawing graphs on few circles and few spheres. ArXiv e-print arxiv.org\/abs\/1709.06965 (2017)","key":"14_CR16","DOI":"10.1007\/978-3-319-74180-2_14"},{"doi-asserted-by":"crossref","unstructured":"Mondal, D., Nishat, R.I., Biswas, S., Rahman, M.S.: Minimum-segment convex drawings of 3-connected cubic plane graphs. J. Comb. Opt. 25(3), 460\u2013480 (2013). https:\/\/doi.org\/10.1007\/s10878-011-9390-6","key":"14_CR17","DOI":"10.1007\/s10878-011-9390-6"},{"unstructured":"Moscow Mathematical Olympiad, problem no. 78223 (1960). http:\/\/www.problems.ru\/view_problem_details_new.php?id=78223 (in Russian)","key":"14_CR18"},{"unstructured":"Scherm, U.: Minimale \u00dcberdeckung von Knoten und Kanten in Graphen durch Geraden. Bachelor\u2019s Thesis, Institut f\u00fcr Informatik, Universit\u00e4t W\u00fcrzburg (2016)","key":"14_CR19"},{"issue":"1","key":"14_CR20","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 Alg. Appl. 19(1), 393\u2013412 (2015)","journal-title":"J. Graph Alg. Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74180-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:51:14Z","timestamp":1709826674000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-74180-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319741796","9783319741802"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74180-2_14","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":"16 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"15 February 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/caldam2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}