Avatar

Mark Velednitsky

Research Scientist

Seattle, WA


Links

GitHub

Google Scholar

ORCID

LinkedIn

MultiStop


Summary

I am a Research Scientist at Amazon Web Services. I earned my Ph.D. in Operations Research at UC Berkeley, where I was advised by Professor Ilan Adler. I hold an undergraduate degree in Mathematics from MIT. I am primarily interested in discrete optimization problems, especially in settings that include graphs and machine learning.

Publications

New Algorithms for Three Combinatorial Optimization Problems on Graphs
Dissertation (2020)
PDF


Solving (k-1)-Stable Instances of k-Terminal Cut with Isolating Cuts
Conference on Combinatorial Optimization and Applications (2019)
Journal | Conference | YouTube


Detecting Aberrant Linking Behavior in Directed Networks
Knowledge Discovery and Information Retrieval (2019)
Conference


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
Conference on Combinatorial Optimization and Applications (2018)
Mixed Integer Programming Workshop (2019)
Journal of Combinatorial Optimization (2020)
Journal | Conference | GitHub | YouTube | Poster


DISPATCH: An optimally-competitive algorithm for online perfect bipartite matching with i.i.d. arrivals
Workshop on Approximation and Online Algorithms (2018)
Theory of Computing Systems (2019)
Journal | Conference | 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 | News


Redundancy-d: The power of d choices for redundancy
Operations Research (2017)
Journal