I am currently a fourth-year PhD student in Operations Research at UC Berkeley. I hold an undergraduate degree in Mathematics from MIT. I am primarily interested in studying discrete optimization problems, especially in settings that involve learning or graphs.

**Detecting Aberrant Linking Behavior in Directed Networks**

*Knowledge Discovery and Information Retrieval* (2019)

**The Dimension of Valid Distance Drawings of Signed Graphs**

*Discrete & Computational Geometry* (2019)

Journal |
GitHub

**Isolation Branching: A branch-and-bound algorithm for the k-terminal cut problem**

*Mixed Integer Programming Workshop* (2019)

*Conference on Combinatorial Optimization and Applications* (2018)

Conference |
GitHub |
YouTube |
Poster

**DISPATCH: An optimally-competitive algorithm for online perfect bipartite matching with i.i.d. arrivals**

*Theory of Computing Systems* (2019)

*Workshop on Approximation and Online Algorithms* (2018)

Conference |
ArXiV |
YouTube

**Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the Asymmetric Traveling Salesman Problem**

*Operations Research Letters* (2017)

Journal |
ArXiV |
News

**Redundancy-d: The power of d choices for redundancy**

*Operations Research* (2017)

Journal

**Solving k-Stable Instances of k-Terminal Cut with Isolating Cuts**

*Conference on Combinatorial Optimization and Applications* (2019)