{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:10Z","timestamp":1750306930120,"version":"3.41.0"},"reference-count":2,"publisher":"Association for Computing Machinery (ACM)","issue":"3\/4","license":[{"start":{"date-parts":[[2013,1,15]],"date-time":"2013-01-15T00:00:00Z","timestamp":1358208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2013,1,15]]},"DOI":"10.1145\/2429135.2429141","type":"journal-article","created":{"date-parts":[[2013,1,22]],"date-time":"2013-01-22T15:28:56Z","timestamp":1358868536000},"page":"76-77","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Partition analysis via polyhedral geometry"],"prefix":"10.1145","volume":"46","author":[{"given":"Felix","family":"Breuer","sequence":"first","affiliation":[{"name":"Department of Mathematics, San Francisco State University, funded by DFG grant BR 4251\/1-1"}]},{"given":"Zafeirakis","family":"Zafeirakopoulos","sequence":"additional","affiliation":[{"name":"Research Institute for Symbolic Computation (RISC) \/ DK-compmath, funded by Austrian Marshall Plan Foundation and Austrian Science Fund (FWF)"}]}],"member":"320","published-online":{"date-parts":[[2013,1,15]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"A. Barvinok. Integer points in polyhedra. Zurich Lectures in Advanced Mathematics. Z\u00fcrich: European Mathematical Society (EMS). viii 190 p. 2008.  A. Barvinok. Integer points in polyhedra. Zurich Lectures in Advanced Mathematics. Z\u00fcrich: European Mathematical Society (EMS). viii 190 p. 2008.","DOI":"10.4171\/052"},{"key":"e_1_2_1_2_1","first-page":"251","volume":"5","author":"Andrews G.","journal-title":"New Reduction Algorithm. Ann. Comb."}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429135.2429141","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2429135.2429141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:35Z","timestamp":1750235735000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2429135.2429141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,15]]},"references-count":2,"journal-issue":{"issue":"3\/4","published-print":{"date-parts":[[2013,1,15]]}},"alternative-id":["10.1145\/2429135.2429141"],"URL":"https:\/\/doi.org\/10.1145\/2429135.2429141","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2013,1,15]]},"assertion":[{"value":"2013-01-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}