{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:44:39Z","timestamp":1725763479585},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450297"},{"type":"electronic","value":"9783642450303"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_16","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T02:32:52Z","timestamp":1386815572000},"page":"163-173","source":"Crossref","is-referenced-by-count":9,"title":["On the Number of Edges of Fan-Crossing Free Graphs"],"prefix":"10.1007","author":[{"given":"Otfried","family":"Cheong","sequence":"first","affiliation":[]},{"given":"Sariel","family":"Har-Peled","sequence":"additional","affiliation":[]},{"given":"Heuna","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Hyo-Sil","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00454-009-9143-9","volume":"41","author":"E. Ackerman","year":"2009","unstructured":"Ackerman, E.: On the maximum number of edges in topological graphs with no four pairwise crossing edges. Discrete & Computational Geometry\u00a041(3), 365\u2013375 (2009)","journal-title":"Discrete & Computational Geometry"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01196127","volume":"17","author":"P.K. Agarwal","year":"1997","unstructured":"Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica\u00a017, 1\u20139 (1997)","journal-title":"Combinatorica"},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"569","DOI":"10.7155\/jgaa.00274","volume":"16","author":"E.N. Argyriou","year":"2012","unstructured":"Argyriou, E.N., Bekos, M.A., Symvonis, A.: The straight-line RAC drawing problem is NP-hard. J. Graph Algorithms Appl.\u00a016(2), 569\u2013597 (2012)","journal-title":"J. Graph Algorithms Appl."},{"issue":"7","key":"16_CR4","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.ipl.2013.01.013","volume":"113","author":"W. Didimo","year":"2013","unstructured":"Didimo, W.: Density of straight-line 1-planar graph drawings. Inf. Process. Lett.\u00a0113(7), 236\u2013240 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"39","key":"16_CR5","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. Theo. Comp. Sci.\u00a0412(39), 5156\u20135166 (2011)","journal-title":"Theo. Comp. Sci."},{"issue":"7-8","key":"16_CR6","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1016\/j.dam.2012.11.019","volume":"161","author":"P. Eades","year":"2013","unstructured":"Eades, P., Liotta, G.: Right angle crossing graphs and 1-planarity. Discrete Applied Mathematics\u00a0161(7-8), 961\u2013969 (2013)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/110858586","volume":"27","author":"J. Fox","year":"2013","unstructured":"Fox, J., Pach, J., Suk, A.: The number of edges in k-quasi-planar graphs. SIAM J. Discrete Math.\u00a027(1), 550\u2013561 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-32241-9_29","volume-title":"Computing and Combinatorics","author":"S.-H. Hong","year":"2012","unstructured":"Hong, S.-H., Eades, P., Liotta, G., Poon, S.-H.: F\u00e1ry\u2019s theorem for 1-planar graphs. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol.\u00a07434, pp. 335\u2013346. Springer, Heidelberg (2012)"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1002\/jgt.21630","volume":"72","author":"V.P. Korzhik","year":"2013","unstructured":"Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity testing. Journal of Graph Theory\u00a072(1), 30\u201371 (2013)","journal-title":"Journal of Graph Theory"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s00373-005-0616-1","volume":"21","author":"J. Pach","year":"2005","unstructured":"Pach, J., Pinchasi, R., Sharir, M., T\u00f3th, G.: Topological graphs with no large grids. Graphs and Combinatorics\u00a021, 355\u2013364 (2005)","journal-title":"Graphs and Combinatorics"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-540-44400-8_24","volume-title":"Discrete and Computational Geometry","author":"J. Pach","year":"2003","unstructured":"Pach, J., Radoi\u010di\u0107, R., T\u00f3th, G.: Relaxing planarity for topological graphs. In: Akiyama, J., Kano, M. (eds.) JCDCG 2002. LNCS, vol.\u00a02866, pp. 221\u2013232. Springer, Heidelberg (2003)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Pach, J., Shahrokhi, F., Szegedy, M.: Applications of the crossing number. In: Proc. 10th Annu. ACM Sympos. Comput. Geom., pp. 198\u2013202 (1994)","DOI":"10.1145\/177424.177629"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01215922","volume":"17","author":"J. Pach","year":"1997","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica\u00a017, 427\u2013439 (1997)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T10:48:00Z","timestamp":1558781280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}