Improved Analysis of RANKING for Online Vertex-Weighted Bipartite Matching. - Billy Jin; David P. Williamson (CoRR, 2020)

Online Nash Social Welfare via Promised Utilities. - Artur Gorokh; Siddhartha Banerjee; Billy Jin; Vasilis Gkatzelis (CoRR, 2020)

A Combinatorial Cut-Based Algorithm for Solving Laplacian Linear Systems. - Monika Henzinger; Billy Jin; David P. Williamson (CoRR, 2020)

High Probability Complexity Bounds for Line Search Based on Stochastic Oracles. - Billy Jin; Katya Scheinberg; Miaolan Xie (NeurIPS, 2021)

Improved Analysis of RANKING for Online Vertex-Weighted Bipartite Matching in the Random Order Model. - Billy Jin; David P. Williamson (WINE, 2021)

Cut-Toggling and Cycle-Toggling for Electrical Flow and Other p-Norm Flows. - Monika Henzinger; Billy Jin; Richard Peng; David P. Williamson (CoRR, 2021)

The Two-Stripe Symmetric Circulant TSP is in P. - Samuel C. Gutekunst; Billy Jin; David P. Williamson (IPCO, 2022)

Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model. - Billy Jin; Will Ma (NeurIPS, 2022)

Online Nash Social Welfare Maximization with Predictions. - Siddhartha Banerjee; Vasilis Gkatzelis; Artur Gorokh; Billy Jin (SODA, 2022)

Proportionally Fair Online Allocation of Public Goods with Predictions. - Siddhartha Banerjee; Vasilis Gkatzelis; Safwan Hossain; Billy Jin; Evi Micha; Nisarg Shah 001 (IJCAI, 2023)

A 4/3-Approximation Algorithm for Half-Integral Cycle Cut Instances of the TSP. - Billy Jin; Nathan Klein; David P. Williamson (IPCO, 2023)

Fluid Approximations for Revenue Management Under High-Variance Demand. - Yicheng Bai; Omar El Housni; Billy Jin; Paat Rusmevichientong; Huseyin Topaloglu; David P. Williamson (Manag. Sci., 2023)

A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems. - Monika Henzinger; Billy Jin; Richard Peng; David P. Williamson (Algorithmica, 2023)

The Online Submodular Assignment Problem. - Daniel Hathcock; Billy Jin; Kalen Patton; Sherry Sarkar; Michael Zlatin (FOCS, 2024)

A Lower Bound for the Max Entropy Algorithm for TSP. - Billy Jin; Nathan Klein; David P. Williamson (IPCO, 2024)

Sample Complexity of Posted Pricing for a Single Item. - Billy Jin; Thomas Kesselheim; Will Ma; Sahil Singla 001 (NeurIPS, 2024)

Online Matroid Intersection: Submodular Water-Filling and Matroidal Welfare Maximization. - Daniel Hathcock; Billy Jin; Kalen Patton; Sherry Sarkar; Michael Zlatin (CoRR, 2024)

High Probability Complexity Bounds for Adaptive Step Search Based on Stochastic Oracles. - Billy Jin; Katya Scheinberg; Miaolan Xie (SIAM J. Optim., 2024)

Sample complexity analysis for adaptive optimization algorithms with stochastic oracles. - Billy Jin; Katya Scheinberg; Miaolan Xie (Math. Program., 2025)

A $ frac{4}{3}$-approximation algorithm for half-integral cycle cut instances of the TSP. - Billy Jin; Nathan Klein; David P. Williamson (Math. Program., 2025)

Learning-Augmented Online Bipartite Fractional Matching. - Davin Choo; Billy Jin; Yongho Shin (CoRR, 2025)