Billy Jin
Computer Science · Purdue University West Lafayette
Publications
38
Citations
120
Est. group size
—
Recurring co-author estimate
Active years
7
Publishing since 2020
Billy Jin works in theoretical computer science and operations research, focusing on the design and analysis of algorithms for combinatorial optimization problems such as the Traveling Salesman Problem (TSP), online matching, and resource allocation. Much of this work involves proving mathematical guarantees on how close approximation algorithms come to optimal solutions, as well as designing algorithms that make good decisions under uncertainty (e.g., online settings where inputs arrive over time, or when using predictions to guide decisions). This research is largely mathematical and theoretical, aimed at understanding the fundamental limits and capabilities of efficient algorithms.
Publication output grew from none a decade ago to a steady pace of roughly 6-9 papers per year since 2022, indicating consistent and active recent research activity.
Generated by claude-sonnet-5 from public bibliographic data · Jul 20, 2026
- Maximum Entropy is a 10/7-Approximation Algorithm for the TSP on Half-Integral Cycle Cut Instances
arXiv (Cornell University) · 2026
- Maximum Entropy is a 10/7-Approximation Algorithm for the TSP on Half-Integral Cycle Cut Instances
arXiv (Cornell University) · 2026
- Maximum Entropy is a 10/7-Approximation Algorithm for the TSP on Half-Integral Cycle Cut Instances
Operations Research Letters · 2026
- A $$\frac{4}{3}$$-approximation algorithm for half-integral cycle cut instances of the TSP
Mathematical Programming · 2025
- The two-stripe symmetric circulant TSP is in P
Mathematical Programming · 2025
- Learning-Augmented Online Bipartite Fractional Matching
arXiv (Cornell University) · 2025
- Sample Complexity of Posted Pricing for a Single Item
2024
- The Online Submodular Assignment Problem
arXiv (Cornell University) · 2024
- A Lower Bound for the Max Entropy Algorithm for TSP
Lecture notes in computer science · 2024
- Sample Complexity of Posted Pricing for a Single Item
arXiv (Cornell University) · 2024
- The Online Submodular Assignment Problem
2024
- The Online Submodular Assignment Problem
arXiv (Cornell University) · 2024
- Fluid Approximations for Revenue Management Under High-Variance Demand
Management Science · 2023
- A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems
Algorithmica · 2023
- Proportionally Fair Online Allocation of Public Goods with Predictions
2023
- arXiv (Cornell University)×21
- Lecture notes in computer science×4
- Mathematical Programming×3
- Management Science×1
- SIAM Journal on Optimization×1
- Kent Quanrud
Computer Science · Purdue University West Lafayette
- Shai Vardi
Computer Science · Purdue University West Lafayette
- Qin Zhang
Computer Science · Indiana University
- Pooya Hatami
Computer Science · The Ohio State University
- Elena Grigorescu
Computer Science · Purdue University West Lafayette
This profile was generated automatically from public scholarly data (OpenAlex). Group size and activity levels are estimates derived from co-authorship patterns.
Last updated Jul 20, 2026.
Claim or correct this profile