{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:31:39Z","timestamp":1725550299732},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304678"},{"type":"electronic","value":"9783540320890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11589440_19","type":"book-chapter","created":{"date-parts":[[2005,11,9]],"date-time":"2005-11-09T07:08:15Z","timestamp":1131520095000},"page":"184-197","source":"Crossref","is-referenced-by-count":1,"title":["Crossing Stars in Topological Graphs"],"prefix":"10.1007","author":[{"given":"G\u00e1bor","family":"Tardos","sequence":"first","affiliation":[]},{"given":"G\u00e9za","family":"T\u00f3th","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","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":"19_CR2","series-title":"London Mathematical Society Lecture Notes","first-page":"167","volume-title":"Surveys in Combinatorics","author":"J. Pach","year":"1999","unstructured":"Pach, J.: Geometric graph theory. In: Lamb, J.D., Preece, D.A. (eds.) Surveys in Combinatorics. London Mathematical Society Lecture Notes, vol.\u00a0267, pp. 167\u2013200. Cambridge University Press, Cambridge (1999)"},{"key":"19_CR3","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":"19_CR4","doi-asserted-by":"crossref","unstructured":"Pach, J., Radoi\u010di\u0107, R., T\u00f3th, G.: A generalization of quasi-planarity. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs. Contemporary Mathematics, vol.\u00a0342, pp. 177\u2013183. AMS (2004)","DOI":"10.1090\/conm\/342\/06141"},{"key":"19_CR5","unstructured":"Pach, J., Pinchasi, R., Sharir, M., T\u00f3th, G.: Topological graphs with no large grids, Graphs and Combinatorics Special Issue dedicated to Victor Neumann-Lara"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-36151-0_28","volume-title":"Graph Drawing","author":"J. Pach","year":"2002","unstructured":"Pach, J., Pinchasi, R., Tardos, G., T\u00f3th, G.: Geometric graphs with no self-intersecting path of length three. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 295\u2013311. Springer, Heidelberg (2002)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Pach, J., Radoi\u010di\u0107, R., Tardos, G., T\u00f3th, G.: Improving the Crossing Lemma by finding more crossings in sparse graphs. In: Proceedings of the 20th Annual Symposium on Computational Geometry (SoCG 2004), pp. 76\u201385 (2004)","DOI":"10.1145\/997817.997831"},{"key":"19_CR8","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"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Schaefer, M., Stefankovi\u010d, D.: Decidability of string graphs. In: Proceedings of the 33rd Annual Symposium on the Theory of Computing (STOC 2001), pp. 241\u2013246 (2001)","DOI":"10.1145\/380752.380807"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11589440_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:47:37Z","timestamp":1619491657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11589440_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304678","9783540320890"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11589440_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}