Understanding Response Time in the Redundancy-d System. - Kristen Gardner 001; Samuel Zbarsky; Mark Velednitsky; Mor Harchol-Balter; Alan Scheller-Wolf (SIGMETRICS Perform. Evaluation Rev., 2016)

Redundancy-d: The Power of d Choices for Redundancy. - Kristen Gardner 001; Mor Harchol-Balter; Alan Scheller-Wolf; Mark Velednitsky; Samuel Zbarsky (Oper. Res., 2017)

Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the Asymmetric Traveling Salesman Problem. - Mark Velednitsky (Oper. Res. Lett., 2017)

DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. - Minjun Chang; Dorit S. Hochbaum; Quico Spaen; Mark Velednitsky (WAOA, 2018)

DISPATCH: An Optimal Algorithm for Online Perfect Bipartite Matching with i.i.d. Arrivals. - Minjun Chang; Dorit S. Hochbaum; Quico Spaen; Mark Velednitsky (CoRR, 2018)

Detecting Aberrant Linking Behavior in Directed Networks. - Dorit S. Hochbaum; Quico Spaen; Mark Velednitsky (KDIR, 2019)

The Dimension of Valid Distance Drawings of Signed Graphs. - Quico Spaen; Christopher Thraves Caro; Mark Velednitsky (Discret. Comput. Geom., 2020)

An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. - Minjun Chang; Dorit S. Hochbaum; Quico Spaen; Mark Velednitsky (Theory Comput. Syst., 2020)

Solving (k-1)-stable instances of k-terminal cut with isolating cuts. - Mark Velednitsky (J. Comb. Optim., 2022)

Correction To: Solving (k-1)-stable instances of k-terminal cut with isolating cuts. - Mark Velednitsky (J. Comb. Optim., 2022)

Isolation branching: a branch and bound algorithm for the k-terminal cut problem. - Mark Velednitsky; Dorit S. Hochbaum (J. Comb. Optim., 2022)