Author:
Eisenbrand Friedrich,Laue Sören
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)
2. Clarkson, K.L.: Las vegas algorithms for linear and integer programming when the dimension is small. Journal of the Association for Computing Machinery 42, 488–499 (1995)
3. Eisenbrand, F.: Short vectors of planar lattices via continued fractions. Information Processing Letters 79(3), 121–126 (2001)
4. Eisenbrand, F.: Fast integer programming in fixed dimension. Technical Report MPI-I-2003-NWG2-002, Max-Planck-Institut für Informatik, Saarbrücken, Germany (2003) (to appear in the Proceedings of ESA 2003)
5. Lecture Notes in Computer Science;F. Eisenbrand,2001
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Knapsack Intersection Graphs and Efficient Computation of Their Maximal Cliques;Computational Modeling of Objects Presented in Images. Fundamentals, Methods, and Applications;2014