We revisit the problem of finding small ϵ-separation keys introduced
by ...
We revisit the MaxSAT problem in the data stream model. In this problem,...
We present algorithms for the Max-Cover and Max-Unique-Cover problems in...
Given a graph G=(V,E) with arboricity α, we study the problem of
decompo...
We study distributed algorithms for some fundamental problems in data
su...
The maximum density subgraph problem, introduced in the 80s by Picard an...
Vizing showed that it suffices to color the edges of a simple graph usin...