b'@inproceedings{AEFM2004-NWG,'b'\nTITLE = {Point Containment in the Integer Hull of a Polyhedron},\nAUTHOR = {Althaus, Ernst and Eisenbrand, Friedrich and Funke, Stefan and Mehlhorn, Kurt},\nLANGUAGE = {eng},\nISBN = {0-89871-558-X},\nLOCALID = {Local-ID: C1256BDD00205AD6-5A66A234AFD82E2DC1256E0C0040AD33-AEFM2004-NWG},\nPUBLISHER = {ACM},\nYEAR = {2004},\nDATE = {2004},\nABSTRACT = {We show that the point containment problem in the integer hull of a polyhedron, which is defined by $m$ inequalities, with coefficients of at most $\\varphi$ bits can be solved in time $O(m+\\varphi)$ in the two-dimensional case and in expected time $O(m+\\varphi^2 \\log m)$ in any fixed dimension. This improves on the algorithm which is based on the equivalence of separation and optimization in the general case and on a direct algorithm (SODA 97) for the two-dimensional case.},\nBOOKTITLE = {Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04)},\nPAGES = {929--933},\nADDRESS = {New Orleans, USA},\n}\n'