Piyashat Sripratak

According to our database, Piyashat Sripratak authored at least 6 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Approximation Algorithms for the <i>b</i>-Matching and List-Restricted Variants of MaxQAP.

Jiratchaphat Nanta, Vorapong Suppakitpaisarn, Piyashat Sripratak

CoRR, December, 2025

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., July, 2025

2022

The Bipartite Boolean Quadric Polytope.

Piyashat Sripratak, Abraham P. Punnen, Tamon Stephen

Discret. Optim., 2022

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 unconstrained 0-1 quadratic programming problem: Polynomially solvable cases.

Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan

Discret. Appl. Math., 2015

2013

Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs.

Abraham P. Punnen, Piyashat Sripratak, Daniel Karapetyan

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013