{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:41:14Z","timestamp":1725565274907},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220572"},{"type":"electronic","value":"9783540247678"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24767-8_9","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T20:45:04Z","timestamp":1284151504000},"page":"81-89","source":"Crossref","is-referenced-by-count":0,"title":["Combinatories and Triangulations"],"prefix":"10.1007","author":[{"given":"Tomas","family":"Hlavaty","sequence":"first","affiliation":[]},{"given":"Vaclav","family":"Skala","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure. ACM Computing Surveys\u00a023(3), 345\u2013405 (1991)","journal-title":"ACM Computing Surveys"},{"key":"9_CR2","unstructured":"Drysdale, R., L., S., McElfresh, S., Snoeyink, J., S.: An improved diamond property for minimum weight triangulation (1998)"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1145\/321765.321781","volume":"20","author":"G. Ehrlich","year":"1973","unstructured":"Ehrlich, G.: Loopless algorithms for generating permutations, combinations, and other combinatorial configurations. Journal of the ACM\u00a020(3), 500\u2013513 (1973)","journal-title":"Journal of the ACM"},{"key":"9_CR4","volume-title":"Intractability: A Guide to the theory of NPcompleteness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, R., Computers, D.S.: Intractability: A Guide to the theory of NPcompleteness. W. H. Freeman, San Francisco (1979)"},{"key":"9_CR5","unstructured":"Jansson, J.: Planar Minimum Weight Triangulations, Master\u2019s Thesis, Department of Computer Science, Lund University, Sweden (1995)"},{"key":"9_CR6","unstructured":"Kucera, L.: Combinatorial Algorithms, SNTL, Publisher of Technical Literature (1989) ISBN 0-85274-298-3"},{"key":"9_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry - an Introduction","author":"F.P. Preparate","year":"1985","unstructured":"Preparate, F.P., Shamos, M.I.: Computational Geometry - an Introduction. Springer, New York (1985)"},{"issue":"5","key":"9_CR8","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1093\/comjnl\/42.5.400","volume":"42","author":"T. Takaoka","year":"1999","unstructured":"Takaoka, T.: O(1) time algorithms for combinatorial generation by tree traversal. Computer Jurnal\u00a042(5), 400\u2013408 (1999)","journal-title":"Computer Jurnal"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1093\/comjnl\/44.4.292","volume":"44","author":"L. Xiang","year":"2001","unstructured":"Xiang, L., Ushijima, K.: On O(1) Time Algorithms for Combinatorial Generation. The Computer Journal\u00a044(4), 292\u2013302 (2001)","journal-title":"The Computer Journal"},{"key":"9_CR10","unstructured":"Yang, B., T., Xu, Y., F., You, Z., Y.: A chain decomposition algorithm for the proof of a property on minimum weight triangulations (1994)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24767-8_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:08:27Z","timestamp":1619996907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24767-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220572","9783540247678"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24767-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}