{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:53:28Z","timestamp":1725472408589},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540332749"},{"type":"electronic","value":"9783540332756"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/978-3-540-33275-6_14","type":"book-chapter","created":{"date-parts":[[2006,11,1]],"date-time":"2006-11-01T17:00:19Z","timestamp":1162400419000},"page":"217-236","source":"Crossref","is-referenced-by-count":3,"title":["Minkowski decomposition of convex lattice polygons"],"prefix":"10.1007","author":[{"given":"Ioannis Z.","family":"Emiris","sequence":"first","affiliation":[]},{"given":"Elias P.","family":"Tsigaridas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1_14","unstructured":"CGAL: Computational geometry algorithms library. \n                  http:\/\/www.cgal.org\n                  \n                ."},{"key":"14_CR2_14","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, Cambridge, MA, 2nd edition, 2001.","edition":"2"},{"key":"14_CR3_14","unstructured":"J. Erickson. Lower bounds for satisfiability problems. Chicago J. of Theoretical Computer Science, 8, 1999. \n                  http:\/\/cjtcs.cs.uchicago.edu\/articles\/1999\/8\/contents.html"},{"issue":"3","key":"14_CR4_14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0925-7721(95)00022-2","volume":"5","author":"A Gajentaan","year":"1995","unstructured":"A. Gajentaan and M. H. Overmars. On a class of O(n2 ) problems in computa-tional geometry. Computational Geometry, Theory and Applications, 5(3):165-185, October 1995.","journal-title":"Computational Geometry, Theory and Applications"},{"key":"14_CR5_14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s00454-001-0024-0","volume":"26","author":"S Gao","year":"2001","unstructured":"S. Gao and A. G. B. Lauder. Decomposition of polytopes and polynomials. Discrete and Computational Geometry, 26:89-104, 2001.","journal-title":"Discrete and Computational Geometry"},{"key":"14_CR6_14","unstructured":"S. Gao and A. G. B. Lauder. Fast absolute irreducibility testing via Newton polytopes. preprint, 2004."},{"key":"14_CR7_14","unstructured":"R. Goldman. Pyramid Algorihtms: A dynamic approach to curves and surfaces for geometric modeling. Morgan Kaufmann, 2002."},{"key":"14_CR8_14","volume-title":"Handbook of computational geometry","author":"JE Goodman","year":"1995","unstructured":"J. E Goodman and J. O\u2019 Rourke. Handbook of computational geometry. Elsevier science, Amsterdam, 1995."},{"issue":"2","key":"14_CR9_14","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/321812.321823","volume":"21","author":"E Horowitz","year":"1974","unstructured":"E. Horowitz and S. Shani. Computing partitions with applications to the knap-sack problem. Journal of ACM, 21(2):277-292, April 1974.","journal-title":"Journal of ACM"},{"issue":"4","key":"14_CR10_14","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O Ibarra","year":"1975","unstructured":"O. Ibarra and C. Kim. Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM, 22(4):463-468, 1975.","journal-title":"J. ACM"},{"issue":"2","key":"14_CR11_14","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/S0022-0000(03)00006-0","volume":"66","author":"H Kellerer","year":"2003","unstructured":"H. Kellerer, R. Mansini, U. Pferschy, and M. G. Speranza. An efficient fully polynomial approximation scheme for the subset-sum problem. J. Comput. Syst. Sci., 66(2):349-370, 2003.","journal-title":"J. Comput. Syst. Sci."},{"issue":"1-2","key":"14_CR12_14","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/A:1015289823859","volume":"17","author":"R Krasauskas","year":"2002","unstructured":"R. Krasauskas. Toric surface patches: Advances in geometrical algorithms and representations. Adv. Comput. Math., 17(1-2):89-113, 2002.","journal-title":"Adv. Comput. Math."},{"key":"14_CR13_14","doi-asserted-by":"crossref","unstructured":"R. Krasauskas and R. Goldman. Toric Bezier Patches with Depth. In R. Gold-man and R. Krasauskas, editors, Topics in Geometric Modeling and Algebraic Geometry, volume 334, pages 65-91. AMS Mathematics of Computation, 2003.","DOI":"10.1090\/conm\/334\/05976"},{"key":"14_CR14_14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995."},{"key":"14_CR15_14","first-page":"98","volume":"30","author":"AM Ostrowski","year":"1921","unstructured":"A.M. Ostrowski.\u00dcber die Bedeutung der Theorie der konvexen Polyeder f\u00fcr die formale Algebra. Jahresberichte Deutsche Marth. Verein 30 (1921), 98-99.","journal-title":"Jahresberichte Deutsche Marth"},{"key":"14_CR16_14","volume-title":"Algorithms for the Knapsack problems","author":"D Pisinger","year":"1995","unstructured":"D. Pisinger. Algorithms for the Knapsack problems. PhD thesis, Department of Computer Science, University of Kopehagen, February 1995."},{"key":"14_CR17_14","unstructured":"F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 3rd edition, October 1990."},{"key":"14_CR18_14","first-page":"83","volume":"28","author":"S Rabinowitz","year":"1989","unstructured":"S. Rabinowitz. A census of convex lattice polygons with at most one interior lattice point. Ars Combinatorica, 28:83-96, 1989.","journal-title":"Ars Combinatorica"},{"key":"14_CR19_14","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0747-7171(03)00094-4","volume":"36","author":"J Schicho","year":"2003","unstructured":"J. Schicho. Simplification of surface parametrizations- a lattice polygon approach. J of Symbolic Computation, 36:535-554, 2003.","journal-title":"J of Symbolic Computation"},{"key":"14_CR20_14","volume-title":"Open problems around exact algorithms","author":"G Woeginger","year":"2004","unstructured":"G. Woeginger. Open problems around exact algorithms. Manuscript, TU Eindhoven, 2004."},{"key":"14_CR21_14","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-36478-1_17","volume-title":"Combinatorial Optimization - Eureka! You shrink!","author":"G Woeginger","year":"2003","unstructured":"G. Woeginger. Exact algorithms for NP-hard problems: A survey. In M. Juenger, G. Reinelt, and G. Rinaldi, editors, Combinatorial Optimization - Eureka! You shrink!, volume 2570, pages 185-207. LNCS, Springer, 2003."},{"key":"14_CR22_14","volume-title":"Fundamental Problems of Algorithmic Algebra","author":"CK Yap","year":"2000","unstructured":"C.K. Yap. Fundamental Problems of Algorithmic Algebra. Oxford University Press, New York, 2000."},{"key":"14_CR23_14","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/S0167-8396(00)00024-8","volume":"17","author":"S Zube","year":"2000","unstructured":"S. Zube. The n-sided toric patches and the A-resultants. Computer Aided Geometric Design, 17:695-714, 2000.","journal-title":"Computer Aided Geometric Design"}],"container-title":["Mathematics and Visualization","Algebraic Geometry and Geometric Modeling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-33275-6_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:59:00Z","timestamp":1619999940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-33275-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540332749","9783540332756"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-33275-6_14","relation":{},"ISSN":["1612-3786"],"issn-type":[{"type":"print","value":"1612-3786"}],"subject":[],"published":{"date-parts":[[2006]]}}}