{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:25:36Z","timestamp":1725643536186},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258770"},{"type":"electronic","value":"9783642258787"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-25878-7_26","type":"book-chapter","created":{"date-parts":[[2011,12,14]],"date-time":"2011-12-14T21:23:04Z","timestamp":1323897784000},"page":"266-277","source":"Crossref","is-referenced-by-count":3,"title":["k-Quasi-Planar Graphs"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Suk","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1145\/1137856.1137895","volume-title":"Proceedings of the Twenty-Second Annual Symposium on Computational Geometry, SCG 2006","author":"E. Ackerman","year":"2006","unstructured":"Ackerman, E.: On the Maximum Number of Edges in Topological Graphs with No Four Pairwise Crossing Edges. In: Proceedings of the Twenty-Second Annual Symposium on Computational Geometry, SCG 2006, pp. 259\u2013263. ACM, New York (2006)"},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1145\/1542362.1542430","volume-title":"Proceedings of the 25th Annual Symposium on Computational Geometry, SCG 2009","author":"E. Ackerman","year":"2009","unstructured":"Ackerman, E., Fox, J., Pach, J., Suk, A.: On Grids in Topological Graphs. In: Proceedings of the 25th Annual Symposium on Computational Geometry, SCG 2009, pp. 403\u2013412. ACM, New York (2009)"},{"issue":"3","key":"26_CR3","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.: Note: On the Maximum Number of Edges in Quasi-Planar Graphs. J. Comb. Theory Ser. A\u00a0114(3), 563\u2013571 (2007)","journal-title":"J. Comb. Theory Ser. A"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0021784","volume-title":"Graph Drawing","author":"P.K. Agarwal","year":"1995","unstructured":"Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-Planar Graphs Have a Linear Number of Edges. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol.\u00a01027, pp. 1\u20137. Springer, Heidelberg (1995)"},{"key":"26_CR5","volume-title":"Research Problems in Discrete Geometry","author":"P. Brass","year":"2005","unstructured":"Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, Berlin (2005)"},{"key":"26_CR6","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. Combinatorial Theory, Series B\u00a056, 9\u201315 (1992)","journal-title":"J. Combinatorial Theory, Series B"},{"key":"26_CR7","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. Annals of Math\u00a051, 161\u2013166 (1950)","journal-title":"Annals of Math"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1145\/1377676.1377735","volume-title":"Proceedings of the Twenty-Fourth Annual Symposium on Computational Geometry, SCG 2008","author":"J. Fox","year":"2008","unstructured":"Fox, J., Pach, J.: Coloring K k -Free Intersection Graphs of Geometric Objects in the Plane. In: Proceedings of the Twenty-Fourth Annual Symposium on Computational Geometry, SCG 2008, pp. 346\u2013354. ACM, New York (2008)"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1112\/jlms\/jdq087","volume":"83","author":"J. Fox","year":"2011","unstructured":"Fox, J., Pach, J., T\u00f3th, C.: Intersection Patterns of Curves. Journal of the London Mathematical Society\u00a083, 389\u2013406 (2011)","journal-title":"Journal of the London Mathematical Society"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Fulek, R., Suk, A.: Disjoint Crossing Families. In: EuroComb 2011 (2011, to appear)","DOI":"10.1016\/j.endm.2011.09.060"},{"issue":"4","key":"26_CR11","first-page":"737","volume":"33","author":"M. Klazar","year":"1992","unstructured":"Klazar, M.: A General Upper Bound in Extremal Theory of Sequences. Commentationes Mathematicae Universitatis Carolinae\u00a033(4), 737\u2013746 (1992)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF01302967","volume":"14","author":"M. Klazar","year":"1994","unstructured":"Klazar, M., Valtr, P.: Generalized Davenport-Schinzel Sequences. Combinatorica\u00a014, 463\u2013476 (1994)","journal-title":"Combinatorica"},{"issue":"3","key":"26_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1706591.1706597","volume":"57","author":"G. Nivasch","year":"2010","unstructured":"Nivasch, G.: Improved Bounds and New Techniques for Davenport\u2013Schinzel Sequences and Their Generalizations. J. ACM\u00a057(3), 3, Article 17 (2010)","journal-title":"J. ACM"},{"key":"26_CR14","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)"},{"issue":"3","key":"26_CR15","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. Graph. Comb.\u00a021(3), 355\u2013364 (2005)","journal-title":"Graph. Comb."},{"key":"26_CR16","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"},{"issue":"6","key":"26_CR17","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. Comb. Theory Ser. A\u00a0118(6), 1863\u20131895 (2011)","journal-title":"J. Comb. Theory Ser. A"},{"key":"26_CR18","first-page":"370","volume-title":"Proceedings of the 27th Annual ACM Symposium on Computational Geometry, SCG 2011","author":"S. Pettie","year":"2011","unstructured":"Pettie, S.: On the Structure and Composition of Forbidden Sequences, with Geometric Applications. In: Proceedings of the 27th Annual ACM Symposium on Computational Geometry, SCG 2011, pp. 370\u2013379. ACM, New York (2011)"},{"issue":"3","key":"26_CR19","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1137\/050623693","volume":"21","author":"G. Tardos","year":"2007","unstructured":"Tardos, G., T\u00f3th, G.: Crossing Stars in Topological Graphs. SIAM J. Discret. Math.\u00a021(3), 737\u2013749 (2007)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"26_CR20","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/PL00009364","volume":"19","author":"P. Valtr","year":"1997","unstructured":"Valtr, P.: On Geometric Graphs with No k Pairwise Parallel Edges. Discrete Comput. Geom.\u00a019(3), 461\u2013469 (1997)","journal-title":"Discrete Comput. Geom."},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-63938-1_63","volume-title":"Graph Drawing","author":"P. Valtr","year":"1997","unstructured":"Valtr, P.: Graph Drawings with No k Pairwise Crossing Edges. In: Di Battista, G. (ed.) GD 1997. LNCS, vol.\u00a01353, pp. 205\u2013218. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25878-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T19:29:23Z","timestamp":1561058963000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25878-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642258770","9783642258787"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25878-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}