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)

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

Greedy on Preorder is Linear for Preorder Initial Tree. - Akash Pareek (CoRR, 2024)

A Simple PTAS for Weighted k-means and Sensor Coverage. - Akash Pareek; Supratim Shit (CoRR, 2025)