Mark Velednitsky

Orcid: 0000-0003-1176-5159

According to our database1, Mark Velednitsky authored at least 11 papers between 2016 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Isolation branching: a branch and bound algorithm for the k-terminal cut problem.
J. Comb. Optim., 2022

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

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

2020
An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.
Theory Comput. Syst., 2020

The Dimension of Valid Distance Drawings of Signed Graphs.
Discret. Comput. Geom., 2020

2019
Detecting Aberrant Linking Behavior in Directed Networks.
Proceedings of the 11th International Joint Conference on Knowledge Discovery, 2019

2018
DISPATCH: An Optimal Algorithm for Online Perfect Bipartite Matching with i.i.d. Arrivals.
CoRR, 2018

DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

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

Redundancy-d: The Power of d Choices for Redundancy.
Oper. Res., 2017

2016
Understanding Response Time in the Redundancy-d System.
SIGMETRICS Perform. Evaluation Rev., 2016


  Loading...