More Like this

1. Making an H $$H$$‐free graph k $$k$$‐colorable

   https://doi.org/10.1002/jgt.22868  

   Fox, Jacob; Himwich, Zoe; Mani, Nitya (February 2023, Journal of Graph Theory)
2. K-homology and K-theory for pure braid groups

   Azzali, Sara; Browne, Sarah L.; Gomez Aparicio, Maria Paula; Ruth, Lauren C.; Wang, Hang (January 2022, New York journal of mathematics)

   We produce an explicit description of the K-theory and K-homology of the pure braid group on n strands. We describe the Baum–Connes correspondence between the generators of the left- and right-hand sides for n = 4. Using functoriality of the assembly map and direct computations, we recover Oyono-Oyono’s result on the Baum–Connes conjecture for pure braid groups [24]. We also discuss the case of the full braid group on 3-strands. 

   more » « less
3. Dr. Top-k: Delegate-Centric Top-k on GPUs

   https://doi.org/10.1145/3458817.3476141  

   Gaihre, Anil; Zheng, Da; Weitze, Scott; Li, Lingda; Song, Shuaiwen; Ding, Caiwen; Li, Xiaoye; Liu, Hang (November 2021, The International Conference for High Performance Computing, Networking, Storage and Analysis (SC 21))
4. Improved Guarantees for k-means++ and k-means++ Parallel

   Makarychev, Konstantin; Reddy, Aravind; Shan, Liren (December 2020, Advances in neural information processing systems)

   In this paper, we study k-means++ and k-means++ parallel, the two most popular algorithms for the classic k-means clustering problem. We provide novel analyses and show improved approximation and bi-criteria approximation guarantees for k-means++ and k-means++ parallel. Our results give a better theoretical justification for why these algorithms perform extremely well in practice. We also propose a new variant of k-means++ parallel algorithm (Exponential Race k-means++) that has the same approximation guarantees as k-means++. 

   more » « less
5. Balanced k-Center Clustering When k Is A Constant

   Ding, Hu (July 2017, Proceedings of the 29th Canadian Conference on Computational Geometry)