Dubey, Yatharth

1. A Theoretical and Computational Analysis of Full Strong-Branching
   2021/10/20 by Dey, Santanu S., Dubey, Yatharth, Molinaro, Marco +1 · 5 citations
   #FOS: Mathematics #Optimization and Control (math.OC)
2. Branch-and-Bound Solves Random Binary IPs in Polytime
   2020/07/30 by Dey, Santanu S., Dubey, Yatharth, Molinaro, Marco · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)
3. Lower Bounds on the Size of General Branch-and-Bound Trees
   2021/03/17 by Dey, Santanu S., Dubey, Yatharth, Molinaro, Marco · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)