{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:23:21Z","timestamp":1742945001539,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501055"},{"type":"electronic","value":"9783319501062"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","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":[[2016]]},"DOI":"10.1007\/978-3-319-50106-2_14","type":"book-chapter","created":{"date-parts":[[2016,12,7]],"date-time":"2016-12-07T15:22:42Z","timestamp":1481124162000},"page":"166-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Drawing Graphs on Few Lines and Few Planes"],"prefix":"10.1007","author":[{"given":"Steven","family":"Chaplick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Fleszar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Lipp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Ravsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oleg","family":"Verbitsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,8]]},"reference":[{"issue":"5","key":"14_CR1","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1002\/jgt.3190130506","volume":"13","author":"J Akiyama","year":"1989","unstructured":"Akiyama, J., Era, H., Gervacio, S.V., Watanabe, M.: Path chromatic numbers of graphs. J. Graph Theory 13(5), 571\u2013573 (1989)","journal-title":"J. Graph Theory"},{"key":"14_CR2","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"},{"key":"14_CR3","unstructured":"Bannister, M.J., Devanny, W.E., Dujmovi\u0107, V., Eppstein, D., Wood, D.R.: Track layouts, layered path decompositions, and leveled planarity (2015). \n                      http:\/\/arxiv.org\/abs\/1506.09145"},{"issue":"6","key":"14_CR4","doi-asserted-by":"publisher","first-page":"2243","DOI":"10.1137\/130908051","volume":"42","author":"GD Battista","year":"2013","unstructured":"Battista, G.D., Frati, F., Pach, J.: On the queue number of planar graphs. SIAM J. Comput. 42(6), 2243\u20132285 (2013)","journal-title":"SIAM J. Comput."},{"key":"14_CR5","volume-title":"Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability","author":"B Bollob\u00e1s","year":"1986","unstructured":"Bollob\u00e1s, B.: Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability, 1st edn. Cambridge University Press, Cambridge (1986)","edition":"1"},{"key":"14_CR6","unstructured":"Broere, I., Mynhardt, C.M.: Generalized colorings of outerplanar and planar graphs. In: Proceedings of the 5th International Conference Graph Theory Applications Algorithms and Computer Science, Kalamazoo, MI, pp. 151\u2013161 (1984, 1985)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"RL Brooks","year":"1941","unstructured":"Brooks, R.L.: On colouring the nodes of a network. Math. Proc. Camb. Philos. Soc. 37, 194\u2013197 (1941)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0925-7721(01)00066-9","volume":"23","author":"TM Chan","year":"2002","unstructured":"Chan, T.M., Goodrich, M.T., Kosaraju, S.R., Tamassia, R.: Optimizing area and aspect ratio in straight-line orthogonal tree drawings. Comput. Geom. Theory Appl. 23, 153\u2013162 (2002)","journal-title":"Comput. Geom. Theory Appl."},{"key":"14_CR9","unstructured":"Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: The complexity of drawing graphs on few lines and few planes (2016). \n                      http:\/\/arxiv.org\/abs\/1607.06444"},{"key":"14_CR10","first-page":"166","volume-title":"Lecture Notes in Computer Science","author":"Steven Chaplick","year":"2016","unstructured":"Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: Drawing graphs on few lines and few planes (2016). \n                      http:\/\/arxiv.org\/abs\/1607.01196"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1112\/jlms\/s1-44.1.612","volume":"44","author":"G Chartrand","year":"1969","unstructured":"Chartrand, G., Kronk, H.V.: The point-arboricity of planar graphs. J. Lond. Math. Soc. 44, 612\u2013616 (1969)","journal-title":"J. Lond. Math. Soc."},{"issue":"1\u20132","key":"14_CR12","first-page":"183","volume":"69","author":"Z Chen","year":"1996","unstructured":"Chen, Z., He, X.: Parallel complexity of partitioning a planar graph into vertex-induced forests. Discrete Appl. Math. 69(1\u20132), 183\u2013198 (1996)","journal-title":"Discrete Appl. Math."},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jctb.2014.07.005","volume":"110","author":"V Dujmovi\u0107","year":"2015","unstructured":"Dujmovi\u0107, V.: Graph layouts via layered separators. J. Comb. Theory Ser. B 110, 79\u201389 (2015)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"14_CR14","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)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/S0097539702416141","volume":"34","author":"V Dujmovi\u0107","year":"2005","unstructured":"Dujmovi\u0107, V., Morin, P., Wood, D.R.: Layout of graphs with bounded tree-width. SIAM J. Comput. 34(3), 553\u2013579 (2005)","journal-title":"SIAM J. Comput."},{"key":"14_CR16","first-page":"455","volume-title":"Handbook of Graph Drawing and Visualization, chap. 14","author":"V Dujmovi\u0107","year":"2013","unstructured":"Dujmovi\u0107, V., Whitesides, S.: Three-dimensional drawings. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, chap. 14, pp. 455\u2013488. CRC Press, Boca Raton (2013)"},{"key":"14_CR17","unstructured":"Durocher, S., Mondal, D.: Drawing plane triangulations with few segments. In: Proceedings of the Canadian Conference Computational Geometry (CCCG 2014), pp. 40\u201345 (2014). \n                      http:\/\/cccg.ca\/proceedings\/2014\/papers\/paper06.pdf"},{"issue":"4","key":"14_CR18","doi-asserted-by":"publisher","first-page":"363","DOI":"10.7155\/jgaa.00075","volume":"7","author":"S Felsner","year":"2003","unstructured":"Felsner, S., Liotta, G., Wismath, S.: Straight-line drawings on restricted integer grids in two and three dimensions. J. Graph Algorithms Appl. 7(4), 363\u2013398 (2003)","journal-title":"J. Graph Algorithms Appl."},{"key":"14_CR19","volume-title":"Parametrized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parametrized Complexity Theory. Springer, Berlin (2006)"},{"issue":"1","key":"14_CR20","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H de Fraysseix","year":"1990","unstructured":"de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41\u201351 (1990)","journal-title":"Combinatorica"},{"issue":"1","key":"14_CR21","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0012-365X(91)90166-Y","volume":"91","author":"W Goddard","year":"1991","unstructured":"Goddard, W.: Acyclic colorings of planar graphs. Discrete Math. 91(1), 91\u201394 (1991)","journal-title":"Discrete Math."},{"issue":"3","key":"14_CR22","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/0097-3165(73)90012-5","volume":"14","author":"B Gr\u00fcnbaum","year":"1973","unstructured":"Gr\u00fcnbaum, B., Walther, H.: Shortness exponents of families of graphs. J. Comb. Theory Ser. A 14(3), 364\u2013385 (1973)","journal-title":"J. Comb. Theory Ser. A"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1214\/aoms\/1177705047","volume":"32","author":"H Hanani","year":"1961","unstructured":"Hanani, H.: The existence and construction of balanced incomplete block designs. Ann. Math. Stat. 32, 361\u2013386 (1961). \n                      http:\/\/www.jstor.org\/stable\/2237750","journal-title":"Ann. Math. Stat."},{"key":"14_CR24","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_CR25","doi-asserted-by":"crossref","unstructured":"Kostochka, A., Melnikov, L.: On a lower bound for the isoperimetric number of cubic graphs. In: Proceedings of the 3rd International Petrozavodsk Conference Probabilistic Methods in Discrete Mathematics, pp. 251\u2013265. TVP, Moskva, VSP, Utrecht (1993)","DOI":"10.1515\/9783112318980-020"},{"key":"14_CR26","doi-asserted-by":"crossref","first-page":"133","DOI":"10.4064\/sm-9-1-133-138","volume":"9","author":"M Krein","year":"1940","unstructured":"Krein, M., Milman, D.: On extreme points of regular convex sets. Studia Math. 9, 133\u2013138 (1940)","journal-title":"Studia Math."},{"issue":"1","key":"14_CR27","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1002\/jgt.3190140113","volume":"14","author":"M Matsumoto","year":"1990","unstructured":"Matsumoto, M.: Bounds for the vertex linear arboricity. J. Graph Theory 14(1), 117\u2013126 (1990)","journal-title":"J. Graph Theory"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-63938-1_49","volume-title":"Graph Drawing","author":"J Pach","year":"1997","unstructured":"Pach, J., Thiele, T., T\u00f3th, G.: Three-dimensional grid drawings of graphs. In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 47\u201351. Springer, Heidelberg (1997). doi:\n                      10.1007\/3-540-63938-1_49"},{"issue":"1","key":"14_CR29","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1002\/jgt.3190140108","volume":"14","author":"KS Poh","year":"1990","unstructured":"Poh, K.S.: On the linear vertex-arboricity of a planar graph. J. Graph Theory 14(1), 73\u201375 (1990)","journal-title":"J. Graph Theory"},{"issue":"4","key":"14_CR30","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1016\/j.ejc.2007.11.022","volume":"29","author":"A Raspaud","year":"2008","unstructured":"Raspaud, A., Wang, W.: On the vertex-arboricity of planar graphs. Eur. J. Comb. 29(4), 1064\u20131075 (2008)","journal-title":"Eur. J. Comb."},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-25870-1_27","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"A Ravsky","year":"2011","unstructured":"Ravsky, A., Verbitsky, O.: On collinear sets in straight-line drawings. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 295\u2013306. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-25870-1_27\n                      \n                    . \n                      https:\/\/arXiv.org\/abs\/0806.0253"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: Fixed points, Nash equilibria, and the existential theory of the reals. Theory Comput. Syst., 1\u201322 (2015, has appeared online)","DOI":"10.1007\/s00224-015-9662-0"},{"key":"14_CR33","unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of the 1st ACM-SIAM Symposium Discrete Algorithms (SODA 1990), pp. 138\u2013148 (1990)"},{"issue":"1","key":"14_CR34","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)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1\u20133","key":"14_CR35","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0012-365X(88)90229-4","volume":"72","author":"J Wang","year":"1988","unstructured":"Wang, J.: On point-linear arboricity of planar graphs. Discrete Math. 72(1\u20133), 381\u2013384 (1988)","journal-title":"Discrete Math."},{"key":"14_CR36","unstructured":"Wikipedia: Krein-Milman theorem. \n                      https:\/\/en.wikipedia.org\/wiki\/Krein-Milman_theorem\n                      \n                    . Accessed 21 Apr 2016"},{"key":"14_CR37","first-page":"1","volume-title":"Encyclopedia of Algorithms","author":"DR Wood","year":"2008","unstructured":"Wood, D.R.: Three-dimensional graph drawing. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms, pp. 1\u20137. Springer, Boston (2008)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50106-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,19]],"date-time":"2020-09-19T00:40:29Z","timestamp":1600476029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50106-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501055","9783319501062"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50106-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"8 December 2016","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":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}