{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:37Z","timestamp":1725490237070},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642317699"},{"type":"electronic","value":"9783642317705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31770-5_10","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T05:03:12Z","timestamp":1343278992000},"page":"103-114","source":"Crossref","is-referenced-by-count":0,"title":["Crossing Angles of Geometric Graphs"],"prefix":"10.1007","author":[{"given":"Karin","family":"Arikushi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-18381-2_6","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"E.N. Argyriou","year":"2011","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: The Straight-Line RAC Drawing Problem Is NP-Hard. In: \u010cern\u00e1, I., Gyim\u00f3thy, T., Hromkovi\u010d, J., Jefferey, K., Kr\u00e1lovi\u0107, R., Vukoli\u0107, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol.\u00a06543, pp. 74\u201385. Springer, Heidelberg (2011)"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01215345","volume":"14","author":"B. Aronov","year":"1994","unstructured":"Aronov, B., Erd\u0151s, P., Goddard, W., Kleitman, D.J., Klugerman, M., Pach, J., Schulman, L.J.: Crossing families. Combinatorica\u00a014(2), 127\u2013134 (1994)","journal-title":"Combinatorica"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Bar\u00e1t, J., Matou\u0161ek, J., Wood, D.R.: Bounded-degree graphs have arbitrarily large geometric thickness. Electr. J. Comb.\u00a013(1) (2006)","DOI":"10.37236\/1029"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1002\/jgt.3190170308","volume":"17","author":"D. Bienstock","year":"1993","unstructured":"Bienstock, D., Dean, N.: Bounds for rectilinear crossing numbers. J. Graph Theory\u00a017(3), 333\u2013348 (1993)","journal-title":"J. Graph Theory"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-25011-8_13","volume-title":"Combinatorial Algorithms","author":"E. Giacomo Di","year":"2011","unstructured":"Di Giacomo, E., Didimo, W., Eades, P., Liotta, G.: 2-Layer Right Angle Crossing Drawings. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol.\u00a07056, pp. 156\u2013169. Springer, Heidelberg (2011)"},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s00224-010-9275-6","volume":"49","author":"E. Giacomo Di","year":"2011","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Area, curve complexity and crossing resolution of non-planar graph drawings. Theory Comput. Syst.\u00a049(3), 565\u2013575 (2011)","journal-title":"Theory Comput. Syst."},{"issue":"16","key":"10_CR7","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.ipl.2010.05.023","volume":"110","author":"W. Didimo","year":"2010","unstructured":"Didimo, W., Eades, P., Liotta, G.: A characterization of complete bipartite rac graphs. Inf. Process. Lett.\u00a0110(16), 687\u2013691 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"39","key":"10_CR8","doi-asserted-by":"publisher","first-page":"5156","DOI":"10.1016\/j.tcs.2011.05.025","volume":"412","author":"W. Didimo","year":"2011","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. Theor. Comput. Sci.\u00a0412(39), 5156\u20135166 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs. J. Graph Alg. & Appl.\u00a04(3), 5\u201317","DOI":"10.7155\/jgaa.00023"},{"key":"10_CR10","unstructured":"Dujmovi\u0107, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. Chicago J. Theor. Comput. Sci (2011)"},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.comgeo.2006.08.002","volume":"38","author":"V. Dujmovi\u0107","year":"2007","unstructured":"Dujmovi\u0107, V., Suderman, M., Wood, D.R.: Graph drawings with few slopes. Comput. Geom.\u00a038(3), 181\u2013193 (2007)","journal-title":"Comput. Geom."},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-25878-7_15","volume-title":"19th Symp. Graph Drawing","author":"P. Eades","year":"2011","unstructured":"Eades, P., Liotta, G.: Right Angle Crossing Graphs and 1-Planarity. In: Speckmann, B. (ed.) GD 2011. LNCS, vol.\u00a07034, pp. 148\u2013153. Springer, Heidelberg (2011)"},{"key":"10_CR13","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Math.\u00a02, 463\u2013470 (1935)","journal-title":"Compositio Math."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jctb.2004.11.002","volume":"94","author":"B. Jackson","year":"2005","unstructured":"Jackson, B., Jord\u00e1n, T.: Connected rigidity matroids and unique realizations of graphs. J. Combin. Theory, Ser.\u00a0B\u00a094, 1\u201329 (2005)","journal-title":"J. Combin. Theory, Ser.\u00a0B"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jctb.2009.03.004","volume":"100","author":"B. Jackson","year":"2010","unstructured":"Jackson, B., Jord\u00e1n, T.: Globally rigid circuits of the directionlength rigidity matroid. J. Combin. Theory, Ser.\u00a0B\u00a0100, 1\u20132 (2010)","journal-title":"J. Combin. Theory, Ser.\u00a0B"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-25878-7_25","volume-title":"19th Symp. Graph Drawing","author":"P. Mukkamala","year":"2011","unstructured":"Mukkamala, P., P\u00e1lv\u00f6lgyi, D.: Drawing Cubic Graphs with the Four Basic Slopes. In: Speckmann, B. (ed.) GD 2011. LNCS, vol.\u00a07034, pp. 254\u2013265. Springer, Heidelberg (2011)"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Pach, J., P\u00e1lv\u00f6lgyi, D.: Bounded-degree graphs can have arbitrarily large slope numbers. Electr. J. Comb.\u00a013(1) (2006)","DOI":"10.37236\/1139"},{"key":"10_CR18","first-page":"405","volume":"31","author":"A. Riskin","year":"1996","unstructured":"Riskin, A.: The crossing number of a cubic plane polyhedral map plus an edge. Studia Sci. Math. Hungar.\u00a031, 405\u2013413 (1996)","journal-title":"Studia Sci. Math. Hungar."},{"key":"10_CR19","unstructured":"Saxe, J.B.: Embeddability of weighted graphs in k-space is strongly NP-hard. In: 17th Allerton Conf. in Communications, Control and Computing, pp. 480\u2013489 (1979)"},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1017\/S144618110000300X","volume":"48","author":"G. Szekeres","year":"2006","unstructured":"Szekeres, G., Peters, L.: Computer solution to the 17-point Erd\u0151s-Szekeres problem. ANZIAM J.\u00a048(2), 151\u2013164 (2006)","journal-title":"ANZIAM J."},{"issue":"2","key":"10_CR21","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1093\/comjnl\/37.2.139","volume":"37","author":"G.A. Wade","year":"1994","unstructured":"Wade, G.A., Chu, J.-H.: Drawability of complete graphs using a minimal slope set. Comput. J.\u00a037(2), 139\u2013142 (1994)","journal-title":"Comput. J."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31770-5_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:47:39Z","timestamp":1620128859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31770-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642317699","9783642317705"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31770-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}