On Proportional Allocation in Hedonic Games. - Martin Hoefer 001; Wanchote Jiamjitrak (SAGT, 2017)

Co-Bipartite Neighborhood Edge Elimination Orderings. - Wanchote Jiamjitrak; Erik Jan van Leeuwen (Electron. Notes Discret. Math., 2017)

New Binary Search Tree Bounds via Geometric Inversions. - Parinya Chalermsook; Wanchote Po Jiamjitrak (ESA, 2020)

On Finding Balanced Bicliques via Matchings. - Parinya Chalermsook; Wanchote Po Jiamjitrak; Ly Orgo (WG, 2020)

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition. - Parinya Chalermsook; Manoj Gupta 002; Wanchote Jiamjitrak; Nidia Obscura Acosta; Akash Pareek; Sorrachai Yingchareonthawornchai (SODA, 2023)

New Analytical Methods for Online Binary Search Trees. - Wanchote Po Jiamjitrak (2023)

The Group Access Bounds for Binary Search Trees. - Parinya Chalermsook; Manoj Gupta 002; Wanchote Jiamjitrak; Akash Pareek; Sorrachai Yingchareonthawornchai (ICALP, 2024)

Parameterised Approximation and Complexity of Minimum Flow Decompositions. - Andreas Grigorjew; Wanchote Jiamjitrak; Brendan Mumey; Alexandru I. Tomescu (CoRR, 2024)

Simple approximation algorithms for Polyamorous Scheduling. - Yuriy Biktairov; Leszek Gasieniec; Wanchote Po Jiamjitrak; Namrata; Benjamin Smith; Sebastian Wild (SOSA, 2025)

Maximum Coverage k-Antichains and Chains: A Greedy Approach. - Manuel Cáceres; Andreas Grigorjew; Wanchote Po Jiamjitrak; Alexandru I. Tomescu (CoRR, 2025)