Mark Velednitsky

Publication Activity (10 Years)

Years Active: 2016-2022
Publications (10 Years): 14

Top Topics

Bipartite Matching

Families Of Valid Inequalities

Branch And Bound

Traveling Salesman Problem

Top Venues

J. Comb. Optim.

SIGMETRICS Perform. Evaluation Rev.

Publications

Mark Velednitsky, Dorit S. Hochbaum
Isolation branching: a branch and bound algorithm for the k-terminal cut problem. J. Comb. Optim. 44 (3) (2022)
Mark Velednitsky
Correction To: Solving (k-1)-stable instances of k-terminal cut with isolating cuts. J. Comb. Optim. 43 (3) (2022)
Mark Velednitsky
Solving (k-1)-stable instances of k-terminal cut with isolating cuts. J. Comb. Optim. 43 (2) (2022)
Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky
An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. Theory Comput. Syst. 64 (4) (2020)
Quico Spaen, Christopher Thraves Caro, Mark Velednitsky
The Dimension of Valid Distance Drawings of Signed Graphs. Discret. Comput. Geom. 63 (1) (2020)
Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky
Detecting Aberrant Linking Behavior in Directed Networks. KDIR (2019)
Mark Velednitsky
Solving (k-1)-Stable Instances of k-terminal cut with Isolating Cuts. COCOA (2019)
Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky
DISPATCH: An Optimal Algorithm for Online Perfect Bipartite Matching with i.i.d. Arrivals. CoRR (2018)
Minjun Chang, Dorit S. Hochbaum, Quico Spaen, Mark Velednitsky
DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals. WAOA (2018)
Mark Velednitsky
Short Combinatorial Proof that the DFJ Polytope is contained in the MTZ Polytope for the Asymmetric Traveling Salesman Problem. CoRR (2018)
Mark Velednitsky, Dorit S. Hochbaum
Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut Problem. COCOA (2018)
Kristen Gardner, Mor Harchol-Balter, Alan Scheller-Wolf, Mark Velednitsky, Samuel Zbarsky
Redundancy-d: The Power of d Choices for Redundancy. Oper. Res. 65 (4) (2017)
Mark Velednitsky
Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the Asymmetric Traveling Salesman Problem. Oper. Res. Lett. 45 (4) (2017)
Kristen Gardner, Samuel Zbarsky, Mark Velednitsky, Mor Harchol-Balter, Alan Scheller-Wolf
Understanding Response Time in the Redundancy-d System. SIGMETRICS Perform. Evaluation Rev. 44 (2) (2016)