We describe a new dependent-rounding algorithmic framework for bipartite...
We consider the problem of counting 4-cycles (C_4) in a general undirect...
We describe a new algorithm for vertex cover with runtime O^*(1.25400^k)...
Karppa Kaski (2019) proposed a novel type of "broken" or "opportunis...
A classic conjecture of Füredi, Kahn and Seymour (1993) states that give...
Given a graph G=(V,E) with arboricity α, we study the problem of
decompo...
The Lovász Local Lemma (LLL) is a powerful tool in probabilistic
combina...
The main focus of this paper is radius-based clustering problems in the
...
We consider Gibbs distributions, which are families of probability
distr...
In the k-cut problem, we want to find the smallest set of edges whose
de...
The Lovasz Local Lemma (LLL) is a keystone principle in probability theo...
An independent transversal (IT) in a graph with a given vertex partition...
We consider the family of Gibbs distributions, which are probability
dis...
The study of graph problems in the Massively Parallel Computations (MPC)...
We consider stochastic settings for clustering, and develop provably-goo...
We describe randomized and deterministic approximation algorithms in Lin...
The Lovász Local Lemma (LLL) is a keystone principle in probability
theo...
A k-truss is a relaxation of a k-clique developed by Cohen (2005),
speci...
Many randomized algorithms can be derandomized efficiently using either ...
The gap between the known randomized and deterministic local distributed...