{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:30:14Z","timestamp":1760441414739,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319621265"},{"type":"electronic","value":"9783319621272"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-62127-2_23","type":"book-chapter","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T02:47:31Z","timestamp":1499136451000},"page":"265-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The Complexity of 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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7833-0454","authenticated-orcid":false,"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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,5]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/BF02574701","volume":"6","author":"D Bienstock","year":"1991","unstructured":"Bienstock, D.: Some provably hard crossing number problems. Discrete Comput. Geom. 6, 443\u2013459 (1991)","journal-title":"Discrete Comput. Geom."},{"issue":"6","key":"23_CR2","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1142\/S0218195903001281","volume":"13","author":"P Bose","year":"2003","unstructured":"Bose, P., Everett, H., Wismath, S.K.: Properties of arrangement graphs. Int. J. Comput. Geom. Appl. 13(6), 447\u2013462 (2003)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Canny, J.F.: Some algebraic and geometric computations in PSPACE. In: Proc. 20th Annu. ACM Symp. Theory Comput. (STOC 1988), pp. 460\u2013467 (1988)","DOI":"10.1145\/62212.62257"},{"issue":"4","key":"23_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/2852040.2852053","volume":"46","author":"J Cardinal","year":"2015","unstructured":"Cardinal, J.: Computational geometry column 62. SIGACT News 46(4), 69\u201378 (2015)","journal-title":"SIGACT News"},{"key":"23_CR5","doi-asserted-by":"crossref","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). arxiv.org\/1607.06444","DOI":"10.1007\/978-3-319-50106-2_14"},{"key":"23_CR6","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). doi:10.1007\/978-3-319-50106-2_14"},{"issue":"3","key":"23_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)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"23_CR8","first-page":"497","volume":"6","author":"V Dujmovi\u0107","year":"2004","unstructured":"Dujmovi\u0107, V., P\u00f3r, A., Wood, D.R.: Track layouts of graphs. Discrete Math. & Theor. Comput. Sci. 6(2), 497\u2013522 (2004)","journal-title":"Discrete Math. & Theor. Comput. Sci."},{"key":"23_CR9","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 (2013)"},{"issue":"3","key":"23_CR10","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 Alg. Appl. 17(3), 301\u2013328 (2013)","journal-title":"J. Graph Alg. Appl."},{"issue":"2","key":"23_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.7155\/jgaa.00319","volume":"18","author":"D Eppstein","year":"2014","unstructured":"Eppstein, D.: Drawing arrangement graphs in small grids, or how to play planarity. J. Graph Alg. Appl. 18(2), 211\u2013231 (2014)","journal-title":"J. Graph Alg. Appl."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Farrugia, A.: Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard. Electr. J. Comb. 11(1) (2004)","DOI":"10.37236\/1799"},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/s00454-012-9394-8","volume":"47","author":"RJ Kang","year":"2012","unstructured":"Kang, R.J., M\u00fcller, T.: Sphere and dot product representations of graphs. Discrete Comput. Geom. 47(3), 548\u2013568 (2012)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"23_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/0404022","volume":"4","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J., Lubiw, A., Ne\u0161et\u0159il, J.: Noncrossing subgraphs in topological layouts. SIAM J. Discrete Math. 4(2), 223\u2013244 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. J. Comb. Theory, Ser. B 62(2), 289\u2013315 (1994)","DOI":"10.1006\/jctb.1994.1071"},{"key":"23_CR16","unstructured":"Matou\u0161ek, J.: Intersection graphs of segments and $${\\exists }\\mathbb{R}$$ (2014). arxiv.org\/1406.2636"},{"key":"23_CR17","first-page":"335","volume":"32","author":"NE Mn\u00ebv","year":"1985","unstructured":"Mn\u00ebv, N.E.: On manifolds of combinatorial types of projective configurations and convex polyhedra. Sov. Math., Dokl. 32, 335\u2013337 (1985)","journal-title":"Sov. Math., Dokl."},{"key":"23_CR18","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/BFb0082792","volume-title":"Topology and Geometry, Rohlin Seminar 1984\u20131986","author":"NE Mn\u00ebv","year":"1988","unstructured":"Mn\u00ebv, N.E.: The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. In: Viro, O. (ed.) Topology and Geometry, Rohlin Seminar 1984\u20131986. LNM, vol. 1346, pp. 527\u2013543. Springer, Heidelberg (1988)"},{"issue":"2","key":"23_CR19","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/1346330.1346336","volume":"55","author":"W Mulzer","year":"2008","unstructured":"Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. J. ACM 55(2), 11 (2008)","journal-title":"J. ACM"},{"issue":"3","key":"23_CR20","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"13","author":"J Renegar","year":"1992","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals, part I: Introduction. preliminaries. the geometry of semi-algebraic sets. the decision problem for the existential theory of the reals. J. Symb. Comput. 13(3), 255\u2013300 (1992)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"23_CR21","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/S0747-7171(10)80004-5","volume":"13","author":"J Renegar","year":"1992","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals, part II: The general decision problem. preliminaries for quantifier elimination. J. Symb. Comput. 13(3), 301\u2013328 (1992)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"23_CR22","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0747-7171(10)80005-7","volume":"13","author":"J Renegar","year":"1992","unstructured":"Renegar, J.: On the computational complexity and geometry of the first-order theory of the reals, part III: Quantifier elimination. J. Symb. Comput. 13(3), 329\u2013352 (1992)","journal-title":"J. Symb. Comput."},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-11805-0_32","volume-title":"Graph Drawing","author":"M Schaefer","year":"2010","unstructured":"Schaefer, M.: Complexity of some geometric and topological problems. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 334\u2013344. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-11805-0_32"},{"key":"23_CR24","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)","DOI":"10.1007\/s00224-015-9662-0"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Stretchability of pseudolines is NP-hard. In: Gritzmann, P., Sturmfels, B. (eds.) Applied Geometry and Discrete Mathematics-The Victor Klee Festschrift, DIMACS Series, vol. 4, pp. 531\u2013554 (1991). Amer. Math. Soc","DOI":"10.1090\/dimacs\/004\/41"},{"issue":"1","key":"23_CR26","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput. 3(1), 103\u2013128 (2007)","journal-title":"Theory Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62127-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:17:12Z","timestamp":1709828232000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62127-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319621265","9783319621272"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62127-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"5 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. John's","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}