{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:09:09Z","timestamp":1725548949301},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642118043"},{"type":"electronic","value":"9783642118050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11805-0_3","type":"book-chapter","created":{"date-parts":[[2010,3,5]],"date-time":"2010-03-05T07:45:33Z","timestamp":1267775133000},"page":"3-14","source":"Crossref","is-referenced-by-count":1,"title":["Drawing Hamiltonian Cycles with No Large Angles"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[]},{"given":"J\u00e1nos","family":"Pach","sequence":"additional","affiliation":[]},{"given":"G\u00e9za","family":"T\u00f3th","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.comgeo.2008.05.004","volume":"42","author":"E. Ackerman","year":"2009","unstructured":"Ackerman, E., Aichholzer, O., Keszegh, B.: Improved upper bounds on the reflexivity of point sets. Computational Geometry: Theory and Applications\u00a042(3), 241\u2013249 (2009)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-540-73951-7_40","volume-title":"Algorithms and Data Structures","author":"O. Aichholzer","year":"2007","unstructured":"Aichholzer, O., Hackl, T., Hoffmann, M., Huemer, C., P\u00f3r, A., Santos, F., Speckman, B., Vogtenhuber, B.: Maximizing maximal angles for plane straight-line graphs. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 458\u2013469. Springer, Heidelberg (2007)"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1137\/S0097539703434267","volume":"35","author":"E.M. Arkin","year":"2005","unstructured":"Arkin, E.M., Bender, M.A., Demaine, E.D., Fekete, S.P., Mitchell, J.S.B., Sethia, S.: Optimal covering tours with turn costs. SIAM Journal on Computing\u00a035(3), 531\u2013566 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/978-3-642-55566-4_6","volume-title":"Discrete and Computational Geometry: The Goodman-Pollack Festschrift","author":"E.M. Arkin","year":"2003","unstructured":"Arkin, E.M., Fekete, S., Hurtado, F., Mitchell, J., Noy, M., Sacrist\u00e1n, V., Sethia, S.: On the reflexivity of point sets. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry: The Goodman-Pollack Festschrift, pp. 139\u2013156. Springer, Heidelberg (2003)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-540-78773-0_56","volume-title":"LATIN 2008: Theoretical Informatics","author":"I. B\u00e1r\u00e1ny","year":"2008","unstructured":"B\u00e1r\u00e1ny, I., P\u00f3r, A., Valtr, P.: Paths with no small angles. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 654\u2013663. Springer, Heidelberg (2008)"},{"key":"3_CR6","unstructured":"Chan, T.: Remarks on k-level algorithms in the plane, manuscript, Univ. of Waterloo (1999)"},{"key":"3_CR7","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill, New York (2001)","edition":"2"},{"key":"3_CR8","volume-title":"What is Mathematics? An Elementary Approach to Ideas and Methods","author":"R. Courant","year":"1979","unstructured":"Courant, R., Robbins, H.: What is Mathematics? An Elementary Approach to Ideas and Methods. Oxford University Press, Oxford (1979)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/PL00009354","volume":"19","author":"T.K. Dey","year":"1998","unstructured":"Dey, T.K.: Improved bounds on planar k-sets and related problems. Discrete & Computational Geometry\u00a019, 373\u2013382 (1998)","journal-title":"Discrete & Computational Geometry"},{"issue":"4","key":"3_CR10","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0925-7721(96)00012-0","volume":"8","author":"S.P. Fekete","year":"1997","unstructured":"Fekete, S.P., Woeginger, G.J.: Angle-restricted tours in the plane. Computational Geometry: Theory and Applications\u00a08(4), 195\u2013218 (1997)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"3_CR11","unstructured":"Kyn\u0107l, J.: Personal communication (2009)"},{"key":"3_CR12","first-page":"107","volume":"14","author":"L. Lov\u00e1sz","year":"1971","unstructured":"Lov\u00e1sz, L.: On the number of halving lines. Ann. Univ. Sci. Budapest, E\u00f6tv\u00f6s, Sec. Math.\u00a014, 107\u2013108 (1971)","journal-title":"Ann. Univ. Sci. Budapest, E\u00f6tv\u00f6s, Sec. Math."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11805-0_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:44:03Z","timestamp":1606185843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11805-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642118043","9783642118050"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11805-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}