15 citations · 21 across the 3 of their papers we have counts for
3 papers
cs.DS2021
Online Matching with High Probability
Milena Mihail, Thorben Tröbst
We study the classical, randomized Ranking algorithm which is known to be -competitive in expectation for the Online Bipartite Matching Problem. We give a tail i…
cs.DM2015★ 15 cited
Graphic Realizations of Joint-Degree Matrices
Georgios Amanatidis, Bradley Green, Milena Mihail
In this paper we introduce extensions and modifications of the classical degree sequence graphic realization problem studied by Erdős-Gallai and Havel-Hakimi, as well as of the cor…
cs.DS2012★ 6 cited
Efficient Generation ε-close to G(n,p) and Generalizations
Antonio Blanca, Milena Mihail
We give an efficient algorithm to generate a graph from a distribution -close to , in the sense of total variation distance. In particular, if is represented with $O…