Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{halman:LIPIcs:2016:6632, author = {Nir Halman}, title = {{A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)}, pages = {9:19:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770187}, ISSN = {18688969}, year = {2016}, volume = {60}, editor = {Klaus Jansen and Claire Mathieu and Jos{\'e} D. P. Rolim and Chris Umans}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6632}, URN = {urn:nbn:de:0030drops66327}, doi = {10.4230/LIPIcs.APPROXRANDOM.2016.9}, annote = {Keywords: Approximate counting, integer knapsack, dynamic programming, bounding constraints, $K$approximating sets and functions} }
Keywords:  Approximate counting, integer knapsack, dynamic programming, bounding constraints, $K$approximating sets and functions  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)  
Issue Date:  2016  
Date of publication:  06.09.2016 