In the stochastic weighted matching problem, the goal is to find a
large...
In this paper, we generalize the recently studied Stochastic Matching pr...
We study the classic online bipartite matching problem with a twist: off...
Given a graph, the densest subgraph problem asks for a set of vertices s...
Envy-free up to one good (EF1) and envy-free up to any good (EFX) are tw...
The edit distance (ED) and longest common subsequence (LCS) are two
fund...
The edit distance (ED) and longest common subsequence (LCS) are two
fund...
In this paper, we study the problem of finding a maximum matching in the...
The k-cut problem asks, given a connected graph G and a positive integer...
We consider the following stochastic matching problem on both weighted a...
Sorting extremely large datasets is a frequently occuring task in practi...
We study the proportional chore division problem where a protocol wants ...