Pataki, G. Et Al. 2010. Basis reduction and the complexity of branch-and-bound. 21st Annual ACM-SIAM Symposium on Discrete Algorithms , (Austin, TX, United States Of America), 1254-1261.

Pataki, G., Tural, M. K., & Wong, E. B., (2010). Basis reduction and the complexity of branch-and-bound . 21st Annual ACM-SIAM Symposium on Discrete Algorithms (pp.1254-1261). Austin, TX, United States Of America

Pataki, Gábor, MUSTAFA KEMAL TURAL, And Erick B. Wong. "Basis reduction and the complexity of branch-and-bound," 21st Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, United States Of America, 2010

Pataki, Gábor Et Al. "Basis reduction and the complexity of branch-and-bound." 21st Annual ACM-SIAM Symposium on Discrete Algorithms , Austin, TX, United States Of America, pp.1254-1261, 2010

Pataki, G. Tural, M. K. And Wong, E. B. (2010) . "Basis reduction and the complexity of branch-and-bound." 21st Annual ACM-SIAM Symposium on Discrete Algorithms , Austin, TX, United States Of America, pp.1254-1261.

@conferencepaper{conferencepaper, author={Gábor Pataki Et Al. }, title={Basis reduction and the complexity of branch-and-bound}, congress name={21st Annual ACM-SIAM Symposium on Discrete Algorithms}, city={Austin, TX}, country={United States Of America}, year={2010}, pages={1254-1261} }