The Power of The Hybrid Model for Mean Estimation. - Yatharth Dubey; Aleksandra Korolova (CoRR, 2018)

Branch-and-Bound Solves Random Binary Packing IPs in Polytime. - Santanu S. Dey; Yatharth Dubey; Marco Molinaro 001 (CoRR, 2020)

The Power of the Hybrid Model for Mean Estimation. - Brendan Avent; Yatharth Dubey; Aleksandra Korolova (Proc. Priv. Enhancing Technol., 2020)

Branch-and-Bound Solves Random Binary IPs in Polytime. - Santanu S. Dey; Yatharth Dubey; Marco Molinaro 001 (SODA, 2021)

Novel Analysis of the Branch-and-Bound Method for Integer Programming. - Yatharth Dubey (2022)

Branch-and-Bound versus Lift-and-Project Relaxations in Combinatorial Optimization. - Gérard Cornuéjols; Yatharth Dubey (CoRR, 2023)

Branch-and-bound solves random binary IPs in poly(n)-time. - Santanu S. Dey; Yatharth Dubey; Marco Molinaro 001 (Math. Program., 2023)

Lower bounds on the size of general branch-and-bound trees. - Santanu S. Dey; Yatharth Dubey; Marco Molinaro 001 (Math. Program., 2023)

On polytopes with linear rank with respect to generalizations of the split closure. - Sanjeeb Dash; Yatharth Dubey (Discret. Optim., 2024)

A theoretical and computational analysis of full strong-branching. - Santanu S. Dey; Yatharth Dubey; Marco Molinaro 001; Prachi Shah (Math. Program., 2024)