{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:49:07Z","timestamp":1770994147826,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540208310","type":"print"},{"value":"9783540245957","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24595-7_8","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T04:46:01Z","timestamp":1280378761000},"page":"86-97","source":"Crossref","is-referenced-by-count":3,"title":["Noncrossing Hamiltonian Paths in Geometric Graphs"],"prefix":"10.1007","author":[{"given":"Jakub","family":"\u010cern\u00fd","sequence":"first","affiliation":[]},{"given":"Zden\u011bk","family":"Dvo\u0159\u00e1k","sequence":"additional","affiliation":[]},{"given":"V\u00edt","family":"Jel\u00ednek","sequence":"additional","affiliation":[]},{"given":"Jan","family":"K\u00e1ra","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_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":"8_CR2","series-title":"London Math. Soc. Lecture Note Ser.","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1017\/CBO9780511721335.007","volume-title":"Geometric graph theory, Surveys in combinatorics, 1999 (Canterbury)","author":"J. Pach","year":"1999","unstructured":"Pach, J.: Geometric graph theory, Surveys in combinatorics, 1999 (Canterbury). London Math. Soc. Lecture Note Ser., vol.\u00a0267, pp. 167\u2013200. Cambridge Univ. Press, Cambridge (1999)"},{"key":"8_CR3","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033203","volume-title":"Combinatorial Geometry","author":"J. Pach","year":"1995","unstructured":"Pach, J., Agarwal, P.K.: Combinatorial Geometry. Wiley Interscience, New York (1995)"},{"key":"8_CR4","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., Radoi\u010di\u0107, R., Tardos, G., T\u00f3th, G.: Geometric graphs with no self\u2013intersecting path of length three. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528, pp. 295\u2013311. Springer, Heidelberg (2002)"},{"key":"8_CR5","unstructured":"Pinchasi, R., Radoi\u010di\u0107, R.: On the number of edges in geometric graphs with no selfintersecting cycle of length 4. In: Proc. 19th Annual Symposium on Computational Geometry (submitted)"},{"key":"8_CR6","unstructured":"Tardos, G.: On the number of edges in a geometric graph with no short self-intersecting paths (in preparation)"},{"key":"8_CR7","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: DiBattista, 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-540-24595-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T11:58:27Z","timestamp":1552823907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24595-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540208310","9783540245957"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24595-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}