Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering. - Buddhima Gamlath; Sangxia Huang; Ola Svensson (ICALP, 2018)

Online Matching with General Arrivals. - Buddhima Gamlath; Michael Kapralov; Andreas Maggiori; Ola Svensson; David Wajc (FOCS, 2019)

Weighted Matchings via Unweighted Augmentations. - Buddhima Gamlath; Sagar Kale; Slobodan Mitrovic; Ola Svensson (PODC, 2019)

Beating Greedy for Stochastic Bipartite Matching. - Buddhima Gamlath; Sagar Kale; Ola Svensson (SODA, 2019)

Approximating Star Cover Problems. - Buddhima Gamlath; Vadim Grinberg (APPROX-RANDOM, 2020)

Nearly-Tight and Oblivious Algorithms for Explainable Clustering. - Buddhima Gamlath; Xinrui Jia 001; Adam Polak 001; Ola Svensson (NeurIPS, 2021)

How to Match in Modern Computational Settings. - Buddhima Gamlath (2021)

Approximate Cluster Recovery from Noisy Labels. - Buddhima Gamlath; Silvio Lattanzi; Ashkan Norouzi-Fard; Ola Svensson (COLT, 2022)