{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:05:13Z","timestamp":1725761113009},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038407"},{"type":"electronic","value":"9783319038414"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03841-4_9","type":"book-chapter","created":{"date-parts":[[2013,12,2]],"date-time":"2013-12-02T00:28:55Z","timestamp":1385944135000},"page":"95-106","source":"Crossref","is-referenced-by-count":2,"title":["New Bounds on the Maximum Number of Edges in k-Quasi-Planar Graphs"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Suk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bartosz","family":"Walczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_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 Comput. Geom.\u00a041, 365\u2013375 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"9_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"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 3rd edn. Wiley Interscience (2008)","DOI":"10.1002\/9780470277331"},{"key":"9_CR4","unstructured":"Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer (2005)"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0095-8956(92)90003-G","volume":"56","author":"V. Capoyleas","year":"1992","unstructured":"Capoyleas, V., Pach, J.: A Tur\u00e1n-type theorem on chords of a convex polygon. J. Combin. Theory Ser. B\u00a056, 9\u201315 (1992)","journal-title":"J. Combin. Theory Ser. B"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Ann. Math.\u00a051, 161\u2013166 (1950)","journal-title":"Ann. Math."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1016\/j.ejc.2011.09.021","volume":"33","author":"J. Fox","year":"2012","unstructured":"Fox, J., Pach, J.: Coloring K\n                           \n                    k\n                  -free intersection graphs of geometric objects in the plane. European J. Combin.\u00a033, 853\u2013866 (2012)","journal-title":"European J. Combin."},{"key":"9_CR8","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, 550\u2013561 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"9_CR9","first-page":"737","volume":"33","author":"M. Klazar","year":"1992","unstructured":"Klazar, M.: A general upper bound in extremal theory of sequences, Comment. Math. Univ. Carolin.\u00a033, 737\u2013746 (1992)","journal-title":"Math. Univ. Carolin."},{"key":"9_CR10","unstructured":"Laso\u0144, M., Micek, P., Pawlik, A., Walczak, B.: Coloring intersection graphs of arc-connected sets in the plane (manuscript)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/PL00007228","volume":"16","author":"S. McGuinness","year":"2000","unstructured":"McGuinness, S.: Colouring arcwise connected sets in the plane I. Graphs Combin.\u00a016, 429\u2013439 (2000)","journal-title":"Graphs Combin."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0012-365X(95)00316-O","volume":"154","author":"S. McGuinness","year":"1996","unstructured":"McGuinness, S.: On bounding the chromatic number of L-graphs. Discrete Math.\u00a0154, 179\u2013187 (1996)","journal-title":"Discrete Math."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1706591.1706597","volume":"57","author":"G. Nivasch","year":"2010","unstructured":"Nivasch, G.: Improved bounds and new techniques for Davenport-Schinzel sequences and their generalizations. J. Assoc. Comput. Machin.\u00a057, 1\u201344 (2010)","journal-title":"J. Assoc. Comput. Machin."},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Pach, J., Radoi\u010di\u0107, R., T\u00f3th, G.: Relaxing planarity for topological graphs. In: Gy\u0151ri, E., Katona, G.O.H., Lov\u00e1sz, L., Fleiner, T. (eds.) More Sets, Graphs and Numbers, Bolyai Soc. Math. Stud., vol.\u00a015, pp. 285\u2013300. Springer (2006)","DOI":"10.1007\/978-3-540-32439-3_12"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/(SICI)1097-0118(199607)22:3<239::AID-JGT4>3.0.CO;2-N","volume":"22","author":"J. Pach","year":"1996","unstructured":"Pach, J., Shahrokhi, F., Szegedy, M.: Applications of the crossing number. J. Graph Theory\u00a022, 239\u2013243 (1996)","journal-title":"J. Graph Theory"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"1863","DOI":"10.1016\/j.jcta.2011.02.011","volume":"118","author":"S. Pettie","year":"2011","unstructured":"Pettie, S.: Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts. J. Combin. Theory Ser. A\u00a0118, 1863\u20131895 (2011)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Pettie, S.: On the structure and composition of forbidden sequences, with geometric applications. In: 27th ACM Symposium on Computational Geometry, pp. 370\u2013379. ACM (2011)","DOI":"10.1145\/1998196.1998258"},{"key":"9_CR18","unstructured":"Suk, A.: Coloring intersection graphs of x-monotone curves in the plane. Combinatorica (to appear)"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/PL00009364","volume":"19","author":"P. Valtr","year":"1998","unstructured":"Valtr, P.: On geometric graphs with no k pairwise parallel edges. Discrete Comput. Geom.\u00a019, 461\u2013469 (1998)","journal-title":"Discrete Comput. Geom."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03841-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T21:29:47Z","timestamp":1558733387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03841-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038407","9783319038414"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03841-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}