Kunanon Burathep

Welcome to my personal website

Kunanon Burathep

(Pronunciation: Ku-na-non Bu-ra-thep)

PhD Student, Department of Computer Science
Durham University, United Kingdom

kunanon.burathep(at)durham.ac.uk k.burathep(at)gmail.com

Google Scholar dblp ORCID GitHub LinkedIn

About Me

I am a PhD student at Durham University, funded by an EPSRC Doctoral Studentship. I am a member of ACiD (Algorithms and Complexity in Durham) and NESTiD (Network Engineering, Science and Theory in Durham).

My research focuses on learning-augmented online algorithms, with a specific focus on online bipartite matching. I also have a strong interest in approximation algorithms for graph connectivity problems.

Learning-Augmented Algorithms
Online Bipartite Matching
Approximation Algorithms
Graph Connectivity

Selected Publications

SOFSEM 2026Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model

KB., T. Erlebach and W. K. Moses Jr.

51st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2026), 2026, pp. 361–375

DOI arXiv

JCSSE 2022An Approximation Algorithm for the Vertex Multicut on Trees with an Application to the Tracking Paths Problem

KB. and J. Fakcharoenphol

19th International Joint Conference on Computer Science and Software Engineering (JCSSE 2022), 2022, pp. 1-5

DOI

View all publications →