Lecture Hall Partitions and the Wreath Products Ck ≀ Sn. - Thomas W. Pensyl; Carla D. Savage (Integers, 2012)

An Improved Approximation for $k$-median, and Positive Correlation in Budgeted Optimization. - Jaroslaw Byrka; Thomas W. Pensyl; Bartosz Rybicki; Aravind Srinivasan; Khoa Trinh (CoRR, 2014)

An Improved Approximation Algorithm for Knapsack Median Using Sparsification. - Jaroslaw Byrka; Thomas W. Pensyl; Bartosz Rybicki; Joachim Spoerhase; Aravind Srinivasan; Khoa Trinh (ESA, 2015)

An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization. - Jaroslaw Byrka; Thomas W. Pensyl; Bartosz Rybicki; Aravind Srinivasan; Khoa Trinh (SODA, 2015)

A Lottery Model for Center-Type Problems with Outliers. - David G. Harris 001; Thomas W. Pensyl; Aravind Srinivasan; Khoa Trinh (APPROX-RANDOM, 2017)

Symmetric Randomized Dependent Rounding. - David G. Harris 001; Thomas W. Pensyl; Aravind Srinivasan; Khoa Trinh (CoRR, 2017)

Approximation algorithms for stochastic clustering. - David G. Harris 001; Shi Li 001; Aravind Srinivasan; Khoa Trinh; Thomas W. Pensyl (NeurIPS, 2018)

Dependent randomized rounding for clustering and partition systems with knapsack constraints. - David G. Harris 001; Thomas W. Pensyl; Aravind Srinivasan; Khoa Trinh (AISTATS, 2020)

Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median. - Kishen N. Gowda; Thomas W. Pensyl; Aravind Srinivasan; Khoa Trinh (CoRR, 2022)

Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median. - Kishen N. Gowda; Thomas W. Pensyl; Aravind Srinivasan; Khoa Trinh (SODA, 2023)