Publications

Edenis Azevedo, Carlos Ferreira, Alexandre Freire, Aritanan Gruber, Augusto Vellozo (2017). An exact algorithm for a problem on allocating indivisible goods under min-max fairness constraints. Proceedings of the XXXVII Congress of the Brazilian Society for Computing (2017).

PDF

Martin Anthony, Endre Boros, Yves Crama, Aritanan Gruber (2017). Quadratic reformulations of nonlinear binary optimization problems. Mathematical Programming, Series A (2017) 162:115–144.

PDF DOI

Martin Anthony, Endre Boros, Yves Crama, Aritanan Gruber (2016). Quadratization of symmetric pseudo-Boolean functions. Discrete Applied Mathematics (2016) Vol. 203, pp 1-12.

PDF DOI

Alexander Fix, Aritanan Gruber, Endre Boros, Ramin Zabih (2015). A Hypergraph-Based Reduction for Higher-Order Binary Markov Random Fields. IEEE Transactions on Pattern Analysis and Machine Intelligence (2015) Vol. 37, Issue 7, pp 1387-1395.

PDF DOI

Aritanan Gruber (2015). Algorithmic and Complexity Results for Boolean and Pseudo-Boolean Functions.

PDF

Endre Boros, Aritanan Gruber (2014). Hardness results for approximate pure Horn CNF formulae minimization. Annals of Mathematics and Artificial Intelligence (2014) Vol. 71, Issue 4, pp 327-363.

PDF DOI

Endre Boros, Aritanan Gruber (2012). On Quadratization of Pseudo-Boolean Functions.

PDF

Alexander Fix, Aritanan Gruber, Endre Boros, Ramin Zabih (2011). A graph cut algorithm for higher-order Markov Random Fields. 2011 International Conference on Computer Vision, Barcelona, Spain, pp 1020–1027.

PDF DOI

Renato P.F.L. Lucindo, Thiago M. Witt, Cassio P. de Campos, Aritanan B. G. Gruber (2006). jOptimum: Um Sistema de Otimização. Anais do XXVI Congresso da Sociedade Brasileira de Computação.