A graph cut algorithm for higher-order Markov Random Fields. - Alexander Fix; Aritanan Gruber; Endre Boros; Ramin Zabih (ICCV, 2011)

On quadratization of pseudo-Boolean functions. - Endre Boros; Aritanan Gruber (ISAIM, 2012)

Hardness results for approximate pure Horn CNF formulae minimization. - Endre Boros; Aritanan Gruber (Ann. Math. Artif. Intell., 2014)

A Hypergraph-Based Reduction for Higher-Order Binary Markov Random Fields. - Alexander Fix; Aritanan Gruber; Endre Boros; Ramin Zabih (IEEE Trans. Pattern Anal. Mach. Intell., 2015)

Quadratization of symmetric pseudo-Boolean functions. - Martin Anthony; Endre Boros; Yves Crama; Aritanan Gruber (Discret. Appl. Math., 2016)

Quadratic reformulations of nonlinear binary optimization problems. - Martin Anthony; Endre Boros; Yves Crama; Aritanan Gruber (Math. Program., 2017)