Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs. - Abraham P. Punnen; Piyashat Sripratak; Daniel Karapetyan (FCT, 2013)

The bipartite unconstrained 0-1 quadratic programming problem: Polynomially solvable cases. - Abraham P. Punnen; Piyashat Sripratak; Daniel Karapetyan (Discret. Appl. Math., 2015)

Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms. - Abraham P. Punnen; Piyashat Sripratak; Daniel Karapetyan (Theor. Comput. Sci., 2015)

The Bipartite Boolean Quadric Polytope. - Piyashat Sripratak; Abraham P. Punnen; Tamon Stephen (Discret. Optim., 2022)

Finding a b-matching that embeds the maximum number of edge pairs in a given set. - Siraphob Buahong; Vorapong Suppakitpaisarn; Piyashat Sripratak (J. Comb. Optim., 2025)