{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:06:48Z","timestamp":1762099608665},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4399,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00229-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:59:17Z","timestamp":1027580357000},"page":"37-46","source":"Crossref","is-referenced-by-count":9,"title":["On computing Hilbert bases via the Elliot\u2013MacMahon algorithm"],"prefix":"10.1016","volume":"263","author":[{"given":"Dmitrii V.","family":"Pasechnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0304-3975(00)00229-2_BIB1","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0747-7171(92)90025-Y","article-title":"AC-unification race","volume":"14","author":"Adi","year":"1992","journal-title":"J. Symbolic Comput."},{"issue":"1","key":"10.1016\/S0304-3975(00)00229-2_BIB2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1006\/inco.1994.1067","article-title":"An efficient incremental algorithm for solving systems of linear Diophantine equations","volume":"113","author":"Contejean","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(00)00229-2_BIB3","series-title":"Computational Geometry: Algorithms and Applications","author":"de Berg","year":"1997"},{"key":"10.1016\/S0304-3975(00)00229-2_BIB4","series-title":"Proceedings Principles and Practice of Constraint Programming \u2013 CP\u201995, vol. 976, Lecture Notes in Computer Science","first-page":"18","article-title":"From Elliott\u2013MacMahon to an algorithm for general linear constraints on naturals.","author":"Domenjoud","year":"1995"},{"key":"10.1016\/S0304-3975(00)00229-2_BIB5","unstructured":"M. Filgueiras, A.P. Tom\u00e1s, A note on the implementation of the Elliott\u2013MacMahon algorithm, Tech. Rep. Department of Computer Science, University of Porto, June 1992."},{"key":"10.1016\/S0304-3975(00)00229-2_BIB6","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/BF03322141","article-title":"On Hilbert bases of polyhedral cones","volume":"32","author":"Henk","year":"1997","journal-title":"Results Math."},{"key":"10.1016\/S0304-3975(00)00229-2_BIB7","series-title":"Proceedings of the 4th International Conference on Rewriting Techniques and Applications, vol. 488, Lecture Notes in Computer Science","first-page":"162","article-title":"Minimal solutions of linear Diophantine systems: bounds and algorithms","author":"Pottier","year":"1991"},{"key":"10.1016\/S0304-3975(00)00229-2_BIB8","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0304-3975(00)00229-2_BIB9","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1215\/S0012-7094-73-04054-4","article-title":"Magic labellings of graphs, symmetric magic squares, systems of parameters and Cohen-Macaulay rings","volume":"40","author":"Stanley","year":"1973","journal-title":"Duke Math. J."},{"key":"10.1016\/S0304-3975(00)00229-2_BIB10","unstructured":"R.P. Stanley, Enumerative combinatorics, vol. 1, Cambridge Studies in Advanced Mathematics, vol. 49, Cambridge University Press, Cambridge, 1997. With a foreword by Gian-Carlo Rota, Corrected reprint of the 1986 original."},{"key":"10.1016\/S0304-3975(00)00229-2_BIB11","volume":"vol. 8","author":"Sturmfels","year":"1996"},{"key":"10.1016\/S0304-3975(00)00229-2_BIB12","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1287\/moor.20.4.864","article-title":"A geometric Buchberger algorithm for integer programming","volume":"20","author":"Thomas","year":"1995","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0304-3975(00)00229-2_BIB13","unstructured":"A.P. Tom\u00e1s, On solving linear Diophantine constraints, Ph.D. Thesis, Department of Computer Science, University of Porto, January 1997."},{"key":"10.1016\/S0304-3975(00)00229-2_BIB14","series-title":"Some Tapas of Computer Algebra","article-title":"Gr\u00f6bner bases and integer programming","author":"Ziegler","year":"1999"},{"key":"10.1016\/S0304-3975(00)00229-2_BIB15","volume":"vol. 152","author":"Ziegler","year":"1995"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002292?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002292?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T06:21:38Z","timestamp":1556778098000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500002292"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00229-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}