Sorrachai Yingchareonthawornchai
สรชัย ยิ่งเจริญถาวรชัย
Postdoc @ the Hebrew University of Jerusalem
Email: [firstname].cp@gmail.com
My research interests include fast graph algorithm design, combinatorial optimization, and extremal combinatorics. I am a post-doctoral researcher at the Hebrew University of Jerusalem working with Omri Weinstein. Previously, I was a Simons-Berkeley postdoctoral fellow at the Simons Institute, UC Berkeley (attending the Fall 2023 program on data structure and optimization for fast algorithms ). I completed a Ph.D. from the department of Computer Science, Aalto University in 2023 where I was fortunate to be advised by Parinya Chalermsook and Danupon Nanongkai.
[DBLP] [Google Scholar] [Twitter]
Recent Manuscripts
Deterministic k-Vertex Connectivity in k^2 Max-flows [PDF]
Chaitanya Nalam, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Recent Publications
The Group Access Bounds for Binary Search Trees [PDF]
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai
ICALP'24An FPTAS for Connectivity Interdiction [PDF soon]
Chien-Chung Huang, Nidia Obscura Acosta, Sorrachai Yingchareonthawornchai
IPCO'24Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns [PDF]
Parinya Chalermsook, Seth Pettie, Sorrachai Yingchareonthawornchai
SODA'24Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition [PDF]
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai
SODA'23Deterministic Small Vertex Connectivity in Almost Linear Time [PDF][Video]
Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
FOCS'22Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver [PDF] [Video]
Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai
ICALP'22Vertex Connectivity in Poly-Logarithmic Max-Flows [PDF] [Video]
Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
STOC'21, JACM'24Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity [PDF] [Source Code]
Max Franck, Sorrachai Yingchareonthawornchai
SEA'21, ACM Journal of Experimental Algorithmics'22Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms [PDF] [Slides by SF]
Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
SODA'20Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme [PDF] [Video by TS]
Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
STOC'19
Masters Students Supervised with Theses at Aalto University
Max Flanck, January 2021, An Experimental Study of a Near-Linear Time Algorithm for Small Vertex Connectivity.
Natalia Kushnerchuk, August 2023, Problems around the Stanley-Wilf Limits of Permutation.
Academic Services
Organizer: Aalto TCS theory seminar, Spring 2023 .
Reviewer: IEEE Transaction on Networking (TON) (2021)
Conference Subreviewers: ICALP 2019, DISC 2019, SOSA 2020, SWAT 2020, SODA 2021, SOSA 2021, ICALP 2021, FOCS 2022, SODA 2023, SOSA 2023, ITCS 2023, STOC 2023, FOCS 2023, SODA 2024, ITCS 2024, STOC 2024.
Acknowledgment: I am thankful to Danupon Nanongkai and Thatchaphol Saranurak for their encouragement and support to pursue a new Ph.D. in Theoretical Computer Science in 2018.