{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T17:53:23Z","timestamp":1767117203582},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2005,9]]},"DOI":"10.1007\/s00373-005-0616-1","type":"journal-article","created":{"date-parts":[[2005,10,25]],"date-time":"2005-10-25T13:35:17Z","timestamp":1130247317000},"page":"355-364","source":"Crossref","is-referenced-by-count":23,"title":["Topological Graphs with No Large Grids"],"prefix":"10.1007","volume":"21","author":[{"given":"J\u00e1nos","family":"Pach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rom","family":"Pinchasi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha","family":"Sharir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e9za","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"616_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica 17, 1\u20139 (1997)","DOI":"10.1007\/BF01196127"},{"key":"616_CR2","unstructured":"Bra\u00df, P., K\u00e1rolyi, G., Valtr, P.: A Tur\u00e1n-type extremal theory of convex geometric graphs. In: Discrete and Computational Geometry \u2013 The Goodman-Pollack Festschrift, B. Aronov et al., (eds.), Algorithms and Combinatorics 25, Springer, Berlin, 2003, pp. 275\u2013300"},{"key":"616_CR3","doi-asserted-by":"crossref","unstructured":"Pach, J.: Geometric graph theory. In: Surveys in Combinatorics, 1999, J.D. Lamb, D.A. Preece, (eds.), London Mathematical Society Lecture Notes 267, Cambridge University Press, Cambridge, 1999, pp. 167\u2013200","DOI":"10.1017\/CBO9780511721335.007"},{"key":"616_CR4","doi-asserted-by":"crossref","unstructured":"Pach, J., Radoi\u010di\u0107, R., T\u00f3th, G.: Relaxing planarity for topological graphs. In: Discrete and Computational Geometry, J. Akiyama, M. Kano (eds.), Lecture Notes in Computer Science 2866 Springer, Berlin, 2003, 221\u2013232","DOI":"10.1007\/978-3-540-44400-8_24"},{"key":"616_CR5","doi-asserted-by":"crossref","unstructured":"Pach, J., Radoi\u010di\u0107, R., T\u00f3th, G.: A generalization of quasi-planarity. In: Towards a Theory of Geometric Graphs, J. Pach (ed.), Contemporary Mathematics 342, AMS, 2004, 177\u2013183","DOI":"10.1090\/conm\/342\/06141"},{"key":"616_CR6","doi-asserted-by":"crossref","unstructured":"Pach, J., Pinchasi, R., Tardos, G., T\u00f3th, G.: Geometric graphs with no self-intersecting path of length three. In: Graph Drawing, M.T. Goodrich, S.G. Kobourov (eds.), Lecture Notes in Computer Science 2528, Springer, Berlin, 2002, pp. 295\u2013311. Also in: European Journal of Combinatorics 25, 793\u2013811 (2004)","DOI":"10.1016\/j.ejc.2003.09.019"},{"key":"616_CR7","doi-asserted-by":"crossref","unstructured":"Pach, J., T\u00f3th, G.: Graphs drawn with few crossings per edge. Combinatorica 17, 427\u2013439 (1997)","DOI":"10.1007\/BF01215922"},{"key":"616_CR8","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), 2001, pp. 241\u2013246","DOI":"10.1145\/380752.380807"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0616-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-005-0616-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0616-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:25Z","timestamp":1559055505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-005-0616-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["616"],"URL":"https:\/\/doi.org\/10.1007\/s00373-005-0616-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}