Buddhima Gamlath

14 papers A* 6Journal 6Unranked 1
YearRankTypeTitle / Venue / Authors
2022 A* conf
Approximate Cluster Recovery from Noisy Labels.
COLT
Buddhima Gamlath, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson
2021 — —
How to Match in Modern Computational Settings.
Buddhima Gamlath
2021 A* conf
Nearly-Tight and Oblivious Algorithms for Explainable Clustering.
NeurIPS
Buddhima Gamlath, Xinrui Jia, Adam Polak, Ola Svensson
2021 J jnl
Nearly-Tight and Oblivious Algorithms for Explainable Clustering.
CoRR
Buddhima Gamlath, Xinrui Jia, Adam Polak, Ola Svensson
2020 — conf
Approximating Star Cover Problems.
APPROX-RANDOM
Buddhima Gamlath, Vadim Grinberg
2019 J jnl
Approximating Star Cover Problems.
CoRR
Buddhima Gamlath, Vadim Grinberg
2019 A* conf
Beating Greedy for Stochastic Bipartite Matching.
SODA
Buddhima Gamlath, Sagar Kale, Ola Svensson
2019 J jnl
Beating Greedy for Stochastic Bipartite Matching.
CoRR
Buddhima Gamlath, Sagar Kale, Ola Svensson
2019 A* conf
Online Matching with General Arrivals.
FOCS
Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, David Wajc
2019 J jnl
Online Matching with General Arrivals.
CoRR
Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, David Wajc
2019 A* conf
Weighted Matchings via Unweighted Augmentations.
PODC
Buddhima Gamlath, Sagar Kale, Slobodan Mitrovic, Ola Svensson
2018 A* conf
Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering.
ICALP
Buddhima Gamlath, Sangxia Huang, Ola Svensson
2018 J jnl
Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering.
CoRR
Buddhima Gamlath, Sangxia Huang, Ola Svensson
2018 J jnl
Weighted Matchings via Unweighted Augmentations.
CoRR
Buddhima Gamlath, Sagar Kale, Slobodan Mitrovic, Ola Svensson