{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:35:59Z","timestamp":1725561359692},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206958"},{"type":"electronic","value":"9783540245872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24587-2_31","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:59:19Z","timestamp":1280393959000},"page":"290-299","source":"Crossref","is-referenced-by-count":1,"title":["A Faster Algorithm for Two-Variable Integer Programming"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Eisenbrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00f6ren","family":"Laue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"31_CR2","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1145\/201019.201036","volume":"42","author":"K.L. Clarkson","year":"1995","unstructured":"Clarkson, K.L.: Las vegas algorithms for linear and integer programming when the dimension is small. Journal of the Association for Computing Machinery\u00a042, 488\u2013499 (1995)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"3","key":"31_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0020-0190(00)00186-1","volume":"79","author":"F. Eisenbrand","year":"2001","unstructured":"Eisenbrand, F.: Short vectors of planar lattices via continued fractions. Information Processing Letters\u00a079(3), 121\u2013126 (2001)","journal-title":"Information Processing Letters"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F.: Fast integer programming in fixed dimension. Technical Report MPI-I-2003-NWG2-002, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany (2003) (to appear in the Proceedings of ESA 2003)","DOI":"10.1007\/978-3-540-39658-1_20"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-45535-3_7","volume-title":"Integer Programming and Combinatorial Optimization","author":"F. Eisenbrand","year":"2001","unstructured":"Eisenbrand, F., Rote, G.: Fast 2-variable integer programming. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol.\u00a02081, pp. 78\u201389. Springer, Heidelberg (2001)"},{"issue":"1","key":"31_CR6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/2422.322417","volume":"31","author":"S.D. Feit","year":"1984","unstructured":"Feit, S.D.: A fast algorithm for the two-variable integer programming problem. Journal of the Association for Computing Machinery\u00a031(1), 99\u2013113 (1984)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Gau\u00df, C.F.: Disquisitiones arithmeticae. Gerh. Fleischer Iun. (1801)","DOI":"10.5479\/sil.324926.39088000932822"},{"issue":"1","key":"31_CR8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/321921.321936","volume":"23","author":"D.S. Hirschberg","year":"1976","unstructured":"Hirschberg, D.S., Wong, C.K.: A polynomial algorithm for the knapsack problem in two variables. Journal of the Association for Computing Machinery\u00a023(1), 147\u2013154 (1976)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"31_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1142\/S0218195994000069","volume":"4","author":"N. Kanamaru","year":"1994","unstructured":"Kanamaru, N., Nishizeki, T., Asano, T.: Efficient enumeration of grid points in a convex polygon and its application to integer programming. International Journal of Computational Geometry & Applications\u00a04(1), 69\u201385 (1994)","journal-title":"International Journal of Computational Geometry & Applications"},{"issue":"1","key":"31_CR10","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322169.322179","volume":"27","author":"R. Kannan","year":"1980","unstructured":"Kannan, R.: A polynomial algorithm for the two-variable integer programming problem. Journal of the Association for Computing Machinery\u00a027(1), 118\u2013122 (1980)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"577","DOI":"10.2307\/1971436","volume":"128","author":"R. Kannan","year":"1988","unstructured":"Kannan, R., Lov\u00e1sz, L.: Covering minima and lattice-point-free convex bodies. Annals of Mathematics\u00a0128, 577\u2013602 (1988)","journal-title":"Annals of Mathematics"},{"key":"31_CR12","unstructured":"Khintchine, A.Y.: Continued Fractions. Noordhoff, Groningen (1963)"},{"key":"31_CR13","volume-title":"The art of computer programming","author":"D. Knuth","year":"1969","unstructured":"Knuth, D.: The art of computer programming, vol.\u00a02. Addison-Wesley, Reading (1969)"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0196-6774(80)90021-8","volume":"1","author":"J.C. Lagarias","year":"1980","unstructured":"Lagarias, J.C.: Worst-case complexity bounds for algorithms in the theory of integral quadratic forms. Journal of Algorithms\u00a01, 142\u2013186 (1980)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"31_CR15","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Mathematics of Operations Research\u00a08(4), 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"key":"31_CR16","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N. Megiddo","year":"1984","unstructured":"Megiddo, N.: Linear programming in linear time when the dimension is fixed. Journal of the Association for Computing Machinery\u00a031, 114\u2013127 (1984)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1911124","volume":"49","author":"H.E. Scarf","year":"1981","unstructured":"Scarf, H.E.: Production sets with indivisibilities. Part I: generalities. Econometrica\u00a049, 1\u201332 (1981)","journal-title":"Econometrica"},{"key":"31_CR18","doi-asserted-by":"publisher","first-page":"395","DOI":"10.2307\/1913318","volume":"49","author":"H.E. Scarf","year":"1981","unstructured":"Scarf, H.E.: Production sets with indivisibilities. Part II: The case of two activities. Econometrica\u00a049, 395\u2013423 (1981)","journal-title":"Econometrica"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1145\/120694.120711","volume-title":"International Symposium on Symbolic and Algebraic Computation, ISSAC 1991","author":"A. Sch\u00f6nhage","year":"1991","unstructured":"Sch\u00f6nhage, A.: Fast reduction and composition of binary quadratic forms. In: International Symposium on Symbolic and Algebraic Computation, ISSAC 1991, pp. 128\u2013133. ACM Press, New York (1991)"},{"key":"31_CR20","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley, Chichester (1986)"},{"key":"31_CR21","first-page":"1132","volume":"20","author":"L.Y. Zamanskij","year":"1984","unstructured":"Zamanskij, L.Y., Cherkasskij, V.D.: A formula for determining the number of integral points on a straight line and its application. Ehkon. Mat. Metody\u00a020, 1132\u20131138 (1984)","journal-title":"Ehkon. Mat. Metody"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24587-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T18:58:09Z","timestamp":1591729089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}