{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:55:41Z","timestamp":1725569741235},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169250"},{"type":"electronic","value":"9783642169267"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16926-7_14","type":"book-chapter","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T07:48:26Z","timestamp":1289375306000},"page":"135-146","source":"Crossref","is-referenced-by-count":7,"title":["Graphs that Admit Right Angle Crossing Drawings"],"prefix":"10.1007","author":[{"given":"Karin","family":"Arikushi","sequence":"first","affiliation":[]},{"given":"Radoslav","family":"Fulek","sequence":"additional","affiliation":[]},{"given":"Bal\u00e1azs","family":"Keszegh","sequence":"additional","affiliation":[]},{"given":"Filip","family":"Mori\u0107","sequence":"additional","affiliation":[]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"LNCS","volume-title":"Proc. 18th Sympos. on Graph Drawing","author":"E. Ackerman","year":"2010","unstructured":"Ackerman, E., Fulek, R., T\u00f3th, C.D.: On the size of graphs that admit polyline drawings with few bends and crossing angles. In: Proc. 18th Sympos. on Graph Drawing. LNCS, Springer, Heidelberg (2010)"},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/j.jcta.2006.08.002","volume":"114","author":"E. Ackerman","year":"2007","unstructured":"Ackerman, E., Tardos, G.: On the maximum number of edges in quasi-planar graphs. J. Combin. Theory Ser. A\u00a0114(3), 563\u2013571 (2007)","journal-title":"J. Combin. Theory Ser. A"},{"key":"14_CR3","series-title":"North-Holland Math. Stud.","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0304-0208(08)73484-4","volume-title":"Theory and practice of combinatorics","author":"M. Ajtai","year":"1982","unstructured":"Ajtai, M., Chv\u00e1tal, V., Newborn, M.M., Szemer\u00e9di, E.: Crossing-free subgraphs. In: Theory and practice of combinatorics. North-Holland Math. Stud., vol.\u00a060, pp. 9\u201312. North-Holland, Amsterdam (1982)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-11805-0_5","volume-title":"Graph Drawing","author":"P. Angelini","year":"2010","unstructured":"Angelini, P., Cittadini, L., Di Battista, G., Didimo, W., Frati, F., Kaufmann, M., Symvonis, A.: On the perspectives opened by right angle crossing drawings. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 21\u201332. Springer, Heidelberg (2010)"},{"issue":"4","key":"14_CR5","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1038\/scientificamerican1077-108","volume":"237","author":"K. Appel","year":"1977","unstructured":"Appel, K., Haken, W.: The solution of the four-color-map problem. Sci. Amer.\u00a0237(4), 108\u2013121 (1977)","journal-title":"Sci. Amer."},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-11805-0_4","volume-title":"Graph Drawing","author":"E. Di Giacomo","year":"2010","unstructured":"Di Giacomo, E., Didimo, W., Liotta, G., Meijer, H.: Area, curve complexity, and crossing resolution of non-planar graph drawings. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol.\u00a05849, pp. 15\u201320. Springer, Heidelberg (2010) (to appear)"},{"key":"14_CR7","series-title":"LNCS","first-page":"206","volume-title":"Proc. 11th WADS","author":"W. Didimo","year":"2009","unstructured":"Didimo, W., Eades, P., Liotta, G.: Drawing graphs with right angle crossings. In: Proc. 11th WADS. LNCS, vol.\u00a05664, pp. 206\u2013217. Springer, Heidelberg (2009)"},{"key":"14_CR8","unstructured":"Dujmovi\u0107, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. In: Proc. Computing: The Australian Theory Sympos.(CATS). CRPIT, ACS (2010) (to appear), \n                    \n                      http:\/\/arxiv.org\/abs\/0908.3545"},{"key":"14_CR9","unstructured":"Hlinen\u00fd, P.: Discharging technique in practice, Lecture text for Spring School on Combinatorics"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Huang, W.: Using eye tracking to investigate graph layout effects. In: 6th Asia-Pacific Sympos. Visualization (APVIS 2007), pp. 97\u2013100 (2007)","DOI":"10.1109\/APVIS.2007.329282"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Huang, W., Hong, S.-H., Eades, P.: Effects of crossing angles. In: Proc. IEEE Pacific Visualization Sympos., pp. 41\u201346 (2008)","DOI":"10.1109\/PACIFICVIS.2008.4475457"},{"key":"14_CR12","volume-title":"Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks","author":"F.T. Leighton","year":"1983","unstructured":"Leighton, F.T.: Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks. MIT Press, Cambridge (1983)"},{"issue":"4","key":"14_CR13","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00454-006-1264-9","volume":"36","author":"J. Pach","year":"2006","unstructured":"Pach, J., Radoi\u010di\u0107, R., Tardos, G., T\u00f3th, G.: Improving the crossing lemma by finding more crossings in sparse graphs. Discrete Comput. Geom.\u00a036(4), 527\u2013552 (2006)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01444968","volume":"58","author":"P. Wernicke","year":"1904","unstructured":"Wernicke, P.: \u00dcber den kartographischen Vierfarbensatz. Math. Ann.\u00a058(3), 413\u2013426 (1904)","journal-title":"Math. Ann."}],"container-title":["Lecture Notes in Computer Science","Graph Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16926-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T04:17:00Z","timestamp":1553228220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16926-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169250","9783642169267"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16926-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}